A new heuristic for determining fleet size and composition
From MaRDI portal
Publication:3712124
DOI10.1007/BFb0121103zbMath0585.90064MaRDI QIDQ3712124
Bruce L. Golden, Arjang A. Assad, Filip Gheysens
Publication date: 1986
Published in: Mathematical Programming Studies (Search for Journal in Brave)
heuristic; logistics; Computational results; lower bound procedure; optimal vehicle mix; fleet size and composition vehicle routing; heterogeneous fleet of vehicles
65K05: Numerical mathematical programming methods
90B05: Inventory, storage, reservoirs
90C09: Boolean programming
Related Items
A column generation approach to the heterogeneous fleet vehicle routing problem, Scatter search for the fleet size and mix vehicle routing problem with time windows, A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows, Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil, Effective algorithm and heuristic for the generalized assignment problem., A sweep-based algorithm for the fleet size and mix vehicle routing problem, Routing problems: A bibliography, Incorporating vehicle into the vehicle routing fleet composition problem, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, Formulations and valid inequalities for the heterogeneous vehicle routing problem
