Empirical study of the greedy heuristic as applied to the link selection problem

Open access

Abstract

Behind the link selection problem there is a practical problem that aims to check efficiently the vehicles on a road network. The checking process is to be realized with license plate reading cameras for checking the valid vignette of vehicles using that part of the network. However this problem should be defined generally and the methods of obtaining a solution can be applied to a wider range of problems independent of the original problem. This paper defines the link selection problem with directed graph, it shows the NP-hard complexity and it gives a heuristic and binary integer programming models to solve the problem. These two kinds of approaches allow us to examine and qualify the heuristic. The computational results of the methods are compared with different sizes of problems.

[1] V. Chvátal, A greedy heuristic for the set-covering problem, Math. Oper. Res., 4, 3, (1979) 233–235. ⇒107

[2] D. S. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, Mass., 1997. ⇒107, 108, 113

[3] D. B. Johnson, Approximation algorithms for combinatorial problems, J. Comp. System Sci., 9, 3 (1974) 256–278. ⇒107, 112

[4] L. Lovász, On the ratio of optimal integral, and fractional covers Discrete Math., 13, 4 (1975) 383–390. ⇒112

[5] L. Marton, P. Pusztai, On modelling and computing traffic assignment, Proc. EURO XVII. European Conf. Operational Research, Budapest, Hungary, 2000, pp. 114. ⇒107

[6] P. Pusztai, An application of the greedy heuristic of set cover to traffic checks, CEJOR Cent. Eur. J. Oper. Res., 16, 4 (2008) 407–414 ⇒107, 108, 115, 119

Acta Universitatis Sapientiae, Informatica

The Journal of "Sapientia" Hungarian University of Transylvania

Journal Information

Metrics

All Time Past Year Past 30 Days
Abstract Views 0 0 0
Full Text Views 70 70 14
PDF Downloads 19 19 4