Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
On a Weight Distribution Problem, with Application to the Design of Stochastic Generators
Journal of the ACM (JACM)
An Investigation of Some Computational Aspects of Integer Programming
Journal of the ACM (JACM)
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
Journal of the ACM (JACM)
An overview of vehicle routing problems
The vehicle routing problem
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Discrete Applied Mathematics
Designing radio-mobile access networks based on synchronous digital hierarchy rings
Computers and Operations Research
A compact model and tight bounds for a combined location-routing problem
Computers and Operations Research
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
Discrete Applied Mathematics
A vehicle routing problem solved by using a hybrid genetic algorithm
Computers and Industrial Engineering
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Computers and Operations Research
Solving an urban waste collection problem using ants heuristics
Computers and Operations Research
Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations
Computers and Operations Research
A framework for multi-robot node coverage in sensor networks
Annals of Mathematics and Artificial Intelligence
Computers and Operations Research
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
An efficient optimal solution to the coil sequencing problem in electro-galvanizing line
Computers and Operations Research
Computers and Industrial Engineering
Review: Industrial aspects and literature survey: Fleet composition and routing
Computers and Operations Research
The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation
Discrete Applied Mathematics
Solving the single-machine sequencing problem using integer programming
Computers and Industrial Engineering
Computers & Mathematics with Applications
Metaheuristics for the asymmetric Hamiltonian path problem
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
The multiple traveling purchaser problem for maximizing system's reliability with budget constraints
Expert Systems with Applications: An International Journal
Energy efficient multicasting problem in wireless ad-hoc networks
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem
Transportation Science
A multi-criteria optimization model for humanitarian aid distribution
Journal of Global Optimization
On the weight-constrained minimum spanning tree problem
INOC'11 Proceedings of the 5th international conference on Network optimization
A matheuristic for the dial-a-ride problem
INOC'11 Proceedings of the 5th international conference on Network optimization
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
A hybrid genetic algorithm for solving the length-balanced two arc-disjoint shortest paths problem
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Minimal load constrained vehicle routing problems
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
EvoCOMNET'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part II
Heuristic approaches for the optimal wiring in large scale robotic skin design
Computers and Operations Research
On the impact of real-time information on field service scheduling
Decision Support Systems
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
Operations Research Letters
Classification of travelling salesman problem formulations
Operations Research Letters
DOE-based parameter tuning for local branching algorithm
International Journal of Metaheuristics
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Layered formulation for the robust vehicle routing problem with time windows
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
The robust vehicle routing problem with time windows
Computers and Operations Research
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem
Computers and Operations Research
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
Multi-period street scheduling and sweeping
International Journal of Metaheuristics
Characterizing acyclic graphs by labeling edges
Discrete Applied Mathematics
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Discrete Applied Mathematics
The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm
Discrete Applied Mathematics
Hi-index | 0.01 |
It has been observed by many people that a striking number of quite diverse mathematical problems can be formulated as problems in integer programming, that is, linear programming problems in which some or all of the variables are required to assume integral values. This fact is rendered quite interesting by recent research on such problems, notably by R. E. Gomory [2, 3], which gives promise of yielding efficient computational techniques for their solution. The present paper provides yet another example of the versatility of integer programming as a mathematical modeling device by representing a generalization of the well-known “Travelling Salesman Problem” in integer programming terms. The authors have developed several such models, of which the one presented here is the most efficient in terms of generality, number of variables, and number of constraints. This model is due to the second author [4] and was presented briefly at the Symposium on Combinatorial Problems held at Princeton University, April 1960, sponsored by SIAM and IBM. The problem treated is: (1) A salesman is required to visit each of n cities, indexed by 1, ··· , n. He leaves from a “base city” indexed by 0, visits each of the n other cities exactly once, and returns to city 0. During his travels he must return to 0 exactly t times, including his final return (here t may be allowed to vary), and he must visit no more than p cities in one tour. (By a tour we mean a succession of visits to cities without stopping at city 0.) It is required to find such an itinerary which minimizes the total distance traveled by the salesman. Note that if t is fixed, then for the problem to have a solution we must have tp ≧ n. For t = 1, p ≧ n, we have the standard traveling salesman problem.Let dij (i ≠ j = 0, 1, ··· , n) be the distance covered in traveling from city i to city j. The following integer programming problem will be shown to be equivalent to (1): (2) Minimize the linear form ∑0≦i≠j≦n∑ dijxij over the set determined by the relations ∑ni=0i≠j xij = 1 (j = 1, ··· , n) ∑nj=0j≠i xij = 1 (i = 1, ··· , n) ui - uj + pxij ≦ p - 1 (1 ≦ i ≠ j ≦ n) where the xij are non-negative integers and the ui (i = 1, …, n) are arbitrary real numbers. (We shall see that it is permissible to restrict the ui to be non-negative integers as well.) If t is fixed it is necessary to add the additional relation: ∑nu=1 xi0 = t Note that the constraints require that xij = 0 or 1, so that a natural correspondence between these two problems exists if the xij are interpreted as follows: The salesman proceeds from city i to city j if and only if xij = 1. Under this correspondence the form to be minimized in (2) is the total distance to be traveled by the salesman in (1), so the burden of proof is to show that the two feasible sets correspond; i.e., a feasible solution to (2) has xij which do define a legitimate itinerary in (1), and, conversely a legitimate itinerary in (1) defines xij, which, together with appropriate ui, satisfy the constraints of (2).Consider a feasible solution to (2). The number of returns to city 0 is given by ∑ni=1 xi0. The constraints of the form ∑ xij = 1, all xij non-negative integers, represent the conditions that each city (other than zero) is visited exactly once. The ui play a role similar to node potentials in a network and the inequalities involving them serve to eliminate tours that do not begin and end at city 0 and tours that visit more than p cities. Consider any xr0r1 = 1 (r1 ≠ 0). There exists a unique r2 such that xr1r2 = 1. Unless r2 = 0, there is a unique r3 with xr2r3 = 1. We proceed in this fashion until some rj = 0. This must happen since the alternative is that at some point we reach an rk = rj, j + 1 k. Since none of the r's are zero we have uri - uri + 1 + pxriri + 1 ≦ p - 1 or uri - uri + 1 ≦ - 1. Summing from i = j to k - 1, we have urj - urk = 0 ≦ j + 1 - k, which is a contradiction. Thus all tours include city 0. It remains to observe that no tours is of length greater than p. Suppose such a tour exists, x0r1 , xr1r2 , ··· , xrprp+1 = 1 with all ri ≠ 0. Then, as before, ur1 - urp+1 ≦ - p or urp+1 - ur1 ≧ p. But we have urp+1 - ur1 + pxrp+1r1 ≦ p - 1 or urp+1 - ur1 ≦ p (1 - xrp+1r1) - 1 ≦ p - 1, which is a contradiction.Conversely, if the xij correspond to a legitimate itinerary, it is clear that the ui can be adjusted so that ui = j if city i is the jth city visited in the tour which includes city i, for we then have ui - uj = - 1 if xij = 1, and always ui - uj ≦ p - 1. The above integer program involves n2 + n constraints (if t is not fixed) in n2 + 2n variables. Since the inequality form of constraint is fundamental for integer programming calculations, one may eliminate 2n variables, say the xi0 and x0j, by means of the equation constraints and produce an equivalent problem with n2 + n inequalities and n2 variables.The currently known integer programming procedures are sufficiently regular in their behavior to cast doubt on the heuristic value of machine experiments with our model. However, it seems appropriate to report the results of the five machine experiments we have conducted so far. The solution procedure used was the all-integer algorithm of R. E. Gomory [3] without the ranking procedure he describes.The first three experiments were simple model verification tests on a four-city standard traveling salesman problem with distance matrix [ 20 23 4 30 7 27 25 5 25 3 21 26 ]The first experiment was with a model, now obsolete, using roughly twice as many constraints and variables as the current model (for this problem, 28 constraints in 21 variables). The machine was halted after 4000 pivot steps had failed to produce a solution. The second experiment used the earlier model with the xi0 and x0j eliminated, resulting in a 28-constraint, 15-variable problem. Here the machine produced the optimal solution in 41 pivot steps.The third experiment used the current formulation with the xi0 and x0j eliminated, yielding 13 constraints and 9 variables. The optimal solution was reached in 7 pivot steps.The fourth and fifth experiments were used on a standard ten-city problem, due to Barachet, solved by Dantzig, Johnson and Fulkerson [1]. The current formulation was used, yielding 91 constraints in 81 variables. The fifth problem differed from the fourth only in that the ordering of the rows was altered to attempt to introduce more favorable pivot choices. In each case the machine was stopped after over 250 pivot steps had failed to produce the solution. In each case the last 100 pivot steps had failed to change the value of the objective function.It seems hopeful that more efficient integer programming procedures now under development will yield a satisfactory algorithmic solution to the traveling salesman problem, when applied to this model. In any case, the model serves to illustrate how problems of this sort may be succinctly formulated in integer programming terms.