An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2020.0962
Download full text from publisher
References listed on IDEAS
- Yang, Zhao & Xiao, Ming-Qing & Ge, Ya-Wei & Feng, De-Long & Zhang, Lei & Song, Hai-Fang & Tang, Xi-Lang, 2018. "A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods," European Journal of Operational Research, Elsevier, vol. 265(1), pages 65-80.
- Michel Gendreau & Gilbert Laporte & Frédéric Semet, 1997. "The Covering Tour Problem," Operations Research, INFORMS, vol. 45(4), pages 568-576, August.
- Walton Pereira Coutinho & Roberto Quirino do Nascimento & Artur Alves Pessoa & Anand Subramanian, 2016. "A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 752-765, November.
- Behnam Behdani & J. Cole Smith, 2014. "An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 26(3), pages 415-432, August.
- John R. Current & David A. Schilling, 1989. "The Covering Salesman Problem," Transportation Science, INFORMS, vol. 23(3), pages 208-213, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
- Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2023. "Results for the close-enough traveling salesman problem with a branch-and-bound algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 369-407, June.
- Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
- Archetti, C. & Carrabs, F. & Cerulli, R. & Laureana, F., 2024. "A new formulation and a branch-and-cut algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 314(2), pages 446-465.
- Di Placido, Andrea & Archetti, Claudia & Cerrone, Carmine & Golden, Bruce, 2023. "The generalized close enough traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 974-991.
- Carrabs, Francesco, 2021. "A biased random-key genetic algorithm for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 292(3), pages 830-854.
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.- Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
- Di Placido, Andrea & Archetti, Claudia & Cerrone, Carmine & Golden, Bruce, 2023. "The generalized close enough traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 310(3), pages 974-991.
- Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2023. "Results for the close-enough traveling salesman problem with a branch-and-bound algorithm," Computational Optimization and Applications, Springer, vol. 85(2), pages 369-407, June.
- Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2021. "On the Distance-Constrained Close Enough Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 32-51.
- Liwei Zeng & Sunil Chopra & Karen Smilowitz, 2019. "The Covering Path Problem on a Grid," Transportation Science, INFORMS, vol. 53(6), pages 1656-1672, November.
- Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
- Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
- Fischer, Vera & Pacheco Paneque, Meritxell & Legrain, Antoine & Bürgy, Reinhard, 2024. "A capacitated multi-vehicle covering tour problem on a road network and its application to waste collection," European Journal of Operational Research, Elsevier, vol. 315(1), pages 338-353.
- Keisuke Murakami, 2018. "Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-22, August.
- Leticia Vargas & Nicolas Jozefowiez & Sandra Ulrich Ngueveu, 2017. "A dynamic programming operator for tour location problems applied to the covering tour problem," Journal of Heuristics, Springer, vol. 23(1), pages 53-80, February.
- Lei, Chao & Lin, Wei-Hua & Miao, Lixin, 2014. "A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 699-710.
- Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
- Christian Burkart & Pamela C. Nolz & Walter J. Gutjahr, 2017. "Modelling beneficiaries’ choice in disaster relief logistics," Annals of Operations Research, Springer, vol. 256(1), pages 41-61, September.
- Walton Pereira Coutinho & Roberto Quirino do Nascimento & Artur Alves Pessoa & Anand Subramanian, 2016. "A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 28(4), pages 752-765, November.
- Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
- Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
- Elfe Buluc & Meltem Peker & Bahar Y. Kara & Manoj Dora, 2022. "Covering vehicle routing problem: application for mobile child friendly spaces for refugees," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(2), pages 461-484, June.
- Agatz, N.A.H. & Bouman, P.C. & Schmidt, M.E., 2016. "Optimization Approaches for the Traveling Salesman Problem with Drone," ERIM Report Series Research in Management ERS-2015-011-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
- Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
- Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
More about this item
Keywords
close-enough; traveling salesman problem; neighborhoods; carousel greedy; drones;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:inm:orijoc:v:32:y:4:i:2020:p:1030-1048. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.