Advertisement

The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows

  • D. Popović
  • M. Vidović
  • M. Nikolić
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 223)

Abstract

The containers drayage problem studied here arise in International Standards Organization (ISO) container distribution and collecting processes, in regions which are oriented to container sea ports or inland terminals. Containers of different sizes, but mostly 20 ft, and 40 ft empty and loaded should be delivered to, or collected from the customers. Therefore, the problem studied here is closely related to the vehicle routing problem with the time windows where an optimal set of routes is obtained. Both delivery and pickup demands can be satisfied in a single route. The specificity of the containers drayage problem analyzed here lies in the fact that a truck may simultaneously carry one 40 ft, or two 20 ft containers, using an appropriate trailer type. This means that in one route there can be one, two, three or four nodes, which is equivalent to the problem of matching nodes in single routes. This paper presents the Variable Neighborhood Search (VNS) heuristic for solving the Containers Drayage Problem with Time Windows (CDPTW). The results from the VNS heuristic are compared with the two optimal MIP mathematical formulations that were introduced in our previous research papers.

Keywords

Variable Neighborhood Search International Standard Organization Container Transportation Container Terminal Local Search Procedure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

This research was partially supported by the Ministry of Education, Science and Technological Development, Government of the Republic of Serbia, through the project TR 36006, for the period 2011-2014.

References

  1. 1.
    Crainic, T.G., Kim, K.H.: Intermodal transportation. In: Barnhart, C., Laporte, G. (eds.) Handbook in OR & MS, vol. 14, pp. 467–537. Elsevier B.V (2007)Google Scholar
  2. 2.
    Macharis, C., Bontekoning, Y.M.: Opportunities for OR in intermodal freight transport research: a review. EJOR 153, 400–416 (2004)CrossRefzbMATHGoogle Scholar
  3. 3.
    Nagl. P.: Longer combination vehicles (LCV) for Asia and Pacific region: some economic implications, UNESCAP Working Papers, No.2, UN (2007)Google Scholar
  4. 4.
    Zhang, R., Yun, W.Y., Kopfer, H.: Heuristic-based truck scheduling for inland container transportation. OR Spectrum 32, 787–808 (2010)CrossRefzbMATHGoogle Scholar
  5. 5.
    Jula, H., Dessouky, M., Ioannou, P., Chassiakos, A.: Container movement by trucks in metropolitan networks: modeling and optimization. Transp. Res. E: Logistics Transp. Rev. 41, 235–259 (2005)CrossRefGoogle Scholar
  6. 6.
    Coslovich, L., Pesenti, R., Ukovich, W.: Minimizing fleet operating costs for a container transportation company. EJOR 171, 776–786 (2006)CrossRefzbMATHGoogle Scholar
  7. 7.
    Imai, A., Nishimura, E., Current, J.: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load. EJOR 176, 87–105 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chung, K.H., Ko, C.S., Shin, J.Y., Hwang, H., Kim, K.H.: Development of mathematical models for the container road transportation in Korean trucking industries. Comput. Ind. Eng. 53, 252–262 (2007)CrossRefGoogle Scholar
  9. 9.
    Namboothiri, R., Erera, A.L.: Planning local container drayage operations given a port access appointment system. Transp. Res. E: Logistics Transp. Rev. 44, 185–202 (2008)CrossRefGoogle Scholar
  10. 10.
    Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transp. Sci. 29, 17–29 (1995)CrossRefzbMATHGoogle Scholar
  11. 11.
    Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems Part I: Transportation between customers and depot. J. für Betriebswirtschaft 58, 21–51 (2008a). doi: 10.1007/s11301-008-0033-7 CrossRefGoogle Scholar
  12. 12.
    Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems Part II: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58, 81–117 (2008b). doi: 10.1007/s11301-008-0036-4 CrossRefGoogle Scholar
  13. 13.
    Vidović, M., Radivojević, G., Ratković, B.: Vehicle routing in containers pickup up and delivery processes. Procedia Social Behav. Sci. 20, 335–343 (2011)CrossRefGoogle Scholar
  14. 14.
    Vidović, M., Radivojević, G., Ratković, B., Bjelić, N., Popović, D.: (2012a) Containers drayage problem with time windows. In: CD Book of Proceedings of the 15th International Conference on Transport Science ICTS 2012, Portoroz, SloveniaGoogle Scholar
  15. 15.
    Vidović, M., Nikolić, M., Popović, D.: (2012b) Two mathematical formulations for the containers drayage problem with time windows. In: 2nd International Conference on Supply Chains ICSC 2012, Katerini, GreeceGoogle Scholar
  16. 16.
    Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Hansen, P., Mladenovic, N., Perez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367–407 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Lai, M., Cao, E.: An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng. Appl. Artif. Intell. 23, 188–195 (2010)CrossRefGoogle Scholar
  19. 19.
    Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340–349 (1974)CrossRefzbMATHGoogle Scholar
  20. 20.
    Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., Vogel, U.: Vehicle routing with compartments: applications, modelling and heuristics. OR Spectrum 334, 885–914 (2010)MathSciNetGoogle Scholar
  21. 21.
    Wang, X., Regan, C.A.: Local truckload pickup and delivery with hard time window constraints. Transp. Res. B: methodological 36, 97–112 (2002)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Faculty of Transport and Traffic Engineering, Department of LogisticsUniversity of BelgradeBelgradeSerbia
  2. 2.Faculty of Transport and Traffic Engineering, Department of Operations Research in TrafficUniversity of BelgradeBelgradeSerbia

Personalised recommendations