Sciweavers

599 search results - page 9 / 120
» The traveling salesman problem
Sort
View
MP
2010
145views more  MP 2010»
13 years 6 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
SWARM
2010
SPRINGER
219views Optimization» more  SWARM 2010»
14 years 26 days ago
Biogeography Migration Algorithm for Traveling Salesman Problem
Biogeography-based optimization algorithm(BBO) is a new kind of optimization algorithm based on Biogeography. It is designed based on the migration strategy of animals to solve the...
Hongwei Mo, Lifang Xu
PPSN
2010
Springer
13 years 6 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
COR
2006
140views more  COR 2006»
13 years 7 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 2 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke