A sweep-based algorithm for the fleet size and mix vehicle routing problem
From MaRDI portal
Publication:1848592
DOI10.1016/S0377-2217(01)00237-5zbMath0998.90016MaRDI QIDQ1848592
Fayez F. Boctor, Jacques Renaud
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
90C59: Approximation methods and heuristics in mathematical programming
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90B20: Traffic problems in operations research
Related Items
A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, A column generation approach to the heterogeneous fleet vehicle routing problem, Synchronized routing of seasonal products through a production/distribution network, A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Formulations and valid inequalities for the heterogeneous vehicle routing problem
Uses Software
Cites Work
- Polyhedral study of the capacitated vehicle routing problem
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- The fleet size and mix vehicle routing problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- The vehicle routing problem: An overview of exact and approximate algorithms
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Routing problems: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- The column-circular, subsets-selection problem: Complexity and solutions
- A new heuristic for the fleet size and mix vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- A new heuristic for determining fleet size and composition
- Vehicle Fleet Composition
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Parallel iterative search methods for vehicle routing problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Extensions of the Petal Method for Vehicle Routeing
- Computer Solutions of the Traveling Salesman Problem
