Population-based algorithm for discrete facility location with ranking of candidate locations

DOI10.1016/J.CAM.2024.116304MaRDI QIDQ6653555zbMATH OpenFDO

Authors Algirdas Lančinskas, Julius Žilinskas, P. Fernández, B. Pelegrin

Publication date 16 December 2024

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

competitive facility locationdiscrete optimizationrandom search algorithms

Mathematics Subject Classification ID

Operations research and management science (90Bxx) Artificial intelligence (68Txx) Mathematical programming (90Cxx)

Recommendations

• A GIS-based optimization framework for competitive multi-facility location-routing problem
• A discrete competitive facility location model with proportional and binary rules sequentially applied
• Optimization of competitive facility location for chain stores
• Competitive facility placement for supply chain optimization
• Improving solution of discrete competitive facility location problems

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A discrete competitive facility location model with proportional and binary rules sequentially applied
• Central places: the theories of von Thünen, Christaller, and Lösch
• Competitive location models: a review
• 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
• Heuristics for the dynamic facility location problem with modular capacities
• How to count. An introduction to combinatorics and its applications
• Improving solution of discrete competitive facility location problems
• Integer Programming: Methods, Uses, Computations
• Multi-objective single agent stochastic search in non-dominated sorting genetic algorithm
• New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
• On the use of genetic algorithms to solve location problems
• 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

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)