scientific article; zbMATH DE number 956790
From MaRDI portal
Publication:5687196
zbMath0870.90056MaRDI QIDQ5687196
Arjang A. Assad, Bruce L. Golden
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (41)
A guided local search heuristic for the capacitated arc routing problem ⋮ The bridges of Königsberg—A historical perspective ⋮ Heuristic method for a mixed capacitated arc routing problem: A refuse collection application ⋮ Rural postman parameterized by the number of components of required edges ⋮ 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 ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Routing problems: A bibliography ⋮ 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 ⋮ Modeling and solving several classes of arc routing problems as traveling salesman problems ⋮ Arc routing problems with time-dependent service costs ⋮ A scatter search algorithm for time-dependent prize-collecting arc routing problems ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ The paired mail carrier problem ⋮ Improved lower bounds and exact algorithm for the capacitated arc routing problem ⋮ A heuristic algorithm based on Monte Carlo methods for the rural postman problem. ⋮ Unnamed Item ⋮ Lower-bounding and heuristic methods for a refuse collection vehicle routing problem ⋮ An algorithm for the hierarchical Chinese postman problem ⋮ An efficient transformation of the generalized vehicle routing problem ⋮ Efficiently solving very large-scale routing problems ⋮ A Decade of Capacitated Arc Routing ⋮ A variable neighborhood search for the capacitated arc routing problem with intermediate facilities ⋮ An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem ⋮ Capacitated arc routing problem with deadheading demands ⋮ Development of a fuel consumption optimization model for the capacitated vehicle routing problem ⋮ Evolutionary algorithms for periodic arc routing problems ⋮ Lower and upper bounds for the mixed capacitated arc routing problem ⋮ A constructive heuristic for the undirected rural postman problem ⋮ The Rural Postman Problem on mixed graphs with turn penalties ⋮ An improved heuristic for the capacitated arc routing problem ⋮ Lower bounds for the mixed capacitated arc routing problem ⋮ Heuristic methods for the sectoring arc routing problem ⋮ Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees ⋮ Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration ⋮ The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra ⋮ A GRASP heuristic for the mixed Chinese postman problem ⋮ Solving capacitated arc routing problems using a transformation to the CVRP ⋮ Districting for salt spreading operations ⋮ A cutting plane algorithm for the capacitated arc routing problem
This page was built for publication:
