Filters
cris logo
-
New search Filters
Select from list
Displayed from Show more
You have reached the maximum number of displayed search results.
All results displayed
No results are available for the search performed
Displayed from
You have reached the maximum number of displayed search results.
All results displayed
Loading results
Obtaining statistical data

Projects / Programmes source: ARIS

Algorithms for locational analysis

Edit
Research activity

Code Science Field Subfield
1.07.00  Natural sciences and mathematics  Computer intensive methods and applications   

Code Science Field
P170  Natural sciences and mathematics  Computer science, numerical analysis, systems, control 
Keywords
facility location, placement, obnoxius facility, hazardous material, undesirable facility, computational geometry, geometric optimization, algorithm, approximation algorithms, randomized algorithms, arrangements, graph algorithms, network design, spanner, optimization, heuristics, GIS, TIN, guard, art gallery problem.
Evaluation (rules)
source: COBISS
Evaluation of bibliographic research performance indicators according to ARIS methodology
Citations Citations for bibliographic records in COBIB.SI that are linked to records in citation databases
source: WoS source: Scopus source: COBISS
Researchers (7)
no. Code Name and surname Research area Role Period No. of publications
1.  04967  PhD Andrej Brodnik  Computer intensive methods and applications  Researcher  2005 - 2008  449 
2.  25993  PhD Sergio Cabello Justo  Mathematics  Head  2005 - 2008  218 
3.  21047  PhD Branko Kaučič  Computer science and informatics  Researcher  2005 - 2008  213 
4.  01931  PhD Bojan Mohar  Mathematics  Researcher  2005 - 2008  1,002 
5.  22649  PhD Janez Povh  Computer intensive methods and applications  Researcher  2005 - 2008  341 
6.  08638  PhD Krista Rizman Žalik  Computer science and informatics  Researcher  2005 - 2008  185 
7.  06671  PhD Borut Žalik  Computer science and informatics  Researcher  2005 - 2008  850 
Organisations (2)
no. Code Research organisation City Registration number No. of publications
1.  0101  Institute of Mathematics, Physics and Mechanics  Ljubljana  5055598000  20,223 
2.  0796  University of Maribor, Faculty of Electrical Engineering and Computer Science  Maribor  5089638003  27,541 
Abstract
Problems concerning the location of facilities have raised much interest within the operations research community given its clear economical, sociological, and demographical impact. Whenever facilities have to be placed or removed, we can search for a model to quantitatively measure the impact of the decision, and the best decision translates into an optimization problem. For example, setting basements for firemen or hospitals so as to minimize the time of action, setting of waste dumps for hazardous material so as to minimize the impact in case of accident, as well as planning the transport of hazardous material through the transport network are problems in the domain of locational analysis that have impact on people's security and safeness. Algorithms that will quickly solve the arising optimization problems are of vital importance. Many parameters such as whether the facilities are attractive or obnoxious, points in the map or more complex structures like roads, the facilities compete or cooperate between them, and others, give rise to different optimization problems. Moreover, depending on the application, we have to model the scenario as a two dimensional geometric domain, a terrain, a weighted graph, or even more complicated metric spaces, given rise to more variants. The functions to optimize may be simple ones, but in most real applications we have to deal with a trade-off between different criteria. When we aim to efficient algorithms for solving these different problems, the algorithms need to tailored to each particular problem, and different problems call for drastically different algorithmical solutions. In this project, we will consider problems arising in locational analysis and we will provide efficient algorithmical solutions to them. The techniques to be used will be mainly drawn from the fields of computational geometry, graph algorithms and data structures. The interaction between these fields and location analysis has proven and keeps being successful, and we expect a better fostering within Slovenia.
Confirmation required
Views history
Favourite