A comparative study of global optimization methods for parameter identification of different equivalent circuit models for Li-ion batteries

X Lai, W Gao, Y Zheng, M Ouyang, J Li, X Han… - Electrochimica Acta, 2019 - Elsevier
A suitable model structure and matched model parameters are prerequisites for the precise
estimation of the battery states. Previous studies pay little attention to whether a parameter …

A new efficient hybrid algorithm for large scale multiple traveling salesman problems

C Jiang, Z Wan, Z Peng - Expert Systems with Applications, 2020 - Elsevier
Multiple traveling salesmen problem (MTSP) is not only a generalization of the traveling
salesman problem (TSP), but also more suitable for modeling practical problems in the real …

Artificial electric field algorithm with greedy state transition strategy for spherical multiple traveling salesmen problem

J Bi, G Zhou, Y Zhou, Q Luo, W Deng - International Journal of …, 2022 - Springer
The multiple traveling salesman problem (MTSP) is an extension of the traveling salesman
problem (TSP). It is found that the MTSP problem on a three-dimensional sphere has more …

Intelligent algorithms and complex system for a smart parking for vaccine delivery center of COVID-19

M Jemmali - Complex & Intelligent Systems, 2022 - Springer
Achieving community immunity against the coronavirus disease 2019 (COVID-19) depends
on vaccinating the largest number of people within a specific period while taking all …

A hybrid algorithm combining glowworm swarm optimization and complete 2-opt algorithm for spherical travelling salesman problems

X Chen, Y Zhou, Z Tang, Q Luo - Applied Soft Computing, 2017 - Elsevier
Abstract The Travelling Salesman Problem (TSP) is one of the most well-known
combinatorial optimization problems and has attracted a lot of interests from researchers …

Genetic algorithm based multi-objective optimization framework to solve traveling salesman problem

T George, T Amudha - Advances in Computing and Intelligent Systems …, 2020 - Springer
The combination of objectives to be optimized is known as Combinatorial Optimization.
Traveling Salesman is one of the demanding topics in the field of Combinatorial …

A graph convolutional encoder and multi-head attention decoder network for TSP via reinforcement learning

J Luo, C Li, Q Fan, Y Liu - Engineering Applications of Artificial Intelligence, 2022 - Elsevier
For the traveling salesman problem (TSP), it is usually hard to find a high-quality solution in
polynomial time. In the last two years, graph neural networks emerge as a promising …

[HTML][HTML] Combining Genetic Algorithm with Local Search Method in Solving Optimization Problems

V Kralev, R Kraleva - Electronics, 2024 - mdpi.com
This research is focused on evolutionary algorithms, with genetic and memetic algorithms
discussed in more detail. A graph theory problem related to finding a minimal Hamiltonian …

Hybrid genetic algorithm with Wiener process for multi-scale colored balanced traveling salesman problem

X Dong, L Ma, X Zhao, Y Shan, J Wang, Z Xu - Expert Systems with …, 2025 - Elsevier
Colored traveling salesman problem (CTSP) can be applied to Multi-machine Engineering
Systems (MES) in industry, colored balanced traveling salesman problem (CBTSP) is a …

Solution of maximum scatter traveling salesman problem through evolutionary approaches

A Singh, S Majumder - Applied Soft Computing, 2024 - Elsevier
This paper is concerned with a variant of the traveling salesman problem (TSP) called the
maximum scatter traveling salesman problem (MSTSP). The goal of MSTSP is to find a …