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

Solving the traveling repairman problem on a line with general processing times and deadlines

Author

Listed:
  • Bock, Stefan

Abstract

This paper resolves the complexity status of the well-known Traveling Repairman Problem on a line (Line-TRP) with general processing times at the request locations and deadline restrictions. It has long remained an open research question whether an exact solution procedure with pseudo-polynomial running time can be developed for this version of the Traveling Repairman Problem that was known to be at least binary NP-hard. The presented proof of strong NP-completeness of the problem is provided by a reduction from 3-PARTITION. Since recent literature provides significant new results for further variants of the Line-TRP and the Line-TSP, a brief updated overview of the complexity status of the different variants is given. Another major contribution is that a practically applicable exact best-first search Branch&Bound approach that optimally solves instances of real-world size in reasonable time is proposed. By applying sophisticated dominance rules as well as lower bounds, the number of enumerated partial solutions is kept limited. The efficiency of the new approach and the applied instruments is validated by a computational study.

Suggested Citation

  • Bock, Stefan, 2015. "Solving the traveling repairman problem on a line with general processing times and deadlines," European Journal of Operational Research, Elsevier, vol. 244(3), pages 690-703.
  • Handle: RePEc:eee:ejores:v:244:y:2015:i:3:p:690-703
    DOI: 10.1016/j.ejor.2015.02.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722171500106X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2015.02.009?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    2. Simon Emde & Malte Fliedner & Nils Boysen, 2012. "Optimally loading tow trains for just-in-time supply of mixed-model assembly lines," IISE Transactions, Taylor & Francis Journals, vol. 44(2), pages 121-135.
    3. Alan S. Manne, 1960. "On the Job-Shop Scheduling Problem," Operations Research, INFORMS, vol. 8(2), pages 219-223, April.
    4. Emde, Simon & Fliedner, Malte & Boysen, Nils, 2012. "Optimally loading tow trains for just-in-time supply of mixed-model assembly lines," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79434, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    5. Emde, Simon & Boysen, Nils, 2012. "Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines," European Journal of Operational Research, Elsevier, vol. 217(2), pages 287-299.
    6. Willem E. de Paepe & Jan Karel Lenstra & Jiri Sgall & René A. Sitters & Leen Stougie, 2004. "Computer-Aided Complexity Classification of Dial-a-Ride Problems," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 120-132, May.
    7. Bock, Stefan, 2010. "Real-time control of freight forwarder transportation networks by integrating multimodal transport chains," European Journal of Operational Research, Elsevier, vol. 200(3), pages 733-746, February.
    8. Harilaos N. Psaraftis & Marius M. Solomon & Thomas L. Magnanti & Tai-Up Kim, 1990. "Routing and Scheduling on a Shoreline with Release Times," Management Science, INFORMS, vol. 36(2), pages 212-223, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kuschel, Torben & Bock, Stefan, 2016. "The weighted uncapacitated planned maintenance problem: Complexity and polyhedral properties," European Journal of Operational Research, Elsevier, vol. 250(3), pages 773-781.
    2. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    3. Akbari, Vahid & Shiri, Davood, 2021. "Weighted online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 295(1), pages 51-65.
    4. Bock, Stefan, 2024. "Vehicle routing for connected service areas - a versatile approach covering single, hierarchical, and bi-criteria objectives," European Journal of Operational Research, Elsevier, vol. 313(3), pages 905-925.
    5. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    6. Irawan, Chandra Ade & Ouelhadj, Djamila & Jones, Dylan & Stålhane, Magnus & Sperstad, Iver Bakken, 2017. "Optimisation of maintenance routing and scheduling for offshore wind farms," European Journal of Operational Research, Elsevier, vol. 256(1), pages 76-89.
    7. Liu, Shixin & Qin, Shujin & Zhang, Ruiyou, 2018. "A branch-and-price algorithm for the multi-trip multi-repairman problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 25-41.

    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. Stefan Bock, 2016. "Finding optimal tour schedules on transportation paths under extended time window constraints," Journal of Scheduling, Springer, vol. 19(5), pages 527-546, October.
    2. Bock, Stefan, 2020. "Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios," European Journal of Operational Research, Elsevier, vol. 283(3), pages 863-882.
    3. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2020. "Loading tow trains ergonomically for just-in-time part supply," European Journal of Operational Research, Elsevier, vol. 284(1), pages 325-344.
    4. Sternatz, Johannes, 2015. "The joint line balancing and material supply problem," International Journal of Production Economics, Elsevier, vol. 159(C), pages 304-318.
    5. Diefenbach, Heiko & Emde, Simon & Glock, Christoph H., 2023. "Multi-depot electric vehicle scheduling in in-plant production logistics considering non-linear charging models," European Journal of Operational Research, Elsevier, vol. 306(2), pages 828-848.
    6. Erfan Ghorbani & Mahdi Alinaghian & Gevork. B. Gharehpetian & Sajad Mohammadi & Guido Perboli, 2020. "A Survey on Environmentally Friendly Vehicle Routing Problem and a Proposal of Its Classification," Sustainability, MDPI, vol. 12(21), pages 1-71, October.
    7. Simon Emde & Michael Schneider, 2018. "Just-In-Time Vehicle Routing for In-House Part Feeding to Assembly Lines," Transportation Science, INFORMS, vol. 52(3), pages 657-672, June.
    8. Simon Emde & Lukas Polten, 2019. "Sequencing assembly lines to facilitate synchronized just-in-time part supply," Journal of Scheduling, Springer, vol. 22(6), pages 607-621, December.
    9. Daria Battini & Nils Boysen & Simon Emde, 2013. "Just-in-Time supermarkets for part supply in the automobile industry," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 24(2), pages 209-217, July.
    10. Simon Emde, 2017. "Scheduling the replenishment of just-in-time supermarkets in assembly plants," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 321-345, January.
    11. Masood Fathi & Victoria Rodríguez & Dalila B.M.M. Fontes & Maria Jesus Alvarez, 2016. "A modified particle swarm optimisation algorithm to solve the part feeding problem at assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 54(3), pages 878-893, February.
    12. Emde, Simon & Gendreau, Michel, 2017. "Scheduling in-house transport vehicles to feed parts to automotive assembly lines," European Journal of Operational Research, Elsevier, vol. 260(1), pages 255-267.
    13. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    14. Boysen, Nils & Emde, Simon, 2014. "Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets," European Journal of Operational Research, Elsevier, vol. 239(3), pages 820-829.
    15. Maurizio Faccio & Mauro Gamberi & Alessandro Persona & Alberto Regattieri & Fabio Sgarbossa, 2013. "Design and simulation of assembly line feeding systems in the automotive sector using supermarket, kanbans and tow trains: a general framework," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 24(2), pages 187-208, July.
    16. Zenker, Michael & Emde, Simon & Boysen, Nils, 2016. "Cyclic inventory routing in a line-shaped network," European Journal of Operational Research, Elsevier, vol. 250(1), pages 164-178.
    17. Adenipekun, Ebenezer Olatunde & Limère, Veronique & Schmid, Nico André, 2022. "The impact of transportation optimisation on assembly line feeding," Omega, Elsevier, vol. 107(C).
    18. Bock, Stefan, 2024. "Vehicle routing for connected service areas - a versatile approach covering single, hierarchical, and bi-criteria objectives," European Journal of Operational Research, Elsevier, vol. 313(3), pages 905-925.
    19. Masood Fathi & Morteza Ghobakhloo, 2020. "Enabling Mass Customization and Manufacturing Sustainability in Industry 4.0 Context: A Novel Heuristic Algorithm for in-Plant Material Supply Optimization," Sustainability, MDPI, vol. 12(16), pages 1-15, August.
    20. Emilio Moretti & Elena Tappia & Martina Mauri & Marco Melacini, 2022. "A performance model for mobile robot-based part feeding systems to supermarkets," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 580-613, September.

    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:244:y:2015:i:3:p:690-703. 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.