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

Construction heuristics for the asymmetric TSP

Author

Listed:
  • Glover, Fred
  • Gutin, Gregory
  • Yeo, Anders
  • Zverovich, Alexey

Abstract

No abstract is available for this item.

Suggested Citation

  • Glover, Fred & Gutin, Gregory & Yeo, Anders & Zverovich, Alexey, 2001. "Construction heuristics for the asymmetric TSP," European Journal of Operational Research, Elsevier, vol. 129(3), pages 555-568, March.
    • Handle: RePEc:eee:ejores:v:129:y:2001:i:3:p:555-568
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00468-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    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. repec:dgr:rugsom:04a27 is not listed on IDEAS
    2. Turkensteen, Marcel & Ghosh, Diptesh & Goldengorin, Boris & Sierksma, Gerard, 2004. "Iterative Patching and the Asymmetric Traveling Salesman Problem," Research Report 04A27, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    3. Graf, Benjamin, 2021. "Preemptive stacker crane problem: Extending tree-based properties and construction heuristics," European Journal of Operational Research, Elsevier, vol. 292(2), pages 532-547.
    4. Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    5. Jäger, G. & Goldengorin, B., 2005. "How to make a greedy heuristic for the asymmetric traveling salesman problem competitive," Research Report 05A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    6. Luo, Xiaochuan & Chu, Chengbin, 2007. "A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness," European Journal of Operational Research, Elsevier, vol. 180(1), pages 68-81, July.
    7. repec:dgr:rugsom:05a11 is not listed on IDEAS
    8. Irnich, Stefan, 2008. "Solution of real-world postman problems," European Journal of Operational Research, Elsevier, vol. 190(1), pages 52-67, October.
    9. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    10. Xuekai Cen & Kanghui Ren & Yiying Cai & Qun Chen, 2023. "Designing Flexible-Bus System with Ad-Hoc Service Using Travel-Demand Clustering," Mathematics, MDPI, vol. 11(4), pages 1-27, February.

    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. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    2. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    3. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    4. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    5. Kouhei Harada, 2021. "A Feasibility-Ensured Lagrangian Heuristic for General Decomposable Problems," SN Operations Research Forum, Springer, vol. 2(4), pages 1-26, December.
    6. Yao, Yu & Zhu, Xiaoning & Dong, Hongyu & Wu, Shengnan & Wu, Hailong & Carol Tong, Lu & Zhou, Xuesong, 2019. "ADMM-based problem decomposition scheme for vehicle routing problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 156-174.
    7. Horbach, Andrei, 2005. "Combinatorial relaxation of the k-traveling salesman problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 599, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Peter Reiter & Walter Gutjahr, 2012. "Exact hybrid algorithms for solving a bi-objective vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 19-43, March.
    9. Rathinam, Sivakumar & Sengupta, Raja, 2006. "Matroid Intersection and its application to a Multiple Depot, Multiple TSP," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt9sj6585p, Institute of Transportation Studies, UC Berkeley.
    10. Marcel Turkensteen & Dmitry Malyshev & Boris Goldengorin & Panos M. Pardalos, 2017. "The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems," Journal of Global Optimization, Springer, vol. 68(3), pages 601-622, July.
    11. Igor Litvinchev & Socorro Rangel & Jania Saucedo, 2010. "A Lagrangian bound for many-to-many assignment problems," Journal of Combinatorial Optimization, Springer, vol. 19(3), pages 241-257, April.
    12. Fatemeh Keshavarz-Ghorbani & Seyed Hamid Reza Pasandideh, 2022. "A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO2 emissions," Annals of Operations Research, Springer, vol. 314(2), pages 497-527, July.
    13. Shawn Choo & Diego Klabjan & David Simchi-Levi, 2010. "Multiship Crane Sequencing with Yard Congestion Constraints," Transportation Science, INFORMS, vol. 44(1), pages 98-115, February.
    14. Zamani, Reza & Lau, Sim Kim, 2010. "Embedding learning capability in Lagrangean relaxation: An application to the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 201(1), pages 82-88, February.
    15. Shengbin Wang & Weizhen Rao & Yuan Hong, 2020. "A distance matrix based algorithm for solving the traveling salesman problem," Operational Research, Springer, vol. 20(3), pages 1505-1542, September.
    16. Steeger, Gregory & Rebennack, Steffen, 2017. "Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: An application to the strategic bidding problem," European Journal of Operational Research, Elsevier, vol. 257(2), pages 669-686.
    17. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    18. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    19. Kinable, Joris & Cire, Andre A. & van Hoeve, Willem-Jan, 2017. "Hybrid optimization methods for time-dependent sequencing problems," European Journal of Operational Research, Elsevier, vol. 259(3), pages 887-897.
    20. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.

    More about this item

    Statistics

    Access and download statistics

    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:129:y:2001:i:3:p:555-568. 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.