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

  • 제39권6호
  • /
  • Pages.554-561
  • /
  • 2013
  • /
  • 1225-0988(pISSN)
  • /
  • 2234-6457(eISSN)
대한산업공학회 (Korean Institute of Industrial Engineers)
권호 표지
DOI QR코드

DOI QR Code

다품종 독립 적재공간을 갖는 배달과 수거를 동시에 고려한 차량경로문제

A Simultaneous Delivery and Pick-up Heterogeneous Vehicle Routing Problem with Separate Loading Area

  • 김각규 (국방대학교 운영분석학과) ;
  • 김성우 (국방대학교 운영분석학과) ;
  • 조성진 (국방대학교 운영분석학과)
  • Kim, Gak-Gyu (Department of Operations Research, Korea National Defense University) ;
  • Kim, Seong-Woo (Department of Operations Research, Korea National Defense University) ;
  • Kim, Seong-Woo (Department of Operations Research, Korea National Defense University)
  • 투고 : 2012.12.19
  • 심사 : 2013.09.04
  • 발행 : 2013.12.15
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

As a special topic of the vehicle routing problems (VRP), VRPSDP extends the vehicle routing problem as considering simultaneous pickup and delivery for goods. The past studies have mainly dealt with a only weight constraint of a loading capacity for heterogeneous products. However. this study suggests VRPSDP considering separate loading area according to characteristics of loading species. The objective is to design a set of minimum distance routes for the vehicle routing assignment with independent capacity for heterogeneous species. And then we present a another HVRPSDP model which is easy to utilizes in a unique circumstance that is a guarantee of executing a task simultaneously from the various areas under restricted time and raising an application of vehicles that returns at the depot for the next mission like the military group. The optimal results of the suggested mathematical models are solved by the ILOG CPLEX software ver. 12.4 that is provided by IBM company.

키워드

참고문헌

  1. Crispim, J. and Brandao, J. (2005), Meta heuristic applied to mixed and simultaneous extensions of vehicle routing problems with backhauls, Journal of the Operational Research Society, 56, 1296-1302. https://doi.org/10.1057/palgrave.jors.2601935
  2. Dantzig, G. B. and Ramser, J. H. (1959), The truck dispatching problem, Management Science, 6, 80-91. https://doi.org/10.1287/mnsc.6.1.80
  3. Dethloff, J. (2001), Vehicle routing and reverse logistics : the vehicle routing problem with simultaneous delivery and pick-up, OR Spektrum, 23(1), 79-96. https://doi.org/10.1007/PL00013346
  4. Egeblad, J., Nielsen, B., and Odgaard, A. (2007), Fast neighborhood search for two- and three-dimesional nesting problems, European Journal of Operational Research, 183(3), 1249-1266. https://doi.org/10.1016/j.ejor.2005.11.063
  5. Emmanouil, E. Zachariadis, Christos D. Tarantilis, and Chris, T. K. (2009), A hybrid metaheuristics for the vehicle routing problems with simultaneous delivery and pick-up service, Expert Systems with Applications, 36(2), 1070-1081. https://doi.org/10.1016/j.eswa.2007.11.005
  6. Ganesh, K. and Narendran, T. T. (2008), TASTE : a two-phase heuristic to solve a routing problem with simultaneous delivery and pick-up, International Journal of Advanced Manufacturing Technology, 37, 1221-1231. https://doi.org/10.1007/s00170-007-1056-2
  7. Gribvoskaia, I., Halskau, O., and Myklebost, K. (2002), Models for pick-up and deliveries from depots with lasso solutions, Molde University College, Norway.
  8. Gronalt, M., Hartl, R., and Reiman, M. (2003), New saving based algorithms for time constrained pickup and delivery of full truckloads, European Journal of Operational Research, 151(1), 520-535. https://doi.org/10.1016/S0377-2217(02)00650-1
  9. Jeon, G. and Lee, C.-M. (2007), A Vehicle Route Problem with Simultaneous Delivery and Pick-up, Thesis Collection published by Korea National Defense University, 15(2), 213-242.
  10. Jung, Y.-H., Kim, G.-G. and Lee, S.-H. (2012), Dual-depot Heterogeneous Vehicle Routing Problem Considering Reverse Logistics, Management Science by KORMS, 29(1), 89-99. https://doi.org/10.7737/KMSR.2012.29.1.089
  11. Kim, N.-H. (1994), Simultaneous Consideration of Delivery and Pick-up in Vehicle Routing Problem, A mater's thesis of Ajou University.
  12. Min, H. (1989), The multiple vehicle routing problem with simultaneous delivery and pick-up, Transportation Research Part A, 23A(5), 377-386.
  13. Park, G.-J. Kim, K.-T., and Jeon, G. (2010), A Vehicle Routing Problem to Minimize the Transportation Cost with Simultaneous Delivery and Pick-up, Journal of Defence Science and Technology, 3(3), 43-51.
  14. Park, M.-W. and Kim, D.-J. (2004), A Study on Vehicle Routing Problem considering Homeward-route Transport Requirement, MORS-K, 30(2), 81-95.
  15. Salhi, S. and Nagy, G. (1999), A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling, Journal of the Operational Research Society, 50(10), 1034-1042. https://doi.org/10.1057/palgrave.jors.2600808
  16. Song, J.-E., Kim, H.-S., Lee, M.-H., and Kim, N.-H. (2006), A Grouping Genetic Algorithm for the Pick-up and Delivery with Time Windows, 2006 Spring Thesis Collection of KIIE and KORMS.
  17. Wassan, N. A., Wassan , H., and Nagy, G. (2008), a reactive tabu search algorithm for the vehicle routing problem SDP, Journal of combinatorial Optimization, 15(4), 368-386. https://doi.org/10.1007/s10878-007-9090-4