Arc Routing

DOI10.1137/1.9781611973679zbMath1322.90006OpenAlexW4251866852MaRDI QIDQ5256774

Publication date: 19 June 2015

Full work available at URL: https://doi.org/10.1137/1.9781611973679

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Related Items (38)

Interpreting the basis path set in neural networks ⋮ The target visitation arc routing problem ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ Transport of skips between recycling centers and treatment facilities ⋮ A branch-and-cut algorithm for the profitable windy rural postman problem ⋮ Local search heuristics for sectoring routing in a household waste collection context ⋮ Hybrid genetic algorithm for the open capacitated arc routing problem ⋮ Parameterized complexity of the \(k\)-arc Chinese postman problem ⋮ Time-dependent routing problems: a review ⋮ Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ The profitable close-enough arc routing problem ⋮ Arc routing with trip-balancing and attractiveness measures -- a waste collection case study ⋮ The generalized arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ Polynomial-time data reduction for weighted problems beyond additive goal functions ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ The periodic rural postman problem with irregular services on mixed graphs ⋮ Approximation algorithms for some min-max postmen cover problems ⋮ The windy rural postman problem with a time-dependent zigzag option ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity ⋮ Inventory routing with pickups and deliveries ⋮ A matheuristic for the distance-constrained close-enough arc routing problem ⋮ On the distance-constrained close enough arc routing problem ⋮ Solving the length constrained \(K\)-drones rural postman problem ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ Approximation Algorithms for the Single Robot Line Coverage Problem ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ Arc routing for parking enforcement officers: exact and heuristic solutions ⋮ Exact approaches for the cutting path determination problem ⋮ Constructing the basis path set by eliminating the path dependency

This page was built for publication: Arc Routing