Heuristics for a dynamic rural postman problem

Computers and Operations Research

Volumn 34, Issue 11, 2007, Pages 3281-3294

  Moreira, Luís M ^a   Oliveira, José F ^a,b   Gomes, A Miguel ^a,b   Ferreira, J Soeiro ^a,b  

^a UNIVERSITY OF PORTO   (Portugal)

^b UNIVERSITY OF PORTO   (Portugal)

Author keywords

Arc routing problems; Combinatorial optimization; Dynamic rural postman problem; Heuristics

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINT THEORY; CUTTING; GRAPHIC METHODS; INDUSTRIAL MANAGEMENT;

ARC ROUTING PROBLEMS; DYNAMIC RURAL POSTMAN PROBLEMS; PRECISION TOOLS;

HEURISTIC METHODS;

EID: 34047124143     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.12.008     Document Type: Article

References (18)

1. Dowsland K.A., and Dowsland W.B. Solution approaches to irregular nesting problems. European Journal of Operational Research 84 (1995) 506-521
2. Gomes A.M., and Oliveira J.F. A 2-exchange heuristic for nesting problems. European Journal of Operational Research 141 2 (2002) 359-370
3. Oliveira J.F., Gomes A.M., and Ferreira J.S. Topos-a new constructive algorithm for nesting problems. Operations Research Spektrum 22 (2000) 263-284
4. Bennel J.A., and Dowsland K.A. Hybridising tabu search with optimisation techniques for irregular stock cutting. Management Science 47 8 (2001) 1160-1172
5. Udi Manber, and Sharat Israni. Pierce point minimization and optimal torch path determination in flame cutting. Journal of Manufacturing Systems 3 1 (1984) 81-89
6. Garfinkel R.S., and Webb I.R. On crossings, the crossing postman problem, and the rural postman problem. Networks 34 (1999) 173-180
7. Ghiani G., and Improta G. The laser-plotter beam routing problem. Journal of the Operational Research Society 52 (2001) 945-951
8. Wangdahl G.E., Pollock S.M., and Woodware J.B. Minimum-trajectory pipe routing. Journal of Ship Research 18 (1974) 46-49
9. Moreira LM. Cutting path determination in a high precision tool factory (in portuguese). Master's thesis, Escola de Gestão do Porto, Universidade do Porto, Portugal; 2001.
10. Eiselt H.A., Gendreu M., and Laporte G. Arc routing problems, PART I: the chinese postman problem. Operations Research 43 2 (1995) 231-242
11. Eiselt H.A., Gendreu M., and Laporte G. Arc routing problems, PART II: the rural postman problem. Operations Research 43 3 (1995) 399-414
12. Eglese R.W., and Murdock H. Routing road sweepers in a rural area. JORSA 42 (1991) 281-288
13. Eglese R.W., and Li L.Y. Efficient routing for winter gritting. JORSA 43 (1992) 1031-1034
14. Li L.Y.O., and Eglese R.W. An interactive algorithm for winter gritting. Journal of the Operational Research Society 47 (1996) 217-228
15. Letchford A.N., and Eglese R.W. The rural postman problem with deadline classes. European Journal of Operational Research 105 (1998) 390-400
16. Laporte G. Modeling and solving several classes of arc routing problems as travelling salesman problems. Computers Operations Research 24 11 (1997) 1057-1061
17. Corberán A., and Sanchis J.M. On the general routing problem polyhedron: facets from the GTPS and RPP polyhedra. European Journal of Operational Research 108 (1998) 538-550
18. Córdoba P.F., García Raffi L.M., and Sanchis J.M. A heuristic algorithm based on monte carlo methods for the rural postman problem. Computers Operations Research 25 12 (1998) 1097-1106