A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem

DOI10.1007/978-3-642-29124-1_2zbMath1292.90064OpenAlexW1921374842MaRDI QIDQ3164899

Günther R. Raidl, Martin Schwengerer, Sandro Pirkwieser

Publication date: 18 October 2012

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29124-1_2

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (14)

A survey of recent research on location-routing problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ Scheduled penalty variable neighborhood search ⋮ A survey on two-echelon routing problems ⋮ A progressive filtering heuristic for the location-routing problem and variants ⋮ A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution ⋮ Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery ⋮ The two-echelon stochastic multi-period capacitated location-routing problem ⋮ A two-echelon location routing problem with mobile satellites for last-mile delivery: mathematical formulation and clustering-based heuristic method ⋮ The open location-routing problem for multi-objective optimization of sustainable supply chain considering social concerns ⋮ A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey ⋮ Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic

This page was built for publication: A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem