90 search results - page 6 / 18 » Metaheuristics for the vehicle routing problem with loading ... |
CEC
2007
IEEE
15 years 1 months ago
2007
IEEE
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
CP
1997
Springer
15 years 1 months ago
1997
Springer
This paper describes the combination of a well-known tsp heuristic, genius, with a constraint programming model for routing problems. The result, genius-cp, is an e cient heuristic...
100
click to vote
CIAC
2003
Springer
15 years 1 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
IOR
2006
14 years 9 months ago
2006
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
COR
2007
14 years 9 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...