The location routing problem with facility sizing decisions
From MaRDI portal
Publication:6056170
DOI10.1111/itor.13125OpenAlexW4210891425MaRDI QIDQ6056170
Carlos L. Quintero-Araujo, Unnamed Author, Jairo R. Montoya-Torres, Javier Panadero, Angel A. Juan
Publication date: 29 September 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13125
Cites Work
- Unnamed Item
- A survey of recent research on location-routing problems
- Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
- A new approach to tactical and strategic planning in production-distribution networks
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- A new model for the hazardous waste location-routing problem
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- Models and exact solutions for a class of stochastic location-routing problems
- A comparative study of heuristics for a two-level routing-location problem
- The hub location and routing problem
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- A survey of the standard location-routing problem
- Multi-period capacitated facility location under delayed demand satisfaction
- A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation
- A multi-objective mathematical model for the industrial hazardous waste location-routing problem
- Capacitated facility location problem with general setup cost
- 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
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
- Multi-Start Methods
- A biased‐randomized metaheuristic for the capacitated location routing problem
- Model and algorithm for bilevel multisized terminal location‐routing problem for the last mile delivery
This page was built for publication: The location routing problem with facility sizing decisions