Vehicle routing on road networks: how good is Euclidean approximation?

DOI10.1016/J.COR.2020.105197MaRDI QIDQ2668618zbMATH OpenOpenAlexWikidataFDO

Authors Burak Boyacı, Thu Huong Dang, Adam N. Letchford

Publication date 7 March 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2020.105197

zbMATH Keywords

combinatorial optimisationroad networkstraveling salesman problemvehicle routing problems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Heuristics for vehicle routing on tree-like networks
• Probabilistic analysis of a routing problem
• A guide to vehicle routing heuristics
• The vehicle routing problem: An overview of exact and approximate algorithms
• Computational Approaches to Stochastic Vehicle Routing Problems

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A cutting plane algorithm for the general routing problem
• A cutting plane procedure for the travelling salesman problem on road networks
• A Dynamic Programming Approach to Sequencing Problems
• A fundamental problem in vehicle routing
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A New Distance Function for Modeling Travel Distances in a Transportation Network
• A note on computational aspects of the Steiner traveling salesman problem
• An Improved Petal Heuristic for the Vehicle Routeing Problem
• An Integer Programming Approach to the Vehicle Scheduling Problem
• Arc Routing
• Compact formulations of the Steiner traveling salesman problem and related problems
• Estimating road distances by mathematical functions
• scientific article; zbMATH DE number 192876 (Why is no real title available?)
• scientific article; zbMATH DE number 3588048 (Why is no real title available?)
• scientific article; zbMATH DE number 1520350 (Why is no real title available?)
• scientific article; zbMATH DE number 758742 (Why is no real title available?)
• Improved branch-cut-and-price for capacitated vehicle routing
• Mathematical Models of Road Travel Distances
• Modelling Inter-city Road Distances by Mathematical Functions
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Pricing routines for vehicle routing with time windows on road networks
• The Steiner traveling salesman problem and its extensions
• The traveling salesman problem on a graph and some related integer polyhedra
• The Traveling Salesman Problem with Distances One and Two
• The traveling salesman problem. A computational study.
• The vehicle routing problem. Latest advances and new challenges.
• Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
• Vehicle Routing
• Vehicle routing problems with alternative paths: an application to on-demand transportation

Cited in

(5)

• Total distance approximations for routing solutions
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• An improved model for estimating optimal VRP solution values
• The hiking tourist problem
• On the hierarchical directed capacitated arc routing problem

Describes a project that uses

Uses Software

• VRP
• OpenStreetMap

This page was built for publication: Vehicle routing on road networks: how good is Euclidean approximation?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668618)