52 search results - page 6 / 11 » Computing with Domino-Parity Inequalities for the Traveling ... |
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
MP
2010
13 years 5 months ago
2010
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. ...
LION
2009
Springer
14 years 2 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
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...