A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems

DOI10.1057/JORS.2008.77MaRDI QIDQ3161792zbMATH OpenOpenAlexFDO

Authors

Publication date 18 October 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2008.77

zbMATH Keywords

cross entropyheuristicsinteger programminglocal searchlocation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximate solutions to large scale capacitated facility location problems
• An effective heuristic for large-scale capacitated facility location problems
• Near-optimal solutions to large-scale facility location problems
• A model and solutions based on the greedy ant colony algorithm for the capacitated facility location problem
• An efficient heuristic algorithm for the capacitated \(p\)-median problem

Cited in

(5)

• A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem
• A model and solutions based on the greedy ant colony algorithm for the capacitated facility location problem
• The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
• Multiobjective facility location model for optimizing Arctic oil spill response

This page was built for publication: A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161792)