대한산업공학회지 (Journal of Korean Institute of Industrial Engineers)

  • 제31권3호
  • /
  • Pages.228-239
  • /
  • 2005
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

고객 제한조건이 있는 복수 차량유형의 차량할당 및 경로선정에 관한 연구

Study on the Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction

  • 이상헌 (국방대학교 운영분석학과) ;
  • 이정만 (국방대학교 운영분석학과)
  • Lee, Sang-Heon (Department of Operations Research, Korea National Defense University) ;
  • Lee, Jung-Man (Department of Operations Research, Korea National Defense University)
  • 발행 : 2005.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.

키워드

참고문헌

  1. Choi, E-J., Lee, T-H., Park, S-S. (2002), Integer Programming Approach to the Heterogeneous Fleet Vehicle Routing Problem, Korean Institute of Industrial Engineers and The Korean OR/MS Society 2002 Spring Union Scientific Seminar
  2. Dantzig, G. B. and Ramser, J. H. (1959), TheTruck Dispatching Problem, Management Science, 6, 80-91 https://doi.org/10.1287/mnsc.6.1.80
  3. Dullaert, W., Janssens, G. K., Sorensen, K. and Vemimmen, B. (2002), New Heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, 53, 1232-1238 https://doi.org/10.1057/palgrave.jors.2601422
  4. Fagerholt, K. (1999), Optimal Fleet Design in a Ship Routing Problem', International Transactions in Operational Research, 6, 453-464 https://doi.org/10.1111/j.1475-3995.1999.tb00167.x
  5. Gendreau, M., Laporte, G., Musaraganyi, C. and Taillard, E. D. (1999), A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem, Computer & Operations Research, 26, 1153-1173 https://doi.org/10.1016/S0305-0548(98)00100-2
  6. Gillet, B. and Miller, L. (1974), A Heuristic Algorithm for the Vehicle Dispatch Problem,Operations Research, 22, 340-349 https://doi.org/10.1287/opre.22.2.340
  7. Golden, B., Assad, A., Levy, L. and Gheysens, F. G. (1984), The Fleet Size and Mix Vehicle Routing Problem, Computer & Operations Research, 11, 49-66 https://doi.org/10.1016/0305-0548(84)90007-8
  8. Ha, H-G., Lee, K-M., Lee, J-M.(2003), Strategies to Decrease National Logistics Costs for Improving National Competitiveness, The Korea TransportInstitute
  9. Hong, G-S. (2003), Improvement Plan of Goods Transport Institution, The Korea Transport Institute
  10. Kang, M-G. (1991), Network and Algorithm, Park -youngsa
  11. Kim, J.U. and Kim, Y. D.(1999), A Decomposition Approach to a MultiPeriod Vehicle Scheduling Problem, TheInternational Journal of Management Science, 27, 421-430
  12. Liu, F. H. and Shen, S. Y. (1999), The Fleet Size and Mix Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, 50, 721-732 https://doi.org/10.1057/palgrave.jors.2600763
  13. Malandraki, C., and Dial, R. B.(1996), A Restricted Dynamic Programming Heuristic Algorithm for the Time Dependent Traveling Salesman Problem, European Journal of Operational Research, 90, 45-55 https://doi.org/10.1016/0377-2217(94)00299-1
  14. Ministry of Labor(2004), Report of Labor Statistical Investigation
  15. Mosheiov, G. (1998), Vehicle Routingwith Pick-up and Delivery: Tour-Partitioning Heuristics, Computers industrial Engineering, 34, 669-684 https://doi.org/10.1016/S0360-8352(97)00275-1
  16. Robert, T. Sumichrast and Markham, I. S. (1995), A Heuristicand Lower bound for a Multi-Depot Routing Problem, Computer & Operations Research, 22, 1047-1056 https://doi.org/10.1016/0305-0548(94)00083-K
  17. Tailard, E. D. (1996), 'A Heuristic Column Generation Method for the Heterogeneous Fleet VRP, RAIRO, 33, 1-34 https://doi.org/10.1051/ro:1999101
  18. Wassan, N. A. and Osman, I. H. (2002), Tabu Search Variants for the Mix Fleet Vehicle Routing Problem, Journal of the Operational Research Society, 53, 768-782 https://doi.org/10.1057/palgrave.jors.2601344