Sciact
  • EN
  • RU

Maximin and maxisum network location problems with various metrics and minimum distance constraints Full article

Conference XXIII International Conference Mathematical Optimization Theory and Operations Research
30 Jun - 6 Jul 2024 , Омск
Source Mathematical Optimization Theory and Operations Research: Recent Trends
Compilation, Springer. 2024. 388 c. ISBN 978-3-031-73364-2.
Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2024, Volume: 2239, Pages: 126–139 Pages count : 14 DOI: 10.1007/978-3-031-73365-9_9
Tags Euclidean metric, Maximin criterion, Maxisum criterion, Obnoxious facility, Shortest paths
Authors Zabudsky G. 1
Affiliations
1 Sobolev Institute of Mathematics SB RAS

Funding (1)

1 Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН». FWNF-2022-0020

Abstract: The paper considers the problems of locating a facility on a road network connecting several settlements. The facility services the settlements, but has adverse effects on the population. The effects decrease as the distance from the facility to the settlements decreases. The study is conducted on the problems with criteria for maximizing the minimum distance from the facility to the nearest settlement (maximin) and maximizing the sum of distances from the facility to the settlements (maxisum). Constraints are imposed on the minimum feasible distances from the settlements to the facility and a budget for transportation costs for servicing the settlements by the facility. Euclidean metric is applied in objective functions and in constraints on minimum feasible distances. The shortest path metric is used to calculate transportation costs. Polynomial algorithms for searching all local optima of the problems are proposed.
Cite: Zabudsky G.
Maximin and maxisum network location problems with various metrics and minimum distance constraints
In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2024. – Т.2239. – C.126–139. – ISBN 978-3-031-73364-2. DOI: 10.1007/978-3-031-73365-9_9 Scopus OpenAlex
Dates:
Published print: Dec 20, 2024
Published online: Dec 20, 2024
Identifiers:
Scopus: 2-s2.0-85214276495
OpenAlex: W4405597592
Citing: Пока нет цитирований
Altmetrics: