IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v26y2020i5d10.1007_s10732-020-09446-w.html
   My bibliography  Save this article

Distance-guided local search

Author

Listed:
  • Daniel Porumbel

    (Conservatoire National des Arts et Métiers)

  • Jin-Kao Hao

    (Université d’Angers
    Institut Universitaire de France)

Abstract

We present several techniques that use distances between candidate solutions to achieve intensification in Local Search (LS) algorithms. An important drawback of classical LS is that after visiting a very high-quality solution the search process can “forget about it” and continue towards very different areas. We propose a method that works on top of a given LS to equip it with a form of memory so as to record the highest-quality visited areas (spheres). More exactly, this new method uses distances between candidate solutions to perform a coarse–grained recording of the LS trajectory, i.e., it records a number of discovered spheres. The (centers of the) spheres are kept sorted in a priority queue in which new centers are continually inserted as in insertion-sort algorithms. After thoroughly investigating a sphere, the proposed method resumes the search from the first best sphere center in the priority queue. The resulting LS trajectory is no longer a continuous path, but a tree-like structure, with closed branches (already investigated spheres) and open branches (as-yet-unexplored spheres). We also explore several other techniques relying on distances, e.g., in Section 2.3, we show how to use distance information to prevent the search from looping indefinitely on large (quasi-)plateaus. Experiments on three problems based on different encodings (partitions, vectors and permutations) confirm the intensification potential of the proposed ideas.

Suggested Citation

  • Daniel Porumbel & Jin-Kao Hao, 2020. "Distance-guided local search," Journal of Heuristics, Springer, vol. 26(5), pages 711-741, October.
  • Handle: RePEc:spr:joheur:v:26:y:2020:i:5:d:10.1007_s10732-020-09446-w
    DOI: 10.1007/s10732-020-09446-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-020-09446-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10732-020-09446-w?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. Qinghua Wu & Jin-Kao Hao, 2013. "An adaptive multistart tabu search approach to solve the maximum clique problem," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 86-108, July.
    2. Porumbel, Daniel & Goncalves, Gilles & Allaoui, Hamid & Hsu, Tienté, 2017. "Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem," European Journal of Operational Research, Elsevier, vol. 256(2), pages 349-367.
    3. Vicente Campos & Manuel Laguna & Rafael Martí, 2005. "Context-Independent Scatter and Tabu Search for Permutation Problems," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 111-122, February.
    Full references (including those not matched with items on IDEAS)

    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. W. Art Chaovalitwongse & Carlos A. S. Oliveira & Bruno Chiarini & Panos M. Pardalos & Mauricio G. C. Resende, 2011. "Revised GRASP with path-relinking for the linear ordering problem," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 572-593, November.
    2. Oleksandra Yezerska & Sergiy Butenko & Vladimir L. Boginski, 2018. "Detecting robust cliques in graphs subject to uncertain edge failures," Annals of Operations Research, Springer, vol. 262(1), pages 109-132, March.
    3. Xu, Yifan & Wandelt, Sebastian & Sun, Xiaoqian, 2021. "Airline integrated robust scheduling with a variable neighborhood search based heuristic," Transportation Research Part B: Methodological, Elsevier, vol. 149(C), pages 181-203.
    4. Hu, Xiaoxuan & Zhu, Waiming & Ma, Huawei & An, Bo & Zhi, Yanling & Wu, Yi, 2021. "Orientational variable-length strip covering problem: A branch-and-price-based algorithm," European Journal of Operational Research, Elsevier, vol. 289(1), pages 254-269.
    5. Rodriguez-Tello, Eduardo & Lardeux, Frédéric & Duarte, Abraham & Narvaez-Teran, Valentina, 2019. "Alternative evaluation functions for the cyclic bandwidth sum problem," European Journal of Operational Research, Elsevier, vol. 273(3), pages 904-919.
    6. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.
    7. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    8. MohammadAmin Fazli & Azin Ghazimatin & Jafar Habibi & Hamid Haghshenas, 2016. "Team selection for prediction tasks," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 743-757, February.
    9. Fred Glover & Gary Kochenberger & Weihong Xie & Jianbin Luo, 2019. "Diversification methods for zero-one optimization," Journal of Heuristics, Springer, vol. 25(4), pages 643-671, October.
    10. Yi Zhou & Jin-Kao Hao & Adrien Goëffon, 2016. "A three-phased local search approach for the clique partitioning problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 469-491, August.
    11. Ghaith Jaradat & Masri Ayob & Zulkifli Ahmad, 2014. "On the performance of Scatter Search for post-enrolment course timetabling problems," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 417-439, April.
    12. Ellips Masehian & Hossein Akbaripour & Nasrin Mohabbati-Kalejahi, 2013. "Landscape analysis and efficient metaheuristics for solving the n-queens problem," Computational Optimization and Applications, Springer, vol. 56(3), pages 735-764, December.
    13. A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna, 2021. "A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 629-642, May.
    14. San Segundo, Pablo & Furini, Fabio & Álvarez, David & Pardalos, Panos M., 2023. "CliSAT: A new exact algorithm for hard maximum clique problems," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1008-1025.
    15. Xue Bai & Rema Padman & Joseph Ramsey & Peter Spirtes, 2008. "Tabu Search-Enhanced Graphical Models for Classification in High Dimensions," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 423-437, August.
    16. Bruno Nogueira & Rian G. S. Pinheiro, 2020. "A GPU based local search algorithm for the unweighted and weighted maximum s-plex problems," Annals of Operations Research, Springer, vol. 284(1), pages 367-400, January.
    17. M Laguna & J Molina & F Pérez & R Caballero & A G Hernández-Díaz, 2010. "The challenge of optimizing expensive black boxes: a scatter search/rough set theory approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(1), pages 53-67, January.
    18. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    19. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    20. Porumbel, Daniel & Coelho, Igor M. & Talbi, El-Ghazali, 2024. "Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 25-43.

    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:joheur:v:26:y:2020:i:5:d:10.1007_s10732-020-09446-w. 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.