Loading...
Please wait, while we are loading the content...
Similar Documents
A Hybrid Algorithm of n-OPT and GA to Solve Dynamic TSP
| Content Provider | CiteSeerX |
|---|---|
| Author | Liu, Zhao Kang, Lishan |
| Abstract | Abstract. We proposed the concept dynamic traveling salesman problem (Dynamic TSP). According to the characteristics of Dynamic TSP, we used a hybrid algorithm of n-OPT and GA to solve it. 2-OPT and 3-OPT are used in GA procedures of mutation and selection. The productivity and quality of solutions under dynamic conditions are evaluated by the experiment. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Dynamic Tsp Hybrid Algorithm Salesman Problem Ga Procedure Dynamic Condition |
| Content Type | Text |
| Resource Type | Article |