Sciweavers

303 search results - page 35 / 61
» Traveling Salesman Problem with Transportation
Sort
View
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
16 years 6 days ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 9 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
ISCI
2008
83views more  ISCI 2008»
15 years 6 months ago
A diversity maintaining population-based incremental learning algorithm
In this paper we propose a new probability update rule and sampling procedure for population-based incremental learning. These proposed methods are based on the concept of opposit...
Mario Ventresca, Hamid R. Tizhoosh
ECML
2004
Springer
15 years 9 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
OL
2010
128views more  OL 2010»
15 years 4 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...