Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 847630, 11 pages
http://dx.doi.org/10.1155/2014/847630
Research Article

Optimal Routing for Heterogeneous Fixed Fleets of Multicompartment Vehicles

1Sun Yat-sen Business School, Sun Yat-sen University, Guangzhou 510275, China
2School of Management, Dalian University of Technology, Dalian 116024, China

Received 26 February 2014; Accepted 31 March 2014; Published 30 April 2014

Academic Editor: Tsan-Ming Choi

Copyright © 2014 Qian Wang et al. 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. A. E. Fallahi, C. Prins, and R. Wolfler Calvo, “A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem,” Computers and Operations Research, vol. 35, no. 5, pp. 1725–1741, 2008. View at Publisher · View at Google Scholar · View at Scopus
  2. L. Muyldermans and G. Pang, “On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm,” European Journal of Operational Research, vol. 206, no. 1, pp. 93–103, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. 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 Zentralblatt MATH · View at MathSciNet
  4. E. D. Taillard, “A heuristic column generation method for the heterogeneous fleet VRP,” RAIRO Operations Research, vol. 33, no. 1, pp. 1–14, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. F. Li, B. Golden, and E. Wasil, “A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem,” Computers and Operations Research, vol. 34, no. 9, pp. 2734–2742, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. B. Golden, A. Assad, L. Levy, and F. Gheysens, “The fleet size and mix vehicle routing problem,” Computers and Operations Research, vol. 11, no. 1, pp. 49–66, 1984. View at Google Scholar · View at Scopus
  7. S. Liu, W. Huang, and H. Ma, “An effective genetic algorithm for the fleet size and mix vehicle routing problems,” Transportation Research Part E: Logistics and Transportation Review, vol. 45, no. 3, pp. 434–445, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. X. Li, S. C. H. Leung, and P. Tian, “A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem,” Expert Systems with Applications, vol. 39, no. 1, pp. 365–374, 2012. View at Publisher · View at Google Scholar · View at Scopus
  9. M. P. Seixas and A. B. Mendes, “Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet,” Mathematical Problems in Engineering, vol. 2013, Article ID 824961, 13 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  10. A. Hoff, H. Andersson, M. Christiansen, G. Hasle, and A. Løkketangen, “Industrial aspects and literature survey: fleet composition and routing,” Computers and Operations Research, vol. 37, no. 12, pp. 2041–2061, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. R. Battiti and G. Tecchiolli, “The reactive tabu search,” INFORMS Journal on Computing, vol. 6, no. 2, pp. 126–140, 1994. View at Publisher · View at Google Scholar
  12. F. Cornillier, F. F. Boctor, G. Laporte, and J. Renaud, “A heuristic for the multi-period petrol station replenishment problem,” European Journal of Operational Research, vol. 191, no. 2, pp. 295–305, 2008. View at Publisher · View at Google Scholar · View at Scopus
  13. P. Avella, M. Boccia, and A. Sforza, “Solving a fuel delivery problem by heuristic and exact approaches,” European Journal of Operational Research, vol. 152, no. 1, pp. 170–179, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. G. G. Brown and G. W. Graves, “Real-time dispatch of petroleum tank trucks,” Management Science, vol. 27, no. 1, pp. 19–32, 1981. View at Google Scholar · View at Scopus
  15. G. G. Brown, C. J. Ellis, W. G. Graves, and D. Ronen, “Real-time, wide area dispatch of Mobil tank trucks,” Interfaces, vol. 17, no. 1, pp. 107–120, 1987. View at Publisher · View at Google Scholar
  16. S. Apotheker, “Curbside collection: complete separation versus commingled collection,” Resource Recycling, 1990. View at Google Scholar
  17. B. Platt and J. Zachary, Co-Collection of Recyclables and Mixed Waste: Problems and Opportunities, Institute for Local Self-Reliance, ILSR, Washington, DC, USA, 1992.
  18. M. Jahre, Logistics systems for recycling-efficient collection of household waste [Ph.D. thesis], Chalmers University of Technology, Göteborg, Sweden, 1995.
  19. J. Renaud, G. Laporte, and F. F. Boctor, “A tabu search heuristic for the multi-depot vehicle routing problem,” Computers and Operations Research, vol. 23, no. 3, pp. 229–235, 1996. View at Publisher · View at Google Scholar · View at Scopus
  20. B. L. Golden, A. A. Assad, and E. A. Wasil, “Routing vehicles in the real world: application in the solid waste, beverage, food, dairy, and newspaper industries,” in The Vehicle Routing Problem, P. Toth and D. Vigo, Eds., vol. 9, pp. 245–286, SIAM, Philadelphia, Pa, USA, 2002. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. Z. Hu, Y. Zhao, and T. M. Choi, “Vehicle routing problem for fashion supply chains with cross-docking,” Mathematical Problems in Engineering, vol. 2013, Article ID 362980, 10 pages, 2013. View at Publisher · View at Google Scholar
  22. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” Journal of the Operational Research Society, vol. 54, no. 1, pp. 65–71, 2003. View at Publisher · View at Google Scholar · View at Scopus
  23. C. D. Tarantilis, C. T. Kiranoudis, and V. S. Vassiliadis, “A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” European Journal of Operational Research, vol. 152, no. 1, pp. 148–158, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. G. Dueck, “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing,” Journal of Computational Physics, vol. 90, no. 1, pp. 161–175, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. C. D. Tarantilis, E. E. Zachariadis, and C. T. Kiranoudis, “A guided tabu search for the heterogeneous vehicle routeing problem,” Journal of the Operational Research Society, vol. 59, no. 12, pp. 1659–1673, 2008. View at Publisher · View at Google Scholar · View at Scopus
  26. X. Li, P. Tian, and Y. P. Aneja, “An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 46, no. 6, pp. 1111–1127, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Brandão, “A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem,” Computers and Operations Research, vol. 38, no. 1, pp. 140–151, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. B. Almada-Lobo, J. F. Oliveira, and M. A. Carravilla, “Production planning and scheduling in the glass container industry: a VNS approach,” International Journal of Production Economics, vol. 114, no. 1, pp. 363–375, 2008. View at Publisher · View at Google Scholar · View at Scopus
  29. C. Voudouris and E. Tsang, “Guided local search and its application to the traveling salesman problem,” European Journal of Operational Research, vol. 113, no. 2, pp. 469–499, 1999. View at Google Scholar · View at Scopus
  30. I. H. Osman and N. A. Wassan, “A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls,” Journal of Scheduling, vol. 5, no. 4, pp. 263–285, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. N. A. Wassan, “A reactive tabu search for the vehicle routing problem,” Journal of the Operational Research Society, vol. 57, no. 1, pp. 111–116, 2006. View at Publisher · View at Google Scholar · View at Scopus
  32. N. A. Wassan, A. H. Wassan, and G. Nagy, “A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries,” Journal of Combinatorial Optimization, vol. 15, no. 4, pp. 368–386, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  33. N. A. Wassan and I. H. Osman, “Tabu search variants for the mix fleet vehicle routing problem,” Journal of the Operational Research Society, vol. 53, no. 7, pp. 768–782, 2002. View at Publisher · View at Google Scholar · View at Scopus