Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces

Probabilistic combinatorial optimization problems are generalized versions of deterministic combinatorial optimization problems with explicit inclusion of probabilistic elements in the problem definitions. Based on the probabilistic traveling salesman problem PTSP and on the probabilistic minimum spanning tree problem PMSTP, the objective of this paper is to give a rigorous treatment of the probabilistic analysis of these problems in the plane. More specifically we present general finite-size bounds and limit theorems for the objective functions of the PTSP and PMSTP. We also discuss the practical implications of these results and indicate some open problems.

[1]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[2]  Antoine Jézéquel,et al.  Probabilistic vehicle routing problems , 1985 .

[3]  Patrick Jaillet,et al.  Probabilistic Traveling Salesman Problems , 1985 .

[4]  Patrick Jaillet.  Rates of Convergence for Quasi-Additive Smooth Euclidean Functionals and Application to Combinatorial Optimization Problems , 1992, Math. Oper. Res..

[5]  J. Steele.  Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability , 1981 .

[6]  H. R. Pitt.  Divergent Series , 1951, Nature.

[7]  Eugene L. Lawler,et al.  The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[8]  Patrick Jaillet,et al.  Shortest path problems with node failures , 1992, Networks.

[9]  Patrick Jaillet,et al.  A Priori Optimization , 1990, Oper. Res..

[10]  Wansoo T. Rhee,et al.  Martingale Inequalities and NP-Complete Problems , 1987, Math. Oper. Res..

[11]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[12]  D. Bertsimas.  Probabilistic combinatorial optimization problems , 1988 .

[13]  J. Beardwood,et al.  The shortest path through many points , 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

[14]  A R Odoni,et al.  THE PROBABILISTIC VEHICLE ROUTING PROBLEM. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .

[15]  B. Weide.  Statistical methods in algorithm design and analysis. , 1978 .

[16]  Patrick Jaillet.  On Some Probabilistic Combinatorial Optimization Problems Defined on Graphs , 1987 .

[17]  J. Michael Steele,et al.  Complete Convergence of Short Paths and Karp's Algorithm for the TSP , 1981, Math. Oper. Res..

[18]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[19]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..