A GRASP heuristic for the mixed Chinese postman problem

DOI10.1016/S0377-2217(01)00296-XMaRDI QIDQ1847247zbMATH OpenOpenAlexFDO

Authors Rafael Martí, Ángel Corberán, José M. Sanchis

Publication date 17 November 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(01)00296-x

zbMATH Keywords

Chinese postmanGRASPMetaheuristicsRouting

Mathematics Subject Classification ID

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

Recommendations

• A heuristic algorithm for the mixed Chinese postman problem
• scientific article; zbMATH DE number 3871059
• Algorithms for the Chinese postman problem on mixed networks
• Finding postal carrier walk paths in mixed graphs
• Arc Routing Problems, Part I: The Chinese Postman Problem

Cites work

• A cutting plane algorithm for the windy postman problem
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem
• A probabilistic heuristic for a computationally difficult set covering problem
• An optimal algorithm for the mixed Chinese postman problem
• Approximation Algorithms for Some Postman Problems
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem
• Computing approximate solutions of the maximum covering problem with GRASP
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 3871059 (Why is no real title available?)
• scientific article; zbMATH DE number 1187150 (Why is no real title available?)
• scientific article; zbMATH DE number 3504658 (Why is no real title available?)
• scientific article; zbMATH DE number 1568940 (Why is no real title available?)
• scientific article; zbMATH DE number 1568941 (Why is no real title available?)
• scientific article; zbMATH DE number 1568943 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• scientific article; zbMATH DE number 956790 (Why is no real title available?)
• Matching, Euler tours and the Chinese postman
• Odd Minimum Cut-Sets and b-Matchings
• On the complexity of edge traversing

Cited in

(12)

• Improved solutions for the Chinese postman problem on mixed networks
• The mixed general routing polyhedron
• A heuristic algorithm for the mixed Chinese postman problem
• Algorithms for the Chinese postman problem on mixed networks
• Heuristics for the mixed rural postman problem
• New heuristic algorithms for the windy rural postman problem
• Solution of real-world postman problems
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• Recent results on arc routing problems: an annotated bibliography
• scientific article; zbMATH DE number 3871059 (Why is no real title available?)
• Hierarchical Chinese postman problem with fuzzy travel times
• Approximation algorithms for solving the k-Chinese postman problem under interdiction budget constraints

This page was built for publication: A GRASP heuristic for the mixed Chinese postman problem

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