Sciweavers

2340 search results - page 42 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
GECCO
2007
Springer
193views Optimization» more  GECCO 2007»
16 years 6 days ago
Approximating covering problems by randomized search heuristics using multi-objective models
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann,...
CEC
2007
IEEE
15 years 10 months ago
A hybrid evolutionary approach to the university course timetabling problem
Combinations of evolutionary based approaches with local search have provided very good results for a variety of scheduling problems. This paper describes the development of such a...
Salwani Abdullah, Edmund K. Burke, Barry McCollum
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 11 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
AI
1998
Springer
15 years 10 months ago
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
Jean Berger, Martin Salois, Regent Begin
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 7 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier