A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles

Cites Work

Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows
The vehicle routing problem
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
A tabu search method for the truck and trailer routing problem
Variable neighborhood search
A survey on two-echelon routing problems
Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
Synchronizing vans and cargo bikes in a city distribution network
A general variable neighborhood search for the swap-body vehicle routing problem
Stochastic local search with learning automaton for the swap-body vehicle routing problem
A cluster-first route-second approach for the swap body vehicle routing problem
Variable neighborhood search: basics and variants
A relax-and-repair heuristic for the swap-body vehicle routing problem
A lower bound for the adaptive two-echelon capacitated vehicle routing problem
Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem
Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and `grey zone' customers arising in urban logistics
Crowd-shipping with time windows and transshipment nodes
Skewed general variable neighborhood search for the cumulative capacitated vehicle routing problem
Variable neighborhood search: the power of change and simplicity
A note on the hierarchical multi-switch multi-echelon vehicle routing problem

This page was built for publication: A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561246)