A new heuristic for the fleet size and mix vehicle routing problem

DOI10.1016/0305-0548(91)90028-PzbMath0723.90018OpenAlexW2023610130MaRDI QIDQ2276859

Yanyan Li

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90028-p

zbMATH Keywords

compositionheuristicroutingweighted matchingcentral depotfleet of vehiclesfleet size and mix vehicle routing problemsuccessive route fusion

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (27)

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ Incorporating vehicle into the vehicle routing fleet composition problem ⋮ A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem ⋮ Thirty years of heterogeneous vehicle routing ⋮ Routing problems: A bibliography ⋮ A column generation approach to the heterogeneous fleet vehicle routing problem ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic ⋮ Integrated fleet mix and routing decision for hazmat transportation: a developing country perspective ⋮ A stochastic optimization approach for staff scheduling decisions at inpatient units ⋮ Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles ⋮ Resource planning and a depot location model for electric power restoration. ⋮ 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 ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ 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 variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ A multi-level composite heuristic for the multi-depot vehicle fleet mix problem ⋮ Unnamed Item ⋮ Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil ⋮ Aircrew schedule generation using repeated matching ⋮ A sweep-based algorithm for the fleet size and mix vehicle routing problem ⋮ A parametric analysis of heuristics for the vehicle routing problem with side-constraints ⋮ A repeated matching heuristic for the single-source capacitated facility location problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of techniques for solving the fleet size and mix vehicle routing problem
• The fleet size and mix vehicle routing problem
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
• A new heuristic for the fleet size and mix vehicle routing problem
• The Truck Dispatching Problem
• Nonoptimal Edges for the Symmetric Traveling Salesman Problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

This page was built for publication: A new heuristic for the fleet size and mix vehicle routing problem