Constrained weapon-target assignment: Enhanced very large scale neighborhood search algorithm

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

Volumn 40, Issue 1, 2010, Pages 198-204

  Lee, Mei Zi ^a  

^a CHUNG SHAN INSTITUTE OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Constrained WTA problem; Cyclic multiexchange; Improvement graph; Network flow; Valid cycle; Very large scale neighborhood (VLSN) search algorithm; Weapon target assignment (WTA)

Indexed keywords

CAPACITATED MINIMUM SPANNING TREE PROBLEM; FEASIBLE SOLUTION; GRAPH NETWORKS; LOWER AND UPPER BOUNDS; OPTIMIZATION PROBLEMS; SCHEDULING PROBLEM; SEARCH ALGORITHMS; UPPER BOUND; VERY LARGE SCALE NEIGHBORHOODS; VERY LARGE-SCALE NEIGHBORHOOD SEARCH; WEAPON-TARGET ASSIGNMENT;

DECISION TREES; GRAPH THEORY; LEARNING ALGORITHMS; SCHEDULING ALGORITHMS; TARGETS;

TRAVELING SALESMAN PROBLEM;

EID: 72949124164     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2009.2030163     Document Type: Article

References (24)

1. F. Yu, F. Tu, and K. R. Pattipati, "Integration of a holonic organizational control architecture and multiobjective evolutionary algorithm for flexible distributed scheduling," IEEE Trans. Syst., Man, Cybern. A, Syst., Humans, vol.38, no.5, pp. 1001-1017, Sep. 2008.
2. E. Wacholder, "A neural network-based optimization algorithm for the weapon-target assignment problem," ORSA J. Comput., vol.1, no.4, pp. 232-246, 1989.
3. J. Berger and D. Leong-Kon, "The resolution of an open-loop resource allocation problem using a neural network approach," in Proc. 27th IEEE Annu. Simul. Symp., 1994, pp. 51-58.
4. Z.-J. Lee, S.-F. Su, and C.-Y. Lee, "A genetic algorithm with domain knowledge for weapon-target assignment problems," J. Chin. Inst. Eng., vol.25, no.3, pp. 287-295, 2002.
5. R. K. Ahuja, A. Kumar, K. Jha, and J. B. Orlin, "Exact and heuristic methods for the weapon target assignment problem," MIT Sloan School Manage., Cambridge, MA, Tech. Rep. 4464-4503, Jul. 2003. working paper.
6. J. K. Chandra, "Very large-scale neighborhood search heuristics for combinatorial optimization problems," Ph.D. dissertation, Univ. Florida Press, Gainesville, FL, 2004.
7. G. A. Tagliarini, J. F. Christ, and E. W. Page, "Optimization using neural networks," IEEE Trans. Comput., vol.40, no.12, pp. 1347-1358, Dec. 1991.
8. Z.-J. Lee, S.-F. Su, and C.-Y. Lee, "Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol.33, no.1, pp. 113-121, Feb. 2003.
9. L. Chen, C. Ren, and S. Deng, "An efficient approximation for weapon-target assignment," in Proc. IEEE ISECS Int. Colloq. Comput., Commun., Control, Manage., 2008, pp. 764-767.
10. D. Khosla, "Hybrid genetic approach for the dynamic weapon-target allocation," Proc. SPIE, vol.4396, pp. 244-259, 2001.
11. D. Khosla and T. Nichols, "Hybrid evolutionary algorithms for networkcentric command and control," Proc. SPIE, vol.6249, pp. 13-31, 2006.
12. H. Cai, J. Liu, Y. Chen, and H.Wang, "Survey of the research on dynamic weapon-target assignment problem," J. Syst. Eng. Electron., vol.17, no.3, pp. 559-565, Sep. 2006.
13. A. R. Eckler and S. A. Burr, Mathematical Models of Target Coverage and Missile Allocation. Alexandria, VA: Mil. Oper. Res. Soc., 1972.
14. S. P. Lloyd and H. S. Witsenhausen, "Weapons allocation is NPcomplete," in Proc. IEEE Summer Simul. Conf., Reno, NV, 1986, pp. 1054-1058.
15. R. K. Ahuja, J. B. Orlin, and D. Sharma, "A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem," Oper. Res. Lett., vol.31, no.3, pp. 185-194, May 2003.
16. R. K. Ahuja, J. B. Orlin, and D. Sharma, "Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem," Math. Program., vol.91, no.1, pp. 71-97, Oct. 2001.
17. R. K. Ahuja, O. Ergun, J. B. Orlin, and A. P. Punnen, "A survey of very large scale neighborhood search techniques," Discr. Appl. Math., vol.123, no.1-3, pp. 75-102, Nov. 2002.
18. J. J. Hofield and D. W. Tank, "'Neural' computation of decision in optimization problems," Biol. Cybern., vol.52, no.3, pp. 141-152, Jul. 1985.
19. J. C. Platt and A. H. Barr, "Constrained differential optimization," in Proc. IEEE NIPS Conf., 1987, pp. 612-621.
20. B. W. Wah, T. Wang, Y. Shang, and Z. Wu, "Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization," in Proc. 9th IEEE Int. Conf. Tools Artif. Intell., 1997, pp. 224-231.
21. B. W. Wah, T. Wang, Y. Shang, and Z. Wu, "Improving the performance of weighted Lagrange-multiplier methods for nonlinear constrained optimization," Inf. Sci., vol.124, no.1-4, pp. 241-272, May 2000.
22. P. Nanakorn and K.Meesomklin, "An adaptive penalty function in genetic algorithms for structural design optimization," Comput. Struct., vol.79, no.29, pp. 2527-2539, Nov. 2001.
23. H.-L. Liu and Y.-P. Wang, "Solving constrained optimization problem by a specific-design multiobjective genetic algorithm," in Proc. 5th Int. Conf. Comput. Intell. Multimedia Appl., 2003, pp. 200-205.
24. S. Venkatraman and G. G. Yen, "A generic framework for constrained optimization using genetic algorithms," IEEE Trans. Evol. Comput., vol.9, no.4, pp. 424-435, Aug. 2005.