News

 Statistics

Number of Journals34
Number of Issues1,306
Number of Articles9,427
Article View9,188,656
PDF Download5,620,946
Peymankar, M., Baloucian, S. (2018). Modeling and Solution of Fire Allocation and Scheduling Problem of Distributed Sites. Electronic and Cyber Defense, 9(4), 487-504.
Mahbubeh Peymankar; Saeed Baloucian. "Modeling and Solution of Fire Allocation and Scheduling Problem of Distributed Sites". Electronic and Cyber Defense, 9, 4, 2018, 487-504.
Peymankar, M., Baloucian, S. (2018). 'Modeling and Solution of Fire Allocation and Scheduling Problem of Distributed Sites', Electronic and Cyber Defense, 9(4), pp. 487-504.
Peymankar, M., Baloucian, S. Modeling and Solution of Fire Allocation and Scheduling Problem of Distributed Sites. Electronic and Cyber Defense, 2018; 9(4): 487-504.

Modeling and Solution of Fire Allocation and Scheduling Problem of Distributed Sites

علوم و فناوریهای پدافند نوین
Article 11, Volume 9, Issue 4 - Serial Number 34, August 2018, Pages 487-504    PDF (1.59 M)
Authors
Mahbubeh Peymankar; Saeed Baloucian
Receive Date: 30 January 2019,  Revise Date: 16 July 2025,  Accept Date: 30 January 2019 
Abstract
In the combat management systems, mathematical and optimization models have significant impact to find good solutions for fire allocation and scheduling problems. In this paper, a linear integer programming model has been developed for a fire allocation and scheduling problems the aim of which was to maximize the expected value of the target distruction and strategic realms protection and efficient use of weapons by considering the operational constraints for weapon allocation. Since the available operation research solvers can not find the optimal solution of this problem in the large scale sizes, two metaheuristics based on genetic algorithm and chaotic particle swarm optimization was developed. Finally, based on randomnly generated test instances and extensive computation results, the performance of the developed algorithms was evaluated. The computational experiments reveal that the developed chaotic particle swarm optimization algorithm is more efficient especially in the limited and short CPU run time.
Keywords
Allocation; Scheduling; Integer Programming; genetic algorithm; Chaotic Particle Swarm Optimization
Statistics
Article View: 888
PDF Download: 341