A time-dependent hierarchical Chinese postman problem
From MaRDI portal
Publication:2303339
DOI10.1007/s10100-018-0598-8OpenAlexW2905351216WikidataQ128784505 ScholiaQ128784505MaRDI QIDQ2303339
Publication date: 3 March 2020
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-018-0598-8
simulated annealinggenetic algorithmarc routing problemshierarchical Chinese postman problemtime dependent routing
Related Items (6)
Arc routing problems: A review of the past, present, and future ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms ⋮ Eulerian walks in temporal graphs ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs
Cites Work
- Optimization by Simulated Annealing
- The time-dependent prize-collecting arc routing problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Arc routing problems with time-dependent service costs
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Solving the hierarchical Chinese postman problem as a rural postman problem.
- Hybrid genetic algorithm for the open capacitated arc routing problem
- An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- The time-dependent traveling salesman problem
- Vehicle dispatching with time-dependent travel times
- Time-constrained Chinese postman problems
- An algorithm for the hierarchical Chinese postman problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- A fast solution method for the time-dependent orienteering problem
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- A genetic algorithm for a bi-objective capacitated arc routing problem
- On the hierarchical Chinese postman problem with linear ordered classes
- A simulated annealing solution method for robust school bus routing
- Postman tour on a graph with precedence relation on arcs
- Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Genetic algorithm for Chinese postman problems
- The moving-target traveling salesman problem
- Vehicle routing and scheduling with time-varying data: A case study
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing
- Handbook of metaheuristics
This page was built for publication: A time-dependent hierarchical Chinese postman problem
