The m-Steiner Traveling Salesman Problem with online edge blockages
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-021-00720-6
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Yinfeng Xu & Maolin Hu & Bing Su & Binhai Zhu & Zhijun Zhu, 2009. "The canadian traveller problem and its competitive analysis," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 195-205, August.
- Xingang Wen & Yinfeng Xu & Huili Zhang, 2015. "Online traveling salesman problem with deadlines and service flexibility," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 545-562, October.
- Zhang, Huili & Tong, Weitian & Xu, Yinfeng & Lin, Guohui, 2015. "The Steiner Traveling Salesman Problem with online edge blockages," European Journal of Operational Research, Elsevier, vol. 243(1), pages 30-40.
- Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
- Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
- Xu, Zhou & Rodrigues, Brian, 2017. "An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem," European Journal of Operational Research, Elsevier, vol. 257(3), pages 735-745.
- Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
- Bezalel Gavish & Kizhanathan Srikanth, 1986. "An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems," Operations Research, INFORMS, vol. 34(5), pages 698-717, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Davood Shiri & Hakan Tozan, 2022. "Online routing and searching on graphs with blocked edges," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1039-1059, September.
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.- Davood Shiri & Vahid Akbari & F. Sibel Salman, 2020. "Online routing and scheduling of search-and-rescue teams," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 755-784, September.
- Kara, Imdat & Bektas, Tolga, 2006. "Integer linear programming formulations of multiple salesman problems and its variations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1449-1458, November.
- Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
- 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.
- Shanxiu Jiang & Li Luo, 2019. "Online in-time service problem with minimal server assignment," Journal of Combinatorial Optimization, Springer, vol. 37(1), pages 114-122, January.
- Akbari, Vahid & Shiri, Davood & Sibel Salman, F., 2021. "An online optimization approach to post-disaster road restoration," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 1-25.
- Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
- Davood Shiri & Hakan Tozan, 2022. "Online routing and searching on graphs with blocked edges," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1039-1059, September.
- Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
- Bérczi, Kristóf & Mnich, Matthias & Vincze, Roland, 2023. "Approximations for many-visits multiple traveling salesman problems," Omega, Elsevier, vol. 116(C).
- Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
- Funke, Julia & Kopfer, Herbert, 2016. "A model for a multi-size inland container transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 70-85.
- Davood Shiri & F. Sibel Salman, 2017. "On the online multi-agent O–D k-Canadian Traveler Problem," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 453-461, August.
- José Alejandro Cornejo-Acosta & Jesús García-Díaz & Julio César Pérez-Sansalvador & Carlos Segura, 2023. "Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems," Mathematics, MDPI, vol. 11(13), pages 1-25, July.
- Wex, Felix & Schryen, Guido & Feuerriegel, Stefan & Neumann, Dirk, 2014. "Emergency response in natural disaster management: Allocation and scheduling of rescue units," European Journal of Operational Research, Elsevier, vol. 235(3), pages 697-708.
- Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
- Bektaş, Tolga, 2012. "Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing," European Journal of Operational Research, Elsevier, vol. 216(1), pages 83-93.
- CASTRO, Marco & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter & GOOS, Peter, 2012. "A simple GRASP+VND for the travelling salesperson problem with hotel selection," Working Papers 2012024, University of Antwerp, Faculty of Business and Economics.
- Zhang, Huili & Tong, Weitian & Lin, Guohui & Xu, Yinfeng, 2019. "Online minimum latency problem with edge uncertainty," European Journal of Operational Research, Elsevier, vol. 273(2), pages 418-429.
- Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
More about this item
Keywords
m-Steiner Traveling Salesman Problem; Canadian Traveler Problem; Traffic Blockage; Competitive Ratio;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:jcomop:v:41:y:2021:i:4:d:10.1007_s10878-021-00720-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.