Approximating the length of Chinese postman tours
نویسندگان
چکیده
This article develops simple and easy-to-use approximation formulae for the length of a Chinese Postman Problem (CPP) optimal tour on directed and undirected strongly connected planar graphs as a function of the number of nodes and the number of arcs for graphs whose nodes are randomly distributed on a unit square area. These approximations, obtained from a multi-linear regression analysis, allow to easily forecast the length of a CPP optimal tour for various practical combinations of number of arcs and nodes ranging, from 10 to 300 nodes and 15 to 900 arcs.
منابع مشابه
Matching, Euler tours and the Chinese postman
The solution of the Chinese postman problem using matching theory is given. The convex hull of integer solutions is described as a linear programming polyhedron. This polyhedron is used to show that a good algorithm gives an optimum solution. The algorithm is a specialization of the more general b-matching blossom algorithm. Algorithms for finding Euler tours and related problems are also discu...
متن کاملPostman tours and cycle covers
Raspaud, A., Postman tours and cycle covers, Discrete Mathematics 111 (1993) 447-454. Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most IF(G)1 + 1 k’(G)1 3 and that, if G is a minimally 2-edge connected graph, then the length is at most 21 V(G)l-2. We then deduce results concerning the length of a shortest cycle cover for graphs containing no subdivision...
متن کاملCapacitated Windy Rural Postman Problem with Several Vehicles: A Hybrid Multi-Objective Simulated Annealing Algorithm
This paper presents the capacitated Windy Rural Postman Problem with several vehicles. For this problem, two objectives are considered. One of them is the minimization of the total cost of all vehicle routes expressed by the sum of the total traversing cost and another one is reduction of the maximum cost of vehicle route in order to find a set of equitable tours for the vehicles. Mathematical ...
متن کاملNew facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem
In this paper the Min-Max version of the Windy Rural Postman Problem with several vehicles is introduced. For this problem, in which the objective is to minimize the length of the longest tour in order to find a set of balanced tours for the vehicles, we present here an ILP formulation and study its associated polyhedron. Based on its partial description, a branch-and-cut algorithm has been imp...
متن کاملOn the optimality of a simple strategy for searching graphs
Consider a search game with an immobile hider in a graph. A Chinese postman tour is a closed trajectory which visits all the points of the graph and has minimal length. We show that encircling the Chinese postman tour in a random direction is an optimal search strategy if and only if the graph is weakly Eulerian (i.e it consists of several Eulerian curves connected in a tree-like structure).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- 4OR
دوره 12 شماره
صفحات -
تاریخ انتشار 2014