Sciweavers

425 search results - page 3 / 85
» Variable neighborhood search for the linear ordering problem
Sort
View
HEURISTICS
2008
124views more  HEURISTICS 2008»
13 years 6 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
HM
2009
Springer
145views Optimization» more  HM 2009»
13 years 11 months ago
Multiple Variable Neighborhood Search Enriched with ILP Techniques for the Periodic Vehicle Routing Problem with Time Windows
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
Sandro Pirkwieser, Günther R. Raidl
HEURISTICS
2002
88views more  HEURISTICS 2002»
13 years 6 months ago
The Parallel Variable Neighborhood Search for the p-Median Problem
Félix García-López, Bel&eacut...
AAAI
1996
13 years 7 months ago
Neighborhood Inverse Consistency Preprocessing
Constraint satisfaction consistency preprocessing methods are used to reduce search e ort. Time and especially space costs limit the amount of preprocessing that will be cost e ec...
Eugene C. Freuder, Charles D. Elfe