Sciweavers

65 search results - page 7 / 13
» Reachability cuts for the vehicle routing problem with time ...
Sort
View
ICNC
2009
Springer
14 years 5 hour ago
Vehicle Routing Problem with Time Windows: A Hybrid Particle Swarm Optimization Approach
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
Xiaoxiang Liu, Weigang Jiang, Jianwen Xie
NETWORKS
2007
13 years 7 months ago
Models and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Stefan Ropke, Jean-François Cordeau, Gilber...
EOR
2008
119views more  EOR 2008»
13 years 7 months ago
A General Vehicle Routing Problem
In this paper we study a rich vehicle routing problem incorporating various complexities found in real-life applications. The General Vehicle Routing Problem (GVRP) is a combined ...
Asvin Goel, Volker Gruhn