# An application of the greedy heuristic of set cover to traffic checks

Listed:
• Pál Pusztai

()

## Abstract

Let us suppose that X is a given, finite, not empty set and $${\mathcal F}$$ is a given collection of subsets of X such that their union equals X, in other words $${\mathcal F}$$ covers X. Set cover is the problem of selecting as few as possible subsets from $${\mathcal F}$$ such that their union covers X. Max k-cover is the problem of selecting k subsets from $${\mathcal F}$$ such that their union has maximum cardinality. Both problems are NP-hard. There is a polynomial time greedy heuristic that iteratively selects the subset from $${\mathcal F}$$ that covers the largest number of yet uncovered elements. We implemented this greedy algorithm to support the planning of a checking system that is aimed to check the vehicles in a road network. We would like to answer such questions: – How many and which links are sufficient to check a given percentage of all traffic flow? – What percentage of traffic can be checked with given links? This paper defines the necessary data and basic knowledge, gives algorithms to answer the previous questions and also shows the results of an implementation in a road network that contains about 11,000 junctions, 3,000 origin–destination junctions and 26,000 links. Copyright Springer-Verlag 2008

## Suggested Citation

• Pál Pusztai, 2008. "An application of the greedy heuristic of set cover to traffic checks," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(4), pages 407-414, December.
• Handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:407-414
DOI: 10.1007/s10100-008-0067-x
as

File URL: http://hdl.handle.net/10.1007/s10100-008-0067-x

As the access to this document is restricted, you may want to search for a different version of it.

## References listed on IDEAS

as
1. S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
Full references (including those not matched with items on IDEAS)

## Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as

Cited by:

1. A. Kimms & K.-C. Maassen & S. Pottbäcker, 2012. "Guiding traffic in the case of big events with spot checks on traffic and additional parking space requirements," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 755-773, December.

### Keywords

Set cover; Greedy heuristic; Traffic checks; Traffic assignment; Shortest paths;

## Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:407-414. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.