The problem the researchers set out to solve belongs to a class known in operations research as arc routing. Unlike node routing problems, such as the famous traveling salesman problem, where the goal is to visit a set of points, arc routing requires vehicles to traverse the connections themselves, the road segments, rather than the intersections. This distinction matters enormously for winter maintenance, waste collection, street sweeping, and snow plowing, because the service is delivered along the length of each street, not at a single doorstep. The mathematical lineage of arc routing traces back to the Chinese postman problem, named by mathematician Mei-Ko Kwan in 1962, which asks for the shortest closed walk that traverses every edge of a network at least once. When the network’s edges can be served by a single vehicle with unlimited capacity, elegant polynomial-time algorithms based on matching theory, developed by Jack Edmonds and Ellis Johnson in the early 1970s, solve the problem exactly.

Reality, however, is rarely so forgiving. A salting truck carries a finite load of salt and must return to the depot to reload, which introduces capacity constraints and splits the work into multiple trips. Moreover, not every street in a city requires salting with equal urgency; major arteries and steep or high-traffic segments demand treatment, while some minor roads may be skipped or deferred. This is where the rural postman problem enters the picture. In the rural variant, only a required subset of edges must be traversed, and the vehicle may pass over non-required edges merely to connect the required ones. The rural postman problem is computationally much harder than its all-edges counterpart; it is NP-hard, meaning that no efficient exact algorithm is known for large instances, and solution quality depends on clever heuristics and metaheuristics.

The contribution of Aliogullari and colleagues is to fuse these two classical formulations into a new hybrid: the capacitated rural Chinese postman problem. In their model, vehicles depart from and return to a depot, must serve all required road segments at least once, respect the salt capacity of each vehicle, and minimize the total tour length. This combination captures the essential structure of a real salting operation far more faithfully than either parent problem alone. The capacitated Chinese postman problem, on its own, forces treatment of every street, which is wasteful when only a subset needs salt. The rural postman problem, on its own, ignores the practical reality that a truck’s hopper empties and reloads are unavoidable. By joining the two, the researchers created a model in which priority segments are guaranteed service, capacity limits dictate trip structure, and total distance is minimized.

To test the model, the team turned to Erzurum, one of the coldest major cities in Turkey, where winter road icing is a persistent and serious hazard. The application focused on the central districts of Palandöken, Aziziye, and Yakutiye, which fall under the jurisdiction of the Erzurum Metropolitan Municipality. These districts encompass the dense urban core of the city, with road networks whose salting demands fluctuate sharply with snowfall and freezing events. Mapping the actual streets onto a graph, with road segments as edges and intersections as nodes, the researchers formulated their new mathematical model over this real-world instance, turning an abstract optimization problem into a concrete planning tool for municipal engineers.

Solving such a model exactly is out of the question at city scale. The capacitated rural Chinese postman problem inherits the NP-hardness of both of its ancestors, and the number of possible route assignments grows explosively with network size. The authors therefore employed a genetic algorithm, a metaheuristic inspired by biological evolution. In a genetic algorithm, candidate solutions are encoded as individuals in a population, typically as strings resembling chromosomes. The algorithm iteratively improves the population through selection, favoring individuals whose routes are shorter; crossover, combining segments of two parent solutions to produce offspring; and mutation, randomly perturbing solutions to maintain diversity and escape local optima. Over many generations, the population converges toward high-quality routes that would be practically impossible to discover through exhaustive search.

Genetic algorithms have a long and successful history in arc routing. Previous studies have applied them to bi-objective capacitated arc routing, to mixed networks, and to multi-depot winter maintenance variants, and related approaches such as memetic algorithms, tabu search, guided local search, and ant colony optimization have all been deployed against capacitated arc routing challenges in waste collection, road marking, and city logistics. What distinguishes the new work is not the algorithmic machinery alone but the problem definition it serves. The authors report that the genetic algorithm performed well on their Erzurum instances, producing short tour routes that satisfy the model’s constraints, and they position the study as the first introduction of capacitated rural Chinese postman methods to the road salting domain, together with the new mathematical model that underpins them.

The practical implications extend well beyond one Turkish city. Municipalities worldwide spend enormous budgets on winter maintenance, and the cost of a suboptimal routing plan is measured not only in diesel and salt but in accidents, traffic delays, and public trust. A routing model that respects vehicle capacity, prioritizes required segments, and minimizes total distance can translate directly into fewer truck-hours on the road, less salt released into the environment, and faster restoration of safe driving conditions after a storm. Because the underlying framework is generic, the same model could plausibly be adapted to related services, from snow plowing to gritting to the sweeping of priority bus corridors, wherever a fleet of capacitated vehicles must cover a designated subset of a street network.

The study also contributes to a vibrant research frontier in which classical combinatorial optimization meets modern computing. Recent years have seen neural solvers with attention mechanisms applied to capacitated arc routing, Lagrangian relaxation decompositions, hybrid metaheuristics with stochastic demands, and polynomial-time solvability results for special graph structures. Against this backdrop, the Erzurum study is a reminder that progress often comes not only from faster algorithms but from sharper problem definitions that match operational reality. By carving out the capacitated rural Chinese postman problem as a distinct object of study and validating it on a genuine municipal network, the researchers have given both the operations research community and winter maintenance practitioners a new tool, and a new benchmark, for the cold months ahead.

Subject of Research: A capacitated rural Chinese postman routing model solved by genetic algorithm for road salting in winter snow removal operations

Article Title: Capacitated rural Chinese postman problem in road salting for snow removal operations

Article References: Aliogullari, E., Aydin, N., & Yilmaz, M. (2026). Capacitated rural Chinese postman problem in road salting for snow removal operations. Neural Computing and Applications, 38(17), Article 712. https://doi.org/10.1007/s00521-026-12441-0

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12441-0

Keywords: arc routing, Chinese postman problem, rural postman problem, genetic algorithm, road salting, snow removal, winter maintenance, vehicle routing, combinatorial optimization, Erzurum, metaheuristics, capacitated arc routing