Cargando…
A novel approach for solving travelling thief problem using enhanced simulated annealing
Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques. The Traveling Thief Problem (TTP) is an optimization problem that combines two well-known NP-Hard problems including the 0...
Autores principales: | Ali, Hamid, Zaid Rafique, Muhammad, Shahzad Sarfraz, Muhammad, Malik, Muhammad Sheraz Arshad, Alqahtani, Mohammed A., Alqurni, Jehad Saad |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
PeerJ Inc.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8022508/ https://www.ncbi.nlm.nih.gov/pubmed/33834093 http://dx.doi.org/10.7717/peerj-cs.377 |
Ejemplares similares
-
Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022) -
Petri Net based modeling and analysis for improved resource utilization in cloud computing
por: Rizwan Ali, Muhammad, et al.
Publicado: (2021) -
Optimal sequence for chain matrix multiplication using evolutionary algorithm
por: Iqbal, Umer, et al.
Publicado: (2021) -
Solving optimization problems simultaneously: the variants of the traveling salesman problem with time windows using multifactorial evolutionary algorithm
por: Ban, Ha-Bang, et al.
Publicado: (2023) -
Study on a hybrid algorithm combining enhanced ant colony optimization and double improved simulated annealing via clustering in the Traveling Salesman Problem (TSP)
por: Hao, Tan, et al.
Publicado: (2023)