62 search results - page 2 / 13 » Branch-and-Price-and-Cut for the Split-Delivery Vehicle Rout... |
PDP
2002
IEEE
14 years 9 days ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
GECCO
2009
Springer
14 years 1 hour 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...
GECCO
2009
Springer
14 years 1 hour ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
COR
2011
2011
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
13 years 2 months ago
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
We address a large scale waste collection vehicle routing problem with time windows (VRPTW) complicated by multiple disposal trips and drivers lunch breaks. A fitness search spac...