Solution of real-world postman problems
From MaRDI portal
Publication:2482818
Recommendations
Cites work
- A GRASP heuristic for the mixed Chinese postman problem
- A Note on Postman Problems with Zigzag Service
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Construction heuristics for the asymmetric TSP.
- Fast local search algorithms for the handicapped persons transportation problem
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- scientific article; zbMATH DE number 4068590 (Why is no real title available?)
- scientific article; zbMATH DE number 2064413 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- scientific article; zbMATH DE number 1568945 (Why is no real title available?)
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Large-step Markov chains for the TSP incorporating local search heuristics
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- On finding minimum routes in a network with turn penalties
- On the complexity of edge traversing
- On the windy postman problem
- Sequential search and its application to vehicle-routing problems
- Solving arc routing problems with turn penalties
- The Chinese Postman Problem for Mixed Networks
- The Directed Rural Postman Problem with Turn Penalties
- The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
- Transforming asymmetric into symmetric traveling salesman problems
- Variable neighborhood search: Principles and applications
Cited in
(18)- Lower bounds for the mixed capacitated arc routing problem
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows
- Heuristics for vehicle routing problems: sequence or set optimization?
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- The windy rural postman problem with a time-dependent zigzag option
- Large multiple neighborhood search for the clustered vehicle-routing problem
- A two-stage solution approach for the directed rural postman problem with turn penalties
- A concise guide to existing and emerging vehicle routing problem variants
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Recent results on arc routing problems: an annotated bibliography
- scientific article; zbMATH DE number 1179832 (Why is no real title available?)
- Traveling salesman problem at the post of Slovenia
- A Note on Postman Problems with Zigzag Service
- Arc routing problems: A review of the past, present, and future
- Small and large neighborhood search for the park-and-loop routing problem with parking selection
- Smart selective navigator (SSN): enhancing urban winter road maintenance through optimized arc routing with hard turn restrictions
- Instance scaling and metamodel-based sensitivity analysis for rolling horizon optimization with application to postal letter delivery services
This page was built for publication: Solution of real-world postman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482818)