IDEAS home Printed from https://ideas.repec.org/a/anm/alpnmr/v6y2018i1p37-48.html
   My bibliography  Save this article

An Ant Colony Optimization Algorithm Approach for Solving Multi-objective Capacitated Vehicle Routing Problem

Author

Listed:
  • Osman Pala
  • Mehmet Aksaraylı

Abstract

In the transportation and logistics sector, the problem of vehicle routing is an important issue that needs to be addressed in many ways. The aim of the work is to minimize the total tour time and the average length of time that a passenger travels on by a service company that is carrying passengers between the hotel and the airport with their service vehicles. Due to the limitations of passenger transport in vehicles, the problem is dealt with as a Multi-objective Capacitated Vehicle Routing problem. An Ant Colony Optimization Algorithm which is a heuristic method is proposed for solving the problem. According to the results of the solution, it is observed that the proposed model provides significant improvements in terms of both parameters in terms of the duration of the tours and the duration of the average transportation time of the customers.

Suggested Citation

  • Osman Pala & Mehmet Aksaraylı, 2018. "An Ant Colony Optimization Algorithm Approach for Solving Multi-objective Capacitated Vehicle Routing Problem," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 6(1), pages 37-48, March.
    • Handle: RePEc:anm:alpnmr:v:6:y:2018:i:1:p:37-48
    DOI: http://dx.doi.org/10.17093/alphanumeric.366852
    as

    Download full text from publisher

    File URL: https://www.alphanumericjournal.com/media/Issue/volume-6-issue-1-2018/cok-amacli-kapasite-kisitli-arac-rotalama-problemi-cozumunde_ejpELx7.pdf
    Download Restriction: no
    File URL: https://alphanumericjournal.com/article/cok-amacli-kapasite-kisitli-arac-rotalama-problemi-cozumunde-bir-karinca-kolonisi-optimizasyon-algoritmasi-yaklasimi/
    Download Restriction: no
    File URL: https://libkey.io/http://dx.doi.org/10.17093/alphanumeric.366852?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

    Keywords

    Ant Colony; Multi-objective Optimization; Vehicle Routing Problem;
    All these keywords.

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:anm:alpnmr:v:6:y:2018:i:1:p:37-48. 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: Bahadir Fatih Yildirim (email available below). General contact details of provider: https://www.alphanumericjournal.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.