Abstract
The hierarchical Chinese postman problem (HCPP), a variant of the Chinese postman problem, is an arc routing problem. HCPP is NP-hard and several methods have been developed to solve this problem. Many studies in the literature have taken the minimum distance covered between nodes into consideration. All of these studies ignore time-dependent travel speeds between two locations. Travel speeds (and time) in almost all metropolitan areas change drastically during the day due to a variety of different factors, such as weather condition, peak traffic hours and accidents, along with the distance. Spending minimum time to travel streets is of great importance to ensure traffic flow and road safety, particularly in many practical implementation areas of HCPP, such as snow plowing winter, garbage collection and routing security patrol vehicles. This study introduces a new problem called the time-dependent hierarchical Chinese postman problem that aims to minimize the total travel time, while obeying precedence relationships between edges. This problem differs from most arc routing problems because the duration of traversing a street changes depending on the time of day. The problem was formulated as a mixed integer linear programme. Two metaheuristics were built: a genetic algorithm (GA) and a hybrid simulated annealing (hSA). The proposed model and metaheuristics were tested on modified benchmark instances and randomly generated problem instances with as many as 490 edges. The performance of GA and hSA were compared in terms of solution quality and computational time.
Similar content being viewed by others
References
Albiach J, Sanchis J, Soler D (2008) An asymetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation. Eur J Oper Res 189:789–802
Alfa AS, Liu DQ (1988) Postman routing problem in a hierarchical network. Eng Optim 14:127–138
Arakaki RK, Usberti FL (2018) Hybrid genetic algorithm for the open capacitated arc routing problem. Comput Oper Res 90:221–231
Black D, Eglese R, Wøhlk S (2013) The time-dependent prize-collection arc routing problem. Comput Oper Res 40:526–535
Cabral EA, Gendreau M, Ghiani G, Laporte G (2004) Solving the hierarchical Chinese postman problem as a rural postman problem. Eur J Oper Res 155:44–50
Cerny V (1985) Thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm. J Optim Theory Appl 45(1):41–51
Cordeau JF, Ghiani G, Guerriero E (2014) Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Transp Sci 48:46–58
Damodaran P (1997) A methodology for dynamic planning of road service during a snow fall. M.S. Thesis, Northern Illinois University, DeKalb, IL
Damodaran P, Krishnamurthi M, Srihari K (2008) Lower bounds for Hierarchical Chinese postman problem. Int J Ind Eng 15:36–44
Dhein G, Araújo OCB, Cardoso G (2018) Genetic local search algorithm for a new bi-objective arc routing problem with profit collection and dispersion of vehicles. Expert Syst Appl 92:276–288
Dror M, Stern H, Trudeau P (1987) Postman tour on a graph with precedence relation on arcs. Networks 17:283–294
Fan H, Wang WY (2002) Time-constrained Chinese postman problems. Comput Math Appl 44:375–387
Gaafar LK, Masoud SA (2005) Genetic algorithms and simulated annealing for scheduling in agile manufacturing. Int J Prod Res 43(14):3069–3085
Ghiani G, Improta G (2000) An algorithm for the hierarchical Chinese postman problem. Oper Res Lett 26:27–32
Glover F, Kochenberger GA (2003) Handbook of metaheuristics, chapter 10. Kluwer Academic Publishers, Dordrecht, pp 287–291
Hart E, Ross P, Corne D (2005) Evolutionary scheduling: a review. Genet Program Evolvable Mach 6:191–220
Harwood K, Mumford C, Eglese R (2013) Investigating the use of metaheuristics for solving single vehicle routing problems with time varying traversal costs. J Oper Res Soc 64:34–47
Helvig C, Robins G, Zelikovsky A (2003) The moving-target travelling salesman problem. J Algorithms 49:153–174
Hill AV, Benton WC (1992) Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. J Oper Res Soc 43:343–351
Hua J, Li-shan K (2003) Genetic algorithm for Chinese postman problems. Wuhan Univ J Nat Sci 8(1):316–318
Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144:379–396
Ishibuchi H, Misaki S, Tanaka H (1995) Modified simulated annealing algorithms for the flow shop sequencing problem. Eur J Oper Res 81:388–398
Jiang Q, Sarker R, Abbass H (2005) Tracking moving targets and the non-stationary traveling salesman problem. Complexity 11:171–179
Jiang H, Kang L, Zhang S, Zhu F (2010) Genetic algorithm for mixed Chinese postman problem. In: 5th International Symposium, ISICA 2010, Wuhan China, October 22–24, Proceedings, pp 193–199
Jung S, Haghani A (2001) Genetic algorithm for the time-dependent vehicle routing problem. Transp Res Rec J Transp Res Board 1771:164–171
Kirkpatrick S, Gelatt JRCD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671–680
Korteweg P, Volgenant T (2006) On the hierarchical Chinese postman problem with linear ordered classes. Eur J Oper Res 169:41–52
Kumar SN, Panneerselvam R (2015) A time-dependent vehicle routing problem with time windows for e-commerce supplier site pickups using genetic algorithm. Intell Inf Manag 7:181–198
Lacomme P, Prins C, Sevaux M (2006) A genetic algorithm for a bi-objective capacitated arc routing problem. Comput Oper Res 33(12):3473–3493
Lemieux PF, Campagna L (1984) The snow ploughing problem solved by a graph theory algorithm. Civ Eng Syst 1:337–341
Ma YH, Tian GL, Li X (2015) Genetic algorithm for the capacitated Chinese postman problem on mixed networks. Appl Mech Mater 701:44–49
Maden W, Eglese R, Black D (2009) Vehicle routing and scheduling with time-varying data: a case study. J Oper Res Soc 61:515–522
Malandraki C (1989) Time dependent vehicle routing problems: formulations, solution algorithms and computational experiments. Ph.D. dissertation, Northwestern University, Evanston, IL
Malandraki C, Daskin M (1992) Time dependent vehicle routing problems: formulations, properties, and heuristic algorithms. Transp Sci 26:185–200
Mohammed MA, Ghani MKA, Hamed RI, Mostafa SA, Ahmad MS, Ibrahim DA (2017) Solving vehicle routing problem by using improved genetic algorithm for optimal solution. J Comput Sci 21:255–262
Moon C, Kim J, Choi G, Seo Y (2002) An efficient genetic algorithm for the travelling salesman problem with precedence constraints. Eur J Oper Res 140:606–617
Moreira MR, Ferreira JS (2010) A genetic algorithm for the undirected rural postman problem. https://www.semanticscholar.org
Morgan MJW, Mumford CL (2009) A weight-coded genetic algorithm for the capacitated arc routing problem. In: Proceedings of the 11th annual conference on Genetic and evolutionary computation, Montreal, Québec, Canada, 8–12 July, New York, pp 325–332
Mukhairez HHA, Maghari AYA (2015) Performance comparison of simulated annealing, GA and ACO applied to TSP. Int J Intell Comput Res 6(4):647–654
Rabbani M, Alamdar SF, Farrokhi-Asl H (2016) Capacitated windy rural postman problem with several vehicles: a hybrid multi-objective simulated annealing algorithm. Int J Supply Oper Manag 2(4):1003–1020
Razali NM (2015) An efficient genetic algorithm for large scale vehicle routing problem subject to precedence constraints. Proc Soc Behav Sci 195:1922–1931
Samadi-Dana S, Paydar MM, Jouzdani J (2017) A simulated annealing solution method for robust school bus routing. Int J Oper Res 28(3):307–326
Sayata UB, Desai NP (2015) An algorithm for Hierarchical Chinese postman problem using minimum spanning tree approach based on Kruskals’s algorithm. In: Souvenir of the 2015 IEEE International Advance Computing Conference, IACC 7154702, pp 222–227
Schneider J (2002) The time-dependent travelling salesman problem. Physica A 314:151–155
Sun J, Tan G, Hou G (2011a) A new integer programming formulation for the Chinese postman problem with time dependent travel times. World Acad Sci Eng Technol Int J Comput Inf Eng 5(4):410–414
Sun J, Tan G, Qu H (2011b) Dynamic programming algorithm for the time dependent Chinese Postman Problem. J Inf Comput Sci 8(5):833–841
Sun J, Meng Y, Tan G (2015) An integer programming approach for the Chinese postman problem with time-dependent travel time. J Comb Optim 29(3):565–588
Tagmouti M, Gendreau M, Potvin JY (2007) Arc routing problems with time-dependent service costs. Eur J Oper Res 181:30–39
Tagmouti M, Gendreau M, Potvin JY (2010) A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Comput Ind Eng 59:954–963
Tagmouti M, Gendreau M, Potvin JY (2011) A dynamic capacitated arc routing problems with time dependent service costs. Transp Res Part C Emerg Technol 19:20–28
Tirkolaee EB, Alinaghian M, Sasi MB, Esfahani MS (2016) Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: a waste collection application. J Ind Eng Manag Stud 3(1):61–76
Verbeeck C, Sörensen K, Aghezzaf EH, Vansteenwegen P (2014) A fast solution method for the time dependent orienteering problem. Eur J Oper Res 236:419–432
Wang L, Zheng DZ (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21:38–44
Wøhlk S (2015) Simulated annealing for the capacitated arc routing problem, using an online formulation. https://www.researchgate.net/publication/242091823
Yu VF, Lin SW (2015) Iterated greedy heuristic for the time-dependent prize-collection arc routing problem. Comput Ind Eng 90:54–66
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kayacı Çodur, M., Yılmaz, M. A time-dependent hierarchical Chinese postman problem. Cent Eur J Oper Res 28, 337–366 (2020). https://doi.org/10.1007/s10100-018-0598-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-018-0598-8