Journal of the Korea Safety Management & Science (대한안전경영과학회지)

Korea Safety Management & Science (대한안전경영과학회)
권호 표지

Developing Meta heuristics for the minimum latency problem

대기시간 최소화 문제를 위한 메타 휴리스틱 해법의 개발

  • 양병학 (경원대학교 산업시스템공학과)
  • Received : 2009.10.07
  • Accepted : 2009.12.10
  • Published : 2009.12.30
Download PDF
⟨ Previous Next ⟩

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

References

  1. Arora, S., G. Karakostas. 'Approximation schemes for minimum latency problem.' SIAM Journal of computing, 32(5) (2003) : 1317-1337 https://doi.org/10.1137/S0097539701399654
  2. 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 https://doi.org/10.1016/j.ejor.2007.07.034
  3. De Castro, LN., FJ. Von Zuben. 'Artificial immune systems, Part 1, Basic theory and applications.' Technical Report, TR-DCA (1999)
  4. Fischetti, M., G. Laporte, S. Martello. 'The delivery man problem and cumulative matroids.' Operations Research 41 (6) (1993) : 1055-1064 https://doi.org/10.1287/opre.41.6.1055
  5. Goemans, M., J. Kleinberg. 'An improved approximation ratio for the minimum latency problem.' Mathematical Programming 82 (1998) : 111-124 https://doi.org/10.1007/BF01585867
  6. Mendez-Diaz, I., P. Zabala, A. Lucena. 'A newformulation for the travelling deliveryman problem.' Discreate Applied Mathematics 156 (2008) : 3223-3237 https://doi.org/10.1016/j.dam.2008.05.009
  7. Sahni, S., T. Gonzalez. ' P-complete approximation problems.' Journal of the Association for Computing Machinery 23 (1976) : 555-565 https://doi.org/10.1145/321958.321975
  8. Simchi-Levi, D., O. Berman. 'Minimizing the total flow time of n jobs on a network.' IIE Transactions 23 (1991) : 236-244 https://doi.org/10.1080/07408179108963858
  9. Sorensen, K., M. Sevaux. 'MA|PM: Memetic algorithms with population management.' Computers and Operations Research 33 (2006) : 1214-1225 https://doi.org/10.1016/j.cor.2004.09.011
  10. Webb, IR., 'Depth-first solutions for the deliveryman problem on tree-like networks: An evaluation using a permutation.' LNCS 2368 (2002) : 190-199 https://doi.org/10.1287/trsc.30.2.134
  11. Yang, B. 'Introduction to a Novel Optimization Method: Artificial Immune Systems,' IE Interfaces 20(4), (2007) : 458-468
  12. 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
  13. 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
  14. 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