New assignment algorithms for the multi-depot vehicle routing problem

Journal of the Operational Research Society

Volumn 53, Issue 9, 2002, Pages 977-984

  Giosa, I D ^a   Tansini, I L ^a   Viera, I O ^a  

^a UNIVERSIDAD DE LA REPÚBLICA   (Uruguay)

Author keywords

Assignment; Clustering; Multi depot vehicle routing problem

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GROUND VEHICLES; PROBLEM SOLVING; TRANSPORTATION ROUTES;

VEHICLE ROUTING PROBLEM;

OPERATIONS RESEARCH;

EID: 0036723699     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601426     Document Type: Article

References (14)

1. Routing and scheduling of vehicles and crews: The state of the art
2. Complexity of vehicle routing and scheduling problems
3. Scheduling of vehicles from a central depot to a number of delivery points
4. A sequential route-building algorithm employing a generalised savings criterion
5. On the effectiveness of set covering formulations for the vehicle routing problem with time windows
6. A parallel route building algorithm for the VRPTW
7. Algorithms for the vehicle routing and scheduling problems with time window constraints
8. A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
9. A greedy lookahead heuristic for the vehicle routing problem with time windows
10. An assignment routing problem
11. Assignment algorithms for the multi-depot vehicle routing problem
12. Vehicle routing techniques applied to a milk collection problem