The fleet size and mix problem for capacitated arc routing
From MaRDI portal
Publication:1064973
DOI10.1016/0377-2217(85)90252-8zbMath0576.90094OpenAlexW2039621427MaRDI QIDQ1064973
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90252-8
shortest pathbranch and boundcomputational resultscapacitated arc routingChinese or rural postman problemgiant tourleast cost
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)
Related Items
Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition ⋮ Heuristic method for a mixed capacitated arc routing problem: A refuse collection application ⋮ An efficiency-based path-scanning heuristic for the capacitated arc routing problem ⋮ A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem ⋮ Hybrid genetic algorithm for the open capacitated arc routing problem ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Routing problems: A bibliography ⋮ Efficient frameworks for greedy split and new depth first search split procedures for routing problems ⋮ 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 ⋮ Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ The multi‐purpose K‐drones general routing problem ⋮ Crossover iterated local search for SDCARP ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ 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 ⋮ Combinatorial optimization and green logistics ⋮ Iterated local search and column generation to solve arc-routing as a permutation set-covering problem ⋮ Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities ⋮ Capacitated arc routing problem with deadheading demands ⋮ A memetic algorithm for the team orienteering problem ⋮ Combinatorial optimization and green logistics ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A genetic algorithm for a bi-objective capacitated arc routing problem ⋮ Road network monitoring: algorithms and a case study ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Solving the length constrained \(K\)-drones rural postman problem ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem ⋮ Heuristic methods for the sectoring arc routing problem ⋮ Tour splitting algorithms for vehicle routing problems ⋮ Solving capacitated arc routing problems using a transformation to the CVRP
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- A parallel insert method for the capacitated arc routing problem
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- The Chinese Postman Problem for Mixed Networks
- Capacitated arc routing problems
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
