Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
From MaRDI portal
Publication:6087621
DOI10.1111/itor.12399MaRDI QIDQ6087621
Xu Wang, Fuli Zhou, Yun Lin, Unnamed Author
Publication date: 15 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
simulated annealinggenetic algorithmlast mile deliverybilevel location-routing problemmultisized terminal
Related Items (5)
Evolutionary dynamics of the last mile travel choice ⋮ The location routing problem with facility sizing decisions ⋮ A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information ⋮ Location‐routing problem: a classification of recent research ⋮ A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems
Cites Work
- Unnamed Item
- Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers
- A survey of recent research on location-routing problems
- A math-heuristic for the warehouse location-routing problem in disaster relief
- A simulated annealing heuristic for the open location-routing problem
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Lower and upper bounds for the two-echelon capacitated location-routing problem
- Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
- Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking
- Location-routing: issues, models and methods
- Hybrid metaheuristics. 5th international workshop, HM 2008, Málaga, Spain, October 8--9, 2008. Proceedings
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A comparative study of heuristics for a two-level routing-location problem
- A genetic algorithm for flowshop sequencing
- Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
- E-fulfillment and multi-channel distribution - A review
- Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Exact Method for the Capacitated Location-Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
- A Genetic Algorithm for the Multiple-Choice Integer Program
- The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
- An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This page was built for publication: Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
