Population-based algorithm for discrete facility location with ranking of candidate locations
From MaRDI portal
Publication:6653555
DOI10.1016/J.CAM.2024.116304MaRDI QIDQ6653555
Algirdas Lančinskas, P. Fernández, Julius Žilinskas, B. Pelegrin
Publication date: 16 December 2024
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Mathematical programming (90Cxx) Artificial intelligence (68Txx) Operations research and management science (90Bxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improving solution of discrete competitive facility location problems
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- Heuristics for the dynamic facility location problem with modular capacities
- Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- How to Count
- Integer Programming: Methods, Uses, Computations
- Central Places: The Theories of von Thünen, Christaller, and Lösch
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- On the use of genetic algorithms to solve location problems
- A discrete competitive facility location model with proportional and binary rules sequentially applied
- Competitive location models: a review
This page was built for publication: Population-based algorithm for discrete facility location with ranking of candidate locations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653555)