A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
From MaRDI portal
Publication:1651548
DOI10.1016/j.cor.2017.07.007zbMath1391.90609OpenAlexW2724864772MaRDI QIDQ1651548
Oliver Lum, Rui Zhang, Bruce L. Golden, Edward A. Wasil
Publication date: 12 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.07.007
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Arc routing problems: A review of the past, present, and future, OAR lib: an open source arc routing library
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lower bounds and heuristics for the windy rural postman problem
- Routeing winter gritting vehicles
- The windy rural postman problem with a time-dependent zigzag option
- Transforming arc routing into node routing problems
- Solution of real-world postman problems
- A constraint programming approach to the Chinese postman problem with time windows
- Heuristic approaches to vehicle routing with backhauls and time windows
- A Branch-and-Price Algorithm for Capacitated Arc Routing Problem with Flexible Time Windows
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Matching, Euler tours and the Chinese postman
- A branch & cut algorithm for the windy general routing problem and special cases
- A Note on Postman Problems with Zigzag Service
