A continuous approximation model for the fleet composition problem on the rectangular grid

DOI10.1007/s00291-016-0457-8zbMath1371.90026OpenAlexW2511288762MaRDI QIDQ2362170

Matthew J. Roorda, Mehdi Nourinejad

Publication date: 6 July 2017

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-016-0457-8

zbMATH Keywords

vehicle routing problemcontinuous approximationfleet compositionfleet size

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

A concise guide to existing and emerging vehicle routing problem variants

Cites Work

• Industrial aspects and literature survey: fleet composition and routing
• The fleet size and mix vehicle routing problem
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• Incorporating vehicle into the vehicle routing fleet composition problem
• Dividing a Territory Among Several Vehicles
• A heuristic column generation method for the heterogeneous fleet VRP
• Tabu search variants for the mix fleet vehicle routing problem
• Confidence intervals for the correlation from a bivariate normal
• A heuristic for vehicle fleet mix problem using tabu search and set partitioning
• A Robust Branch-Cut-and-Price Algorithm for the Heterogeneous Fleet Vehicle Routing Problem

This page was built for publication: A continuous approximation model for the fleet composition problem on the rectangular grid