The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
DOI10.1016/j.ejor.2018.03.014zbMath1403.90087OpenAlexW2793990791WikidataQ130119018 ScholiaQ130119018MaRDI QIDQ1754738
Christian Brandstätter, Marc Reimann
Publication date: 31 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://nrl.northumbria.ac.uk/id/eprint/34036/1/paper_1_main_R2.pdf
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Uses Software
Cites Work
- The linehaul-feeder vehicle routing problem with virtual depots and time windows
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW
- A general heuristic for vehicle routing problems
- The fleet size and mix vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- The Truck Dispatching Problem
- Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The fleet size and mix vehicle routing problem with time windows
- A guide to vehicle routing heuristics
- A Computational Study Of A New Heuristic For The Site-Dependent Vehicle Routing Problem
- A Tabu Search Algorithm For The Site Dependent Vehicle Routing Problem With Time Windows
This page was built for publication: The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches
