IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v33y2010i6p481-493.html
   My bibliography  Save this article

Locating inspection facilities in traffic networks: an artificial intelligence approach

Author

Listed:
  • Milica Šelmić
  • Dušan Teodorović
  • Katarina Vukadinović

Abstract

In order for traffic authorities to attempt to prevent drink driving, check truck weight limits, driver hours and service regulations, hazardous leaks from trucks, and vehicle equipment safety, we need to find answers to the following questions: (a) What should be the total number of inspection stations in the traffic network? and (b) Where should these facilities be located? This paper develops a model to determine the locations of uncapacitated inspection stations in a traffic network. We analyze two different model formulations: a single-objective optimization problem and a multi-objective optimization problem. The problems are solved by the Bee Colony Optimization (BCO) method. The BCO algorithm belongs to the class of stochastic swarm optimization methods, inspired by the foraging habits of bees in the natural environment. The BCO algorithm is able to obtain the optimal value of objective functions in all test problems. The CPU times required to find the best solutions by the BCO are found to be acceptable.

Suggested Citation

  • Milica Šelmić & Dušan Teodorović & Katarina Vukadinović, 2010. "Locating inspection facilities in traffic networks: an artificial intelligence approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 33(6), pages 481-493, June.
    • Handle: RePEc:taf:transp:v:33:y:2010:i:6:p:481-493
    DOI: 10.1080/03081060.2010.505047
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2010.505047
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081060.2010.505047?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:transp:v:33:y:2010:i:6:p:481-493. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.