Predrag Stanojević

Predrag Stanojević

Auto-generated profile, based on publicly available information

Predrag Stanojević

University of Belgrade

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 September 2012 in Soft Computing
Verified
Journal Article
Closed access
PDF file
MMMiroslav Marić
Miroslav Marić
ZSZorica Stanimirović
Zorica Stanimirović
PSPredrag Stanojević
Predrag Stanojević

24 April 2012 in Information Technology And Control
Verified
Journal Article
Closed access
PDF file
ZSZorica Stanimirovic
Zorica Stanimirovic
MMMiroslav Maric
Miroslav Maric
SBSrdjan Bozovic
Srdjan Bozovic
PSPredrag Stanojevic
Predrag Stanojevic
This paper deals with a variant of a discrete location problem of establishing long-term care facilities in a given network.The objective is to determine optimal locations for these facilities in order to minimize the maximum number of assigned patients to a single facility. We propose an efficient evolutionary approach (EA) for solving this problem, based on binary encoding, appropriate objective function and standard genetic operators. Unfeasible individuals in the population are corrected to be feasible, while applied EA strategies keep the feasibility of individuals and preserve the diversity of genetic material. The algorithm is benchmarked on a real-life test instance with 33 nodes and the obtained results are compared with the existing ones from the literature. The EA is additionally tested on new problem instances derived from the standard ORLIB AP hub data set with up to 400 potential locations. For the first time in the literature we report verified optimal solutions for most of the tested problem instances with up to 80 nodes obtained by the standard optimization tool CPLEX. Exhaustive computational experiments show that the EA approach quickly returns all optimal solutions for smaller problem instances, while large-scale instances are solved in a relatively short CPU time. The results obtained on the test problems of practical sizes clearly indicate the potential of the proposed evolutionary-based method for solving this problem and similar discrete location problems.DOI: http://dx.doi.org/10.5755/j01.itc.41.1.1115

18 June 2016 in IMA Journal of Management Mathematics
Verified
Journal Article
Closed access
PDF file
ADAleksandar Djenić
Aleksandar Djenić
MMMiroslav Marić
Miroslav Marić
ZSZorica Stanimirović
Zorica Stanimirović
PSPredrag Stanojević
Predrag Stanojević
This article deals with a problem of determining locations for installing long-term care facilities in the given network, in order to minimize the maximum number of patients that are assigned to a single installed facility. The problem is known as the Long-Term Care Facility Location Problem (LTCFLP). We propose an improved mathematical formulation for the LTCFLP and evaluate its efficiency through a set of computational experiments on test instances with up to 80 potential facility locations. To solve instances of larger problem dimensions, we develop a metaheuristic method based on a Variable Neighbourhood Search (VNS). A reduced VNS algorithm is employed to provide a good-quality initial solution, which is then used as a starting point of the basic VNS method. A local search procedure with efficient fast interchange method is implemented in the proposed VNS-based approach. The algorithm is benchmarked on a large-scale dataset involving up to 400 potential facility locations. Presented computational results show that the proposed VNS quickly reaches all optimal solutions from the literature, and in most cases outperforms existing heuristic methods for solving the LTCFLP.