IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v349y2005i3p649-666.html
   My bibliography  Save this article

Weight annealing

Author

Listed:
  • Ninio, Matan
  • Schneider, Johannes J.

Abstract

Simulated Annealing has become a standard optimization technique for a wide variety of problems: starting at a random configuration and performing a sequence of moves, the system is optimized using a control parameter which partially allows for accepting a deterioration and therefore for climbing over barriers in the energy landscape. Our approach, Weight Annealing, changes the energy landscape by assigning variable weights to the single parts of the proposed problem. We describe the philosophies behind these algorithms and present results for the Traveling Salesman Problem and the Sherrington–Kirkpatrick-model for spin glasses.

Suggested Citation

  • Ninio, Matan & Schneider, Johannes J., 2005. "Weight annealing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 349(3), pages 649-666.
    • Handle: RePEc:eee:phsmap:v:349:y:2005:i:3:p:649-666
    DOI: 10.1016/j.physa.2004.10.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437104013585
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2004.10.022?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. 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.
    2. Schneider, Johannes & Dankesreiter, Markus & Fettes, Werner & Morgenstern, Ingo & Schmid, Martin & Maria Singer, Johannes, 1997. "Search-space smoothing for combinatorial optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 243(1), pages 77-112.
    3. Robert H. Storer & S. David Wu & Renzo Vaccari, 1992. "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling," Management Science, INFORMS, vol. 38(10), pages 1495-1509, October.
    4. Michael Held & Richard M. Karp, 1970. "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research, INFORMS, vol. 18(6), pages 1138-1162, December.
    5. Voudouris, Christos & Tsang, Edward, 1999. "Guided local search and its application to the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 113(2), pages 469-499, March.
    6. Coy, Steven P. & Golden, Bruce L. & Wasil, Edward A., 2000. "A computational study of smoothing heuristics for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 15-27, July.
    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. Ransberger, Martin & Morgenstern, Ingo & Schneider, Johannes J., 2011. "Influence of rounding errors on the quality of heuristic optimization algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(13), pages 2571-2581.
    2. Burke, Edmund K. & Bykov, Yuri, 2017. "The late acceptance Hill-Climbing heuristic," European Journal of Operational Research, Elsevier, vol. 258(1), pages 70-78.

    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. Ransberger, Martin & Morgenstern, Ingo & Schneider, Johannes J., 2011. "Influence of rounding errors on the quality of heuristic optimization algorithms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(13), pages 2571-2581.
    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. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    4. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    5. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    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.
    7. Elena Nechita & Gloria Cerasela Crişan & Laszlo Barna Iantovics & Yitong Huang, 2020. "On the Resilience of Ant Algorithms. Experiment with Adapted MMAS on TSP," Mathematics, MDPI, vol. 8(5), pages 1-20, May.
    8. 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.
    9. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
    10. Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos, 2005. "A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 311-326, December.
    11. Rego, Cesar, 1998. "Relaxed tours and path ejections for the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 522-538, April.
    12. Chris Walshaw, 2002. "A Multilevel Approach to the Travelling Salesman Problem," Operations Research, INFORMS, vol. 50(5), pages 862-877, October.
    13. Michael Brusco & Hans-Friedrich Köhn, 2008. "Optimal Partitioning of a Data Set Based on the p-Median Model," Psychometrika, Springer;The Psychometric Society, vol. 73(1), pages 89-105, March.
    14. Ahmed Kheiri & Alina G. Dragomir & David Mueller & Joaquim Gromicho & Caroline Jagtenberg & Jelke J. Hoorn, 2019. "Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 561-595, December.
    15. 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.
    16. Haouari, Mohamed & Chaouachi, Jouhaina Siala, 2006. "Upper and lower bounding strategies for the generalized minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 171(2), pages 632-647, June.
    17. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    18. Gábor Braun & Samuel Fiorini & Sebastian Pokutta & David Steurer, 2015. "Approximation Limits of Linear Programs (Beyond Hierarchies)," Mathematics of Operations Research, INFORMS, vol. 40(3), pages 756-772, March.
    19. Yanling Chu & Xiaoju Zhang & Zhongzhen Yang, 2017. "Multiple quay cranes scheduling for double cycling in container terminals," PLOS ONE, Public Library of Science, vol. 12(7), pages 1-19, July.
    20. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.

    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:phsmap:v:349:y:2005:i:3:p:649-666. 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.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.