Sciweavers

117 search results - page 3 / 24
» Hybrid constructive heuristics for the critical node problem
Sort
View
TCAD
2002
110views more  TCAD 2002»
13 years 4 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
ACISICIS
2007
IEEE
13 years 11 months ago
A Hybrid Simulated Annealing with Kempe Chain Neighborhood for the University Timetabling Problem
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
Mauritsius Tuga, Regina Berretta, Alexandre Mendes
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
13 years 11 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
MP
2006
138views more  MP 2006»
13 years 4 months ago
A new ILP-based refinement heuristic for Vehicle Routing Problems
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
Roberto De Franceschi, Matteo Fischetti, Paolo Tot...
HM
2007
Springer
135views Optimization» more  HM 2007»
13 years 11 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik