A comparison of techniques for solving the fleet size and mix vehicle routing problem
From MaRDI portal
Publication:800225
DOI10.1007/BF01720070zbMath0549.90068OpenAlexW2076134858MaRDI QIDQ800225
Arjang A. Assad, Bruce L. Golden, Filip Gheysens
Publication date: 1984
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720070
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers, Simple heuristics for the multi-period fleet size and mix vehicle routing problem, Incorporating vehicle into the vehicle routing fleet composition problem, Thirty years of heterogeneous vehicle routing, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Routing problems: A bibliography, A column generation approach to the heterogeneous fleet vehicle routing problem, A Survey of the Generalized Assignment Problem and Its Applications, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, The sales force sizing problem with multi-period workload assignments, and service time windows, Scatter search for the fleet size and mix vehicle routing problem with time windows, Routing a Heterogeneous Fleet of Vehicles, A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, A new heuristic for the fleet size and mix vehicle routing problem, Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs, Industrial aspects and literature survey: fleet composition and routing, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil, A sweep-based algorithm for the fleet size and mix vehicle routing problem, A comparison of techniques for solving the fleet size and mix vehicle routing problem
Cites Work
- A Lagrangean relaxation heuristic for vehicle routing
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- The fleet size and mix vehicle routing problem
- Approximate Traveling Salesman Algorithms
- A branch and bound algorithm for the generalized assignment problem
- Implementing vehicle routing algorithms
