IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v51y2011i3p515-540.html
   My bibliography  Save this article

Seeking global edges for traveling salesman problem in multi-start search

Author

Listed:
  • Weiqi Li

Abstract

No abstract is available for this item.

Suggested Citation

  • Weiqi Li, 2011. "Seeking global edges for traveling salesman problem in multi-start search," Journal of Global Optimization, Springer, vol. 51(3), pages 515-540, November.
    • Handle: RePEc:spr:jglopt:v:51:y:2011:i:3:p:515-540
    DOI: 10.1007/s10898-010-9643-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-010-9643-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-010-9643-4?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. William Cook & Paul Seymour, 2003. "Tour Merging via Branch-Decomposition," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 233-248, August.
    2. Charles Fleurent & Fred Glover, 1999. "Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory," INFORMS Journal on Computing, INFORMS, vol. 11(2), pages 198-204, May.
    3. R. Martí & J. Marcos Moreno-Vega & A. Duarte, 2010. "Advanced Multi-start Methods," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 265-281, Springer.
    4. Marti, Rafael & Laguna, Manuel & Glover, Fred & Campos, Vicente, 2001. "Reducing the bandwidth of a sparse matrix with tabu search," European Journal of Operational Research, Elsevier, vol. 135(2), pages 450-459, 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. Thomas Weise & Yuezhong Wu & Raymond Chiong & Ke Tang & Jörg Lässig, 2016. "Global versus local search: the impact of population sizes on evolutionary algorithm performance," Journal of Global Optimization, Springer, vol. 66(3), pages 511-534, 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. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
    2. 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.
    3. Pinana, Estefania & Plana, Isaac & Campos, Vicente & Marti, Rafael, 2004. "GRASP and path relinking for the matrix bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 153(1), pages 200-210, February.
    4. Alberto Caprara & Juan-José Salazar-González, 2005. "Laying Out Sparse Graphs with Provably Minimum Bandwidth," INFORMS Journal on Computing, INFORMS, vol. 17(3), pages 356-373, August.
    5. Behrooz Koohestani & Riccardo Poli, 2015. "Addressing the envelope reduction of sparse matrices using a genetic programming system," Computational Optimization and Applications, Springer, vol. 60(3), pages 789-814, April.
    6. Torkil Kollsker & Thomas J. R. Stidsen, 2021. "Optimisation and Static Equilibrium of Three-Dimensional LEGO Constructions," SN Operations Research Forum, Springer, vol. 2(2), pages 1-52, June.
    7. Rodriguez-Tello, Eduardo & Hao, Jin-Kao & Torres-Jimenez, Jose, 2008. "An improved simulated annealing algorithm for bandwidth minimization," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1319-1335, March.
    8. Sergio Cavero & Eduardo G. Pardo & Abraham Duarte, 2022. "A general variable neighborhood search for the cyclic antibandwidth problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 657-687, March.
    9. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    10. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
    11. Hideki Hashimoto & Sylvain Boussier & Michel Vasquez & Christophe Wilbaut, 2011. "A GRASP-based approach for technicians and interventions scheduling for telecommunications," Annals of Operations Research, Springer, vol. 183(1), pages 143-161, March.
    12. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
    13. Celso C. Ribeiro & Eduardo Uchoa & Renato F. Werneck, 2002. "A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 228-246, August.
    14. Ada Alvarez & José González-Velarde & Karim De-Alba, 2005. "Scatter Search for Network Design Problem," Annals of Operations Research, Springer, vol. 138(1), pages 159-178, September.
    15. Daniel Martins & Gabriel M. Vianna & Isabel Rosseti & Simone L. Martins & Alexandre Plastino, 2018. "Making a state-of-the-art heuristic faster with data mining," Annals of Operations Research, Springer, vol. 263(1), pages 141-162, April.
    16. Michele Samorani & Manuel Laguna, 2012. "Data-Mining-Driven Neighborhood Search," INFORMS Journal on Computing, INFORMS, vol. 24(2), pages 210-227, May.
    17. Lim, Andrew & Rodrigues, Brian & Xiao, Fei, 2006. "Heuristics for matrix bandwidth reduction," European Journal of Operational Research, Elsevier, vol. 174(1), pages 69-91, October.
    18. Vicente Campos & Estefanía Piñana & Rafael Martí, 2011. "Adaptive memory programming for matrix bandwidth minimization," Annals of Operations Research, Springer, vol. 183(1), pages 7-23, March.
    19. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    20. Gerald Senarclens de Grancy & Marc Reimann, 2016. "Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP," 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. 24(1), pages 29-48, March.

    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:spr:jglopt:v:51:y:2011:i:3:p:515-540. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.