Optimal Routing for Shared Autonomous Vehicles Feeder Services in Urban Networks

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Afandizadeh Shahriar; Aziz Jalali Dorsa; Bigdeli Rad Hamid

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF TRANSPORTATION RESEARCH Year:2024 | Volume: | Issue: Page(s): 25-44

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Optimal Routing for Shared Autonomous Vehicles Feeder Services in Urban Networks

Author(s)

Afandizadeh Shahriar | Aziz Jalali Dorsa | Bigdeli Rad Hamid | Issue Writer Certificate

Keywords

Dial-A-Ride ProblemQ4

Electric Autonomous VehiclesQ4

Feeder ServicesQ4

Genetic AlgorithmQ4

Abstract

The Complexities of Operating DAR Services Mean That Computerized Planning and Scheduling Is Necessary for Systems of Realistic Size. This Research Studies an Electric Autonomous Fleet Size with Mix Dial-A-Ride Problem. The Goal of The Problem Is to Minimize a Weighted Objective Function Consisting of The Total Travelling Costs of All Vehicles, Users' Excess Ride Time Costs and Vehicles' Acquisition Costs While Satisfying Customer Service Level Constraints Along with Battery Level Management and Recharge Times Management Constraints. In This Variant of The Dial-A-Ride Problem, Recharging at Any of The Available Charging Stations Is Allowed. A Cluster-First, Route-Second Genetic Algorithm Is Proposed to Solve the Problem, Where the Clustering Is Performed by Choosing the Fleet Size and Assigning the Customers to The Fleet Using a Genetic Algorithm (GA), Then the Primary Routes Are Developed by A Routing Heuristic, Finally the Charging Stations Will Be Inserted to The Algorithm Using an Insertion Technique. The Performance of The Proposed Method Is Tested by Using Benchmark Instances of a Related Problem from The Recent Literature. The Proposed Method Has Achieved Solutions Comparable with The Current State-Of-Art Methods. The Computational Results Show That the Proposed Method Is Effective in Finding Comparable Solutions with The Current State-Of-Art Method. New Instances, Some of Which Include First-Mile Feeder Services, Are Generated Based on The Data from Uber Technologies Inc. Tests Performed on New Instances Demonstrate That the Minimum Possible Fleet Size Does Not Always Result in Minimum Costs. Moreover, The Tests Show That Integration of The Feeder Services into Dial-A-Ride Services Increases Ride-Sharing Ridership..

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops