A sweep-based algorithm for the fleet size and mix vehicle routing problem

European Journal of Operational Research

Volumn 140, Issue 3, 2002, Pages 618-628

  Renaud, Jacques ^a   Boctor, Fayez F ^a  

^a UNIVERSITÉ LAVAL   (Canada)

Author keywords

Fleet selection; Sweep based heuristic; Vehicle routing problem

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

VEHICLE ROUTING PROBLEMS;

OPERATIONS RESEARCH;

EID: 0036680973     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00237-5     Document Type: Article

References (34)

1. The column-circular sub-sets selection problem: Complexity and solutions
2. Scheduling of vehicles from a central depot to a number of delivery points
3. Polyhedral study of the capacitated vehicle routing problem
4. A new heuristic for the fleet size and mix vehicle routing problem
5. Vehicle fleet composition
6. A generalized assignment heuristic for vehicle routing
7. An integer programming approach to the vehicle scheduling problem
8. New insertion and post optimization procedures for the traveling salesman problem
9. A tabu search heuristic for the vehicle routing problem
10. A tabu search heuristic for the heterogeneous fleet vehicle routing problem
11. A comparison of techniques for solving the fleet size and mix vehicle routing problem
12. A new heuristic for determining fleet size and composition
13. A heuristic for the vehicle dispatching problem
14. The fleet size and mix vehicle routing problem
15. The size and composition of a road transport fleet
16. A new exact algorithm for the vehicle routing problem based on q-path and k-shortest paths relaxations
17. The traveling salesman problem: An overview of exact and approximate algorithms
18. The vehicle routing problem: An overview of exact and approximate algorithms
19. Routing problems: A bibliography
20. Computer solution of the traveling salesman problem
21. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
22. Local search strategies for the vehicle fleet mix problem
23. An improved petal heuristic for the vehicle routing problem
24. A fast composite heuristic for the symmetric traveling salesman problem
25. Probabilistic diversification and intensification in local search for vehicle routing
26. Extension of the petal method for vehicle routing
27. Improvement to vehicle routing heuristics
28. Incorporating vehicle routing into the vehicle fleet composition problem
29. Adaptation of some vehicle fleet mix heuristics
30. Parallel iteration search methods for vehicle routing
31. A heuristic column generation method for the heterogeneous fleet VRP
32. Truck fleet size composition for concrete distribution
33. Computer scheduling of vehicle from one or more depots to a number of delivery points