IDEAS home Printed from https://ideas.repec.org/h/ito/pchaps/214917.html
   My bibliography  Save this book chapter

Multi-Strategy MAX-MIN Ant System for Solving Quota Traveling Salesman Problem with Passengers, Incomplete Ride and Collection Time

In: Operations Management - Emerging Trend in the Digital Era

Author

Listed:
  • Bruno C.H. Silva
  • Islame F.C. Fernandes
  • Marco C. Goldbarg
  • Elizabeth Goldbarg

Abstract

This study proposes a novel adaptation of MAX-MIN Ant System algorithm for the Quota Traveling Salesman Problem with Passengers, Incomplete Ride, and Collection Time. There are different types of decisions to solve this problem: satisfaction of the minimum quota, acceptance of ride requests, and minimization of travel costs under the viewpoint of the salesman. The Algorithmic components proposed regards vehicle capacity, travel time, passenger limitations, and a penalty for delivering a passenger deliverance out of the required destination. The ant-based algorithm incorporates different sources of heuristic information for the ants and memory-based principles. Computational results are reported, showing the effectiveness of this ant-based algorithm.

Suggested Citation

  • Bruno C.H. Silva & Islame F.C. Fernandes & Marco C. Goldbarg & Elizabeth Goldbarg, 2021. "Multi-Strategy MAX-MIN Ant System for Solving Quota Traveling Salesman Problem with Passengers, Incomplete Ride and Collection Time," Chapters, in: Antonella Petrillo & Fabio De Felice & Germano Lambert-Torres & Erik Leandro Bonaldi (ed.), Operations Management - Emerging Trend in the Digital Era, IntechOpen.
    • Handle: RePEc:ito:pchaps:214917
    DOI: 10.5772/intechopen.93860
    as

    Download full text from publisher

    File URL: https://www.intechopen.com/chapters/73466
    Download Restriction: no
    File URL: https://libkey.io/10.5772/intechopen.93860?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

    Traveling Salesman; integer programming; transportation; shared mobility; Ant Colony Optimization;
    All these keywords.

    JEL classification:

    • M11 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Production Management

    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:ito:pchaps:214917. 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: Slobodan Momcilovic (email available below). General contact details of provider: http://www.intechopen.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.