Sciweavers

208 search results - page 4 / 42
» Evolutionary algorithms and multi-objectivization for the tr...
Sort
View
EVOW
2011
Springer
12 years 11 months ago
Optimization of the Nested Monte-Carlo Algorithm on the Traveling Salesman Problem with Time Windows
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
Arpad Rimmel, Fabien Teytaud, Tristan Cazenave
CEC
2011
IEEE
12 years 7 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
CIAC
2010
Springer
282views Algorithms» more  CIAC 2010»
13 years 11 months ago
Improved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Mo...
IPPS
1998
IEEE
13 years 12 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
GECCO
2011
Springer
374views Optimization» more  GECCO 2011»
12 years 11 months ago
A hybrid heuristic approach for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Petrica C. Pop, Serban Iordache