Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T18:38:00.038Z Has data issue: false hasContentIssue false

Combining constraint Propagationand meta-heuristics for searching a Maximum Weight Hamiltonian Chain

Published online by Cambridge University Press:  12 October 2006

Yves Caseau*
Affiliation:
Bouygues e-Lab, 1 avenue Eugène Freyssinet, 78061 St-Quentin en Yvelines Cedex, France; e-mail: ycs@caseau.com
Get access

Abstract

This paper presents the approach that we developed to solve the ROADEF 2003 challenge problem. This work is part of a research program whose aim is to study the benefits and the computer-aided generation of hybrid solutions that mix constraint programming and meta-heuristics, such as large neighborhood search (LNS). This paper focuses on three contributions that were obtained during this project: an improved method for propagating Hamiltonian chain constraints, a fresh look at limited discrepancy search and the introduction of randomization and de-randomization within our combination algebra. This algebra is made of terms that represent optimization algorithms, following the approach of SALSA [1], which can be generated or tuned automatically using a learning meta-strategy [2]. In this paper, the hybrid combination that is investigated mixes constraint propagation, a special form of limited discrepancy search and large neighborhood search.

Information

Type
Research Article
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable