[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9621))

Included in the following conference series:

  • 2500 Accesses

Abstract

This paper presents an enhanced guided ejection search (GES) to minimize the number of vehicles in the NP-hard pickup and delivery problem with time windows. The proposed improvements decrease the convergence time of the GES, and boost the quality of results. Extensive experimental study on the benchmark set shows how the enhancements influence the GES capabilities. It is coupled with the statistical tests to verify the significance of the results. We give a guidance on how to select a proper algorithm variant based on test characteristics and objectives. We report one new world’s best result obtained using the enhanced GES.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 35.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 44.99
Price includes VAT (United Kingdom)
  • 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

Similar content being viewed by others

Notes

  1. 1.

    See: http://www.sintef.no/projectweb/top/pdptw/li--lim-benchmark/.

  2. 2.

    The world’s best solutions are available at: https://www.sintef.no/projectweb/top/pdptw/li--lim-benchmark/400-customers/; reference date: April 27, 2015.

  3. 3.

    Our PDPTW feasibility checker is available at: http://sun.aei.polsl.pl/~jnalepa/PDPTW-checker/.

  4. 4.

    See http://sun.aei.polsl.pl/~jnalepa/ACIIDS2016/ for the solution details.

References

  1. Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(3), 455–472 (2002)

    Article  Google Scholar 

  2. Kalina, P., Vokrinek, J.: Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In: Proceeding of the IEEE SMC, pp. 1558–1563 (2012)

    Google Scholar 

  3. Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Op. Res. 218(1), 1–6 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  4. Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput., 1–19 (2015). doi:10.1007/s00500-015-1642-4

    Google Scholar 

  5. Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258–272 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171–197 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. Betriebswirtschaft 58(1), 21–51 (2008)

    Article  Google Scholar 

  8. Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 123–137. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sc. 40(4), 455–472 (2006)

    Article  Google Scholar 

  10. Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. 34(2), 107–121 (2000)

    Article  Google Scholar 

  11. Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202–213. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62, 23–35 (2015)

    Article  MathSciNet  Google Scholar 

  13. Nagata, Y., Tojo, S.: Guided ejection search for the job shop scheduling problem. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 168–179. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Nagata, Y., Bräysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Op. Res. Lett. 37(5), 333–338 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Blocho, M., Czech, Z.: A parallel memetic algorithm for the vehicle routing problem with time windows. In: Proceeding of the 3PGCIC, pp. 144–151 (2013)

    Google Scholar 

Download references

Acknowledgments

This research was supported by the National Science Centre under research Grant No. DEC-2013/09/N/ST6/03461, and performed using the infrastructure supported by the POIG.02.03.01-24-099/13 grant: “GeCONiI—Upper Silesian Center for Computational Science and Engineering”.

Author information

Authors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Jakub Nalepa & Miroslaw Blocho

  2. ABB IT, Krakow, Poland

    Miroslaw Blocho

Authors
  1. Jakub Nalepa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miroslaw Blocho
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jakub Nalepa .

Editor information

Editors and Affiliations

  1. Wrocław University of Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Wrocław University of Technology, Wrocław, Poland

    Bogdan Trawiński

  3. Iwate Prefectural University, Takizawa, Japan

    Hamido Fujita

  4. National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nalepa, J., Blocho, M. (2016). Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49381-6_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49381-6_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49380-9

  • Online ISBN: 978-3-662-49381-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation