94 search results - page 17 / 19 » A Multi-start Heuristic Algorithm for the Generalized Travel... |
CONSTRAINTS
2002
13 years 7 months ago
2002
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
EVOW
2004
Springer
14 years 26 days ago
2004
Springer
Genetic Algorithms (GAs) are well-known heuristic algorithms and have been widely applied to solve combinatorial problems. Edge recombination is one of the famous crossovers design...
CEC
2010
IEEE
13 years 8 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
AAIM
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. This paper presents an iterative, highly parallelizable approach to find good tours for very large instances of the Euclidian version of the well-known Traveling Salesma...
WAOA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Many online problems encountered in real-life involve a twostage decision process: upon arrival of a new request, an irrevocable firststage decision (the assignment of a...