A novel two-phase heuristic method for vehicle routing problem with backhauls
From MaRDI portal
(Redirected from Publication:971756)
Recommendations
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- The vehicle routing problem with backhauls
- Heuristic approaches to vehicle routing with backhauls and time windows
- Metaheuristic for the vehicle routing problem with backhauls and time windows
Cites work
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A memetic algorithm for a vehicle routing problem with backhauls
- A reactive tabu search for the vehicle routing problem
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Arc routing problems with time-dependent service costs
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds
- Self-organizing feature maps for the vehicle routing problem with backhauls
- The Reactive Tabu Search
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- VRP
- Vehicle dispatching with time-dependent travel times
Cited in
(4)- Vehicle routing with backhauls: review and research perspectives
- The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- A distance function for computing on finite subsets of Euclidean spaces
This page was built for publication: A novel two-phase heuristic method for vehicle routing problem with backhauls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971756)