Solving shortest circuit problem of military health support based on partheno-genetic algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

Supported by Key Research Project of “11th Five-year” of PLA(08G078).

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    ObjectiveTo propose an effective algorithm for solving the shortest circuit problem of military health support.MethodsPartheno-genetic algorithm (PGA),which only used mutation operation and selection operation,was adopted in the present study.The algorithm was based on K-random-nearer-neighbor algorithm combined with two-random-point exchange,two-neighbor-point exchange,circular-based part inversion and random insertion mutation operations.Furthermore,greedy strategy was applied in selection to improve the hill-climbing capability of PGA.ResultsThe simulation results of CTSP31 and standard dataset from TSP library indicated that the PGA was more effective than existing algorithms from the literature.ConclusionPGA can serve as a basis for further development of a computer-assisted program,and it provides optimized decision-making scheme for improving the quality and speed of military medical service disposition.

    Reference
    Related
    Cited by
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 01,2009
  • Revised:November 20,2009
  • Adopted:November 27,2009
  • Online: February 01,2010
  • Published:
Article QR Code