skip to main content
10.1145/3520304.3528893acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

A hyper-heuristic approach for the PDPTW

Authors Info & Claims
Published:19 July 2022Publication History

ABSTRACT

The one-to-one pickup and delivery problem with time-windows (PDPTW) is one of the most important problems in Operations Research (OR). In this problem a set of goods need to be transported in a given time-window with a fleet of vehicles. The pickup and delivery problem is one of the most challenging and important combinatorial optimisation problems as it has many real-world applications. Selection hyper-heuristics that learn heuristic utility during optimisation have been successfully applied to a variety of different optimisation problems including those in OR. In this paper we investigate the application of a sequence-based selection hyper-heuristic to the one-to-one, static and deterministic variant of the pickup and delivery problem with time-windows and will compare the results against two well known approaches in the Adaptive Large Neighbourhood Search and Grouping Genetic Algorithm.

References

  1. Jsprit framework. https://github.com/graphhopper/jsprit. Accessed: 2021-11-25.Google ScholarGoogle Scholar
  2. Russell Bent and Pascal Van Hentenryck. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4):875--893, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Christian Blum, Andrea Roli, and Michael Sampels. Hybrid metaheuristics: an emerging approach to optimization, volume 114. Springer, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  4. Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and Rong Qu. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12):1695--1724, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  5. Jan Christiaens and Greet Vanden Berghe. Slack induction by string removals for vehicle routing problems. Transportation Science, 54(2):417--433, 2020.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Timothy Curtois, Dario Landa-Silva, Yi Qu, and Wasakorn Laesanklang. Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows. EURO Journal on Transportation and Logistics, 7(2):151--192, 2018.Google ScholarGoogle ScholarCross RefCross Ref
  7. George B Dantzig and John H Ramser. The truck dispatching problem. Management science, 6(1):80--91, 1959.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Yvan Dumas, Jacques Desrosiers, and Francois Soumis. The pickup and delivery problem with time windows. European journal of operational research, 54(1):7--22, 1991.Google ScholarGoogle Scholar
  9. Ahmed Kheiri and Ed Keedwell. A sequence-based selection hyper-heuristic utilising a hidden markov model. In Proceedings of the 2015 annual conference on genetic and evolutionary computation, pages 417--424, 2015.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Haibing Li and Andrew Lim. A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools, 12(02): 173--186, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  11. Quan Lu and Maged Dessouky. An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Science, 38(4):503--514, 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. William P Nanry and J Wesley Barnes. Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological, 34(2):107--121, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  13. Giselher Pankratz. A grouping genetic algorithm for the pickup and delivery problem with time windows. Or Spectrum, 27(1):21--41, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  14. Stefan Ropke and Jean-François Cordeau. Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(3):267--286, 2009.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Stefan Ropke and David Pisinger. An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4):455--472, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Stefan Ropke, Jean-François Cordeau, and Gilbert Laporte. Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks: An International Journal, 49(4):258--272, 2007.Google ScholarGoogle Scholar
  17. Carlo S Sartori and Luciana S Buriol. A study on the pickup and delivery problem with time windows: matheuristics and new instances. Computers & Operations Research, 124:105065, 2020.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. A hyper-heuristic approach for the PDPTW

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GECCO '22: Proceedings of the Genetic and Evolutionary Computation Conference Companion
      July 2022
      2395 pages
      ISBN:9781450392686
      DOI:10.1145/3520304

      Copyright © 2022 Owner/Author

      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 19 July 2022

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,669of4,410submissions,38%

      Upcoming Conference

      GECCO '24
      Genetic and Evolutionary Computation Conference
      July 14 - 18, 2024
      Melbourne , VIC , Australia
    • Article Metrics

      • Downloads (Last 12 months)47
      • Downloads (Last 6 weeks)13

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader