Lower and upper bounds for the two-echelon capacitated location-routing problem
From MaRDI portal
Publication:339668
DOI10.1016/J.COR.2012.04.003zbMATH Open1349.90080OpenAlexW2165941447WikidataQ41763970 ScholiaQ41763970MaRDI QIDQ339668FDOQ339668
Authors: Claudio Contardo, V. C. Hemmelmayr, Teodor Gabriel Crainic 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.04.003
Recommendations
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- An exact algorithm for the two-echelon capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- An exact method for the capacitated location-routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A general heuristic for vehicle routing problems
- Record breaking optimization results using the ruin and recreate principle
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- New families of valid inequalities for the two-echelon vehicle routing problem
Cited In (38)
- A taxonomical analysis, current methods and objectives on location-routing problems
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
- Combining facility location and routing decisions in sustainable urban freight distribution under horizontal collaboration: how can shippers be benefited?
- A survey of recent research on location-routing problems
- Flexible two-echelon location routing problem
- Optimizing combined tours: the truck-and-cargo-bike case
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
- A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
- Two-echelon vehicle routing problem with satellite bi-synchronization
- Two-echelon vehicle routing problems: a literature review
- The two-echelon stochastic multi-period capacitated location-routing problem
- Designing a two-echelon distribution network under demand uncertainty
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- Battery swap station location-routing problem with capacitated electric vehicles
- A large neighbourhood based heuristic for two-echelon routing problems
- A survey of adaptive large neighborhood search algorithms and applications
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
- A progressive filtering heuristic for the location-routing problem and variants
- A variable neighborhood search approach for the two-echelon location-routing problem
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
- A location-or-routing problem with partial and decaying coverage
- Title not available (Why is that?)
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- An exact algorithm for the two-echelon capacitated vehicle routing problem
- A survey of variants and extensions of the location-routing problem
This page was built for publication: Lower and upper bounds for the two-echelon capacitated location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339668)
