Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic
From MaRDI portal
Publication:2673293
DOI10.1007/S10100-021-00759-0OpenAlexW3175977420MaRDI QIDQ2673293FDOQ2673293
Authors: Jan Pelikán, Petr Štourač, Ondřej Sokol 
Publication date: 9 June 2022
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-021-00759-0
Recommendations
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Iterated local search for the vehicle routing problem with a private fleet and a common carrier
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- The vehicle routing-allocation problem: A unifying framework
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- The consistent vehicle routing problem with heterogeneous fleet
- A general heuristic for vehicle routing problems
- A unified exact method for solving different classes of vehicle routing problems
- A practical heuristic for a large scale vehicle routing problem
Cites Work
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- A heuristic algorithm for the truckload and less-than-truckload problem
- A heuristic for the routing and carrier selection problem
- Lower and upper bounds for the mixed capacitated arc routing problem
- A new heuristic and an exact approach for a production planning problem
- Heuristic approaches for solid transportation-\(p\)-facility location problem
Cited In (1)
This page was built for publication: Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673293)
