산업공학 (IE interfaces)

  • 제20권2호
  • /
  • Pages.103-111
  • /
  • 2007
  • /
  • 1225-0996(pISSN)
  • /
  • 2234-6465(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지

유전자 알고리듬을 이용한 운행비용 최소화 다용량 차량경로문제

A Heterogeneous VRP to Minimize the Transportation Costs Using Genetic Algorithm

  • 임무균 (국방대학교 운영분석학과) ;
  • 전건욱 (국방대학교 운영분석학과)
  • Ym, Mu-Kyun (Department of Operations Research, Korea National Defense University) ;
  • Jeon, Geon-Wook (Department of Operations Research, Korea National Defense University)
  • 투고 : 20070100
  • 심사 : 20070500
  • 발행 : 2007.06.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A heterogeneous VRP which considers various capacities, fixed and variable costs was suggested in this study. The transportation cost for vehicle is composed of its fixed and variable costs incurred proportionately to the travel distance. The main objective is to minimize the total sum of transportation costs. A mathematical programming model was suggested for this purpose and it gives an optimal solution by using OPL-STUDIO (ILOG CPLEX). A genetic algorithm which considers improvement of an initial solution, new fitness function with weighted cost and distance rates, and flexible mutation rate for escaping local solution was also suggested. The suggested algorithm was compared with the results of a tabu search and sweeping method by Taillard and Lee, respectively. The suggested algorithm gives better solutions rather than existing algorithms.

키워드

참고문헌

  1. Choi, E and Tcha, D. (2007), A column generation approach to the heterogeneous fleet vehicle routing problem, Computer & Operation research, 34, 2080-2095 https://doi.org/10.1016/j.cor.2005.08.002
  2. Clark, G. and Wright, J. (1964), Scheduling of vehicle from a Central Depot to a Number of Delivery Points, Operations Research, 12, 568-581 https://doi.org/10.1287/opre.12.4.568
  3. Desrochers, M. and Verhoog, J. W. (1991), A new heuristic for the fleet size and mix vehicle routing problem, Computers and Operations Research, 18, 263-274 https://doi.org/10.1016/0305-0548(91)90028-P
  4. Gendreau, M., Laporte, G., Musaraganyi, C, and Taillard, E. D. (1999), A Tabu Search Heuristic for the Heterogeneous Fleet Vehicle Routing Problem, Computer & Operation Research, 26, 1153-1173 https://doi.org/10.1016/S0305-0548(98)00100-2
  5. Gheysens F. G., B., Golden B. L., and Assad A. (1984), A comparison of techniques for solving the fleet size and mix vehicle routing problem, Operation Research Spektrum, 6, 207-216 https://doi.org/10.1007/BF01720070
  6. Gillet, B. and Miller, L. (1974), A Heuristic Algorithm for the vehicle Dispatching Problem, Operation Research, 22, 340-349 https://doi.org/10.1287/opre.22.2.340
  7. Glover, F. (1997), Tabu search and Adaptive Memory Problem programming: Advances, Applications and Challenges, Interfaces in Comp. Sc. and Oper. Res., 1-76
  8. Golden, B., Assad, A., Levy, L., and Gheysen, 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
  9. Jo, H. S. and Sim, J. I. (2006), 2004 Traffic Congestion Cost Analysis, KOTl, 137-144
  10. Kim, K. H. and Lee, Y. H. (2001), A Heuristic for Vehicle Routing Problem with Customer's Delivery Volume, Conference of the Korean Institute of Industrial Engineers (Spring)
  11. Lee, J. M. (2004), Modeling and Analysis of the Heterogeneous Fleet Vehicle Routing Problem with Customer Window, Korea National Defence University, Master Thesis, 15-29
  12. No, I. G. and Ha, Y. H. (2001), Heterogeneous Fleet and Dynamic Vehicle Routing Problem with Time Windows under E-Commerce, 2001 Conference of the Korean Institute of Industrial Engineers (Spring)
  13. Ochi, L. S., Vianna, D. S., Drummond, J. M. A., and Victor, A. O. (1998), A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet, Lecture Notes in Computer Science, 1388, 216-224
  14. Renaud, J. and Boctor, F. F. (2002), A sweep-based algorithm for the fleet size and mix vehicle routing problem, European Journal of Operational Research, 140, 618-628 https://doi.org/10.1016/S0377-2217(01)00237-5
  15. Salhi, S., Sari, M., Saidi, D., and Touati, N. (1992), Adaptation of some vehicle fleet mix heuristics, Omega, 20, 653-660 https://doi.org/10.1016/0305-0483(92)90009-V
  16. Salhi, S. and Rand, G. K. (1993), Incorporating vehicle routing into the vehicle fleet composition problem, European Journal of Operation Research, 66, 313-330 https://doi.org/10.1016/0377-2217(93)90220-H
  17. Seu, S. and Han, S. Y. (2005), 2003 Transportation Cost Analysis, KOTl, 119-124
  18. Taillard, E. D. (1996), A heuristic column generation method for heterogeneous fleet, CRT, 3
  19. Wassan, N. A. and Osman, I. H. (2002), Tabu search ariants for the mix fleet vehicle routing problem, Journal of the Operational Research Society, 53, 768-782 https://doi.org/10.1057/palgrave.jors.2601344