대기시간 최소화 문제를 위한 메타 휴리스틱 해법의 개발 Developing Meta heuristics for the minimum latency problem
양병학
- 언어KOR
- URLhttp://db.koreascholar.com/Article/Detail/245735
대한안전경영과학회지
제11권 제4호
(2009.12)
pp.213-220
pp.213-220
대한안전경영과학회
(Korea Safety Management & Science)
초록
The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.
저자