Journal of Navigation and Port Research (한국항해항만학회지)

Korean Institute of Navigation and Port Research (한국항해항만학회)
권호 표지
DOI QR코드

DOI QR Code

Nearest L- Neighbor Method with De-crossing in Vehicle Routing Problem

  • Published : 2009.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

The field of vehicle routing is currently growing rapidly because of many actual applications in truckload and less than truckload trucking, courier services, door to door services, and many other problems that generally hinder the optimization of transportation costs in a logistics network. The rapidly increasing number of customers in such a network has caused problems such as difficulty in cost optimization in terms of getting a global optimum solution in an acceptable time. Fast algorithms are needed to find sufficient solutions in a limited time that can be used for real time scheduling. In this paper, the nearest L-method (NLNM) is proposed to obtain a vehicle routing solution. String neighbors of different lengths were chosen, tested and compared. The applied de crossing procedure is meant to solve the routes by NLNM by giving a better solution and shorter computation time than that of NLNM with long string neighbors.

Keywords

References

  1. Ahuja, R.K., Magnanti, T.L., and Orlin J.B.(1993), "Network flows: theory, algorithms and applications", 1st edition, Prentice Hall
  2. Arya, S., Mount, D. M., Netanyahu, N. S., Silvennan, R and Wu,A. Y. (1994), "An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions", Journal of the ACM, Vol. 45, No.6, pp. 891-923 https://doi.org/10.1145/293347.293348
  3. Chitty, D.M. and Hernandez, M.L. (2004) , "A hybrid ant colony optimization technique for dynamic vehicle routing", Book chapter, Genetic and Evolutionary Computation - GECCO 2004, pp. 48-59
  4. Fabri, A. and Recht, P.(2006), "On Dynamic Pickup and Delivery Vehicle Routing with Several Time Windows and Waiting Times", Journal of Transportation Research Part B, Vol. 40, pp. 335-350 https://doi.org/10.1016/j.trb.2005.04.002
  5. Fan, J., Wang, X., and Ning, H.(2006) , "A Multiple Vehicles Routing Problem Algorithm with Stochastic Demand", The Sixth World on Intelligent Control and Automation WCICA
  6. Gendreau, M., Laporte, G., and Seguin R.(1996), "Stochastic vehicle routing", European Journal Of Operational Research, Vol. 88, pp. 3-12 https://doi.org/10.1016/0377-2217(95)00050-X
  7. Haghani, A. and Jung, S.(2005), "A Dynamic Vehicle Routing Problem with Time-Dependent Travel Times", Journal of Computers & Operations Research, Vol. 32, pp. 2959-2986 https://doi.org/10.1016/j.cor.2004.04.013
  8. Hashimoto, H., Ibaraki, T., Imahori, S., and Yagiura, M.(2006), "The Vehicle Routing Problem with Flexible Time Windows and Travelling Times", Journal of Discrete Applied Mathematics, Vol. 154, pp. 2271-2290 https://doi.org/10.1016/j.dam.2006.04.009
  9. Hanshar, F.T. and Ombuki-Berman, B.M.(2007), "Dynamic vehicle routing using genetic algorithms", Applied Intelligent, Vol. 27, pp. 89-99 https://doi.org/10.1007/s10489-006-0033-z
  10. Ichoua, S., Gendreau, M., and Potvin, J.Y.(2003), "Vehicle Dispatching with Time-Dependent Travel Times", European Journal of Operational Research, Vol.114, pp. 379-396 https://doi.org/10.1016/S0377-2217(02)00147-9
  11. Michalewicz (1996), "Genetic algorithms + data structures = evolution programs", 3rd edition, Springer
  12. Montemanni, R Gambardella, L.M., Rizzoli, A.E., and Donati, A.V.(2005), "Ant colony system for a dynamic vehicle routing problem", Journal of Combinatorial Optimization, Vol. 10, pp. 327-343 https://doi.org/10.1007/s10878-005-4922-6
  13. Simchi-Levi, D., Kaminsky, P., and Simchi-Levi, E.(2003), "Design and Managing the Supply Chain: Concepts, Strategies and Case Studies", McGraw Hill
  14. Solomon data, http://www.idsia.ch/luca/macs-vrptw/problems/ we1co me.htm
  15. Shin, J.H., Chang, M.H., and Yu, S.J. (2008), "A Study on RTLS Technology based YT Dynamic Operation for Efficiency of Container Terminal", Journal of Navigation and Port Research, Vol. 32, No.5, pp. 369-377 https://doi.org/10.5394/KINPR.2008.32.5.369
  16. Shin, J.H., Yu, Yu, S.J., and Chang, M.H. (2008), "A Study on Optimized Decision Model for Transfer Crane Operation in Container Terminal", Journal of Navigation and Port Research, Vol. 32, No.6, pp. 465-47l https://doi.org/10.5394/KINPR.2008.32.6.465
  17. Shin, J.Y. and Oh, S.I. (2008), "Vehicle Routing Problem for delivering containers using combined chassis trailers", Conference of 2008 KlNPR, pp. 155-156
  18. Toth, P. and Vigo, D.(2002), "The Vehicle Routing Problem", Society for Industrial and Applied Mathematics (SIAM)
  19. Zeimpekis, V. and Giaglis, G.M.(2005), "A Dynamic Real-Time Vehicle Routing System for Distribution Operations", Consumer Driven Electronic Transformation, Springer

Cited by

  1. Nearest L- Neighbor Method with De-crossing in Vehicle Routing Problem vol.33, pp.2, 2009, https://doi.org/10.5394/KINPR.2009.33.2.143