Improved Genetic Algorithm for Weapon Target Assignment Problem

Author(s):  
Luo Ruining ◽  
Zhao Yan
2012 ◽  
Vol 605-607 ◽  
pp. 2399-2404
Author(s):  
Xin Lai Chen ◽  
Song Shen

Represent a new Weapon-Target Assignment (WTA) model of warship fleet as to the characteristic of the modern naval battle field and the battle modality. This model considers the WTA to a multi-objects optimization problem, and a Fast and Elitist Non-Dominated Sorting Genetic Algorithm (FENSGA) is applied to resolve this model. The FENSGA can reach a set of wide-distributing, robust solution. One running of the FENSGA can reach a multi-Pareto solution, which the commander can select from. A simulation is given to prove the validity of this model and algorithm.


2011 ◽  
Vol 97-98 ◽  
pp. 619-622 ◽  
Author(s):  
Na Li ◽  
Zhi Hong Jin ◽  
Erick Massami

The combined optimization of continuous berth allocation problem and quay crane assignment problem are solved. Considering the real constraints of container terminal, an improved genetic algorithm is proposed. The chromosome is composed of berthing time, berthing location and number of quay cranes. While in the following, specific quay cranes are fixed to assign to ships. Through comparisons with the former two literatures, the results are improved averagely by 33.78% and 28.57% respectively by the proposed genetic algorithm, which shows its effectiveness.


Sign in / Sign up

Export Citation Format

Share Document