Routeing winter gritting vehicles
From MaRDI portal
Publication:1317045
DOI10.1016/0166-218X(92)00003-5zbMath0790.90031OpenAlexW1977642073MaRDI QIDQ1317045
Publication date: 23 June 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(92)00003-5
networksimulated annealingheuristic algorithmlimited vehicle capacitiesmultiple depot locationstotal distance travelledunconstrained Chinese postman problem
Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A guided local search heuristic for the capacitated arc routing problem, Algorithms for the windy postman problem, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, Algorithms for the Chinese postman problem on mixed networks, Solving the time varying postman problems with timed automata, A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading, A hybrid metaheuristic approach for the capacitated arc routing problem, Location-arc routing problem: heuristic approaches and test instances, A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows, Algorithms for the rural postman problem, Routing problems: A bibliography, Arc routing problems with time-dependent service costs, Metaheuristics: A bibliography, An improved multi-objective framework for the rich arc routing problem, On matchings, T‐joins, and arc routing in road networks, Arc routing problems: A review of the past, present, and future, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, Solving the hierarchical Chinese postman problem as a rural postman problem., Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics, A deterministic tabu search algorithm for the capacitated arc routing problem, A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, The windy rural postman problem with a time-dependent zigzag option, Capacitated arc routing problem with deadheading demands, Evolutionary algorithms for periodic arc routing problems, A guided local search procedure for the multi-compartment capacitated arc routing problem, A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem, Road network monitoring: algorithms and a case study, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, An integer programming approach for the Chinese postman problem with time-dependent travel time, Districting for salt spreading operations
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- Simulated Annealing – An Annotated Bibliography
- Capacitated arc routing problems
- Matching, Euler tours and the Chinese postman
