Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows

The traveling salesman problem with time windows (TSPTW) is a variant of the traveling salesman problem in which each customer should be visited within a given time window. In this paper, we propose an electromagnetism-like algorithm (EMA) that uses a new constraint handling technique to minimize th...

Descripción completa

Detalles Bibliográficos
Autores principales: Yurtkuran, Alkın, Emel, Erdal
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3958671/
https://www.ncbi.nlm.nih.gov/pubmed/24723834
http://dx.doi.org/10.1155/2014/871242

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3958671/
https://www.ncbi.nlm.nih.gov/pubmed/24723834
http://dx.doi.org/10.1155/2014/871242

Ejemplares similares