×
Chen, Huey-Kuo; Chou, Huey-Wen; Hsu, Chia-Yuan

The linehaul-feeder vehicle routing problem with virtual depots and time windows. (English) Zbl 1235.90021

Math. Probl. Eng. 2011, Article ID 759418, 15 p. (2011).
Summary: This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints; small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.

Cited in 4 Documents

MSC:

90B06 Transportation, logistics and supply chain management

Software:

Tabu search
Cite Review PDF
Full Text: DOI

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. · doi:10.1287/trsc.1090.0279
[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. · doi:10.1287/trsc.1030.0056
[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. · doi:10.1287/trsc.1030.0057
[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. · Zbl 1026.90102 · doi:10.1016/S0305-0548(00)00056-3
[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. · Zbl 1079.90116 · doi:10.1016/j.cor.2004.08.002
[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. · doi:10.1016/j.tre.2005.01.002
[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. · doi:10.1016/j.cie.2006.02.006
[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. · Zbl 1278.90177 · doi:10.1016/j.ejor.2006.10.047
[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. · doi:10.1016/j.tre.2009.05.005
[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. · doi:10.1287/inte.1040.0109
[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. · Zbl 1113.90035 · doi:10.1016/j.cor.2005.02.045
[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. · Zbl 1113.90035 · doi:10.1016/j.cor.2005.02.045
[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. · Zbl 1127.90391 · doi:10.1111/j.1475-3995.2006.00539.x
[14] H. K. Chen and H. Wang, “The garbage truck routing problem with time windows,” Working Paper at National Central University, Taiwan, 2008.
[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.
[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. · doi:10.1287/trsc.1030.0057
[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. · doi:10.1109/TASE.2011.2142304
[19] F. Glover, “Tabu search-part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190-206, 1989. · Zbl 0753.90054
[20] F. Glover, “Tabu search-part II,” ORSA Journal on Computing, vol. 2, no. 1, pp. 4-32, 1990. · Zbl 0771.90084
[21] F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, Mass, USA, 1997. · Zbl 0930.90083
[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. · Zbl 1060.90019 · doi:10.1057/palgrave.jors.2601707
[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. · doi:10.1057/jors.2011.25
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.