Improvement Procedures for the Undirected Rural Postman Problem

Authors:
Alain Hertz;Gilbert Laporte;Pierrette Nanchen Hugo
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
1999

Citing 0
Cited 16

New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A heuristic for the periodic rural postman problem

Computers and Operations Research
New heuristic algorithms for the windy rural postman problem

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A tabu search algorithm for the min-max k-Chinese postman problem

Computers and Operations Research
A constructive heuristic for the undirected rural postman problem

Computers and Operations Research
Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem

Operations Research
A Solution to the Rural Postman Problem Based on Artificial Ant Colonies

Current Topics in Artificial Intelligence
Rank-Based Ant System to Solve the Undirected Rural Postman Problem

IWANN '09 Proceedings of the 10th International Work-Conference on Artificial Neural Networks: Part II: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living
The Clustered Prize-Collecting Arc Routing Problem

Transportation Science
Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration

Computers and Operations Research
New heuristic algorithms for the windy rural postman problem

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
A dynamic path planning approach for multi-robot sensor-based coverage considering energy constraints

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Energy constrained multi-robot sensor-based coverage path planning using capacitated arc routing approach

Robotics and Autonomous Systems
The Windy Clustered Prize-Collecting Arc-Routing Problem

Transportation Science
Capacitated arc routing problem with deadheading demands

Computers and Operations Research
An ILS-Based metaheuristic for the stacker crane problem

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality solutions.