Presentation is loading. Please wait.

Presentation is loading. Please wait.

Company LOGO Searching Solutions of C-TSP Harbin Institute of Technology Lecturer: HUA Dingguo Tutor: YAN Jihong Utilizing GA.

Similar presentations


Presentation on theme: "Company LOGO Searching Solutions of C-TSP Harbin Institute of Technology Lecturer: HUA Dingguo Tutor: YAN Jihong Utilizing GA."— Presentation transcript:

1 Company LOGO Searching Solutions of C-TSP Harbin Institute of Technology Lecturer: HUA Dingguo Tutor: YAN Jihong Utilizing GA

2 Contents GA Introduction 2 Searching Result 4 Definition of C-TSP 31 Searching Process 33 References 5

3 1. Definition of C-TSP  What is C-TSP?  C-TSP: China Travelling Salesman Problem  Cities: 31 cities including [1] Beijing, Shanghai, Tientsin, Shijiazhuang, Taiyuan, Hohhot, Shenyang, Changchun, Harbin, Sian, Lanzhou, Yinchuan, Xining, Urumqi, Jinan, Nanking, Hangzhou, Hefei, Nanchang, Foochow, Taipei, Chengchow, Wuhan, Changsha, Canton, Nanning, Haikou, Chengdu, Guiyang, Kunming, Lhasa

4 1. Definition of C-TSP  Starting point:  Beijing  Destination:  Back to Beijing  Constraint:  Every city has to be visited  Every city except Beijing can be visited for ONLY ONCE  Searching Target:  The shortest travelling path

5 Straight-Line Path Only straight- line path is considered for the simplicity of the problem Direct Arrival Direct arrival can be realized between any 2 of the 31 cities Assumptions 1. Definition of C-TSP

6 2. GA Introduction Inverse Mutation Mutation Distance related FitnessEvaluation Roulette Selection Oder Crossover Crossover Population Near-Optimal Solution

7 2.1 Population & Encode  Population:  The scale of initial population is very crucial to the performance of GA;  If the scale is too small, the diversity is not guaranteed;  If the scale is too large, the computing is hence time consuming;  The scale is finally determined as 500 Problem Scale Relatively Small

8 2.1 Population & Encode  Encode  Since the cities can be denoted as integers 1-Beijing; 2-Shanghai; 3- Tientsin …  Every chromosome can be encoded in the form of integer string of 1 to 31 which is arranged in a random order  Example 

9 2.2 Fitness Evaluation Distance is the major concern of C-TSP the fitness value of one chromosome can be calculated as follows: First, a pseudo fitness value f is obtained by Eq. 1 Second, Fitness value F can be obtained through linear fitness scaling f F average Eq. 1

10 2.3 GA Operators Selection Operator one Roulette

11 2.3 GA Operator Crossover Order Crossover Operator two

12 2.3 GA Operator Crossover Order Crossover Operator two x- 3- x- 5- x-10- x x x- x- x- x x

13 2.3 GA Operator Mutation Inverse Mutation Operator three

14 3 Searching Process The 100 th Generation

15 3 Searching Process The 500 th Generation

16 3 Searching Process The 1000 th Generation

17 3 Searching Process Evolution G 1000 G 500 G 200 G 100

18 4 Searching Result 试验次数最优旅行路线距离 /kilometer 获得代数

19 4 Searching Result The Near Optimal Solution obtained by Hopfield Artificial Neural Networks is Kilometers [1] GA found 6 better solutions ! In 10 experiments The best is Kilometers !

20 4 Searching Result Near-Optimal solution obtained by Hopfield ANN

21 4 Searching Result Near-Optimal solution obtained by GA

22 References [1]JIN Pan, FAN Junbo, TAN Yongdong. Neural Networks and Neural Computer: Theory · Application [M]. Chengdu: Southwest Jiaotong University Press, 1991:

23 Company LOGO Harbin Institute of Technology


Download ppt "Company LOGO Searching Solutions of C-TSP Harbin Institute of Technology Lecturer: HUA Dingguo Tutor: YAN Jihong Utilizing GA."

Similar presentations


Ads by Google