Cargando…
Deep Learning Assisted Memetic Algorithm for Shortest Route Problems
Finding the shortest route between a pair of origin and destination is known to be a crucial and challenging task in intelligent transportation systems. Current methods assume fixed travel time between any pairs, thus the efficiency of these approaches is limited because the travel time in reality c...
Autores principales: | Turky, Ayad, Rahaman, Mohammad Saiedur, Shao, Wei, Salim, Flora D., Bradbrook, Doug, Song, Andy |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7302558/ http://dx.doi.org/10.1007/978-3-030-50426-7_9 |
Ejemplares similares
-
Memetic Algorithms with Partial Lamarckism for the Shortest Common Supersequence Problem
por: Cotta, Carlos
Publicado: (2005) -
A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm
por: Cui, Shuxian, et al.
Publicado: (2022) -
Handbook of Memetic Algorithms
por: Neri, Ferrante, et al.
Publicado: (2012) -
Multi-objective memetic algorithms
por: Goh, Chi-Keong, et al.
Publicado: (2009) -
Facing the phase problem in Coherent Diffractive Imaging via Memetic Algorithms
por: Colombo, Alessandro, et al.
Publicado: (2017)