Capacitated arc routing problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An improved heuristic for the capacitated arc routing problem
- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- Heuristic methods for the sectoring arc routing problem
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
- Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration
- The fleet size and mix problem for capacitated arc routing
- Approximate solutions for the capacitated arc routing problem
- Routeing winter gritting vehicles
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees
- An efficiency-based path-scanning heuristic for the capacitated arc routing problem
- Hybrid genetic algorithm for the open capacitated arc routing problem
- Two phased hybrid local search for the periodic capacitated arc routing problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Capacitated arc routing problem with deadheading demands
- Evolutionary algorithms for periodic arc routing problems
- Constant-factor approximations for capacitated arc routing without triangle inequality
- Transforming arc routing into node routing problems
- A cutting plane algorithm for the capacitated arc routing problem
- A guided local search heuristic for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Routing problems: A bibliography
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
- Approximation algorithms for some extensions of the maximum profit routing problem
- Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Improved approximation algorithms for cumulative VRP with stochastic demands
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- Augment-insert algorithms for the capacitated arc routing problem
- Exact approaches for the cutting path determination problem
- A compact transformation of arc routing problems into node routing problems
- The aircraft maintenance base location problem
- Multi-depot rural postman problems
- Solving an urban waste collection problem using ants heuristics
- Lower and upper bounds for the mixed capacitated arc routing problem
- New lower bound for the capacitated arc routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Road network monitoring: algorithms and a case study
- A scatter search for the periodic capacitated arc routing problem
- Solving capacitated arc routing problems using a transformation to the CVRP
- The capacitated arc routing problem with refill points
- The commodity-split multi-compartment capacitated arc routing problem
- Arc routing under uncertainty: introduction and literature review
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- The capacitated arc routing problem with intermediate facilities
- Approximation algorithms for cumulative VRP with stochastic demands
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
- A branch-and-price algorithm for capacitated arc routing problem with flexible time windows
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Local search based approximation algorithms for two-stage stochastic location problems
- Min-Max K-vehicles windy rural postman problem
- Recent results on arc routing problems: an annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- An approach to the asymmetric multi-depot capacitated arc routing problem
- The mixed capacitated arc routing problem with non-overlapping routes
- A hybrid metaheuristic approach for the capacitated arc routing problem
- Local search heuristics for sectoring routing in a household waste collection context
- The synchronized arc and node routing problem: application to road marking
- A memetic algorithm for the travelling salesperson problem with hotel selection
- Improved bounds for large scale capacitated arc routing problem
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Location-arc routing problem: heuristic approaches and test instances
- Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
- Location arc routing problem with inventory constraints
- A decade of capacitated arc routing
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- Crossover iterated local search for SDCARP
- Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem
- A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs
- A heuristic for the solution of vehicle routing problems with time windows and multiple dumping sites in waste collection
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- Approximate solutions for the maximum benefit chinese postman problem
- Modeling the Pre Auction Stage The Truckload Case
- New large-scale data instances for CARP and new variations of CARP
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- An improved multi-objective framework for the rich arc routing problem
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems
- “Make no little plans”: Impactful research to solve the next generation of transportation problems
- On matchings, T‐joins, and arc routing in road networks
- A PTAS for Capacitated Vehicle Routing on Trees
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- Arc routing problems: A review of the past, present, and future
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Effects of update frequencies in a dynamic capacitated arc routing problem
- A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times
- A parameterized lower bounding method for the open capacitated arc routing problem
- Integrating parcel delivery schedules with public transport networks in urban co-modality systems
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
- An adaptive large neighborhood search method for the drone-truck arc routing problem
- Autonomous data detection and inspection with a fleet of UAVs
This page was built for publication: Capacitated arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3910337)
