A two-stage solution approach for the directed rural postman problem with turn penalties

DOI10.1016/j.ejor.2018.07.004zbMath1403.90092OpenAlexW2822109911WikidataQ129565168 ScholiaQ129565168MaRDI QIDQ1991193

Xingyin Wang, Benjamin Dussault, Carmine Cerrone, Edward A. Wasil, Bruce L. Golden

Publication date: 30 October 2018

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

Full work available at URL: http://hdl.handle.net/11567/975048

zbMATH Keywords

heuristicsgreedy algorithmrural postman problemroutingturn penalties

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (1)

Modeling and Solving the Intersection Inspection Rural Postman Problem

Cites Work

• Unnamed Item
• The shortest path problem with forbidden paths
• The capacitated general windy routing problem with turn penalties
• Carousel greedy: a generalized greedy algorithm with applications in optimization
• Route planning with turn restrictions: A computational experiment
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Solution of real-world postman problems
• An algorithm for the Rural Postman problem on a directed graph
• Solving arc routing problems with turn penalties
• Matching, Euler tours and the Chinese postman
• The Directed Rural Postman Problem with Turn Penalties
• A transformation for the mixed general routing problem with turn penalties
• The Rural Postman Problem on mixed graphs with turn penalties

This page was built for publication: A two-stage solution approach for the directed rural postman problem with turn penalties