Browse > Article

Developing Meta heuristics for the minimum latency problem  

Yang, Byoung-Hak (Department of Industrial Engineering, Kyungwon University)
Publication Information
Journal of the Korea Safety Management & Science / v.11, no.4, 2009 , pp. 213-220 More about this Journal
Abstract
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.
Keywords
Minimum latency problem; Meta heuristic;
Citations & Related Records
Times Cited By KSCI : 4  (Citation Analysis)
연도 인용수 순위
1 De Castro, LN., FJ. Von Zuben. 'Artificial immune systems, Part 1, Basic theory and applications.' Technical Report, TR-DCA (1999)
2 Sahni, S., T. Gonzalez. ' P-complete approximation problems.' Journal of the Association for Computing Machinery 23 (1976) : 555-565   DOI   ScienceOn
3 Simchi-Levi, D., O. Berman. 'Minimizing the total flow time of n jobs on a network.' IIE Transactions 23 (1991) : 236-244   DOI   ScienceOn
4 Yang, B. ' A clonal selection algorithm using the rolling planning and an Extended Memory cell for the Inventory routing problem,' Korean Management Science review 26(1), (2009) : 171-182   과학기술학회마을   ScienceOn
5 Yang, B., AB. Badiru. 'An population management genetic algorithm on coordinated scheduling problem between suppliers and manufacture,' Journal of the Korea Safety Management and Science 11(3), (2009) : 131-138
6 Boudia, M, C. Prins. 'A memetic algorithm with dynamic population management for an integrated production-distribution problem.' European Journal of operational Research 195 (2009) : 703-715   DOI   ScienceOn
7 Yang, B. 'A Vehicle Routing Problem In the Vendor Managed Inventory System,' Journal of the Korea Safety Management and Science 10(3), (2008) : 217-225
8 Fischetti, M., G. Laporte, S. Martello. 'The delivery man problem and cumulative matroids.' Operations Research 41 (6) (1993) : 1055-1064   DOI   ScienceOn
9 Arora, S., G. Karakostas. 'Approximation schemes for minimum latency problem.' SIAM Journal of computing, 32(5) (2003) : 1317-1337   DOI   ScienceOn
10 Sorensen, K., M. Sevaux. 'MA|PM: Memetic algorithms with population management.' Computers and Operations Research 33 (2006) : 1214-1225   DOI   ScienceOn
11 Goemans, M., J. Kleinberg. 'An improved approximation ratio for the minimum latency problem.' Mathematical Programming 82 (1998) : 111-124   DOI
12 Mendez-Diaz, I., P. Zabala, A. Lucena. 'A newformulation for the travelling deliveryman problem.' Discreate Applied Mathematics 156 (2008) : 3223-3237   DOI   ScienceOn
13 Yang, B. 'Introduction to a Novel Optimization Method: Artificial Immune Systems,' IE Interfaces 20(4), (2007) : 458-468
14 Webb, IR., 'Depth-first solutions for the deliveryman problem on tree-like networks: An evaluation using a permutation.' LNCS 2368 (2002) : 190-199   DOI   ScienceOn