Please use this identifier to cite or link to this item:
Title: Heuristics for a dynamic rural postman problem
Authors: José Soeiro Ferreira
António Miguel Gomes
Luís Miguel Moreira
José Fernando Oliveira
Issue Date: 2007
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.
metadata.dc.type: article
Appears in Collections:CESE - Articles in International Journals

Files in This Item:
File Description SizeFormat 
  Restricted Access
351.43 kBAdobe PDFView/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.