Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2015, Article ID 126754, 9 pages
Research Article

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

1Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
2Centre of Excellence in Mathematics, CHE, Si Ayutthaya Road, Bangkok 10400, Thailand

Received 15 April 2015; Accepted 15 June 2015

Academic Editor: Chin-Chia Wu

Copyright © 2015 P. Kabcome and T. Mouktonglang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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.