Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows
Joint Authors
Source
International Journal of Mathematics and Mathematical Sciences
Issue
Vol. 2015, Issue 2015 (31 Dec. 2015), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2015-07-29
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Kabcome, P.& Mouktonglang, T.. 2015. Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows. International Journal of Mathematics and Mathematical Sciences،Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1066182
Modern Language Association (MLA)
Kabcome, P.& Mouktonglang, T.. Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows. International Journal of Mathematics and Mathematical Sciences No. 2015 (2015), pp.1-9.
https://search.emarefa.net/detail/BIM-1066182
American Medical Association (AMA)
Kabcome, P.& Mouktonglang, T.. Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows. International Journal of Mathematics and Mathematical Sciences. 2015. Vol. 2015, no. 2015, pp.1-9.
https://search.emarefa.net/detail/BIM-1066182
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1066182
