An Asymptotic, Probabilistic Analysis of a Routing Problem

DOI10.1287/MOOR.3.2.89MaRDI QIDQ4165119zbMATH OpenOpenAlexFDO

Authors David M. Stein

Publication date 1978

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.3.2.89

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Strong limit theorems (60F15) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Cited in

(15)

• Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
• A continuous approach to the design of physical distribution systems
• Total distance approximations for routing solutions
• Continuous approximation models in freight distribution management
• Designing multi-vehicle delivery tours in a grid-cell format
• k-interchange procedures for local search in a precedence-constrained routing problem
• Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
• A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
• Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
• A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution
• A tabu search heuristic for the dynamic transportation of patients between care units
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• Discrete online TSP
• Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics
• The physicist's approach to the travelling salesman problem. II

This page was built for publication: An Asymptotic, Probabilistic Analysis of a Routing Problem

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