The linehaul-feeder vehicle routing problem with virtual depots and time windows
From MaRDI portal
Publication:410539
Recommendations
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Tabu search heuristics for the vehicle routing problem with time windows.
- The Vehicle Routing Problem with Time Windows Part I: Tabu Search
- A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows
Cites work
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A tabu search heuristic for the truck and trailer routing problem
- A tabu search method for the truck and trailer routing problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows
- Scheduling of inbound and outbound trucks in cross docking systems with temporary storage
- Tabu Search—Part I
- Tabu Search—Part II
- Waste collection vehicle routing problem with time windows
Cited in
(4)- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows
- Research on coordination and optimization of order allocation and delivery route planning in take-out system
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
This page was built for publication: The linehaul-feeder vehicle routing problem with virtual depots and time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q410539)