Skip to Main content Skip to Navigation
Conference papers

Une simple heuristique pour rapprocher DFS et LNS pour les COP

Abstract : In this paper, we argue that a combination of wellknown and new search strategies enables Depth First tree Search (DFS) to mimic the behavior of Large Neighborhood Search (LNS), which reduces considerably the gap between the two techniques. In particular, we are able to implement a DFS strategy that shares the scalability properties of LNS, but the optimality of solutions can eventually be proven.
Document type :
Conference papers
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03390559
Contributor : Kathleen Torck Connect in order to contact the contributor
Submitted on : Thursday, October 21, 2021 - 2:21:02 PM
Last modification on : Wednesday, November 3, 2021 - 9:54:24 AM

Identifiers

  • HAL Id : hal-03390559, version 1

Collections

Citation

Julien Vion, Sylvain Piechowiak. Une simple heuristique pour rapprocher DFS et LNS pour les COP. Actes des 13e Journées Francophones de la Programmation par Contraintes, JFPC 2017, Jun 2017, Montreuil sur Mer, France. ⟨hal-03390559⟩

Share

Metrics

Record views

6