Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
DOI10.1002/net.22076zbMath1528.90018OpenAlexW3189111817MaRDI QIDQ6065889
Unnamed Author, Unnamed Author, Unnamed Author, John E. Mitchell
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22076
facility locationdecomposition algorithmgreedy heuristiclast-mile logisticsbilevel mixed integer programurban consolidation
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Spatial interaction models. Facility location using game theory
- Location-routing: issues, models and methods
- The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
- Resolution method for mixed integer bi-level linear problems based on decomposition technique
- Network hub location problems: The state of the art
- Constraint Qualifications and KKT Conditions for Bilevel Programming Problems
This page was built for publication: Location of urban micro‐consolidation centers to reduce the social cost of last‐mile deliveries of cargo: A heuristic approach
