1. CMU Intellectual Repository
  2. Academic Support Units
  3. Chiang Mai University Library
  4. CMUL: Journal Articles
Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/54653
Full metadata record
DC FieldValueLanguage
dc.contributor.authorP. Kabcomeen_US
dc.contributor.authorT. Mouktonglangen_US
dc.date.accessioned2018-09-04T10:19:41Z-
dc.date.available2018-09-04T10:19:41Z-
dc.date.issued2015-01-01en_US
dc.identifier.issn16870425en_US
dc.identifier.issn01611712en_US
dc.identifier.other2-s2.0-84939204024en_US
dc.identifier.other10.1155/2015/126754en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84939204024&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/54653-
dc.description.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.en_US
dc.subjectMathematicsen_US
dc.titleVehicle routing problem for multiple product types, compartments, and trips with soft time windowsen_US
dc.typeJournalen_US
article.title.sourcetitleInternational Journal of Mathematics and Mathematical Sciencesen_US
article.volume2015en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsSouth Carolina Commission on Higher Educationen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.