General variable neighborhood search for the multi-AGV scheduling problem with sorting operations

General variable neighborhood search for the multi-AGV scheduling problem with sorting operations

To solve the intractable multiple automatic guided vehicles (AGVs) scheduling problem encountered in the sorting processes of the logistics sorting centers,a large-scale AGV scheduling problem was studied on the basis of considering the sorting time windows and charging requirements.A general variab...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Chao GUO, Xiangling CHEN, Peng GUO, Qiang WANG
Formato: article
Lenguaje:ZH
Publicado: Hebei University of Science and Technology 2021
Materias:
logistics system management; sorting operation; automatic guided vehicle; scheduling; charging demand; vari-able neighborhood search
Technology
T
Acceso en línea:https://doaj.org/article/8bc6370d2d5a4cd5b2709db2243c8276
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Ejemplares similares