Back to Search
Start Over
The time-consistent dial-a-ride problem
- Source :
- Networks, Networks, Wiley, 2021, ⟨10.1002/net.22063⟩, Networks, Wiley, In press, ⟨10.1002/net.22063⟩, Networks, 2022, 79 (4), pp.452-478. ⟨10.1002/net.22063⟩
- Publication Year :
- 2021
- Publisher :
- HAL CCSD, 2021.
-
Abstract
- International audience; 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, we define a new variant of the multi-period dial-a-ride problem called the time-consistent dial-a-ride problem. A transportation planning is supposed to be time-consistent if for each passenger, the same service time is used all along the planning horizon. However, considering the numerous variations in transportation demands over a week, designing consistent plan for all users can be too expensive. It is therefore necessary to find a compromise solution between costs and time-consistency objectives. The time-consistent dial-a-ride problem is solved using an epsilon-constraint approach to illustrate the trade-off between these two objectives. It computes an approximation of the Pareto front, using a matheuristic framework that combines a large neighbourhood search with the solution of set partitioning problems. This approach is benchmarked on time-consistent vehicle routing problem literature instances. Experiments are also conducted in the context of door-to-door transportation for people with disabilities, using real data. These experiments support managerial insights regarding the inter-relatedness of costs and quality of service.
- Subjects :
- Operations research
Computer Networks and Communications
Computer science
0211 other engineering and technologies
Healthcare logistics
Context (language use)
Time horizon
02 engineering and technology
Set partitioning
Multi-objective optimization
0502 economics and business
Vehicle routing problem
Dial-a-ride problem
Service (business)
050210 logistics & transportation
Transportation planning
Service quality
021103 operations research
Quality of service
05 social sciences
[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]
Vehicle routing
Large neighborhood search
Hardware and Architecture
Consistency
Software
Information Systems
Subjects
Details
- Language :
- English
- ISSN :
- 00283045 and 10970037
- Database :
- OpenAIRE
- Journal :
- Networks, Networks, Wiley, 2021, ⟨10.1002/net.22063⟩, Networks, Wiley, In press, ⟨10.1002/net.22063⟩, Networks, 2022, 79 (4), pp.452-478. ⟨10.1002/net.22063⟩
- Accession number :
- edsair.doi.dedup.....df2211a3454b04341b5c03ec4e25b978