A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
DOI10.1155/2012/954249zbMATH Open1264.90102OpenAlexW2134618090WikidataQ57782170 ScholiaQ57782170MaRDI QIDQ1955409FDOQ1955409
Authors: G. G. Cabrera, Enrique Cabrera, Ricardo L. Soto, L. Jose Miguel Rubio, Broderick Crawford, Fernando Paredes
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
Recommendations
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- An effective hybrid approach to the two-stage capacitated facility location problem
- A hybrid VNS–path relinking for the p-hub median problem
- A hybrid method for the probabilistic maximal covering location-allocation problem
- A simple and effective evolutionary algorithm for the capacitated location-routing problem
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A tabu search approach to the uncapacitated facility location problem
- Lagrangean heuristics for location problems
- Title not available (Why is that?)
- A comparative study of artificial bee colony algorithm
- Matheuristics
- Upper and lower bounds for the single source capacitated location problem.
- Bees algorithm for generalized assignment problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Near-optimal solutions to large-scale facility location problems
- Hybrid metaheuristics
- Primal-dual variable neighborhood search for the simple plant-location problem
- Observations on some heuristic methods for the capacitated facility location problem
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- On solving large instances of the capacitated facility location problem
- A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
- Application of facilities location to an insurance company’s office reconfiguration
Cited In (6)
- RAMP algorithms for the capacitated facility location problem
- Solving a novel inventory location model with stochastic constraints and \((R,s,S)\) inventory control policy
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Metaheuristic algorithm for solving biobjective possibility planning model of location-allocation in disaster relief logistics
- Parameter tuning for local-search-based matheuristic methods
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955409)