201 search results - page 21 / 41 » Algorithms for the On-Line Quota Traveling Salesman Problem |
COR
2008
13 years 6 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...
GECCO
2008
Springer
13 years 8 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...
GECCO
2009
Springer
14 years 10 days 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...
RECOMB
2005
Springer
14 years 8 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...
ANTSW
2004
Springer
14 years 1 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...