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

Bruno C.H. Silva, Islame F.C. Fernandes, Marco C. Goldbarg and Elizabeth Goldbarg

A chapter in Operations Management - Emerging Trend in the Digital Era from IntechOpen

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.

Keywords: Traveling Salesman; integer programming; transportation; shared mobility; Ant Colony Optimization (search for similar items in EconPapers)
JEL-codes: M11 (search for similar items in EconPapers)
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.intechopen.com/chapters/73466 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ito:pchaps:214917

DOI: 10.5772/intechopen.93860

Access Statistics for this chapter

More chapters in Chapters from IntechOpen
Bibliographic data for series maintained by Slobodan Momcilovic ().