Journal ArticleDOI
Further results on the probabilistic traveling salesman problem
Reads0
Chats0
TLDR
This paper reexamine the probabilistic traveling salesman problem using a variety of theoretical and computational approaches, sharpen the best known bounds, derive several asymptotic relations, and compare from various veiwpoints the PTSP with the re-optimization strategy.About:
This article is published in European Journal of Operational Research.The article was published on 1993-02-19. It has received 108 citations till now. The article focuses on the topics: Travelling salesman problem & Heuristics.read more
Citations
More filters
Journal ArticleDOI
Stochastic vehicle routing.
TL;DR: The main problems of stochastic vehicle routing are described within a broad classification scheme and the most important contributions are summarized in table form.
Journal ArticleDOI
Real-Time Multivehicle Truckload Pickup and Delivery Problems
TL;DR: A generic real-time multivehicle truckload pickup and delivery problem that captures most features of the operational problem of a real-world trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously is introduced.
Journal ArticleDOI
A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
TL;DR: A tabu search heuristic is developed for a version of the stochastic vehicle routing problem where customers are present at locations with some probabilities and have random demands and produces an optimal solution in 89.45% of cases.
Journal ArticleDOI
Stochastic Vehicle Routing with Random Travel Times
Astrid S. Kenyon,David P. Morton +1 more
TL;DR: This work considers stochastic vehicle routing problems on a network with random travel and service times and provides bounds on optimal objective function values and conditions under which reductions to simpler models can be made.
Journal ArticleDOI
An exact algorithm for the vehicle routing problem with stochastic demands and customers
TL;DR: The stochastic vehicle routing problem, where each customer has a known probability of presence and a random demand, is considered and is solved for the first time to optimality by means of an integer L-shaped method.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
S. Lin,Brian W. Kernighan +1 more
TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Book
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TL;DR: In this paper, Johnson and Papadimitriou proposed a performance guarantee for heuristics, based on the notion of well-solved special cases (P. Gilmore, et al.).