Sciweavers

925 search results - page 30 / 185
» A Solution to the Extended GCD Problem
Sort
View
EOR
2007
158views more  EOR 2007»
13 years 7 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...
HEURISTICS
2010
13 years 5 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 1 months ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen
ECAI
2004
Springer
14 years 1 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
HM
2009
Springer
145views Optimization» more  HM 2009»
14 years 11 days 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