Milica Šelmić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Milica Šelmić has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Miloš Nikolić
University of Belgrade, Faculty of Transport and Traffic Engineering, Belgrade, Serbia
2 shared publications Aleksandra Ivanović
1 shared publication- Dragana Macura
University of Belgrade
1 shared publication - Dragana Šarac
Univerzitet u Novom Sadu – Fakultet tehničkih nauka
1 shared publication - Dušan Ramljak
School of Professional Graduate Studies at Great Valley, The Pennsylvania State University, Malvern, PA 19355, USA
1 shared publication - Dušan Teodorović
Faculty of Transport and Traffic Engineering, University of Belgrade, Belgrade, Serbia
1 shared publication
Latest Publications
- Open Access
- 1 January 2025
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Vojnotehnicki glasnik
- Vol. 73 (2) , 496-518
Planning vehicle routes to optimize fuel consumption
Introduction/purpose: Models developed for routing transport vehicles with an environmental focus are predominantly dedicated to reverse logistics or transporting environmentally hazardous cargo. Few models in the relevant literature consider the ecological factors for routing vehicles involved in the distribution of consumer goods. Methods: This paper presents a model for planning vehicle routes to optimize fuel consumption, considering the time windows required for service and payload capacity of vehicles. A heuristic algorithm was developed to minimize fuel consumption. A Simulated Annealing metaheuristic was applied to enhance the solutions obtained by the proposed heuristic. Results: The results from the heuristic algorithm for fuel consumption minimization and the improved results using the Simulated Annealing metaheuristic are presented. All tests were conducted on Solomons instances. Conclusion: The developed approach to vehicle routing ensures a compromise between transport companies and ecology. The results show that applying this approach can simultaneously minimize the costs of the transport company and CO2 emissions.
- 1 January 2025
- Published by Centre for Evaluation in Education and Science (CEON/CEES) in Vojnotehnicki glasnik
- Vol. 73 (2) , 496-518
Open AccessPlanning vehicle routes to optimize fuel consumption
Introduction/purpose: Models developed for routing transport vehicles with an environmental focus are predominantly dedicated to reverse logistics or transporting environmentally hazardous cargo. Few models in the relevant literature consider the ecological factors for routing vehicles involved in the distribution of consumer goods. Methods: This paper presents a model for planning vehicle routes to optimize fuel consumption, considering the time windows required for service and payload capacity of vehicles. A heuristic algorithm was developed to minimize fuel consumption. A Simulated Annealing metaheuristic was applied to enhance the solutions obtained by the proposed heuristic. Results: The results from the heuristic algorithm for fuel consumption minimization and the improved results using the Simulated Annealing metaheuristic are presented. All tests were conducted on Solomons instances. Conclusion: The developed approach to vehicle routing ensures a compromise between transport companies and ecology. The results show that applying this approach can simultaneously minimize the costs of the transport company and CO2 emissions.
- 1 August 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (10) , 4090-4095
Determining the number of postal units in the network – Fuzzy approach, Serbia case study
- 1 August 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (10) , 4090-4095
Determining the number of postal units in the network – Fuzzy approach, Serbia case study
- 29 January 2013
- Published by Taylor & Francis in Optimization
- Vol. 62 (8) , 1113-1142
Parallelization strategies for bee colony optimization based on message passing communication protocol
The Bee Colony Optimization (BCO) algorithm is a meta-heuristic that belongs to the class of biologically inspired stochastic swarm optimization methods, based on the foraging habits of bees in nature. BCO operates on a population of solutions, and therefore, it represents a good basis for parallelization. The main contribution of this work is the development of new and efficient parallelization strategies for BCO. We propose two synchronous and two asynchronous parallelization strategies for a distributed memory multiprocessor architecture under the Message Passing Interface (MPI) communication protocol. The first synchronous strategy involves independent execution of several BCO algorithms, while the second one implements cooperation between these algorithms. The asynchronous strategies are implemented in two ways: with centralized and non-centralized communication controls. The presented experimental results, addressing the problem of static scheduling independent tasks on identical machines, show that our parallel BCO algorithms provide excellent performance. As for the case of independent execution, a significant speedup is obtained while preserving the solution quality. Compared to the sequential execution, cooperative strategy leads to better quality solutions within the same amount of wall-clock time, as long as it is applied to a modest number of processors engaged in parallel BCO execution. As this number increases, asynchronous strategies outperform the other ones with respect to both solution quality and running time.
- 29 January 2013
- Published by Taylor & Francis in Optimization
- Vol. 62 (8) , 1113-1142
Parallelization strategies for bee colony optimization based on message passing communication protocol
The Bee Colony Optimization (BCO) algorithm is a meta-heuristic that belongs to the class of biologically inspired stochastic swarm optimization methods, based on the foraging habits of bees in nature. BCO operates on a population of solutions, and therefore, it represents a good basis for parallelization. The main contribution of this work is the development of new and efficient parallelization strategies for BCO. We propose two synchronous and two asynchronous parallelization strategies for a distributed memory multiprocessor architecture under the Message Passing Interface (MPI) communication protocol. The first synchronous strategy involves independent execution of several BCO algorithms, while the second one implements cooperation between these algorithms. The asynchronous strategies are implemented in two ways: with centralized and non-centralized communication controls. The presented experimental results, addressing the problem of static scheduling independent tasks on identical machines, show that our parallel BCO algorithms provide excellent performance. As for the case of independent execution, a significant speedup is obtained while preserving the solution quality. Compared to the sequential execution, cooperative strategy leads to better quality solutions within the same amount of wall-clock time, as long as it is applied to a modest number of processors engaged in parallel BCO execution. As this number increases, asynchronous strategies outperform the other ones with respect to both solution quality and running time.