Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic
From MaRDI portal
Publication:2673293
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 heuristic algorithm for the truckload and less-than-truckload problem
- A heuristic for the routing and carrier selection problem
- A new heuristic and an exact approach for a production planning problem
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Heuristic approaches for solid transportation-\(p\)-facility location problem
- Lower and upper bounds for the mixed capacitated arc routing 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)