Comparison of two heuristic algorithms for a location and design problem

DOI10.1007/978-3-319-56829-4_4zbMATH Open1380.90160OpenAlexW2713811278MaRDI QIDQ3133353FDOQ3133353

Authors: Aleksandr Yur'Evich Gnusarev 

Publication date: 14 February 2018

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-56829-4_4

Recommendations

• Variable neighborhood search approach for the location and design problem
• A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
• Solving the multiple competitive facilities location problem
• Competitive facility location and design problem
• Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cited In (2)

• Variable neighborhood search approach for the location and design problem
• Computational Science and Its Applications – ICCSA 2004

This page was built for publication: Comparison of two heuristic algorithms for a location and design problem

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