544 search results - page 24 / 109 » Improving Local Search for Fuzzy Scheduling Problems |
AAAI
2000
13 years 9 months ago
2000
Scheduling, routing, and layout tasks are examples of hard operations-research problems that have broad application in industry. Typical algorithms for these problems combine some...
ISCC
2006
IEEE
14 years 1 months ago
2006
IEEE
Genetic Algorithms are very powerful search methods that are used in different optimization problems. Parallel versions of genetic algorithms are easily implemented and usually in...
NMA
2010
13 years 5 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
PATAT
2004
Springer
14 years 1 months ago
2004
Springer
A hybrid Multi-Objective Evolutionary Algorithm is used to tackle the uncapacitated exam proximity problem. In this hybridization, local search operators are used instead of the tr...