Constraint-based large neighborhood search for machine reassignment

Publikationstyp
Konferenz
Autor(en)
Felix Brandt and Markus Völker and Jochen Speck
Jahr
2012
Notiz
European Conference on Operational Research
Abstract
The presented approach is basically a large neighbourhood search that iteratively improves the given solution. In each iteration a subset of processes is released, while all other processes stay on their current machine. Released processes are then reassigned to the machines by a constraint program and the first improving solution is selected. We evaluate different neighbourhood selection strategies, branching techniques and optimization to improve performance on big instances. Furthermore, we present a network flow formulation that allows to compute lower bounds on the necessary costs.
Link
http://challenge.roadef.org/2012/en/index.php
Forschungsfelder
Logistik und Supply-Chain-Optimierung
Download .bib
Download .bib
Eingetragen von
Felix Brandt