A modified particle swarm optimization algorithm for a vehicle scheduling problem with soft time windows

This article constructed a vehicle scheduling problem (VSP) with soft time windows for a certain ore company. VSP is a typical NP-hard problem whose optimal solution can not be obtained in polynomial time, and the basic particle swarm optimization(PSO) algorithm has the obvious shortcoming of premat...

Descripción completa

Detalles Bibliográficos
Autores principales: Qiao, Jinwei, Li, Shuzan, Liu, Ming, Yang, Zhi, Chen, Jun, Liu, Pengbo, Li, Huiling, Ma, Chi
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2023
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10603129/
https://www.ncbi.nlm.nih.gov/pubmed/37884636
http://dx.doi.org/10.1038/s41598-023-45543-z

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10603129/
https://www.ncbi.nlm.nih.gov/pubmed/37884636
http://dx.doi.org/10.1038/s41598-023-45543-z

Ejemplares similares