Iterated local search for the vehicle routing problem with a private fleet and a common carrier
From MaRDI portal
Publication:5059448
Recommendations
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- 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
- A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
- Solving variants of the vehicle routing problem with a simple parallel iterated tabu search
Cites work
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- A heuristic for the routing and carrier selection problem
- A Modeling Language for Mathematical Programming
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Multi-objective optimization with diversity preserving mixture-based iterated density estimation evolutionary algorithms.
- New benchmark instances for the capacitated vehicle routing problem
- The traveling-salesman problem
- The truck dispatching problem
Cited in
(9)- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Combination of local search and CLP in the vehicle-fleet scheduling problem
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic
- An adaptive iterated local search heuristic for the heterogeneous fleet vehicle routing problem
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- Multi-objective sustainable capacitated location routing problem formulation in sustainable supply-chain management
- An iterated local search algorithm for latency vehicle routing problems with multiple depots
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
This page was built for publication: Iterated local search for the vehicle routing problem with a private fleet and a common carrier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059448)