Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
From MaRDI portal
(Redirected from Publication:342292)
Recommendations
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- The capacitated arc routing problem: heuristics
Cites work
- scientific article; zbMATH DE number 558539 (Why is no real title available?)
- scientific article; zbMATH DE number 1520350 (Why is no real title available?)
- A cutting plane algorithm for the capacitated arc routing problem
- A deterministic tabu search algorithm for the capacitated arc routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- A variable neighborhood descent algorithm for a real waste collection problem with mobile depots
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- An improved heuristic for the capacitated arc routing problem
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
- Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions
- Approximate solutions for the capacitated arc routing problem
- Capacitated arc routing problems
- Competitive memetic algorithms for arc routing problems
- Cut-first branch-and-price-second for the capacitated arc-routing problem
- Experimental evaluation of heuristic optimization algorithms: A tutorial
- GRASP with evolutionary path-relinking for the capacitated arc routing problem
- Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
- Heuristic methods for the sectoring arc routing problem
- Improved bounds for large scale capacitated arc routing problem
- Improved lower bounds and exact algorithm for the capacitated arc routing problem
- Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
- Lower and upper bounds for the mixed capacitated arc routing problem
- Lower bounds for the mixed capacitated arc routing problem
- Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
- Metaheuristics. From design to implementation.
- Network service scheduling and routing
- Recent results on arc routing problems: an annotated bibliography
- Solving an urban waste collection problem using ants heuristics
- Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
- The Arc Routing and Scheduling Problem with Transshipment
- The Capacitated Arc Routing Problem: Lower bounds
- The capacitated arc routing problem with intermediate facilities
- The fleet size and mix problem for capacitated arc routing
- The mixed capacitated arc routing problem with non-overlapping routes
Cited in
(16)- Waste collection routing: a survey on problems and methods
- Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities
- Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities
- A multi-level capacitated arc routing problem with intermediate facilities in waste collection
- Designing visually and operationally attractive routes to improve driver acceptance in road cleaning vehicle routing problem
- Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities
- Solving vehicle routing problems with intermediate stops using VRPSolver models
- An improved multi-objective framework for the rich arc routing problem
- An updated annotated bibliography on arc routing problems
- Graph partitioning-based matheuristic for residential waste collection problem with visual attractiveness and turn penalty
- A districting-based heuristic for the coordinated capacitated arc routing problem
- Exploring roadside management optimisation opportunities: a systematic review on arc routing problems applications and modelling
- Arc routing with trip-balancing and attractiveness measures -- a waste collection case study
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem
- Arc routing for parking enforcement officers: exact and heuristic solutions
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
This page was built for publication: Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342292)
