The fleet size and mix problem for capacitated arc routing

From MaRDI portal
Publication:1064973

DOI10.1016/0377-2217(85)90252-8zbMath0576.90094OpenAlexW2039621427MaRDI QIDQ1064973

Gündüz Ulusoy

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




Related Items

Divide-and-conquer large scale capacitated arc routing problems with route cutting off decompositionHeuristic method for a mixed capacitated arc routing problem: A refuse collection applicationAn efficiency-based path-scanning heuristic for the capacitated arc routing problemA hybrid metaheuristic approach for the capacitated arc routing problemOrienteering problem: a survey of recent variants, solution approaches and applicationsAn integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problemHybrid genetic algorithm for the open capacitated arc routing problemConstructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilitiesRouting problems: A bibliographyEfficient frameworks for greedy split and new depth first search split procedures for routing problemsAn improved multi-objective framework for the rich arc routing problemMemetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problemsUsing an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problemsOn approximate data reduction for the Rural Postman Problem: Theory and experimentsFast upper and lower bounds for a large‐scale real‐world arc routing problemThe multi‐purpose K‐drones general routing problemCrossover iterated local search for SDCARPUsing dual feasible functions to construct fast lower bounds for routing and location problemsA multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problemA Decade of Capacitated Arc RoutingA variable neighborhood search for the capacitated arc routing problem with intermediate facilitiesCombinatorial optimization and green logisticsIterated local search and column generation to solve arc-routing as a permutation set-covering problemSplitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilitiesCapacitated arc routing problem with deadheading demandsA memetic algorithm for the team orienteering problemCombinatorial optimization and green logisticsLower and upper bounds for the mixed capacitated arc routing problemA genetic algorithm for a bi-objective capacitated arc routing problemRoad network monitoring: algorithms and a case studyRecent results on Arc Routing Problems: An annotated bibliographyIndustrial aspects and literature survey: fleet composition and routingSolving the length constrained \(K\)-drones rural postman problemA variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problemHeuristic methods for the sectoring arc routing problemTour splitting algorithms for vehicle routing problemsSolving capacitated arc routing problems using a transformation to the CVRP



Cites Work