scientific article; zbMATH DE number 1520350
From MaRDI portal
Publication:4510100
zbMath0947.00016MaRDI QIDQ4510100
No author found.
Publication date: 22 October 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (64)
A guided local search heuristic for the capacitated arc routing problem ⋮ The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ New results for the directed profitable rural postman problem ⋮ Approximation algorithms for solving the constrained arc routing problem in mixed graphs ⋮ Heuristic method for a mixed capacitated arc routing problem: A refuse collection application ⋮ A branch & cut algorithm for the windy general routing problem and special cases ⋮ Rural postman parameterized by the number of components of required edges ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The mixed capacitated arc routing problem with non-overlapping routes ⋮ A matheuristic for the team orienteering arc routing problem ⋮ A survey of models and algorithms for winter road maintenance. III: Vehicle routing and depot location for spreading ⋮ A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal ⋮ A hybrid metaheuristic approach for the capacitated arc routing problem ⋮ Lower bounds and heuristics for the windy rural postman problem ⋮ The capacitated arc routing problem with refill points ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ On a routing and scheduling problem concerning multiple edge traversals in graphs ⋮ Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles ⋮ Arc routing problems with time-dependent service costs ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ Medical waste collection considering transportation and storage risk ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ Solving the Periodic Edge Routing Problem in the Municipal Waste Collection ⋮ Arc routing with trip-balancing and attractiveness measures -- a waste collection case study ⋮ An ILP-refined tabu search for the directed profitable rural postman problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Crossover iterated local search for SDCARP ⋮ A deterministic tabu search algorithm for the 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 ⋮ Solving an urban waste collection problem using ants heuristics ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Solution of real-world postman problems ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ The undirected capacitated arc routing problem with profits ⋮ Combinatorial optimization and green logistics ⋮ A guided local search procedure for the multi-compartment capacitated arc routing problem ⋮ A comparison of two different formulations for arc routing problems on mixed graphs ⋮ A constraint programming approach to the Chinese postman problem with time windows ⋮ Privatized rural postman problems ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Part logistics in the automotive industry: decision problems, literature review and research agenda ⋮ City streets parking enforcement inspection decisions: the Chinese postman's perspective ⋮ Exact methods based on node-routing formulations for undirected arc-routing problems ⋮ An improved heuristic for the capacitated arc routing problem ⋮ Forty years of periodic vehicle routing ⋮ Exploiting sparsity in pricing routines for the capacitated arc routing problem ⋮ Arc routing for parking enforcement officers: exact and heuristic solutions ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ Heuristic methods for the sectoring arc routing problem ⋮ Solving the prize-collecting rural postman 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 ⋮ Modeling the Pre Auction Stage The Truckload Case ⋮ An integer programming approach for the Chinese postman problem with time-dependent travel time ⋮ A cutting plane algorithm for the capacitated arc routing problem
This page was built for publication:
