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

Optimally solving a versatile Traveling Salesman Problem on tree networks with soft due dates and multiple congestion scenarios

Author

Listed:
  • Bock, Stefan

Abstract

This paper considers a versatile Traveling Salesman Problem (TSP) on tree networks with soft due date restrictions. Data unreliability is handled by introducing multiple congestion scenarios. The objective function sums up customizable monotonous cost assessments of the scenario-dependent total tardiness. Due to its generality, this covers a versatile application of different concepts including several robustness issues. Various complexity results are derived for the minimization of total tardiness: While the problem is proven to be at least binary NP-hard in all cases, strongly NP-hardness is shown if either the number of congestion scenarios or the number of roads are allowed to increase linearly with the number of requests. The same applies if non-zero unloading times occur. In order to efficiently solve the problem, a best-first Branch&Bound approach is proposed that attains a pseudo-polynomial running time if none of the three aforementioned cases applies. The Branch&Bound approach is evaluated by a computational study.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:283:y:2020:i:3:p:863-882
    DOI: 10.1016/j.ejor.2019.11.058
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221719309701
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2019.11.058?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. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    2. Andrés Gómez & Ricardo Mariño & Raha Akhavan-Tabatabaei & Andrés L. Medaglia & Jorge E. Mendoza, 2016. "On Modeling Stochastic Travel and Service Times in Vehicle Routing," Transportation Science, INFORMS, vol. 50(2), pages 627-641, May.
    3. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    4. 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.
    5. Goerigk, Marc & Knust, Sigrid & Le, Xuan Thanh, 2016. "Robust storage loading problems with stacking and payload constraints," European Journal of Operational Research, Elsevier, vol. 253(1), pages 51-67.
    6. 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.
    7. Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
    8. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    9. Ferrucci, Francesco & Bock, Stefan, 2016. "Pro-active real-time routing in applications with multiple request patterns," European Journal of Operational Research, Elsevier, vol. 253(2), pages 356-371.
    10. 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).
    11. Guy Desaulniers & Fausto Errico & Stefan Irnich & Michael Schneider, 2016. "Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows," Operations Research, INFORMS, vol. 64(6), pages 1388-1405, December.
    12. R. Montemanni & J. Barta & M. Mastrolilli & L. M. Gambardella, 2007. "The Robust Traveling Salesman Problem with Interval Data," Transportation Science, INFORMS, vol. 41(3), pages 366-381, August.
    13. 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.
    14. Elgesem, Aurora Smith & Skogen, Eline Sophie & Wang, Xin & Fagerholt, Kjetil, 2018. "A traveling salesman problem with pickups and deliveries and stochastic travel times: An application from chemical shipping," European Journal of Operational Research, Elsevier, vol. 269(3), pages 844-859.
    15. Stewart, William R. & Golden, Bruce L., 1983. "Stochastic vehicle routing: A comprehensive approach," European Journal of Operational Research, Elsevier, vol. 14(4), pages 371-385, December.
    16. 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.
    17. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 79443, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    18. Christiansen, Marielle & Fagerholt, Kjetil & Nygreen, Bjørn & Ronen, David, 2013. "Ship routing and scheduling in the new millennium," European Journal of Operational Research, Elsevier, vol. 228(3), pages 467-483.
    19. 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.
    20. Ann Campbell & Michel Gendreau & Barrett Thomas, 2011. "The orienteering problem with stochastic travel and service times," Annals of Operations Research, Springer, vol. 186(1), pages 61-81, June.
    21. Schneider, M., 2016. "The vehicle-routing problem with time windows and driver-specific times," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65941, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    22. Taş, D. & Gendreau, M. & Dellaert, N. & van Woensel, T. & de Kok, A.G., 2014. "Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach," European Journal of Operational Research, Elsevier, vol. 236(3), pages 789-799.
    23. A. L. Soyster, 1973. "Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming," Operations Research, INFORMS, vol. 21(5), pages 1154-1157, October.
    24. Eshetie Berhan & Birhanu Beshah & Daniel Kitaw & Ajith Abraham, 2014. "Stochastic Vehicle Routing Problem: A Literature Survey," Journal of Information & Knowledge Management (JIKM), World Scientific Publishing Co. Pte. Ltd., vol. 13(03), pages 1-12.
    25. 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.
    26. 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.
    27. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    28. Figliozzi, Miguel Andres, 2010. "The impacts of congestion on commercial vehicle tour characteristics and costs," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(4), pages 496-506, July.
    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. 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.

    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, 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.
    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. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    9. 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.
    10. 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.
    11. 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.
    12. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    13. C. Briand & Y. He & S. U. Ngueveu, 2018. "Energy-efficient planning for supplying assembly lines with vehicles," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 387-414, December.
    14. 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.
    15. Alexandra Anderluh & Rune Larsen & Vera C. Hemmelmayr & Pamela C. Nolz, 2020. "Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 806-828, December.
    16. 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.
    17. 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.
    18. Bakker, Steffen J. & Wang, Akang & Gounaris, Chrysanthos E., 2021. "Vehicle routing with endogenous learning: Application to offshore plug and abandonment campaign planning," European Journal of Operational Research, Elsevier, vol. 289(1), pages 93-106.
    19. Jorge Oyola & Halvard Arntzen & David L. Woodruff, 2017. "The stochastic vehicle routing problem, a literature review, Part II: solution methods," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(4), pages 349-388, December.
    20. Ali, Ousmane & Côté, Jean-François & Coelho, Leandro C., 2021. "Models and algorithms for the delivery and installation routing problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 162-177.

    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:283:y:2020:i:3:p:863-882. 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.