Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows

P. Kabcome and T. Mouktonglang

International Journal of Mathematics and Mathematical Sciences, 2015, vol. 2015, 1-9

Abstract:

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.

Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2015/126754.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2015/126754.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:126754

DOI: 10.1155/2015/126754

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().