In this paper the problem of eeciently serving a sequence of requests that are presented in a metric space in an on-line fashion and then returning back to the departure point is considered. The problem, that is the on-line version of a variant of the Traveling Salesman Problem (namely the Vehicle Routing Problem with release times), and that for the sake of intuition we call On-Line Traveling ...

⎯In the Dynamic and Stochastic Traveling Salesman Problem (DSTSP) a vehicle has to service a number of requests which are disclosed in a dynamic fashion over a planning horizon. When the vehicle is temporarily idle, one option is to reposition it in anticipation of future demand. The aim of this paper is to study waiting strategies for the DSTSP under a probabilistic characterization of custome...

Decomposition methods are techniques for exploiting the tractable substructures of an integer program in order to obtain improved solution procedures. In particular, the goal is to derive improved methods of bounding the optimal solution value, which can then be used to drive a branch-andbound algorithm. Such methods are the preferred solution approaches for a wide range of important models ari...

An Eflective Heuristic Algorithm for the Traveling. THE SYMMETRIC traveling-salesman problem is: Given an n by n symmetric matrix of.symmetric traveling salesman problem. However, the design and implementation of an algorithm based on this heuristic is not trivial. There are many.This article is about the heuristic for the travelling salesman problem. An Effective Heuristic Algorithm for the Tr...

OF THESIS GENERALIZED PARTITION CROSSOVER FOR THE TRAVELING SALESMAN

The Vehicle Routing Problem (VRP) is a complex combinatorial optimization problem that can be described as follows: given a fleet of vehicles with uniform capacity, a common depot, and several costumer demands; find the set of routes with overall minimum route cost which service all the demands. The multiple traveling salesman problem (mTSP) is a generalization of the well-known traveling sales...