An adaptive large neighborhood search heuristic for the green dial-a-ride problem

Mohamed Amine Masmoudi, Manar Hosny, Emrah Demir

    Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

    2 Scopus citations

    Abstract

    This chapter presents a new extension of the Dial-a-Ride Problem (DARP), in which a fleet of Alternative Fuel Vehicles (AFVs) is considered. Due to the limited driving range, the AFVs may visit some Alternative Fuel Stations to be refueled with a partial refueling quantity during its journey to serve all users' demands. The proposed variant is called the Green DARP (G-DARP). The chapter introduces a linear mixed-integer mathematical formulation of the G-DARP, and proposes an efficient Adaptive Large Neighborhood Search heuristic algorithm to solve the G-DARP. The algorithm is supported by efficient local search operators to enhance the search and improve the quality of solutions, as well as a flexible acceptance function to more explore the search space. The chapter also presents numerical experiments to demonstrate that the solution approach provides high-quality solutions for newly generated instances.

    Original languageBritish English
    Title of host publicationSolving Transport Problems
    Subtitle of host publicationTowards Green Logistics
    Publisherwiley
    Pages1-26
    Number of pages26
    ISBN (Electronic)9781119686750
    ISBN (Print)9781786303899
    DOIs
    StatePublished - 27 Dec 2019

    Keywords

    • Adaptive large neighborhood search heuristic algorithm
    • Alternative fuel stations
    • Alternative fuel vehicles
    • Computational experiments
    • Green dial-a-ride problem
    • Linear mixed-integer mathematical formulation
    • Local search operators

    Fingerprint

    Dive into the research topics of 'An adaptive large neighborhood search heuristic for the green dial-a-ride problem'. Together they form a unique fingerprint.

    Cite this