Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/54653| Title: | Vehicle routing problem for multiple product types, compartments, and trips with soft time windows |
| Authors: | P. Kabcome T. Mouktonglang |
| Authors: | P. Kabcome T. Mouktonglang |
| Keywords: | Mathematics |
| Issue Date: | 1-Jan-2015 |
| Abstract: | © 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. |
| URI: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/54653 |
| ISSN: | 16870425 01611712 |
| Appears in Collections: | CMUL: Journal Articles |
Files in This Item:
There are no files associated with this item.
Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.