A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
DOI10.1155/2012/954249zbMath1264.90102OpenAlexW2134618090WikidataQ57782170 ScholiaQ57782170MaRDI QIDQ1955409
Enrique Cabrera, L. Jose Miguel Rubio, Broderick Crawford, Fernando Paredes, Ricardo L. Soto, Guillermo G. Cabrera
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/954249
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Observations on some heuristic methods for the capacitated facility location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- On solving large instances of the capacitated facility location problem
- A tabu search approach to the uncapacitated facility location problem
- Upper and lower bounds for the single source capacitated location problem.
- Near-optimal solutions to large-scale facility location problems
- Lagrangean heuristics for location problems
- Bees algorithm for generalized assignment problem
- A comparative study of artificial bee colony algorithm
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Hybrid Metaheuristics
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
- Matheuristics
- Application of facilities location to an insurance company’s office reconfiguration
This page was built for publication: A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem