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

The Linehaul-Feeder Vehicle Routing Problem with Virtual Depots and Time Windows

Department of Civil Engineering, National Central University, No. 300, Jung-Da Road, Jung-Li City, Taoyuan 320, Taiwan

Received 15 August 2011; Accepted 17 September 2011

Academic Editor: J. J. Judice

Copyright © 2011 Huey-Kuo Chen 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. T. G. Crainic, N. Ricciardi, and G. Storchi, “Models for evaluating and planning city logistics systems,” Transportation Science, vol. 43, no. 4, pp. 432–454, 2009. View at Publisher · View at Google Scholar
  2. O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, part I: route construction and local search algorithms,” Transportation Science, vol. 39, no. 1, pp. 104–118, 2005. View at Publisher · View at Google Scholar · View at Scopus
  3. O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, part II: metaheuristics,” Transportation Science, vol. 39, no. 1, pp. 119–139, 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. I.-M. Chao, “A tabu search method for the truck and trailer routing problem,” Computers & Operations Research, vol. 29, no. 1, pp. 33–51, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. S. Scheuerer, “A tabu search heuristic for the truck and trailer routing problem,” Computers & Operations Research, vol. 33, no. 4, pp. 894–909, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. M. A. Waller, C. R. Cassady, and J. Ozment, “Impact of cross-docking on inventory in a decentralized retail supply chain,” Transportation Research Part E, vol. 42, no. 5, pp. 359–382, 2006. View at Publisher · View at Google Scholar
  7. Y. H. Lee, J. W. Jung, and K. M. Lee, “Vehicle routing scheduling for cross-docking in the supply chain,” Computers & Industrial Engineering, vol. 51, no. 2, pp. 247–256, 2006. View at Publisher · View at Google Scholar
  8. W. Yu and P. J. Egbelu, “Scheduling of inbound and outbound trucks in cross docking systems with temporary storage,” European Journal of Operational Research, vol. 184, no. 1, pp. 377–396, 2008. View at Publisher · View at Google Scholar
  9. H. Yan and S. L. Tang, “Pre-distribution and post-distribution cross-docking operations,” Transportation Research Part E, vol. 45, no. 6, pp. 843–859, 2009. View at Publisher · View at Google Scholar
  10. S. Sahoo, S. Kim, B. I. Kim, B. Kraas, and A. Popov Jr., “Routing optimization for waste management,” Interfaces, vol. 35, no. 1, pp. 24–36, 2005. View at Publisher · View at Google Scholar
  11. B. I. Kim, S. Kim, and S. Sahoo, “Balanced clustering algorithms for vehicle routing problems,” in Proceedings of the Institute of Industrial Engineers Annual Conference, Houston, Tex, USA, May 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. B. I. Kim, S. Kim, and S. Sahoo, “Waste collection vehicle routing problem with time windows,” Computers & Operations Research, vol. 33, no. 12, pp. 3624–3642, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  13. A. Del Pia and C. Filippi, “A variable neighborhood descent algorithm for a real waste collection problem with mobile depots,” International Transactions in Operational Research, vol. 13, pp. 125–141, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. H. K. Chen and H. Wang, “The garbage truck routing problem with time windows,” Working Paper at National Central University, Taiwan, 2008. View at Google Scholar
  15. S. Y. Tu, S. J. Lai, and Y. P. Li, “Application of the vehicle routing problem with time windows—an example of lunch box delivery,” Graduation Term Paper, Department of Transportation Technology and Logistics Management, Chung Hua University, Hsin Chu, Taiwan, 2001. View at Google Scholar
  16. J. Chang, Y. J. Cho, and Y. C. Hwang, “A study on time constrained vehicle routing problem for lunch box delivery,” in Proceedings of the Annual Meeting of Chinese Institute of Industrial Engineering, Kaohsiung, Taiwan, 2001. View at Publisher · View at Google Scholar
  17. Y. T. Chang, Model formulation and solution algorithms for the line-haul feeder problem, M.S. thesis, Department of Transportation Technology and Logistics Management, Chung Hua University, Hsin Chu, Taiwan, 2006.
  18. H. K. Chen, H. W. Chou, C. F. Hsueh, and T. Y. Ho, “The linehaul-feeder vehicle routing problem with virtual depots,” IEEE Transactions on Automation Science and Engineering. In press. View at Publisher · View at Google Scholar
  19. F. Glover, “Tabu search-part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, 1989. View at Google Scholar
  20. F. Glover, “Tabu search-part II,” ORSA Journal on Computing, vol. 2, no. 1, pp. 4–32, 1990. View at Google Scholar
  21. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, Mass, USA, 1997.
  22. J.-F. Cordeau, G. Laporte, and A. Mercier, “Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 55, no. 5, pp. 542–546, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  23. L. Moccia, J.-F. Cordeau, and G. Laporte, “An incremental tabu search heuristic for the generalized vehicle routing problem with time windows,” Journal of the Operational Research Society. In press. View at Publisher · View at Google Scholar