A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
From MaRDI portal
Publication:1406725
DOI10.1016/S0305-0548(98)00028-8zbMath1040.90553MaRDI QIDQ1406725
José María Sanchis, Pedro Fernández de Córdoba, Lluís Miquel Garcia Raffi
Publication date: 7 September 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Heuristics for a dynamic rural postman problem, A real delivery problem dealt with Monte Carlo techniques, Recent results on Arc Routing Problems: An annotated bibliography, The ALGACEA‐1 method for the capacitated vehicle routing problem
Cites Work
- Unnamed Item
- New inequalities for the general routing problem
- A polyhedral approach to the rural postman problem
- Algorithms for the rural postman problem
- On general routing problems
- A fundamental problem in vehicle routing
- Approximation Algorithms for Some Postman Problems
- Matching, Euler tours and the Chinese postman
- Arc Routing Problems, Part II: The Rural Postman Problem