Cargando…
The bi-objective multimodal car-sharing problem
The aim of the bi-objective multimodal car-sharing problem (BiO-MMCP) is to determine the optimal mode of transport assignment for trips and to schedule the routes of available cars and users whilst minimizing cost and maximizing user satisfaction. We investigate the BiO-MMCP from a user-centred poi...
Autores principales: | Enzi, Miriam, Parragh, Sophie N., Puchinger, Jakob |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9165302/ https://www.ncbi.nlm.nih.gov/pubmed/35673525 http://dx.doi.org/10.1007/s00291-021-00631-2 |
Ejemplares similares
-
A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem
por: Parragh, Sophie N., et al.
Publicado: (2021) -
Bi-objective facility location under uncertainty with an application in last-mile disaster relief
por: Nazemi, Najmesadat, et al.
Publicado: (2021) -
Solving routing problems with pairwise synchronization constraints
por: Parragh, Sophie N., et al.
Publicado: (2018) -
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)