Sciact
  • EN
  • RU

Solving Maximin Location Problems on Networks with Different Metrics and Restrictions Full article

Conference 22nd International conference "Mathematical Optimization Theory and Operations Research"
02-08 Jul 2023 , Екатеринбург
Source Mathematical Optimization Theory and Operations Research: Recent Trends
Compilation, Springer. 2023. 406 c.
Journal Communications in Computer and Information Science
ISSN: 1865-0929
Output data Year: 2023, Volume: 1881, Pages: 188-200 Pages count : 13 DOI: 10.1007/978-3-031-43257-6_15
Tags Euclidean metric, Maxmin criterion, Obnoxious facility, Shortest paths, Voronoi diagram.
Authors Zabudsky Gennady G. 1
Affiliations
1 Sobolev Institute of Mathematics SB RAS

Funding (1)

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

Abstract: Several optimal location problems of an obnoxious facility on a network of roads connecting settlements are considered. It is necessary to find such location of the facility so that a minimum distance to a nearest settlement is as large as possible taking into account the resident population. Such facility can be, for example, a nuclear power plant, a waste recycling plant. An overview of various formulations, the properties of the problems and algorithms for solving are given. The main focus is on the problem taking into account a restriction on transportation costs for servicing the settlements by the facility. The cost of servicing the settlements by the facility is determined using the shortest paths in the network. The objective function uses Euclidean metric. Exact algorithm for solving of this problem is proposed.
Cite: Zabudsky G.G.
Solving Maximin Location Problems on Networks with Different Metrics and Restrictions
In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2023. – Т.1881. – C.188-200. DOI: 10.1007/978-3-031-43257-6_15 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85174614385
OpenAlex: W4386891702
Citing:
DB Citing
Scopus 2
Altmetrics: