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

An empirical study of a new metaheuristic for the traveling salesman problem

Author

Listed:
  • Tsubakitani, Shigeru
  • Evans, James R.

Abstract

No abstract is available for this item.

Suggested Citation

  • Tsubakitani, Shigeru & Evans, James R., 1998. "An empirical study of a new metaheuristic for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 113-128, January.
    • Handle: RePEc:eee:ejores:v:104:y:1998:i:1:p:113-128
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(96)00334-7
    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. Volgenant, Ton & Jonker, Roy, 1982. "A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation," European Journal of Operational Research, Elsevier, vol. 9(1), pages 83-89, January.
    2. Volgenant, Ton & Jonker, Roy, 1983. "The symmetric traveling salesman problem and edge exchanges in minimal 1-trees," European Journal of Operational Research, Elsevier, vol. 12(4), pages 394-403, April.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    5. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    6. B. Golden & L. Bodin & T. Doyle & W. Stewart, 1980. "Approximate Traveling Salesman Algorithms," Operations Research, INFORMS, vol. 28(3-part-ii), pages 694-711, June.
    7. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    8. Frederick S. Hillier, 1969. "Efficient Heuristic Procedures for Integer Linear Programming with an Interior," Operations Research, INFORMS, vol. 17(4), pages 600-637, August.
    9. Robert L. Karg & Gerald L. Thompson, 1964. "A Heuristic Approach to Solving Travelling Salesman Problems," Management Science, INFORMS, vol. 10(2), pages 225-248, January.
    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. Alexander Nikolaev & Sheldon Jacobson & Shane Hall & Darrall Henderson, 2011. "A framework for analyzing sub-optimal performance of local search algorithms," Computational Optimization and Applications, Springer, vol. 49(3), pages 407-433, July.
    2. 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.
    3. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    4. Rego, Cesar, 2001. "Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 1," European Journal of Operational Research, Elsevier, vol. 129(2), pages 456-459, March.
    5. H Tang & E Miller-Hooks, 2005. "Algorithms for a stochastic selective travelling salesperson problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(4), pages 439-452, April.
    6. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.

    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. R. Dekker & M. B. M. de Koster & K. J. Roodbergen & H. van Kalleveen, 2004. "Improving Order-Picking Response Time at Ankor's Warehouse," Interfaces, INFORMS, vol. 34(4), pages 303-313, August.
    2. G Laporte, 2010. "A concise guide to the Traveling Salesman Problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 35-40, January.
    3. Rego, Cesar, 2001. "Technical note on the paper "An empirical study of a new metaheuristic for the traveling salesman problem" (by Shigeru Tsubakitani, James R. Evans, European Journal of Operational Research 1," European Journal of Operational Research, Elsevier, vol. 129(2), pages 456-459, March.
    4. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.
    5. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    6. Sleegers, Joeri & Olij, Richard & van Horn, Gijs & van den Berg, Daan, 2020. "Where the really hard problems aren’t," Operations Research Perspectives, Elsevier, vol. 7(C).
    7. Anurag Agarwal, 2009. "Theoretical insights into the augmented-neural-network approach for combinatorial optimization," Annals of Operations Research, Springer, vol. 168(1), pages 101-117, April.
    8. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    9. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    10. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    11. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    12. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    13. Ozgur, C. O. & Brown, J. R., 1995. "A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem," Omega, Elsevier, vol. 23(2), pages 205-219, April.
    14. Daniels, Richard L. & Rummel, Jeffrey L. & Schantz, Robert, 1998. "A model for warehouse order picking," European Journal of Operational Research, Elsevier, vol. 105(1), pages 1-17, February.
    15. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    16. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    17. 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.
    18. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    19. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.
    20. Negenman, Ebbe G., 2001. "Local search algorithms for the multiprocessor flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(1), pages 147-158, January.

    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:104:y:1998:i:1:p:113-128. 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.