Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

A Heuristic for Fleet Size and Mix Vehicle Routing Problem with Time Deadline

고객의 납기마감시간이 존재하는 이기종 차량경로문제의 발견적 해법

  • Kang Chung-Sang (THE HITE CO., LTD.) ;
  • Lee Jun-Su (Dept. of Industrial information & system Eng., Chonbuk National Uiversity)
  • 강충상 (하이트맥주㈜) ;
  • 이준수 (전북대학교 산업정보시스템공학과 대학원)
  • Published : 2005.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper dealt with a kind of heterogeneous vehicle routing problem with known demand and time deadline of customers. The customers are supposed to have one of tight deadline and loose deadline. The demand of customers with tight deadline must be fulfilled in the deadline. However, the late delivery is allowed to customers with loose deadline. That is, the paper suggests a model to minimize total acquisition cost, total travel distance and total violation time for a fleet size and mix vehicle routing problem with time deadline, and proposes a heuristic algorithm for the model. The proposed algorithm consists of two phases, i.e. generation of an initial solution and improvement of the current solution. An initial solution is generated based on a modified insertion heuristic and iterative Improvement procedure is accomplished using neighborhood generation methods such as swap and reallocation. The proposed algorithm is evaluated using a well known numerical example.

Keywords

References

  1. Bramel, J. & D. Simchi-Levi; 'Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows,' Operations Research, 44(3) : pp.501-509, 1996 https://doi.org/10.1287/opre.44.3.501
  2. Danzig, G. B. & J. H. Ramer; 'The Truck Dispatching Problem,' Management Science, 6(1): pp.88-91, 1959
  3. Desrochers, M & T. Verhoog; 'A New Heuristic for the Fleet Size and Mix Vehicle Routing Problem,' Computer & Operations Research. 18(3): pp.263-274, 1991 https://doi.org/10.1016/0305-0548(91)90028-P
  4. Dullaert, W., GK. Janssens, K. Sorensen & B. Vernimmen; 'New heuristic for the Fleet Size and Mix Vehicle Routing Problem with Time windows,' The Journal of Operational Research Society, 53(11): pp.1232-1238, 2002 https://doi.org/10.1057/palgrave.jors.2601422
  5. Etezadi, T. & J. E. Beasley; 'Vehicle fleet composition,' The Journal of the Operational Research Society 34(1) : pp.87-91, 1983 https://doi.org/10.2307/2581607
  6. Gould, J.; 'The size and composition of a road transport fleet,' Operational Research Quarterly, 20(1): pp.81-92, 1969 https://doi.org/10.1057/jors.1969.30
  7. Jacques Renaud & F. F. Boctor; 'A Sweep-based algorithm for the Fleet Size and Mix Vehicle Routing Problem,' European Journal of Operational Research, 140(3) : pp.618-628, 2002 https://doi.org/10.1016/S0377-2217(01)00237-5
  8. Lau, H. S., M. Sim & K. M. Teo; 'Vehicle routing problem with time windows and a limited number of vehicles,' European Journal of Operational Research, 148(3) : pp.559-569, 2003 https://doi.org/10.1016/S0377-2217(02)00363-6
  9. Liu, F. H. & S. Y. Shen; 'The Fleet Size and Mix Vehicle Routing Problem with Time Windows,' The Journal of the Operational Research Society, 50(7) : pp.721-732, 1999 https://doi.org/10.2307/3010326
  10. Potvin, J. Y. & J. M. Rousseau; 'A Parallel Route building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows,' European Journal of Operational Research 66(3): pp.331-340, 1993 https://doi.org/10.1016/0377-2217(93)90221-8
  11. Salhi, S. & G. K. Rand, 'Incorporating Vehicle Routing into the Vehicle Fleet Composition Problem,' European Journal of Operational Research, 66(3): pp.313-330, 1993 https://doi.org/10.1016/0377-2217(93)90220-H
  12. Solomon, M. M; 'Algorithms for the Vehicle Routing and Scheduling Problems with Time Windows Constraints,' Operations Research, 35(2): pp.254-265, 1987 https://doi.org/10.1287/opre.35.2.254
  13. Stefan Irnich; 'A Multi-depot Pickup and Delivery Problem with a single hub and Heterogeneous Vehicles,' European Journal of Operational Research, 122(2): pp.310-328, 2000 https://doi.org/10.1016/S0377-2217(99)00235-0
  14. Thangiah, S. R., I. H. Osman, R. Vinayagamoorthy & T. Sun; 'Algorithms for Vehicle Routing Problems with Time Deadlines,' American Journal of Mathematical and Management Sciences, 13(3/4): pp.322-355, 1995
  15. Voudouris, C. & E. Tsang, 'Guided Local Search,' Technical Report CSM- 247, Department of Computer Science, University of Essex, Colchester, UK. 1995
  16. Woods, D. G. & F. C. Harris; 'Truck Fleet size composition for concrete distribution,' International Journal of Physical Distribution & logistics management, 10(1) : pp.3-14, 1979 https://doi.org/10.1108/eb014462