Table of Contents Author Guidelines Submit a Manuscript
International Journal of Mathematics and Mathematical Sciences
Volume 2015 (2015), Article ID 126754, 9 pages
http://dx.doi.org/10.1155/2015/126754
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.

Linked References

  1. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, pp. 80–91, 1959. View at Google Scholar
  2. M. Ball, T. Maganti, C. Monma, and G. Nemhasuser, Handbook in Operations Research and Management Science, 8: Network Routing, 1995.
  3. J.-F. Cordeau, M. Gendreau, G. Laporte, J.-Y. Potvin, and F. Semet, “A guide to vehicle routing heuristics,” Journal of the Operational Research Society, vol. 53, no. 5, pp. 512–522, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. M. Gendrau, G. Laport, and J. Potvin, “Vehicle routing: modern heuristics,” in Local Search in Combinatorial Optimization, E. Aarts and J. Lenstra, Eds., pp. 311–336, Wiley, London, UK, 1997. View at Google Scholar
  5. B. Golden and A. Assad, Vehicle Routing: Methods and Studies, Elsevier Science, Amsterdam, The Netherlands, 1988.
  6. P. Toth and D. Vigo, The Vehicle Routing Problem, vol. 9 of SIAM Monographs on Discrete Mathematics and Applications, 2002.
  7. J.-F. Cordeau, G. Laporte, and A. Mercier, “A unified tabu search heuristic for vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 52, no. 8, pp. 928–936, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. M. Desrochers, J. Desrosiers, and M. Solomon, “A new optimization algorithm for the vehicle routing problem with time windows,” Operations Research, vol. 40, no. 2, pp. 342–354, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. J. Homberger and H. Gehring, “Two evolutionary metaheuristics for the vehicle routing problem with time windows,” INFOR Journal, vol. 37, pp. 297–318, 1999. View at Google Scholar · View at Scopus
  10. G. Ioannou, M. Kritikos, and G. Prastacos, “A greedy look-ahead heuristic for the vehicle routing problem with time windows,” Journal of the Operational Research Society, vol. 52, no. 5, pp. 523–537, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  11. N. Kohl and O. B. Madsen, “An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation,” Operations Research, vol. 45, no. 3, pp. 395–406, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, vol. 35, no. 2, pp. 254–265, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  13. N. Balakrishnan, “Simple heuristics for the vehicle routeing problem with soft time windows,” Journal of the Operational Research Society, vol. 44, no. 3, pp. 279–287, 1993. View at Publisher · View at Google Scholar · View at Scopus
  14. G. Ioannou, M. Kritikos, and G. Prastacos, “A problem generator-solver heuristic for vehicle routing with soft time windows,” Omega, vol. 31, no. 1, pp. 41–53, 2003. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Min, “A multiobjective vehicle routing problem with soft time windows: the case of a public library distribution system,” Socio-Economic Planning Sciences, vol. 25, no. 3, pp. 179–188, 1991. View at Publisher · View at Google Scholar · View at Scopus
  16. É. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,” Transportation Science, vol. 31, no. 2, pp. 170–186, 1997. View at Publisher · View at Google Scholar · View at Scopus
  17. B. Fleischmann, “The vehicle routing problem with multiple use of vehicles,” Working Paper, Fachbereich Wirtschaftswissenschaften, University Hamburg, Hamburg, Germany, 1990. View at Google Scholar
  18. R. J. Petch and S. Salhi, “A multi-phase constructive heuristic for the vehicle routing problem with multiple trips,” Discrete Applied Mathematics, vol. 133, no. 1–3, pp. 69–92, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. A. Olivera and O. Viera, “Adaptive memory programming for the vehicle routing problem with multiple trips,” Computers & Operations Research, vol. 34, no. 1, pp. 28–47, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. C. Prins, “Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case,” Journal of Mathematical Modelling and Algorithms, vol. 1, no. 2, pp. 135–150, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. A. E. Fallahi, C. Prins, and R. Wolfler Calvo, “A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem,” Computers & Operations Research, vol. 35, no. 5, pp. 1725–1741, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. U. Derigs, J. Gottlieb, J. Kalkoff, M. Piesche, F. Rothlauf, and U. Vogel, “Vehicle routing with compartments: applications, modelling and heuristics,” OR Spectrum, vol. 33, no. 4, pp. 885–914, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  23. C. G. Tapia, “A mixed-binary linear model for fleet routing and multiple product-type distribution,” Philippine Management Review, vol. 6, no. 1, pp. 75–86, 1995-1996. View at Google Scholar
  24. M. Roelofs and J. Bisschop, AIMMS Language Reference, Paragon Decision Technology, 2013.