A new simulated annealing-based tabu search algorithm for unit commitment

2002 ◽  
Author(s):  
A.H. Mantawy ◽  
Y.L. Abdel-Magid ◽  
S.Z. Selim
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Unit Commitment ◽  
Search Algorithm ◽  
Tabu Search Algorithm

scholarly journals Optimal Network Destruction Strategy with Heterogeneous Cost under Cascading Failure Model

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Fang Yang ◽  
Tao Ma ◽  
Tao Wu ◽  
Hong Shan ◽  
Chunsheng Liu
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Network Performance ◽  
Search Algorithm ◽  
Cascading Failure ◽  
Tabu Search Algorithm ◽  
Failure Model ◽  
The Cost ◽  
Node Removal ◽  
The Impact

By studying an attacker’s strategy, defenders can better understand their own weaknesses and prepare a response to potential threats in advance. Recent studies on complex networks using the cascading failure model have revealed that removing critical nodes in the network will seriously threaten network security due to the cascading effect. The conventional strategy is to maximize the declining network performance by removing as few nodes as possible, but this ignores the difference in node removal costs and the impact of the removal order on network performance. Having considered all factors, including the cost heterogeneity and removal order of nodes, this paper proposes a destruction strategy that maximizes the declining network performance under a constraint based on the removal costs. First, we propose a heterogeneous cost model to describe the removal cost of each node. A hybrid directed simulated annealing and tabu search algorithm is then devised to determine the optimal sequence of nodes for removal. To speed up the search efficiency of the simulated annealing algorithm, this paper proposes an innovative directed disturbance strategy based on the average cost. After each annealing iteration, the tabu search algorithm is used to adjust the order of node removal. Finally, the effectiveness and convergence of the proposed algorithm are evaluated through extensive experiments on simulated and real networks. As the cost heterogeneity increases, we find that the impact of low-cost nodes on network security becomes larger.

scholarly journals Human Resource Scheduling Model and Algorithm with Time Windows and Multi-Skill Constraints

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 598 ◽  
Author(s):  
Zhiping Zuo ◽  
Yanhui Li ◽  
Jing Fu ◽  
Jianlin Wu
Keyword(s):  
Simulated Annealing ◽  
Tabu Search ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Search Algorithm ◽  
Time Windows ◽  
Neighborhood Search ◽  
Tabu Search Algorithm ◽  
Service Personnel ◽  
The Stability

In situations where an organization has limited human resources and a lack of multi-skilled employees, organizations pay more and more attention to cost control and personnel arrangements. Based on the consideration of the service personnel scheduling as well as the routing arrangement, service personnel of different skills were divided into different types according to their multiple skills. A mathematical programming model was developed to reduce the actual cost of organization. Then, a hybrid meta heuristic that combines a tabu search algorithm with a simulated annealing was designed to solve the problem. This meta heuristic employs several neighborhood search operators and integrates the advantages of both the tabu search algorithm and the simulated annealing algorithm. Finally, the stability and validity of the algorithm were validated by the tests of several kinds of examples.

Sign in / Sign up

Export Citation Format

Share Document