Cargando…

List-Based Simulated Annealing Algorithm for Traveling Salesman Problem

Simulated annealing (SA) algorithm is a popular intelligent optimization algorithm which has been successfully applied in many fields. Parameters' setting is a key factor for its performance, but it is also a tedious work. To simplify parameters setting, we present a list-based simulated anneal...

Descripción completa

Detalles Bibliográficos
Autores principales:	Zhan, Shi-hua, Lin, Juan, Zhang, Ze-jun, Zhong, Yi-wen
Formato:	Online Artículo Texto
Lenguaje:	English
Publicado:	Hindawi Publishing Corporation 2016
Materias:	Research Article
Acceso en línea:	https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4808530/ https://www.ncbi.nlm.nih.gov/pubmed/27034650 http://dx.doi.org/10.1155/2016/1712630

Ejemplares similares

Hybrid Algorithm Based on Ant Colony Optimization and Simulated Annealing Applied to the Dynamic Traveling Salesman Problem
por: Stodola, Petr, et al.
Publicado: (2020)

Solving the clustered traveling salesman problem via traveling salesman problem methods
por: Lu, Yongliang, et al.
Publicado: (2022)

An Adaptive Evolutionary Algorithm for Traveling Salesman Problem with Precedence Constraints
por: Sung, Jinmo, et al.
Publicado: (2014)

The traveling salesman problem and its variations
por: Gutin, Gregory, et al.
Publicado: (2007)

The multi-stripe travelling salesman problem
por: Çela, Eranda, et al.
Publicado: (2017)

Solving Traveling Salesman Problems Based on Artificial Cooperative Search Algorithm
por: Liu, Guangjun, et al.
Publicado: (2022)

The Ordered Clustered Travelling Salesman Problem: A Hybrid Genetic Algorithm
por: Ahmed, Zakir Hussain
Publicado: (2014)

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem
por: Jiang, Zi-bin, et al.
Publicado: (2016)

Genetic Algorithm for Traveling Salesman Problem with Modified Cycle Crossover Operator
por: Hussain, Abid, et al.
Publicado: (2017)

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)

The traveling salesman problem: a computational study
por: Applegate, David L, et al.
Publicado: (2006)

A closer look at the travelling salesman problem
por: Østergaard, Christina V
Publicado: (2020)

Dataset for the electric capacitated traveling salesman problem
por: Gialos, Anastasios, et al.
Publicado: (2023)

Automatic Combination of Operators in a Genetic Algorithm to Solve the Traveling Salesman Problem
por: Contreras-Bolton, Carlos, et al.
Publicado: (2015)

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
por: Qian, Wenyang, et al.
Publicado: (2023)

Genetic codes optimized as a traveling salesman problem
por: Attie, Oliver, et al.
Publicado: (2019)

Hybrid pointer networks for traveling salesman problems optimization
por: Stohy, Ahmed, et al.
Publicado: (2021)

Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows
por: Yurtkuran, Alkın, et al.
Publicado: (2014)

A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case
por: Tsai, Chun-Wei, et al.
Publicado: (2014)

A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model
por: Wang, Zhaocai, et al.
Publicado: (2022)

Solving the Traveling Salesman's Problem Using the African Buffalo Optimization
por: Odili, Julius Beneoluchi, et al.
Publicado: (2016)

Traveling salesman problem solution using magnonic combinatorial device
por: Balinskyy, Mykhaylo, et al.
Publicado: (2023)

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)

Sense of direction and conscientiousness as predictors of performance in the Euclidean travelling salesman problem
por: Kyritsis, Markos, et al.
Publicado: (2017)

Heuristics and Learning Models for Dubins MinMax Traveling Salesman Problem
por: Nayak, Abhishek, et al.
Publicado: (2023)

Dynamic sub-route-based self-adaptive beam search Q-learning algorithm for traveling salesman problem
por: Zhang, Jin, et al.
Publicado: (2023)

Dynamic Flying Ant Colony Optimization (DFACO) for Solving the Traveling Salesman Problem
por: Dahan, Fadl, et al.
Publicado: (2019)

A Revisiting Method Using a Covariance Traveling Salesman Problem Algorithm for Landmark-Based Simultaneous Localization and Mapping
por: Ryu, Hyejeong
Publicado: (2019)

A traveling salesman approach for predicting protein functions
por: Johnson, Olin, et al.
Publicado: (2006)

Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic
por: Anaya Fuentes, Gustavo Erick, et al.
Publicado: (2018)

A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem
por: Odili, Julius Beneoluchi, et al.
Publicado: (2021)

Amoeba-inspired analog electronic computing system integrating resistance crossbar for solving the travelling salesman problem
por: Saito, Kenta, et al.
Publicado: (2020)

Combined Simulated Annealing Algorithm for the Discrete Facility Location Problem
por: Qin, Jin, et al.
Publicado: (2012)

People Efficiently Explore the Solution Space of the Computationally Intractable Traveling Salesman Problem to Find Near-Optimal Tours
por: Acuña, Daniel E., et al.
Publicado: (2010)

Multiple probabilistic traveling salesman problem in the coordination of drug transportation—In the context of sustainability goals and Industry 4.0
por: Twaróg, Sebastian, et al.
Publicado: (2021)

Simultaneous Pickup and Delivery Traveling Salesman Problem considering the Express Lockers Using Attention Route Planning Network
por: Du, Yu, et al.
Publicado: (2021)

Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems
por: Zhang, Zili, et al.
Publicado: (2016)

Death of a salesman
por: Hastings, Gerard B, et al.
Publicado: (2015)

A novel approach for solving travelling thief problem using enhanced simulated annealing
por: Ali, Hamid, et al.
Publicado: (2021)

A one-commodity pickup-and-delivery traveling salesman problem solved by a two-stage method: A sensor relocation application
por: Miao, Kun, et al.
Publicado: (2019)

Cannot write session to /tmp/vufind_sessions/sess_tkj63otgrqhahd3rdc9mrsgtk7