A computational study of several heuristics for the DRPP

DOI10.1007/BF01299159zbMATH Open0822.90051MaRDI QIDQ1804375FDOQ1804375

Authors: Yanyan Li 

Publication date: 9 October 1995

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Recommendations

• An algorithm for the Rural Postman problem on a directed graph
• Algorithms for the rural postman problem
• The Directed Rural Postman Problem with Turn Penalties
• Lower bounds and heuristics for the windy rural postman problem
• A constructive heuristic for the undirected rural postman problem

zbMATH Keywords

lower boundarc routingheuristic algorithmsrural postman problemcutting plane techniques

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A fundamental problem in vehicle routing
• Matching, Euler tours and the Chinese postman
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• An algorithm for the Rural Postman problem on a directed graph
• On general routing problems
• Networks and vehicle routing for municipal waste collection
• Title not available (Why is that?)

Cited In (9)

• An algorithm for the Rural Postman problem on a directed graph
• OAR lib: an open source arc routing library
• A constructive heuristic for the undirected rural postman problem
• Solving the close-enough arc routing problem
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem.
• Heuristics for a dynamic rural postman problem
• Algorithms for the rural postman problem
• Theoretical implications involved in the DDRP method
• A heuristic algorithm for the drone rural postman problem

This page was built for publication: A computational study of several heuristics for the DRPP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804375)