An evolutionary approach for the target allocation problem

Date

2003-09-01

Author

Erdem, E
Özdemirel, Nur Evin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

133
views

0
downloads

We propose an evolutionary approach for target allocation in tactical level land combat. The purpose is to assign friendly military units to enemy units such that the total weapon effectiveness used is minimised while the attrition goals set for the enemy units are satisfied. A repair algorithm is developed to ensure feasibility with respect to the attrition goal constraints. A tightness measure is devised to determine the population size of the genetic algorithm as a function of constraint tightness. Also, a local improvement algorithm is used to further improve the solution quality. Experimental results indicate that the genetic algorithm can find solutions with acceptable quality in reasonable computation time. Although the approach is developed for the target allocation problem, it can be adapted for other assignment problems.

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

https://hdl.handle.net/11511/40007

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

https://doi.org/10.1057/palgrave.jors.2601580

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Semi-dynamic modelling of heterogeneous land combat Özdemirel, Nur Evin (Informa UK Limited, 2006-01-01) We propose a semi-dynamic approach to tactical level land combat modelling from the attacker's viewpoint. Our approach decomposes a battle between heterogeneous forces into stages and mini battles. For each mini battle in a stage, we use three models: a mathematical programming model for optimizing force allocations, a Lanchester simulation model for predicting whether or not the stage targets are reached under the allocations, and a model for weapon effectiveness update from one stage to the next. These mo...
An interactive approach for multiobjective decision making Koksalan, M; Karasakal, Esra (Informa UK Limited, 2006-05-01) We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an inte...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09) In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
A Heuristic for Obtaining and Initial Solution for the Transportation Problem Kirca, Ömer; Şatır, Ahmet (JSTOR, 1990-9) A heuristic for obtaining an initial solution for the transportation problem is presented. Comparison of findings obtained by the new heuristic and Vogel's approximation method (VAM) are tabulated for 480 examples. Superior performance of the new heuristic over VAM is discussed in terms of total costs obtained, number of iterations required to reach the final solution, and CPU time required to solve the problems. Experimental design aspects are also presented.

Citation Formats

E. Erdem and N. E. Özdemirel, “An evolutionary approach for the target allocation problem,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 958–969, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40007.