A supervised learning-driven heuristic for solving the facility location and production planning problem
DOI10.1016/J.EJOR.2021.11.020zbMATH Open1506.90144OpenAlexW3212447182MaRDI QIDQ2140228FDOQ2140228
Authors: Tao Wu, Le Huang, Zhe Liang, Xiaoning Zhang, Canrong Zhang 
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.020
Recommendations
- Exact algorithms for integrated facility location and production planning problems
- A hybrid heuristic for the facilities layout problem
- A new heuristic and an exact approach for a production planning problem
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
- AI 2005: Advances in Artificial Intelligence
- A general heuristic for production planning problems
- A heuristic algorithm for a supply chain's production-distribution planning
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A heuristic algorithm for a production planning problem in an assembly system
- Heuristic approach for solving the multi-objective facility layout problem
Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Discrete location and assignment (90B80)
Cites Work
- Selected Topics in Column Generation
- Production Planning by Mixed Integer Programming
- Stabilized column generation
- Local branching
- The feasibility pump
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Integrating facility location and production planning decisions
- Column Generation
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- A new approach to tactical and strategic planning in production-distribution networks
- Integrated strategic and tactical planning in a supply chain network design with a heuristic solution method
- RENS. The optimal rounding
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations
- Title not available (Why is that?)
- Progressive selection method for the coupled lot-sizing and cutting-stock problem
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Exact algorithms for integrated facility location and production planning problems
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Sequential versus integrated optimization: production, location, inventory control, and distribution
- Heuristics for the dynamic facility location problem with modular capacities
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- A unified decomposition matheuristic for assembly, production, and inventory routing
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
Cited In (3)
Uses Software
This page was built for publication: A supervised learning-driven heuristic for solving the facility location and production planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140228)
