IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3201656.html
   My bibliography  Save this article

A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves

Author

Listed:
  • Guilherme V. Batista
  • Cassius T. Scarpin
  • José E. Pécora
  • Angel Ruiz

Abstract

This paper describes a variant of the Periodic Capacitated Arc Routing Problem for inspections in a railroad network. Inspections are performed by vehicles over a time horizon on which some stretches need evaluation more frequently than others due to its use. Each car can evaluate one stretch per day without being attached to a depot; at each day, the shift may start and end at different locations. This characterizes the problem as the Periodic Capacitated Arc Routing Problem with Continuous Moves in which firstly the delays on attendances are minimized and, second, the displacement costs. We present a mathematical model and an Ant Colony Optimization algorithm to solve the problem. The use of a local search procedure and some principles of Granular Tabu Search is crucial for the algorithm’s performance. The numerical results are promising, especially for critical situations where the arcs’ needs are close to the total vehicles’ capacity.

Suggested Citation

  • Guilherme V. Batista & Cassius T. Scarpin & José E. Pécora & Angel Ruiz, 2019. "A New Ant Colony Optimization Algorithm to Solve the Periodic Capacitated Arc Routing Problem with Continuous Moves," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, July.
    • Handle: RePEc:hin:jnlmpe:3201656
    DOI: 10.1155/2019/3201656
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3201656.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/3201656.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/3201656?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
    ---><---

    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:hin:jnlmpe:3201656. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.