Approximate solutions for the maximum benefit Chinese postman problem

International Journal of Systems Science

Volumn 36, Issue 13, 2005, Pages 815-822

  Pearn, W L ^a   Chiu, W C ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Algorithms; Approximate solutions; Maximum Benefit Chinese Postman Problem

Indexed keywords

APPROXIMATION THEORY; COSTS; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; SYSTEMS SCIENCE; TREES (MATHEMATICS);

APPROXIMATE SOLUTIONS; MAXIMUM BENEFIT CHINESE POSTMAN PROBLEM (MBCPP); REAL-WORLD APPLICATIONS;

ALGORITHMS;

EID: 30344477677     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/00207720500282292     Document Type: Article

References (21)

1. A. Assad and B. Golden, "Arc routing methods and applications", in Network Routing Handbooks in OR & MS, Vol. 8, Amsterdam: Elsevier Science, 1995.
2. A.A. Assad, W.L. Pearn and B.L. Golden, "The capacitated Chinese postman problem: lower bounds and solvable cases", Am. J. Math. Manag. Sci., 7, pp. 63-88, 1987.
3. N. Christofides, V. Campos, A. Corberan and E. Mota, "An algorithm for the rural postman problem", in Imperial College Report IC-OR, 1981.
4. M. Dror, Arc Routing. Theory, Solutions and Applications. Boston, MA: Kluwer Academic, 2000.
5. M. Dror, H. Stern and P. Trudeau, "Postman tour on a graph with precedence relation on arcs", Networks, 17, pp. 283-294, 1987.
6. J. Edmonds and E.L. Johnson, "Matching, Euler tours and the Chinese postman", Math. Program., 5, pp. 88-124, 1973.
7. H.A. Eiselt, M. Gendgreau and G. Laporte, "Arc routing problems, part 1: the Chinese postman problem", Oper. Res., 43, pp. 231-242, 1995a.
8. H.A. Eiselt, M. Gendreau and G. Laporte, "Arc routing problems, part 2: the rural postman problem", Oper. Res., 43, pp. 399-414, 1995b.
9. G. Ghiani and G. Improta, "An algorithm for the hierarchical Chinese postman problem", Oper. Res. Lett., 26, pp. 27-32, 2000.
10. B. Golden and R. Wong, "Capacitated arc routing problems", Networks, 11, pp. 305-315, 1981.
11. C. Malandraki and M.S. Daskin, "The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem", Eur. J. Oper. Res., 65, pp. 218-234, 1993.
12. W.L. Pearn, "New lower bounds for the capacitated arc routing problem", Networks, 18, pp. 181-191, 1988.
13. W.L. Pearn, "Approximate solutions for the capacitated arc routing problem", Comput. Oper. Res., 16, pp. 589-600, 1989.
14. W.L. Pearn, "Augment-Insert algorithms for the capacitated arc routing problem", Comput. & Oper. Res., 18, pp. 189-198, 1991.
15. W.L. Pearn, "Solvable cases of the k-person Chinese postman problem", Oper. Res. Lett., 16, pp. 241-244, 1994.
16. W.L. Pearn, A.A. Assad and B.L. Golden, "Transforming arc routing into node routing problem", Comput. Oper. Res., 14, pp. 285-288, 1987.
17. W.L. Pearn and J.B. Chou, "Improved solutions for the Chinese postman problem on mixed networks", Comput. Oper. Res., 26, pp. 819-827, 1999.
18. W.L. Pearn and M.L. Li, "Algorithms for the windy postman problem", Comput. Oper. Res., 21, pp. 641-651, 1994.
19. W.L. Pearn and C.M. Liu, "Algorithms for the Chinese postman problem on mixed networks", Comput. Oper. Res., 22, pp. 479-489, 1995.
20. W.L. Pearn and K.H. Wang, "On the maximum benefit Chinese postman problem", OMEGA, Int. J. Manag. Sci., 31, pp. 269-273, 2003.
21. W.L. Pearn and T.C. Wu, "Algorithms for the rural postman problem", Comput. Oper. Res., 22, pp. 819-823, 1995.