Filters

2003 - 20042
Reset filters

Settings

Subject: genetic algorithmsWoS Q: Q2

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    Article
    Citation - WoS: 7
    Citation - Scopus: 10
    Optimizing the Performance of Single-Mode Laser Diode System Using Genetic Algorithm
    (Elsevier Sci Ltd, 2004) Aydin, E; Aydın, Elif; Yildirim, R; Aydın, Elif; Department of Electrical & Electronics Engineering; Department of Electrical & Electronics Engineering
    In this correspondence, micro-genetic algorithm (MGA) application results for optimizing the performance of electronic feedback of a laser diode are presented. The goal of optimization is to find the maximum bandwidth of the laser diode with electronic feedback used in fiber optic digital communication. A numerical analysis of the system theory of the single-mode laser diode to obtain numerical results of the gain, the Pulse response, and the harmonic distortion for electronic feedback is also presented. The dependence of the system gain on the feedback gain and delay is examined. The Pulse response is studied and it is shown that a transmission rate over 1 Gbyte/s can be achieved. (C) 2003 Elsevier Ltd. All rights reserved.
  • Thumbnail Image
    Article
    Citation - WoS: 11
    Citation - Scopus: 13
    An Evolutionary Approach for the Target Allocation Problem
    (Palgrave Publishers Ltd, 2003) Erdem, E; Ozdemirel, NE
    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.