IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v323y2025i3p753-766.html
   My bibliography  Save this article

A new effective heuristic for the Prisoner Transportation Problem

Author

Listed:
  • Ferreira, Luciano
  • Maciel, Marcos Vinicius Milan
  • de Carvalho, José Valério
  • Silva, Elsa
  • Alvelos, Filipe Pereira

Abstract

The Prisoner Transportation Problem is an NP-hard combinatorial problem and a complex variant of the Dial-a-Ride Problem. Given a set of requests for pick-up and delivery and a homogeneous fleet, it consists of assigning requests to vehicles to serve all requests, respecting the problem constraints such as route duration, capacity, ride time, time windows, multi-compartment assignment of conflicting prisoners and simultaneous services in order to optimize a given objective function.

Suggested Citation

  • Ferreira, Luciano & Maciel, Marcos Vinicius Milan & de Carvalho, José Valério & Silva, Elsa & Alvelos, Filipe Pereira, 2025. "A new effective heuristic for the Prisoner Transportation Problem," European Journal of Operational Research, Elsevier, vol. 323(3), pages 753-766.
    • Handle: RePEc:eee:ejores:v:323:y:2025:i:3:p:753-766
    DOI: 10.1016/j.ejor.2025.01.029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725000694
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.01.029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    2. Timo Gschwind & Stefan Irnich, 2015. "Effective Handling of Dynamic Time Windows and Its Application to Solving the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 49(2), pages 335-354, May.
    3. Soares, Ricardo & Marques, Alexandra & Amorim, Pedro & Parragh, Sophie N., 2024. "Synchronisation in vehicle routing: Classification schema, modelling framework and literature review," European Journal of Operational Research, Elsevier, vol. 313(3), pages 817-840.
    4. Gu, Wenjuan & Archetti, Claudia & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Speranza, M. Grazia, 2024. "Vehicle routing problems with multiple commodities: A survey," European Journal of Operational Research, Elsevier, vol. 317(1), pages 1-15.
    5. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    6. Gaul, Daniela & Klamroth, Kathrin & Pfeiffer, Christian & Stiglmayr, Michael & Schulz, Arne, 2025. "A tight formulation for the dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 321(2), pages 363-382.
    7. Cordeau, Jean-François & Laporte, Gilbert, 2003. "A tabu search heuristic for the static multi-vehicle dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 37(6), pages 579-594, July.
    8. Yannik Rist & Michael A. Forbes, 2021. "A New Formulation for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 55(5), pages 1113-1135, September.
    9. David M. Stein, 1978. "Scheduling Dial-a-Ride Transportation Systems," Transportation Science, INFORMS, vol. 12(3), pages 232-249, August.
    10. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    11. Jean-François Cordeau, 2006. "A Branch-and-Cut Algorithm for the Dial-a-Ride Problem," Operations Research, INFORMS, vol. 54(3), pages 573-586, June.
    12. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    13. Timo Gschwind & Michael Drexl, 2019. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 53(2), pages 480-491, March.
    14. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    15. Henke, Tino & Speranza, M. Grazia & Wäscher, Gerhard, 2015. "The multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 246(3), pages 730-743.
    16. Baïou, Mourad & Colares, Rafael & Kerivin, Hervé, 2023. "Complexity, algorithmic, and computational aspects of a dial-a-ride type problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 552-565.
    17. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    18. Christiaens, Jan & Çalik, Hatice & Wauters, Tony & Chirayil Chandrasekharan, Reshma & Vanden Berghe, Greet, 2020. "The prisoner transportation problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1058-1073.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anzenhofer, Fabian & Schmidbaur, Simon & Klein, Robert & Steinhardt, Claudius, 2025. "The potential of governmental regulation on shared mobility-on-demand systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 192(C).
    2. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    3. Jodeau, Jean & Absi, Nabil & Chevrier, Rémy & Feillet, Dominique, 2024. "The rail-road Dial-a-Ride problem," European Journal of Operational Research, Elsevier, vol. 318(2), pages 486-499.
    4. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    5. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    6. Christian Pfeiffer & Arne Schulz, 2022. "An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 87-119, March.
    7. Rahman, Md Hishamur & Chen, Shijie & Sun, Yanshuo & Siddiqui, Muhammad Imran Younus & Mohebbi, Matthew & Marković, Nikola, 2023. "Integrating dial-a-ride with transportation network companies for cost efficiency: A Maryland case study," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    8. Su, Yue & Dupin, Nicolas & Parragh, Sophie N. & Puchinger, Jakob, 2024. "A Branch-and-Price algorithm for the electric autonomous Dial-A-Ride Problem," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    9. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    10. Omar Rifki, 2024. "Autonomous Ride-Sharing Service Using Graph Embedding and Dial-a-Ride Problem: Application to the Last-Mile Transit in Lyon City," Mathematics, MDPI, vol. 12(4), pages 1-17, February.
    11. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    12. Ritzinger, Ulrike & Puchinger, Jakob & Rudloff, Christian & Hartl, Richard F., 2022. "Comparison of anticipatory algorithms for a dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 301(2), pages 591-608.
    13. Molenbruch, Yves & Braekers, Kris & Hirsch, Patrick & Oberscheider, Marco, 2021. "Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm," European Journal of Operational Research, Elsevier, vol. 290(1), pages 81-98.
    14. Guo, Shuocheng & Dayarian, Iman & Li, Jian & Qian, Xinwu, 2025. "Solving the equity-aware dial-a-ride problem using an exact branch-cut-and-price algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    15. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
    16. Chane-Haï Timothée & Vercraene Samuel & Monteiro Thibaud, 2023. "The assignment-dial-a-ride-problem," Health Care Management Science, Springer, vol. 26(4), pages 770-784, December.
    17. Zang, Zhaoqi & Tian, Qingyun & Wang, David Z.W., 2025. "On-demand transportation system for cross-state abortion travel: A dual dial-a-ride problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 196(C).
    18. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    19. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.
    20. Gaul, Daniela & Klamroth, Kathrin & Pfeiffer, Christian & Stiglmayr, Michael & Schulz, Arne, 2025. "A tight formulation for the dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 321(2), pages 363-382.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:323:y:2025:i:3:p:753-766. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.