The time‐consistent dial‐a‐ride problem
Sign Up to like & getrecommendations! Published in 2021 at "Networks"
DOI: 10.1002/net.22063
Abstract: In the context of door-to-door transportation of people with disabilities, service quality considerations such as maximum ride time and service time-consistency are critical requirements. To identify a good trade-off between these considerations and economic objectives,… read more here.
Keywords: dial ride; time; ride problem; time consistent ... See more keywords
An enhanced approach for the dial a ride problem with drivers preferences
Sign Up to like & getrecommendations! Published in 2024 at "OPSEARCH"
DOI: 10.1007/s12597-024-00843-4
Abstract: The paper addresses a variant of the dial-a-ride problem with additional features. It is referred to as the DARP with driver preferences, which attempts to determine a solution more driver-oriented by designing a short trip… read more here.
Keywords: ride problem; enhanced approach; approach; dial ride ... See more keywords
The dial-a-ride problem with electric vehicles and battery swapping stations
Sign Up to like & getrecommendations! Published in 2018 at "Transportation Research Part E: Logistics and Transportation Review"
DOI: 10.1016/j.tre.2018.08.005
Abstract: The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and schedules for customers with special needs and/or disabilities. The DARP with Electric Vehicles and battery swapping stations (DARP-EV) concerns scheduling a fleet of EVs to… read more here.
Keywords: battery swapping; electric vehicles; vehicles battery; dial ride ... See more keywords
An exact branch-and-price-and-cut algorithm for a practical and large-scale dial-a-ride problem
Sign Up to like & getrecommendations! Published in 2024 at "Journal of the Operational Research Society"
DOI: 10.1080/01605682.2024.2412214
Abstract: Abstract Vehicle routing problems are encountered in various practical transportation scenarios. One such problem is the dial-a-ride problem (DARP), which involves transporting efficiently passengers from their origin to their destination and whose objective is to… read more here.
Keywords: ride problem; exact branch; problem; price cut ... See more keywords
Simulated annealing heuristic for the general share-a-ride problem
Sign Up to like & getrecommendations! Published in 2018 at "Engineering Optimization"
DOI: 10.1080/0305215x.2018.1437153
Abstract: ABSTRACT This research introduces an extension of the share-a-ride problem (SARP), called the general share-a-ride problem (G-SARP). Similarly to SARP, a taxi in G-SARP can service passenger and package requests at the same time. However,… read more here.
Keywords: general share; share ride; ride problem;