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

@article{Carvalho2020AnEA,
  title={An exact approach for the Minimum-Cost Bounded-Error Calibration Tree problem},
  author={Iago Augusto de Carvalho and Marco A. Ribeiro},
  journal={Annals of Operations Research},
  year={2020},
  volume={287},
  pages={109-126}
}
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… 
1 Citations

State‐of‐the‐Art Optimization and Metaheuristic Algorithms

References

SHOWING 1-10 OF 32 REFERENCES

Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem

This paper proposes to adapt the augmented $$\epsilon $$ϵ-constraint method in order to solve small sized instances of the bi-SMCFP and develops three metaheuristics: a multiobjectives multi-operator genetic algorithm, an adaptive multiobjective variable neighborhood search and new hybrid method combining the epsilon constraint with the evolutionary metaheuristic.

A Collaborative Approach to In-Place Sensor Calibration

A two-phase post-deployment calibration technique for large-scale, dense sensor deployments that derives relative calibration relationships between pairs of co-located sensors, while in the second phase, it maximizes the consistency of the pair-wise calibration functions among groups of sensor nodes.