Naval Postgraduate School
Dudley Knox Library
NPS Dudley Knox Library
View Item 
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  •   Calhoun Home
  • Theses and Dissertations
  • 1. Thesis and Dissertation Collection, all items
  • View Item
  • How to search in Calhoun
  • My Accounts
  • Ask a Librarian
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

All of CalhounCollectionsThis Collection

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors

A genetic algorithm based anti-submarine warfare simulator

Thumbnail
Download
Icongeneticalgorithm00timm.pdf (5.577Mb)
Download Record
Download to EndNote/RefMan (RIS)
Download to BibTex
Author
Timmerman, Michael Jay
Date
1993-09
Advisor
Shing, Man-Tak
Lee, Yuh-jeng
Metadata
Show full item record
Abstract
This research was aimed at improving the genetic algorithm used in an earlier anti-submarine warfare simulator. The problem with the earlier work was that it focused on the development of the environmental model, and did not optimize the genetic algorithm which drives the submarine. The improvements to the algorithm centered on finding the optimal combination of mutation rate, inversion rate, crossover rate, number of generations per turn, population size, and grading criteria. The earlier simulator, which was written in FORTRAN-77, was recoded in Ada. The genetic algorithm was tested by the execution of several thousand runs of the simulation, varying the parameters to determine the optimal solution. Once the best combination was found, it was further tested by having officers with anti-submarine warfare experience run the simulation in various scenarios to test its performance. The optimum parameters were found to be: population size of eight, five generations per turn, mutation rate of 0.001, inversion rate of 0.25, crossover rate of 0.65, grading criteria of sum of the fitness values of all alleles while building the strings, and checking the performance against the last five environments for the final string selection. The use of these parameters provided for the best overall performance of the submarine in a variety of tactical situations. The submarine was able to close the target and execute an attack in 73.1% of the two hundred tests of the final configuration of the genetic algorithm
URI
https://hdl.handle.net/10945/26571
Collections
  • 1. Thesis and Dissertation Collection, all items

Related items

Showing items related by title, author, creator and subject.

  • Thumbnail

    Optimizing coverage and revisit time in sparse military satellite constellations a comparison of traditional approaches and genetic algorithms 

    Parish, Jason A. (Monterey, California. Naval Postgraduate School, 2004-09);
    Sparse military satellite constellations were designed using two methods: a traditional approach and a genetic algorithm. One of the traditional constellation designs was the Discoverer II space based radar. Discoverer II ...
  • Thumbnail

    Genetic algorithms in the Battlespace Terrain Reasoning and Awareness-Battle Command (Btra-Bc) battle engine 

    Maroon, Kenneth J. (Monterey, California: Naval Postgraduate School, 2009-09);
    The U.S. Army Corps of Engineers Research and Development Center's (ERDC) Battlespace Terrain Reasoning and Awareness-Battle Command (BTRA-BC) Battle Engine (BBE) is a tool that enables command staffs to semi-automate ...
  • Thumbnail

    Resource constrained scheduling problem at U.S. Naval Shipyards 

    Nawara, Terrence M. (Monterey California. Naval Postgraduate School, 2013-06);
    Submarine repair schedules are some of the most complex schedules seen in project management. Repairs of a nuclear U.S. submarine are resource constrained since resources are divided among approximately thirty shops (e.g., ...
NPS Dudley Knox LibraryDUDLEY KNOX LIBRARY
Feedback

411 Dyer Rd. Bldg. 339
Monterey, CA 93943
circdesk@nps.edu
(831) 656-2947
DSN 756-2947

    Federal Depository Library      


Start Your Research

Research Guides
Academic Writing
Ask a Librarian
Copyright at NPS
Graduate Writing Center
How to Cite
Library Liaisons
Research Tools
Thesis Processing Office

Find & Download

Databases List
Articles, Books & More
NPS Theses
NPS Faculty Publications: Calhoun
Journal Titles
Course Reserves

Use the Library

My Accounts
Request Article or Book
Borrow, Renew, Return
Tech Help
Remote Access
Workshops & Tours

For Faculty & Researchers
For International Students
For Alumni

Print, Copy, Scan, Fax
Rooms & Study Spaces
Floor Map
Computers & Software
Adapters, Lockers & More

Collections

NPS Archive: Calhoun
Restricted Resources
Special Collections & Archives
Federal Depository
Homeland Security Digital Library

About

Hours
Library Staff
About Us
Special Exhibits
Policies
Our Affiliates
Visit Us

NPS-Licensed Resources—Terms & Conditions
Copyright Notice

Naval Postgraduate School

Naval Postgraduate School
1 University Circle, Monterey, CA 93943
Driving Directions | Campus Map

This is an official U.S. Navy Website |  Please read our Privacy Policy Notice  |  FOIA |  Section 508 |  No FEAR Act |  Whistleblower Protection |  Copyright and Accessibility |  Contact Webmaster

Export search results

The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

A logged-in user can export up to 15000 items. If you're not logged in, you can export no more than 500 items.

To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.