Improved genetic algorithm for minimum latency problem

Authors:
Ban Ha Bang;Nguyen Duc Nghia
Affiliations:
Hanoi University of Technology, Hai Ba Trung Dist., Hanoi, Vietnam;Hanoi University of Technology, Hai Ba Trung Dist., Hanoi, Vietnam
Venue:
Proceedings of the 2010 Symposium on Information and Communication Technology
Year:
2010

Citing 10
Cited 0

The minimum latency problem

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation schemes for minimum latency problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An improved approximation ratio for the minimum latency problem

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
P-Complete Approximation Problems

Journal of the ACM (JACM)
Preventing premature convergence to local optima in genetic algorithms via random offspring generation

IEA/AIE '99 Proceedings of the 12th international conference on Industrial and engineering applications of artificial intelligence and expert systems: multiple approaches to intelligent systems
Faster approximation algorithms for the minimum latency problem

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Genetic Algorithms for the Traveling Salesman Problem

Proceedings of the 1st International Conference on Genetic Algorithms
Paths, Trees, and Minimum Latency Tours

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Exact algorithms for the minimum latency problem

Information Processing Letters
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Minimum Latency Problem (MLP), also known as traveling repairman problem, in general case, is proved to be NP--hard. This paper presents several new techniques based on the scheme of the genetic algorithm for solving MLP. The experimental results on the proposed algorithm show that it gives the approximation ratio which is about 1.9 times higher than the lower bound on the optimal solution.