Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
From MaRDI portal
Publication:2676294
DOI10.1016/j.cor.2022.105897OpenAlexW4293149290WikidataQ114193058 ScholiaQ114193058MaRDI QIDQ2676294
Burcu B. Keskin, Jianing Zhi, Zhifeng Xiao
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.105897
Uses Software
Cites Work
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
- A new heuristic for solving the \(p\)-median problem in the plane
- A hybrid differential evolution approach based on surrogate modelling for scheduling bottleneck stages
- A scatter search-based heuristic to locate capacitated transshipment points
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
- Scatter search for the single source capacitated facility location problem
- A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge
- An effective heuristic for large-scale capacitated facility location problems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Learning a classification of mixed-integer quadratic programming problems
- Modeling and design of global logistics systems: a review of integrated strategic and tactical models and design algorithms
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments
- Learning when to use a decomposition
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- A learning-based algorithm to quickly compute good primal solutions for stochastic integer programs
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A Machine Learning-Based Approximation of Strong Branching
- Random forests
This page was built for publication: Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
