Cargando…
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
The problem of transporting patients or elderly people has been widely studied in literature and is usually modeled as a dial-a-ride problem (DARP). In this paper we analyze the corresponding problem arising in the daily operation of the Austrian Red Cross. This nongovernmental organization is the l...
Autores principales: | Schilde, M., Doerner, K.F., Hartl, R.F. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Pergamon Press
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3611096/ https://www.ncbi.nlm.nih.gov/pubmed/23543641 http://dx.doi.org/10.1016/j.cor.2011.02.006 |
Ejemplares similares
-
Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
por: Schilde, M., et al.
Publicado: (2014) -
Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem
por: Parragh, Sophie N.
Publicado: (2011) -
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) -
New Bounds for Maximizing Revenue in Online Dial-a-Ride
por: Christman, Ananya, et al.
Publicado: (2020)