Sciweavers

109 search results - page 1 / 22
» Two local search approaches for solving real-life car sequen...
Sort
View
EOR
2008
71views more  EOR 2008»
13 years 5 months ago
Two local search approaches for solving real-life car sequencing problems
Bertrand Estellon, Frédéric Gardi, K...
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
14 years 4 days ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
EOR
2008
75views more  EOR 2008»
13 years 5 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
PATAT
2004
Springer
151views Education» more  PATAT 2004»
13 years 11 months ago
Decomposition and Parallelization of Multi-resource Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of ...
Petr Slechta
EMO
2003
Springer
137views Optimization» more  EMO 2003»
13 years 10 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle