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

Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem

Author

Listed:
  • Yu, Wei
  • Liu, Zhaohui
  • Bao, Xiaoguang

Abstract

This paper is concerned with the Online Quota Traveling Salesman Problem. Depending on the symmetry of the metric and the requirement for the salesman to return to the origin, four variants are analyzed. We present optimal deterministic algorithms for each variant defined on a general space, a real line, or a half-line. As a byproduct, an improved lower bound for a variant of Online TSP on a half-line is also obtained.

Suggested Citation

  • Yu, Wei & Liu, Zhaohui & Bao, Xiaoguang, 2014. "Optimal deterministic algorithms for some variants of Online Quota Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 735-740.
    • Handle: RePEc:eee:ejores:v:238:y:2014:i:3:p:735-740
    DOI: 10.1016/j.ejor.2014.04.037
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714003798
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.04.037?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. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    2. Michiel Blom & Sven O. Krumke & Willem E. de Paepe & Leen Stougie, 2001. "The Online TSP Against Fair Adversaries," INFORMS Journal on Computing, INFORMS, vol. 13(2), pages 138-148, May.
    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. Tengyu Wu & Lin He & Haiyan Yu, 0. "Online traveling salesman problem with time cost and non-zealous server," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-24.
    2. Mengyuan Gou & Haiyan Yu, 2023. "Online Delivery Problem for Hybrid Truck–Drone System with Independent and Truck-Carried Drones," Sustainability, MDPI, vol. 15(2), pages 1-15, January.
    3. Tengyu Wu & Lin He & Haiyan Yu, 2022. "Online traveling salesman problem with time cost and non-zealous server," Journal of Combinatorial Optimization, Springer, vol. 44(3), pages 2143-2166, October.

    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. Morteza Keshtkaran & Koorush Ziarati & Andrea Bettinelli & Daniele Vigo, 2016. "Enhanced exact solution methods for the Team Orienteering Problem," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 591-601, January.
    2. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    3. Stacy A. Voccia & Ann Melissa Campbell & Barrett W. Thomas, 2019. "The Same-Day Delivery Problem for Online Purchases," Service Science, INFORMS, vol. 53(1), pages 167-184, February.
    4. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    5. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    6. Dumez, Dorian & Lehuédé, Fabien & Péton, Olivier, 2021. "A large neighborhood search approach to the vehicle routing problem with delivery options," Transportation Research Part B: Methodological, Elsevier, vol. 144(C), pages 103-132.
    7. Lin, Jun & Qian, Yanjun & Cui, Wentian & Goh, Thong Ngee, 2015. "An effective approach for scheduling coupled activities in development projects," European Journal of Operational Research, Elsevier, vol. 243(1), pages 97-108.
    8. Vansteenwegen, Pieter & Mateo, Manuel, 2014. "An iterated local search algorithm for the single-vehicle cyclic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 237(3), pages 802-813.
    9. Yu, Bin & Shan, Wenxuan & Sheu, Jiuh-Biing & Diabat, Ali, 2022. "Branch-and-price for a combined order selection and distribution problem in online community group-buying of perishable products," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 341-373.
    10. Drexl, Michael, 2013. "A note on the separation of subtour elimination constraints in elementary shortest path problems," European Journal of Operational Research, Elsevier, vol. 229(3), pages 595-598.
    11. Devansh Jalota & Dario Paccagnan & Maximilian Schiffer & Marco Pavone, 2023. "Online Routing Over Parallel Networks: Deterministic Limits and Data-driven Enhancements," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 560-577, May.
    12. Ahn, Jaemyung & de Weck, Olivier & Geng, Yue & Klabjan, Diego, 2012. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration," European Journal of Operational Research, Elsevier, vol. 223(1), pages 47-59.
    13. Majsa Ammouriova & Massimo Bertolini & Juliana Castaneda & Angel A. Juan & Mattia Neroni, 2022. "A Heuristic-Based Simulation for an Education Process to Learn about Optimization Applications in Logistics and Transportation," Mathematics, MDPI, vol. 10(5), pages 1-18, March.
    14. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    15. Archetti, Claudia & Corberán, Ángel & Plana, Isaac & Sanchis, José Maria & Speranza, M. Grazia, 2015. "A matheuristic for the Team Orienteering Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 245(2), pages 392-401.
    16. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    17. 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.
    18. Samita Kedkaew & Warisa Nakkiew & Parida Jewpanya & Wasawat Nakkiew, 2024. "A Novel Tourist Trip Design Problem with Stochastic Travel Times and Partial Charging for Battery Electric Vehicles," Mathematics, MDPI, vol. 12(18), pages 1-19, September.
    19. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    20. Orhan Karasakal, 2016. "Minisum and maximin aerial surveillance over disjoint rectangles," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(3), pages 705-724, October.

    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:238:y:2014:i:3:p:735-740. 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.