Sciweavers

3 search results - page 1 / 1
» Tabu Search with Simple Ejection Chains for Coloring Graphs
Sort
View
ANOR
2002
110views more  ANOR 2002»
13 years 4 months ago
Tabu Search with Simple Ejection Chains for Coloring Graphs
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
José Luis González Velarde, Manuel L...
HM
2005
Springer
140views Optimization» more  HM 2005»
13 years 10 months ago
Fast Ejection Chain Algorithms for Vehicle Routing with Time Windows
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
Herman Sontrop, Pieter van der Horn, Marc Uetz
EOR
2007
158views more  EOR 2007»
13 years 4 months ago
A graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Wit...
Edmund K. Burke, Barry McCollum, Amnon Meisels, Sa...