Cargando…
Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem
Dial-a-ride problems deal with the transportation of people between pickup and delivery locations. Given the fact that people are subject to transportation, constraints related to quality of service are usually present, such as time windows and maximum user ride time limits. In many real world appli...
Autor principal: | Parragh, Sophie N. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier Science
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3916793/ https://www.ncbi.nlm.nih.gov/pubmed/24511211 http://dx.doi.org/10.1016/j.trc.2010.06.002 |
Ejemplares similares
-
Hybrid column generation and large neighborhood search for the dial-a-ride problem
por: Parragh, Sophie N., et al.
Publicado: (2013) -
A Comparison of Multiple Objective Algorithms in the Context of a Dial a Ride Problem
por: Guerreiro, Pedro M. M., et al.
Publicado: (2020) -
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
por: Schilde, M., et al.
Publicado: (2011) -
New Bounds for Maximizing Revenue in Online Dial-a-Ride
por: Christman, Ananya, et al.
Publicado: (2020) -
Two-stage battery recharge scheduling and vehicle-charger assignment policy for dynamic electric dial-a-ride services
por: Ma, Tai-Yu
Publicado: (2021)