A heuristic algorithm based on Monte Carlo methods for the rural postman problem.

DOI10.1016/S0305-0548(98)00028-8zbMath1040.90553OpenAlexW1969087251MaRDI QIDQ1406725

José María Sanchis, Lluís Miquel Garcia Raffi, Pedro Fernández de Córdoba

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00028-8

zbMATH Keywords

Monte Carlo methodsrouting problemsRural Postman Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

Heuristics for a dynamic rural postman problem ⋮ Improving a constructive heuristic for the general routing problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ The ALGACEA‐1 method for the capacitated vehicle routing problem ⋮ A real delivery problem dealt with Monte Carlo techniques

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

This page was built for publication: A heuristic algorithm based on Monte Carlo methods for the rural postman problem.