Results 31 to 40 of about 114,653,411 (178)
Goal Programming Approach for Carrying People with Physical Disabilities
Most of today's optimization efforts aim to reduce costs, time or the number of resources used. However, optimization efforts should consider other factors as important as these, such as facilitating the lives of the disabled, elderly and pregnant and ...
Oğuzhan Ahmet Arik +2 more
doaj +1 more source
PRYORTIE: Public on-demand smart transportation service via a scalable fog-based platform
Over the past few years, the on-demand transport services (e.g., Uber) have witnessed an unprecedented popularity due to its easy-to-adopt model (i.e., a passenger orders a taxi, a request is sent to all drivers in the vicinity, drivers accept/reject the
Naveed Ahmed +3 more
doaj +1 more source
The Dial-a-Ride Problem with Split Requests and Profits [PDF]
In this paper we introduce the dial-a-ride problem with split requests and profits (DARPSRP). Users place transportation requests, specifying a pickup location, a delivery location, and a time window for either of the two. Based on maximum user ride time considerations, the second time window is generated.
Sophie N. Parragh +2 more
openaire +3 more sources
A Hybrid Adaptive Large Neighborhood Heuristic for a Real-Life Dial-a-Ride Problem
The transportation of elderly and impaired people is commonly solved as a Dial-A-Ride Problem (DARP). The DARP aims to design pick-up and delivery vehicle routing schedules.
Slim Belhaiza
doaj +1 more source
The Dial-a-Ride Problem with School Bell Time Adjustment
In this paper, we study a paratransit application in which children are transported every day from their homes to their special schools or medical-social establishments. To optimize this transportation system, the establishments collaborate to propose a joint transportation plan.
Vercraene, Samuel +3 more
openaire +4 more sources
Dial-a-Ride Problem (DARP) data set from Ouro Preto-MG, Basil
The data was used on a dissertation to obtain a Master degree. The research is "A based-VNS algorithm to solve the Dial-a-RIde Problem". The data set was created based on the data given by the transportation sector of the Health System of the Ouro Preto ...
André Luyde da Silva Souza (7019426)
core +1 more source
AUTONOMOUS DIAL-A-RIDE TRANSIT INTRODUCTORY OVERVIEW
This paper introduces a modernized version of many-to-few dial-a-ride called autonomous dial-a-ride transit (ADART), which employs fully-automated order-entry and routing-and-scheduling systems that reside exclusively on board the vehicle.
Dial, R B
core +2 more sources
Comparison of anticipatory algorithms for a dial-a-ride problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ulrike Ritzinger +3 more
openaire +2 more sources
A tight formulation for the dial-a-ride problem
Ridepooling services play an increasingly important role in modern transportation systems. With soaring demand and growing fleet sizes, the underlying route planning problems become increasingly challenging. In this context, we consider the dial-a-ride problem (DARP): Given a set of transportation requests with pick-up and delivery locations, passenger
Daniela Gaul +4 more
openaire +3 more sources
On-line single-server dial-a-ride problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. Feuerstein, L. Stougie (Leen)
openaire +6 more sources

