IDEAS home Printed from
MyIDEAS: Log in (now much improved!) to save this article

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

Listed author(s):
  • Pál Pusztai


Registered author(s):

    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

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL:
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Article provided by 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 in its journal Central European Journal of Operations Research.

    Volume (Year): 16 (2008)
    Issue (Month): 4 (December)
    Pages: 407-414

    in new window

    Handle: RePEc:spr:cejnor:v:16:y:2008:i:4:p:407-414
    DOI: 10.1007/s10100-008-0067-x
    Contact details of provider: Web page:

    Web page:

    Web page:

    Web page:

    Web page:

    Web page:

    Web page:

    Order Information: Web:

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    in new window

    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)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.