Lower and upper bounds for the two-echelon capacitated location-routing problem
From MaRDI portal
(Redirected from Publication:339668)
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
Cites work
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A general heuristic for vehicle routing problems
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact method for the capacitated location-routing problem
- New families of valid inequalities for the two-echelon vehicle routing problem
- Record breaking optimization results using the ruin and recreate principle
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
Cited in
(42)- A progressive filtering heuristic for the location-routing problem and variants
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- Two-stage heuristic algorithm for the large-scale capacitated location routing problem
- An adaptive large neighborhood search for an E-grocery delivery routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- 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
- Optimizing combined tours: the truck-and-cargo-bike case
- A multi-commodity two-echelon capacitated vehicle routing problem with time windows: model formulations and solution approach
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
- 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
- A location-or-routing problem with partial and decaying coverage
- The two-echelon stochastic multi-period capacitated location-routing problem
- Two-echelon vehicle routing problems: a literature review
- Designing a two-echelon distribution network under demand uncertainty
- Solving a bi-objective transportation location routing problem by metaheuristic algorithms
- A taxonomical analysis, current methods and objectives on location-routing problems
- Two echelon location routing problem with simultaneous pickup and delivery: mixed integer programming formulations and comparative analysis
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Modeling and algorithm for multi-echelon location-routing problem
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- An exact algorithm for the two-echelon capacitated vehicle routing problem
- Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- A survey of adaptive large neighborhood search algorithms and applications
- The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Flexible two-echelon location routing problem
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations
- A memetic algorithm for the capacitated location-routing problem with mixed backhauls
- Battery swap station location-routing problem with capacitated electric vehicles
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- A variable neighborhood search approach for the two-echelon location-routing problem
- Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm
- A large neighbourhood based heuristic for two-echelon routing problems
- A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network
- A survey of variants and extensions of the location-routing problem
- Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
- scientific article; zbMATH DE number 1189254 (Why is no real title available?)
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)
