94 search results - page 6 / 19 » A Multi-start Heuristic Algorithm for the Generalized Travel... |
145
Voted
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
124
click to vote
IPL
2008
15 years 3 months ago
2008
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
144
Voted
DISOPT
2010
15 years 4 months ago
2010
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
138
Voted
RECOMB
2005
Springer
16 years 4 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
139
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...