A heuristic for vehicle fleet mix problem using tabu search and set partitioning
From MaRDI portal
Publication:5387422
DOI10.1057/palgrave.jors.2602421zbMath1153.90359OpenAlexW1999274012WikidataQ126254675 ScholiaQ126254675MaRDI QIDQ5387422
No author found.
Publication date: 9 May 2008
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602421
Related Items (12)
A continuous approximation model for the fleet composition problem on the rectangular grid ⋮ Thirty years of heterogeneous vehicle routing ⋮ The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation ⋮ A hybrid algorithm for the heterogeneous fleet vehicle routing problem ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations ⋮ A skewed general variable neighborhood search algorithm with fixed threshold for the heterogeneous fleet vehicle routing problem ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM
This page was built for publication: A heuristic for vehicle fleet mix problem using tabu search and set partitioning
