Heuristics for a dynamic rural postman problem

Authors:
Luís M. Moreira;José F. Oliveira;A. Miguel Gomes;J. Soeiro Ferreira
Affiliations:
INESC Porto - Instituto de Engenharia de Sistemas e Computadores do Porto, Portugal;INESC Porto - Instituto de Engenharia de Sistemas e Computadores do Porto, Portugal and FEUP - Faculdade de Engenharia da Universidade do Porto, Portugal;INESC Porto - Instituto de Engenharia de Sistemas e Computadores do Porto, Portugal and FEUP - Faculdade de Engenharia da Universidade do Porto, Portugal;INESC Porto - Instituto de Engenharia de Sistemas e Computadores do Porto, Portugal and FEUP - Faculdade de Engenharia da Universidade do Porto, Portugal
Venue:
Computers and Operations Research
Year:
2007

Citing 3
Cited 4

Modeling and solving several classes of arc routing problems as traveling salesman problems

Computers and Operations Research
A heuristic algorithm based on Monte Carlo methods for the rural postman problem

Computers and Operations Research
Hybridising Tabu Search with Optimisation Techniques for Irregular Stock Cutting

Management Science

Lower bounds for the mixed capacitated arc routing problem

Computers and Operations Research
An evolutionary approach to the multidepot capacitated arc routing problem

IEEE Transactions on Evolutionary Computation
The open capacitated arc routing problem

Computers and Operations Research
GRASP with evolutionary path-relinking for the capacitated arc routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper presents a very special cutting path determination problem appearing in a high precision tools factory, and provides two new heuristics for its resolution. Particular features of both the cutting process, and of the material to be cut, bring in a set of unusual constraints, when compared with other cutting processes, which confer additional complexity and originality to the problem. In particular, this is a matter of practical and economic relevance, since the solution methods are intended to be implemented in a real-life industrial environment. The concept of dynamic graph is exploited to deal with the arc routing problem under study, which is modelled as a dynamic rural postman problem. The constructive heuristics developed, the ''higher up vertex heuristic'' (HUV) and the ''minimum empty path heuristic'' (MEP) are tested with real data sets.