Vehicle routing problem for multiple product types, compartments, and trips with soft time windows

© 2015 P. Kabcome and T. Mouktonglang. This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a sing...

Full description

Saved in:

Bibliographic Details
Main Authors:	P. Kabcome, T. Mouktonglang
Format:	Journal
Published:	2018
Subjects:	Agricultural and Biological Sciences
Online Access:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44633
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Chiang Mai University

id	th-cmuir.6653943832-44633
record_format	dspace
spelling	th-cmuir.6653943832-446332018-04-25T07:53:11Z Vehicle routing problem for multiple product types, compartments, and trips with soft time windows P. Kabcome T. Mouktonglang Agricultural and Biological Sciences © 2015 P. Kabcome and T. Mouktonglang. This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a single type of product. Each vehicle is allowed to have more than one trip, as long as it corresponds to the maximum distance allowed in a workday. Numerical results show the effectiveness of our model. 2018-01-24T04:45:52Z 2018-01-24T04:45:52Z 2015-01-01 Journal 16870425 01611712 2-s2.0-84939204024 10.1155/2015/126754 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44633
institution	Chiang Mai University
building	Chiang Mai University Library
country	Thailand
collection	CMU Intellectual Repository
topic	Agricultural and Biological Sciences
spellingShingle	Agricultural and Biological Sciences P. Kabcome T. Mouktonglang Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
description	© 2015 P. Kabcome and T. Mouktonglang. This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a single type of product. Each vehicle is allowed to have more than one trip, as long as it corresponds to the maximum distance allowed in a workday. Numerical results show the effectiveness of our model.
format	Journal
author	P. Kabcome T. Mouktonglang
author_facet	P. Kabcome T. Mouktonglang
author_sort	P. Kabcome
title	Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
title_short	Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
title_full	Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
title_fullStr	Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
title_full_unstemmed	Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
title_sort	vehicle routing problem for multiple product types, compartments, and trips with soft time windows
publishDate	2018
url	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/44633
_version_	1681422595477471232

Vehicle routing problem for multiple product types, compartments, and trips with soft time windows

Similar Items