Using Genetic Algorithm to Solve the Shortest Driving Time Problem and Improvement of Population Initialization
碩士 === 東海大學 === 資訊工程學系 === 98 === In this thesis we investigate the influences on the genetic algorithm of a shortest driving time problem due to factors such as nodes on a map, the population size, the mutation rate, the crossover rate, and the converging rate. When the nodes on the map increase,...
Main Authors: | Hao-Tian Zuo, 左浩天 |
---|---|
Other Authors: | Chu-Hsing Lin |
Format: | Others |
Language: | en_US |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19502145854766465880 |
Similar Items
-
An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
by: Ovidiu Cosma, et al.
Published: (2021-01-01) -
A Genetic Algorithm for Finding Routes with Shortest Driving Time in Intelligent Transportation Systems
by: Chia-Ren Li, et al.
Published: (2008) -
The Algorithm for Solving Shortest-Path Problems Based on Electrical Circuit Laws
by: Mohammad Zarei Mahmoodabadi, et al.
Published: (2011-07-01) -
A more efficient quantum algorithm for solving the shortest vector problem
by: Yanlin Chen, et al.
Published: (2016) -
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
by: Zedong Sun, et al.
Published: (2020-01-01)