loading
Documents

Research.Publish.Connect.

Paper

Authors: Renaud De Landtsheer ; Gustavo Ospina ; Yoann Guyot ; Fabian Germeau and Christophe Ponsard

Affiliation: CETIC Research Centre, Belgium

ISBN: 978-989-758-218-9

Keyword(s): Sequence, Local Search, CBLS, Global Constraints, Global Moves, OscaR.cbls.

Related Ontology Subjects/Areas/Topics: Applications ; Artificial Intelligence ; Knowledge Discovery and Information Retrieval ; Knowledge-Based Systems ; Mathematical Modeling ; Methodologies and Technologies ; Operational Research ; Optimization ; OR in Transportation ; Pattern Recognition ; Routing ; Software Engineering ; Symbolic Systems

Abstract: Constraint-Based Local Search (CBLS) is an approach for quickly building local search solvers based on a declarative modelling framework for specifying input variables, constraints and objective function. An underlying engine can efficiently update the optimization model to reflect any change to the input variables, enabling fast exploration of neighbourhoods as performed by local search procedures. This approach suffers from a weakness when moves involve modifying the value of a large set of input variables in a structured fashion. In routing optimization, if one implements the optimization model by means of integer variables, a two-opt move that flip a portion of route requires modifying the value of many variables. The constraint on this problems are then notified about many updates, but they need to infer that these updates constitute a flip, and waste a lot of time. This paper presents this multi-variable limitation, discusses approaches to mitigate it, and proposes an ef ficient implementation of a variable type that represents sequences of integers to avoid it. The proposed implementation offers good complexities for updating and querying the value of sequences of integers and some mechanisms to enable the use of state-of-the art incremental global constraints. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.153.73.72

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
De Landtsheer, R.; Ospina, G.; Guyot, Y.; Germeau, F. and Ponsard, C. (2017). Supporting Efficient Global Moves on Sequences in Constraint-based Local Search Engines.In Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-218-9, pages 171-180. DOI: 10.5220/0006201901710180

@conference{icores17,
author={Renaud De Landtsheer. and Gustavo Ospina. and Yoann Guyot. and Fabian Germeau. and Christophe Ponsard.},
title={Supporting Efficient Global Moves on Sequences in Constraint-based Local Search Engines},
booktitle={Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2017},
pages={171-180},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006201901710180},
isbn={978-989-758-218-9},
}

TY - CONF

JO - Proceedings of the 6th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Supporting Efficient Global Moves on Sequences in Constraint-based Local Search Engines
SN - 978-989-758-218-9
AU - De Landtsheer, R.
AU - Ospina, G.
AU - Guyot, Y.
AU - Germeau, F.
AU - Ponsard, C.
PY - 2017
SP - 171
EP - 180
DO - 10.5220/0006201901710180

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.