A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
From MaRDI portal
Publication:2029063
DOI10.1016/J.EJOR.2020.07.034zbMath1487.90151OpenAlexW3044549082MaRDI QIDQ2029063
Pirmin Fontaine, Ferdinand Mühlbauer
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.07.034
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions ⋮ A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services ⋮ Drone location and vehicle fleet planning with trucks and aerial drones ⋮ The multi-vehicle truck-and-robot routing problem for last-mile delivery ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ Two-echelon vehicle routing problems: a literature review ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows ⋮ The vehicle routing problem with load-dependent travel times for cargo bicycles
Cites Work
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A survey on two-echelon routing problems
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A large neighbourhood based heuristic for two-echelon routing problems
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A comparative study of heuristics for a two-level routing-location problem
- The electric two-echelon vehicle routing problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Flexible two-echelon location routing problem
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A matheuristic for the truck and trailer routing problem
- Synchronizing vans and cargo bikes in a city distribution network
- A survey of variants and extensions of the location-routing problem
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
This page was built for publication: A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
