Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Chinese Postman"”.
-
Public sector vehicle routing : the Chinese postman problem.
Massachusetts Institute of Technology. Dept. of Electrical Engineering. Thesis. 1970. M.S.
-
Matchings, Connectivity, and Eigenvalues in Regular Graphs
… problems for regular graphs, including the Chinese postman problem, the path cover number, the average edge-connectivity, and the number of perfect matchings. In Chapter 5, we study an $r$-dynamic coloring problem and give the relationship between the $r$-dynamic chromatic number and the …
-
Route Optimization for Automated Bridge Inspection with Genetic Algorithm
… This task maps well to the NP-Hard Min-Max k-Chinese Postman Problem (MM k-CPP), which is part of the family of Arc Routing Problems (ARPs). These represent a broad class of problems wherein the goal is to traverse every edge of a graph in the most optimal fashion, under some set of …
-
Wireless sensor network aided search and rescue in trails
… The algorithms are developed based on solving Chinese Postman problems. Next, we present extensive experimental results to compare the performances of different methods and examine the accuracy of the mathematical models. A very fast heuristic method, divide-merge, is shown to outperform all …
-
Contributions to Multiple Postmen Problems
… problems, where the aim is to find a set of postman tours (each starting and ending at a post office) for k >= 2 postmen. We consider the Min-Max k-Chinese Postman Problem (MM k-CPP) where, given a street network, the objective is to cover each street by at least one postman tour while …