A fundamental problem in vehicle routing

DOI10.1002/NET.3230040105zbMath0368.90130OpenAlexW2006140965WikidataQ126263589 ScholiaQ126263589MaRDI QIDQ4145183

C. S. Orloff

Publication date: 1974

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230040105

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Traffic problems in operations research (90B20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (67)

The target visitation arc routing problem ⋮ Time-constrained Chinese postman problems ⋮ A polyhedral approach to the rural postman problem ⋮ ILP formulation of the degree-constrained minimum spanning hierarchy problem ⋮ On residual approximation in solution extension problems ⋮ A capacitated general routing problem on mixed networks ⋮ Two-phase branch-and-cut for the mixed capacitated general routing problem ⋮ The Steiner traveling salesman problem with online edge blockages ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Empirical analysis for the VRPTW with a multigraph representation for the road network ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ Algorithms for the rural postman problem ⋮ Routing problems: A bibliography ⋮ Modeling and solving the mixed capacitated general routing problem ⋮ Multi-depot rural postman problems ⋮ A branch-and-cut algorithm for the maximum benefit Chinese postman problem ⋮ Vehicle routing on road networks: how good is Euclidean approximation? ⋮ Optimally solving the joint order batching and picker routing problem ⋮ A new view on rural postman based on Eulerian extension and matching ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ The generalized arc routing problem ⋮ Arc routing problems: A review of the past, present, and future ⋮ Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ On Residual Approximation in Solution Extension Problems ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Approximation algorithms for the min-max mixed rural postmen cover problem and its variants ⋮ Improving a constructive heuristic for the general routing problem ⋮ Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times ⋮ The multi‐purpose K‐drones general routing problem ⋮ The single robot line coverage problem: Theory, algorithms, and experiments ⋮ A heuristic algorithm based on Monte Carlo methods for the rural postman problem. ⋮ On Eulerian extensions and their application to no-wait flowshop scheduling ⋮ Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover ⋮ Heuristische Lösungsverfahren für Lieferplanprobleme ⋮ Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows ⋮ A branch-and-price algorithm for the windy rural postman problem ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Using dual feasible functions to construct fast lower bounds for routing and location problems ⋮ A Decade of Capacitated Arc Routing ⋮ On the general routing polytope ⋮ Computing finest mincut partitions of a graph and application to routing problems ⋮ An approximation algorithm for the general routing problem ⋮ The Steiner traveling salesman problem and its extensions ⋮ Exact algorithms for the order picking problem ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs ⋮ The directed profitable location rural postman problem ⋮ A computational study of several heuristics for the DRPP ⋮ An algorithm for then×n optimum assignment problem ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ The general routing polyhedron: A unifying framework ⋮ The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem ⋮ The mixed postman problem ⋮ Differential approximation of NP-hard problems with equal size feasible solutions ⋮ New inequalities for the general routing problem ⋮ From Few Components to an Eulerian Graph by Adding Arcs ⋮ Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ The rural postman problem with deadline classes ⋮ The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra ⋮ On the hierarchical Chinese postman problem with linear ordered classes ⋮ The fleet size and mix problem for capacitated arc routing ⋮ The arc partitioning problem ⋮ On the mixed Chinese postman problem ⋮ On games arising from multi-depot Chinese postman problems ⋮ Compact formulations of the Steiner traveling salesman problem and related problems

Cites Work

• Unnamed Item

This page was built for publication: A fundamental problem in vehicle routing