Skip to main content
SpringerLink
Log in

A Harmony Search Approach for the Selective Pick-Up and Delivery Problem with Delayed Drop-Off

  • Conference paper
  • First Online:
Harmony Search Algorithm

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 382))

Abstract

In the last years freight transportation has undergone a sharp increase in the scales of its underlying processes and protocols mainly due to the ever-growing community of users and the increasing number of on-line shopping stores. Furthermore, when dealing with the last stage of the shipping chain an additional component of complexity enters the picture as a result of the fixed availability of the destination of the good to be delivered. As such, business opening hours and daily work schedules often clash with the delivery times programmed by couriers along their routes. In case of conflict, the courier must come to an arrangement with the destination of the package to be delivered or, alternatively, drop it off at a local depot to let the destination pick it up at his/her time convenience. In this context this paper will formulate a variant of the so-called courier problem under economic profitability criteria including the cost penalty derived from the delayed drop-off. In this context, if the courier delivers the package to its intended destination before its associated deadline, he is paid a reward. However, if he misses to deliver in time, the courier may still deliver it at the destination depending on its availability or, alternatively, drop it off at the local depot assuming a certain cost. The manuscript will formulate the mathematical optimization problem that models this logistics process and solve it efficiently by means of the Harmony Search algorithm. A simulation benchmark will be discussed to validate the solutions provided by this meta-heuristic solver and to compare its performance to other algorithmic counterparts.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jones Lang Lasalle IP, Inc.: E-commerce boom triggers transformation in retail logistics. White paper (2013)

    Google Scholar 

  2. eMarketer: Worldwide B2C Ecommerce: Q3 2014 Complete Forecast. Research report (2014)

    Google Scholar 

  3. Dror, M., Trudeau, G.: Savings by Split Delivery Routing. Transportation Science 23, 141–145 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Archetti, C., Speranza, M.G., Hertz, A.: A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science 40(1), 64–73 (2006)

    Article  Google Scholar 

  5. Ho, S.C., Haugland, D.: A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows and Split Deliveries. Computers and Operations Research 31(12), 1947–1964 (2004)

    Article  MATH  Google Scholar 

  6. Lin, Y.H., Batta, R., Rogerson, P.A., Blatt, A., Flanigan, M.: A Logistics Model for Delivery of Prioritized Items: Application to a Disaster Relief Effort. Technical report. New York: University of Buffalo (2009)

    Google Scholar 

  7. Balcik, B., Beamon, B.M., Smilowitz, K.: Last Mile Distribution in Humanitarian Relief. Journal of Intelligent Transportation Systems: Technology, Planning, and Operations 12(2), 51–63 (2008)

    Article  Google Scholar 

  8. Mester, D., Bräysy, O., Dullaert, W.: A Multi-Parametric Evolution Strategies Algorithm for Vehicle Routing Problems. Expert Systems with Applications 32, 508–517 (2007)

    Article  Google Scholar 

  9. Alba, E., Dorronsoro, B.: Computing Nine New Best-so-far Solutions for Capacitated VRP with a Cellular Genetic Algorithm. Information Processing Letters 98, 225–230 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  10. Doerner, K.F., Hartl, R.F., Lucka, M.: A Parallel Version of the D-ant Algorithm for the Vehicle Routing Problem. Parallel Numerics, 109–118 (2005)

    Google Scholar 

  11. Li, X., Tian, P.: An ant colony system for the open vehicle routing problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., Stützle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 356–363. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Layeb, A., Ammi, M., Chikhi, S.: A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Journal of Computing and Information Technology 1, 35–46 (2013)

    Article  Google Scholar 

  13. Suárez, J.G., Anticona, M.T.: Solving the capacitated vehicle routing problem and the split delivery using GRASP metaheuristic. In: Bramer, M. (ed.) IFIP AI 2010. IFIP AICT, vol. 331, pp. 243–249. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Chaovalitwongse, W., Kim, D., Pardalos, P.M.: GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows. Journal of Combinatorial Optimization 7, 179–207 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  15. Wang, C., Zhao, F., Mu, D., Sutherland, J.W.: Simulated annealing for a vehicle routing problem with simultaneous pickup-delivery and time windows. In: Prabhu, V., Taisch, M., Kiritsis, D. (eds.) APMS 2013, Part II. IFIP AICT, vol. 415, pp. 170–177. Springer, Heidelberg (2013)

    Google Scholar 

  16. Chen, S., Golden, B., Wasil, E.: The Split Delivery Vehicle Routing Problem: Applications, Algorithms, Test Problems, and Computational Results. Networks 49, 318–329 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  17. Czech, Z.J., Czarnas, P.: Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. In: Euromicro Workshop on Parallel, Distributed and Network-based Processing, pp. 376–383 (2002)

    Google Scholar 

  18. Pirkwieser, S., Raidl, G.R.: Multilevel variable neighborhood search for periodic routing problems. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 226–238. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  19. Kytöjoki, J., Nuortio, T., Bräysy, O., Gendreau, M.: An Efficient Variable Neighborhood Search Heuristic for Very Large Scale Vehicle Routing Problems. Computers & Operations Research 34, 2743–2757 (2007)

    Article  MATH  Google Scholar 

  20. Gendreau, M., Potvin, J.-Y., Bräumlaysy, O., Hasle, G., Løkketangen, A.: Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography. Operations Research/Computer Science Interfaces 43, 143–169 (2008)

    Article  Google Scholar 

  21. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  22. Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M.N., Salcedo-Sanz, S., Geem, Z.W.: A Survey on Applications of the Harmony Search Algorithm. Engineering Applications of Artificial Intelligence 26(8), 1818–1831 (2013)

    Article  Google Scholar 

  23. Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Upper Saddle River. Prentice Hall (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. TECNALIA. OPTIMA Unit, E-48160, Derio, Spain

    Javier Del Ser

  2. University of the Basque Country UPV/EHU, 48013, Bilbao, Spain

    Miren Nekane Bilbao & Cristina Perfecto

  3. Universidad de Alcalá, 28871, Alcalá de Henares, Spain

    Sancho Salcedo-Sanz

Authors
  1. Javier Del Ser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miren Nekane Bilbao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Cristina Perfecto
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sancho Salcedo-Sanz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Javier Del Ser .

Editor information

Editors and Affiliations

  1. Civil, Environmental and Architectural Engineering, Korea University, Seoul, Korea (Republic of)

    Joong Hoon Kim

  2. Energy IT, Gachon University, Seongnam-Si, Korea (Republic of)

    Zong Woo Geem

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Del Ser, J., Bilbao, M.N., Perfecto, C., Salcedo-Sanz, S. (2016). A Harmony Search Approach for the Selective Pick-Up and Delivery Problem with Delayed Drop-Off. In: Kim, J., Geem, Z. (eds) Harmony Search Algorithm. Advances in Intelligent Systems and Computing, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47926-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47926-1_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47925-4

  • Online ISBN: 978-3-662-47926-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation