Tatjana Davidović

Dr. Tatjana Davidović


Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
1 October 2011 in Computers & Operations Research
Verified
Journal Article
Closed access
TDTatjana Davidović
Tatjana Davidović
DRDušan Ramljak
Dušan Ramljak
MŠMilica Šelmić
Milica Šelmić
DTDušan Teodorović
Dušan Teodorović

1 January 2015 in Yugoslav Journal of Operations Research
Verified
Journal Article
Open access
PDF file
TDTatjana Davidović
Tatjana Davidović
DTDusan Teodorovic
Dusan Teodorovic
MSMilica Selmic
Milica Selmic
This paper is an extensive survey of the Bee Colony Optimization (BCO) algorithm, proposed for the first time in 2001. BCO and its numerous variants belong to a class of nature-inspired meta-heuristic methods, based on the foraging habits of honeybees. Our main goal is to promote it among the wide operations research community. BCO is a simple, but efficient meta-heuristic technique that has been successfully applied to many optimization problems, mostly in transport, location and scheduling fields. Firstly, we shall give a brief overview of the other meta-heuristics inspired by bees? foraging principles pointing out the differences between them. Then, we shall provide the detailed description of the BCO algorithm and its modifications, including the strategies for BCO parallelization, and giving the preliminary results regarding its convergence. The application survey is elaborated in Part II of our paper.


25 February 2012 in Journal of Heuristics
Verified
Journal Article
Closed access
PDF file
TDTatjana Davidović
Tatjana Davidović
MŠMilica Šelmić
Milica Šelmić
DTDušan Teodorović
Dušan Teodorović
DRDušan Ramljak
Dušan Ramljak

1 August 2013 in Applied Soft Computing
Verified
Journal Article
Closed access
VMVladislav Maraš
Vladislav Maraš
JLJasmina Lazić
Jasmina Lazić
TDTatjana Davidović
Tatjana Davidović
NMNenad Mladenovic
Nenad Mladenovic

3 September 2022 in Symmetry
Verified
Journal Article
Open access
PDF file
MTMilan Todorovic
Milan Todorovic
LMLuka Matijević
Luka Matijević
DRDušan Ramljak
Dušan Ramljak
TDTatjana Davidović
Tatjana Davidović
DUDragan Urosevic
Dragan Urosevic
ĐJĐorđe Jovanović
Đorđe Jovanović
Blockchains (BCs) are distributed database systems, popular for their innovative, unsupervised maintenance process. They use a so-called consensus protocol to prevent inference by any third party of absolute trust. Security, privacy, consistency, and energy consumption have been identified as the main issues involved in BC maintenance. According to the recent literature, some of these issues can be formulated as combinatorial optimization (CO) problems, and this fact motivated us to consider incorporating CO approaches into a BC. In this paper, we propose the new combinatorial optimization consensus protocol (COCP) based on the proof-of-useful-work (PoUW) concept that assumes solving instances of real-life CO problems. Due to the complexity of the underlying CO problems, we have developed various types of heuristic methods, which are utilized in the COCP. Most of these methods are problem-dependent stochastic heuristic or metaheuristic methods. As is the case with the majority of consensus protocols, PoUW exhibits the property of asymmetry. It is difficult to find a solution for the considered CO problem; however, once a solution is found, its verification is straightforward. We present here a BC framework combining the two above-mentioned fields of research: BC and CO. This framework consists of improvements aiming towards developing the COCP of the PoUW type. The main advantage of this consensus protocol is the efficient utilization of computing resources (by exploring them for finding solutions of real-life CO problem instances), and the provision of a broad range of incentives for the various BC participants. We enumerate the potential benefits of the COCP with respect to its practical impacts and savings in power consumption, describing in detail an illustrative example based on part of the real-life BC network. In addition, we identify several challenges that should be resolved in order to implement a useful, secure, and efficient PoUW consensus protocol.