Efficient heuristics for the Rural Postman Problem

Groves, G.W.; Vuuren, Jan H. van

doi:10.5784/21-1-17

Cited by 26 publications

(18 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It demonstrated significant improvement to solution quality in GRP. Groves and Vuuren in [6] proposed heuristic-based algorithms for RPP. Their simulation results show that their algorithms can provide decent solutions to RPP with relatively low computational complexities.…”

Section: Introductionmentioning

confidence: 99%

A refinement process for nozzle path planning in 3D printing

Fok

Cheng

Tse

2017

2017 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

Abstract-A refinement process for nozzle path planning in 3D printing is presented in this paper. The nozzle path planning problem is formulated as an undirected rural postman problem (URPP). Based on the unique characteristics of URPP in 3D printing applications, a new refinement process is proposed to shorten the processing time of a conventional URPP solver. Performances of the proposed refinement process is evaluated using computer simulations. Simulation results show that when comparing with other URPP solvers, solvers with the proposed process have shorter processing time and can provide solutions with shorter transition length.

show abstract

Section: Introductionmentioning

confidence: 99%

A refinement process for nozzle path planning in 3D printing

Fok

Cheng

Tse

2017

2017 IEEE International Symposium on Circuits and Systems (ISCAS)

View full text Add to dashboard Cite

show abstract

“…These improvement routines can be used as basic tools for the design of more sophisticated constructive algorithms for the RPP (see also [96]) and can easily be adapted to handle directed or mixed graphs. Another local search framework is presented in Groves and van Vuuren [91]. It also applies to the RPP some local search approaches that have been applied successfully to the TSP.…”

Section: The Undirected Rppmentioning

confidence: 99%

Recent results on Arc Routing Problems: An annotated bibliography

Corberán

Prins

2010

Networks

View full text Add to dashboard Cite

Arc routing problems are vehicle routing problems in which the tasks to be performed are located on some arcs or edges of a network, e.g., spreading salt on a road or collecting municipal refuse in a street. They have been much less studied than node routing problems but impressive developments have been achieved in the last decade. The objective of this article is to survey these recent results and to provide an annotated bibliography. Except for a few references, the period surveyed starts from the publication of the book "Arc routing: theory, solutions and applications", edited by Dror in 2000. The article is made up of two main parts: one on uncapacitated (single vehicle) problems derived from the Chinese Postman Problem, the Rural Postman Problem, and the General Routing Problem; and one on multivehicle or capacitated problems such as the Capacitated Arc Routing Problem.

show abstract

“…Note, however, that the length of this shortest path can be determined in a constant amount of time if the shortest distances from each vertex to all vertices in later layers in L is known for the untransformed solution (see Groves and van Vuuren [27] for details). This allows, for example, Two-Opt moves with O(|S| 2 ) time complexity per iteration, to be used in heuristics for the RPP (or to optimize an individual route in a constrained ARP).…”

Section: To O(|v (L)|)mentioning

confidence: 99%

On a routing and scheduling problem concerning multiple edge traversals in graphs

2005

View full text Add to dashboard Cite

Practical vehicle routing problems generally have both routing and scheduling aspects to consider. However, few heuristic methods exist that address both these complicated aspects simultaneously. We present heuristics to determine an efficient circular traversal of a weighted graph that requires a subset of its edges to be traversed, each a specified (potentially different) number of times. Consecutive time instances at which the same edge has to be traversed should additionally be spaced through a scheduling time window as evenly as possible, thus introducing a scheduling consideration to the problem. We present a route construction heuristic for the problem, based on well-known graph theoretic algorithms, as well as a route improvement heuristic, that accepts the solution generated by the construction heuristic as input and attempts to improve it in an iterative fashion. We apply the heuristics to various randomly generated problem instances, and interpret these test results.

show abstract

Efficient heuristics for the Rural Postman Problem

Cited by 26 publications

References 32 publications

A refinement process for nozzle path planning in 3D printing

A refinement process for nozzle path planning in 3D printing

Recent results on Arc Routing Problems: An annotated bibliography

On a routing and scheduling problem concerning multiple edge traversals in graphs

Contact Info

Product

Resources

About