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

Mechanisms for local search

Author

Listed:
  • Anderson, E. J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Anderson, E. J., 1996. "Mechanisms for local search," European Journal of Operational Research, Elsevier, vol. 88(1), pages 139-151, January.
  • Handle: RePEc:eee:ejores:v:88:y:1996:i:1:p:139-151
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00164-2
    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. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1989. "Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning," Operations Research, INFORMS, vol. 37(6), pages 865-892, December.
    2. Burkard, R. E. & Rendl, F., 1984. "A thermodynamically motivated simulation procedure for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 17(2), pages 169-174, August.
    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. Broekmeulen, Rob A. C. M. & van Weert, Arjen & Saedt, Anton P. H., 2002. "Comparing three alternative optimisation methods for the treatment planning of bulbs," Agricultural Systems, Elsevier, vol. 72(1), pages 59-71, April.
    2. Coleman, Dan & Dong, Xioapeng & Hardin, Johanna & Rocke, David M. & Woodruff, David L., 1999. "Some computational issues in cluster analysis with no a priori metric," Computational Statistics & Data Analysis, Elsevier, vol. 31(1), pages 1-11, July.
    3. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    4. T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.

    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. Saul Amorim & Jean-Pierre Barthélemy & Celso Ribeiro, 1992. "Clustering and clique partitioning: Simulated annealing and tabu search approaches," Journal of Classification, Springer;The Classification Society, vol. 9(1), pages 17-41, January.
    2. Drexl, Andreas & Nikulin, Yury, 2005. "Multicriteria airport gate assignment and pareto simulated annealing," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 586, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    3. Maria da Conceição Cunha, 1999. "On Solving Aquifer Management Problems with Simulated Annealing Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 13(3), pages 153-170, June.
    4. Goodson, Justin C. & Ohlmann, Jeffrey W. & Thomas, Barrett W., 2012. "Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand," European Journal of Operational Research, Elsevier, vol. 217(2), pages 312-323.
    5. S Küçükpetek & F Polat & H Oğuztüzün, 2005. "Multilevel graph partitioning: an evolutionary approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 549-562, May.
    6. Dell'Amico, Mauro & Trubian, Marco, 1998. "Solution of large weighted equicut problems," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 500-521, April.
    7. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    8. Orlin, James & Sharma, Dushyant, 2003. "The Extended Neighborhood: Definition And Characterization," Working papers 4392-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    9. Melouk, Sharif & Damodaran, Purushothaman & Chang, Ping-Yu, 2004. "Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealing," International Journal of Production Economics, Elsevier, vol. 87(2), pages 141-147, January.
    10. Melissa Gama & Bruno Filipe Santos & Maria Paola Scaparra, 2016. "A multi-period shelter location-allocation model with evacuation orders for flood disasters," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(3), pages 299-323, September.
    11. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    12. M Kumral & P A Dowd, 2005. "A simulated annealing approach to mine production scheduling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 922-930, August.
    13. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    14. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
    15. Ahern, Zeke & Paz, Alexander & Corry, Paul, 2022. "Approximate multi-objective optimization for integrated bus route design and service frequency setting," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 1-25.
    16. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    17. Van Buer, Michael G. & Woodruff, David L. & Olson, Rick T., 1999. "Solving the medium newspaper production/distribution problem," European Journal of Operational Research, Elsevier, vol. 115(2), pages 237-253, June.
    18. Burkard, Rainer E. & Cela, Eranda, 1995. "Heuristics for biquadratic assignment problems and their computational comparison," European Journal of Operational Research, Elsevier, vol. 83(2), pages 283-300, June.
    19. Yiyo Kuo, 2014. "Design method using hybrid of line-type and circular-type routes for transit network system optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 600-613, July.
    20. Hahsler, Michael, 2017. "An experimental comparison of seriation methods for one-mode two-way data," European Journal of Operational Research, Elsevier, vol. 257(1), pages 133-143.

    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:88:y:1996:i:1:p:139-151. 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.