An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem

Iago A. Carvalho () and Marco A. Ribeiro ()
Additional contact information
Iago A. Carvalho: Universidade Federal de Minas Gerais
Marco A. Ribeiro: Universidade Federal de Minas Gerais

Annals of Operations Research, 2020, vol. 287, issue 1, No 5, 109-126

Abstract: Abstract The Minimum-Cost Bounded-Error Calibration Tree problem (MBCT) is a wireless network optimization problem that arises from the sensors’ need of periodical calibration. The MBCT takes into account two objectives. The first is to minimize the communication distance between the network sensors, while the second is to reduce the maximum post-calibration error in the network. In this paper, we propose a mathematical formulation for the MBCT. Furthermore, we solve the problem using two different implementations of an Augmented $$\epsilon $$ϵ-Constraint Method ($$aug\,\epsilon \text {-}CM$$augϵ-CM) that incorporate the proposed formulation. We also employed the Pareto-fronts obtained by $$aug\,\epsilon \text {-}CM$$augϵ-CM to evaluate the Node-depth Phylogenetic-based Non-dominated Sorting Artificial Immune System (NPE-NSAIS), the most recent heuristic in the literature for MBCT. Computational experiments showed that $$aug\,\epsilon \text {-}CM$$augϵ-CM can solve MBCT instances up to 50 nodes. Furthermore, a statistical test demonstrated that the running times of one of the $$aug\,\epsilon \text {-}CM$$augϵ-CM implementations was significantly smaller than those of the other. Finally, we show that NPE-NSAIS solutions are very close to the Pareto-fronts given by $$aug\,\epsilon \text {-}CM$$augϵ-CM, achieving good results on the evaluated metrics.

Keywords: Multiple objective programming; Augmented $$\epsilon $$ ϵ -constraints; Wireless sensors network; Calibration error; Spanning arborescence (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03443-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:287:y:2020:i:1:d:10.1007_s10479-019-03443-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-019-03443-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().