2343 search results - page 35 / 469 » The Locomotive Routing Problem |
133
click to vote
AEI
2004
15 years 1 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...
136
click to vote
COR
2000
15 years 1 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
112
click to vote
COCOON
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
129
click to vote
MP
2006
15 years 1 months ago
2006
In the paper we address the Distance-Constrained Capacitated Vehicle Routing Problem (DCVRP), where k minimum-cost routes through a central depot have to be constructed so as to co...
149
click to vote
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...