Revised eight-step feasibility checking procedure with linear time complexity for the Dial-a-Ride Problem (DARP)
Year of publication: |
2024
|
---|---|
Authors: | Sohrabi, Somayeh ; Ziarati, Koorush ; Keshtkaran, Morteza |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 164.2024, Art.-No. 106530, p. 1-11
|
Subject: | Dial-a-Ride Problem (DARP) | Eight-step procedure | Feasibility checking procedure | Pickup and Delivery Problem (PDP) | Shared mobility systems |
-
Jlassi, Jihen, (2017)
-
Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem
Masmoudi, Mohamed Amine, (2016)
-
Dynamic pricing for shared mobility systems based on idle time data
Müller, Christian, (2023)
- More ...
-
A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
Sohrabi, Somayeh, (2020)
-
ACS-OPHS : Ant Colony System for the Orienteering Problem with hotel selection
Sohrabi, Somayeh, (2021)
-
Enhanced exact solution methods for the Team Orienteering Problem
Keshtkaran, Morteza, (2016)
- More ...