Results 1 
6 of
6
The traveling salesman problem
, 1994
"... This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances ..."
Abstract

Cited by 125 (6 self)
 Add to MetaCart
This paper presents a selfcontained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances. This is a preliminary version of one of the chapters of the volume “Networks”
RealTime Multivehicle Truckload Pickup and Delivery Problems
 Transportation Science
, 2004
"... In this paper we formally introduce a generic realtime multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks ’ empty travel distances, jobs ’ delayed completion times, and job rejections. Although very simple, the proble ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
(Show Context)
In this paper we formally introduce a generic realtime multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks ’ empty travel distances, jobs ’ delayed completion times, and job rejections. Although very simple, the problem captures most features of the operational problem of a realworld trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously over time. We propose a mixed integer programming formulation for the offline version of the problem. We then consider and compare five rolling horizon strategies for the realtime version. Two of the policies are based on a repeated reoptimization of various instances of the offline problem, while the others use simpler local (heuristic) rules. One of the reoptimization strategies is new while the other strategies have recently been tested for similar realtime fleet management problems. The comparison of the policies is done under a general simulation framework. The analysis is systematic and consider varying traffic intensities, varying degrees of advance information, and varying degrees of flexibility for job rejection decisions. The new reoptimization policy is shown to systematically outperform the others under all these conditions.
TSP  Infrastructure for the Traveling Salesperson Problem
 JOURNAL OF STATISTICAL SOFTWARE
, 2006
"... The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
(Show Context)
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NPcomplete problems. The importance of the TSP arises besides from its theoretical appeal from the variety of its applications. In addition to vehicle routing, many other applications, e.g., computer wiring, cutting wallpaper, job sequencing or several data visualization techniques, require the solution of a TSP. In this paper we introduce the R package TSP which provides a basic infrastructure for handling and solving the traveling salesperson problem. The package features S3 classes for specifying a TSP and its (possibly optimal) solution as well as several heuristics to find good solutions. In addition, it provides an interface to Concorde, one of the best exact TSP solvers currently available.
Introduction to TSP – Infrastructure for the Traveling Salesperson Problem
, 2009
"... ..."
(Show Context)
©2004 INFORMS RealTime Multivehicle Truckload Pickup and Delivery Problems
"... In this paper we formally introduce a generic realtime multivehicle truckload pickup and delivery problem.The problem includes the consideration of various costs associated with trucks ’ empty travel distances, jobs’ delayed completion times, and job rejections. Although very simple, the problem ca ..."
Abstract
 Add to MetaCart
(Show Context)
In this paper we formally introduce a generic realtime multivehicle truckload pickup and delivery problem.The problem includes the consideration of various costs associated with trucks ’ empty travel distances, jobs’ delayed completion times, and job rejections. Although very simple, the problem captures most features of the operational problem of a realworld trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously. We propose a mixedinteger programming formulation for the offline version of the problem. We then consider and compare five rolling horizon strategies for the realtime version. Two of the policies are based on a repeated reoptimization of various instances of the offline problem, while the others use simpler local (heuristic) rules. One of the reoptimization strategies is new, while the other strategies have recently been tested for similar realtime fleet management problems. The comparison of the policies is done under a general simulation framework. The analysis is systematic and considers varying traffic intensities, varying degrees of advance information, and varying degrees of flexibility for jobrejection decisions. The new reoptimization policy is shown to systematically outperform the others under all these conditions. Key words: truckload trucking; vehicle routing; realtime fleet management; intelligent transportation systems
TSP – A RPackage for the Traveling Salesperson Problem
"... 2. Definition and types of TSPs 3. Basic infrastructure in R 4. Algorithms and Heuristics ..."
Abstract
 Add to MetaCart
(Show Context)
2. Definition and types of TSPs 3. Basic infrastructure in R 4. Algorithms and Heuristics