Heuristic Algorithms for Rural Postman Problems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 9, pp. 2414-2421, Sep. 1999
10.3745/KIPSTE.1999.6.9.2414,   PDF Download:

Abstract

This paper proposes two kinds of heuristic algorithms for Rural Postman Problems (RPPs). One is a Simulated Annealing(SA) algorithm for RPSs. In SA, we propose a new cooling schedule which affects the performance of SA. The other is a Genetic Algorithm(GA) for RPPs. In GA, we propose a chromosome structure for RPPs which are edge-oriented problems. In simulations, we compared the proposed methods with the existing methods and the results show that the proposed methods produced better results than the existing methods.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. M. Ju and H. C. Geun, "Heuristic Algorithms for Rural Postman Problems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 9, pp. 2414-2421, 1999. DOI: 10.3745/KIPSTE.1999.6.9.2414.

[ACM Style]
Kang Myung Ju and Han Chi Geun. 1999. Heuristic Algorithms for Rural Postman Problems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 9, (1999), 2414-2421. DOI: 10.3745/KIPSTE.1999.6.9.2414.