Skip to main content
SpringerLink
Log in

Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows

  • Conference paper
  • First Online:
Man-Machine Interactions 5 (ICMMI 2017)

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

Included in the following conference series:

Abstract

Estimating the theoretical complexity of a parallel algorithm can give an impression on how it will perform in practice. However, this complexity analysis is very often omitted in the works from the parallel computation field. In this paper, we theoretically analyze the time complexity of our parallel algorithm for the pickup and delivery problem with time windows (PDPTW), which is an NP-hard discrete optimization task. The PDPTW is a hierarchical objective problem—the main objective is to minimize the number of trucks serving the transportation requests, whereas the second objective is to optimize the travel distance. In our approach, the fleet size is optimized using the parallel ejection search, and the distance is minimized using the parallel memetic algorithm. Finally, we report example experimental results showing that our parallel algorithms work very fast in practice.

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 EPUB and 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

Notes

  1. 1.

    The benchmark and the world’s best results are available at: https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/; access date: March 12, 2017.

References

  1. 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 

  2. Blocho, M., Nalepa, J.: Complexity Analysis of the Parallel Guided Ejection Search for the Pickup and Delivery Problem with Time Windows (2017). http://arxiv.org/abs/1704.06724

  3. Blocho, M., Nalepa, J.: LCS-based selective route exchange crossover for the pickup and delivery problem with time windows. In: Hu, B., López-Ibáñez, M. (eds.) Evolutionary Computation in Combinatorial Optimization. LNCS, vol. 10197, pp. 124–140. Springer, Cham (2017)

    Google Scholar 

  4. Chami, Z.A., Manier, H., Manier, M.A.: New model for a variant of pick up and delivery problem. In: IEEE SMC 2016, Budapest, Hungary, pp. 001,708–001,713 (2016)

    Google Scholar 

  5. 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  MATH  Google Scholar 

  6. Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) Evolutionary Computation in Combinatorial Optimization. LNCS, vol. 6022, pp. 202–213. Springer, Berlin (2010)

    Google Scholar 

  7. Nalepa, J., Blocho, M.: A parallel algorithm with the search space partition for the pickup and delivery with time windows. In: 3PGCIC 2015, Krakow, Poland, pp. 92–99 (2015)

    Google Scholar 

  8. Nalepa, J., Blocho, M.: Co-operation in the parallel memetic algorithm. Int. J. Parallel Program. 43(5), 812–839 (2015)

    Article  Google Scholar 

  9. Nalepa, J., Blocho, M.: Enhanced guided ejection search for the pickup and delivery problem with time windows. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, T.P. (eds.) Intelligent Information and Database Systems. LNCS, vol. 9621, pp. 388–398. Springer, Berlin (2016)

    Google Scholar 

  10. Nalepa, J., Blocho, M.: A parallel memetic algorithm for the pickup and delivery problem with time windows. In: PDP 2017, St. Petersburg, Russia, pp. 1–8 (2017)

    Google Scholar 

  11. Nikolopoulou, A.I., Repoussis, P.P., Tarantilis, C.D., Zachariadis, E.E.: Moving products between location pairs: cross-docking versus direct-shipping. Eur. J. Oper. Res. 256(3), 803–819 (2017)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This research was supported by the National Science Centre under research Grant No. DEC-2013/09/N/ST6/03461, and by the Polish National Centre for Research and Development (POIR.01.02.00-00-0030/15). We thank the TASK CI centre in Gdańsk, where the computations were carried out.

Author information

Authors and Affiliations

  1. Silesian University of Technology, Gliwice, Poland

    Miroslaw Blocho & Jakub Nalepa

Authors
  1. Miroslaw Blocho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Nalepa
    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. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Aleksandra Gruca

  2. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Tadeusz Czachórski

  3. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Katarzyna Harezlak

  4. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Stanisław Kozielski

  5. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Agnieszka Piotrowska

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Blocho, M., Nalepa, J. (2018). Complexity Analysis of the Parallel Memetic Algorithm for the Pickup and Delivery Problem with Time Windows. In: Gruca, A., Czachórski, T., Harezlak, K., Kozielski, S., Piotrowska, A. (eds) Man-Machine Interactions 5. ICMMI 2017. Advances in Intelligent Systems and Computing, vol 659. Springer, Cham. https://doi.org/10.1007/978-3-319-67792-7_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67792-7_46

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67791-0

  • Online ISBN: 978-3-319-67792-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation