To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
The Minimum Latency Problem: A Hybrid Genetic Algorithm |
|
Author |
Zakir Hussain Ahmed |
| Citation |
Vol. 18 No. 11 pp. 153-158 |
|
Abstract |
This paper presents a hybrid genetic algorithm to solve the minimum latency problem (MLP). The problem is a variation of the well-known travelling salesman problem (TSP) in which sum of arrival times at the nodes is minimized. The problem arises in many real-life applications such as logistics for relief supply, scheduling and data retrieval in computer networks. The computational results on TSPLIB instances show the efficiency of our proposed algorithm. Finally, a comparative study is carried out against an existing state-of-art algorithm to establish the goodness of our algorithm. The study shows the effectiveness of our proposed hybrid algorithm. |
|
Keywords |
Minimum latency problem hybrid genetic algorithm local search NP-hard sequential constructive crossover. |
|
URL |
