TRAVE ING SA ESMAN PROB EMS RAVELING ALESMAN ROBLEMS

Traveling Salesman Problem

NP-complete Given a set of n cities and

All known techniques for obtaining an exact solution require an exponentially increasing number of steps (computing resources) as the problems become larger

distances for each pair of cities, find a roundtrip of minimal total length visiting each city exactly g g y y once. n!/2n possible tours (for n=60, 69x1078) Symmetric TSP: d (i, j ) = d ( j , i ) Asymetric TSP: d (i, j ) d ( j , i )
Euclidean TSP (triangle inequality)

TSP is one of the most intensely studied problems in computational mathematics, yet no effective solution method is known for the general case.

History of TSP
http://www.tsp.gatech.edu//history/index.html

Milestones

Germany Cities in TSP

Earliest known reference to TSP is published in Germany 1832
Der Handlungsreisende wie er sein soll und waser zu thun hat, um Auftraege zu erhalten und eines gluecklichen Erfolgs in seinen Geschaeften gewiss zu sein Von einem alten Commin-Voyageur Commin Voyageur

In 1960, Schrijver solved a 45-city problem from the Alten Commis-Voyageur Alt C i V In 1977, Groetschel solved a 120-city problem and p published in Mathematical Programming Study, 1980 g g y The 120 cities include two cities in Switzerland and one in Austria.

15,112 Cities in Germany

Optimal result found in 2001 has length 1,573,084 units (approx. 66,000 ( pp , kilometer) The computation was carried out on a network of 110 processors located at Rice and Princeton. The total computer time y used was 22.6 CPU years, scaled to a Compaq Alpha processor running at 500 MHz. 13,509 city tour through the United States was solved in 1998.

24,978 Cities in Sweden

In May 2004, the traveling salesman problem of visiting all 24 978 cities in Sweden 24,978 was solved: a tour of length 855,597 TSPLIB units (approximately 72,500 kilometers) was found and it was proven that no shorter tour exists. This is currently the largest solved TSP instance,

71,009 Cities in China

Best known result by Hung Dinh Nguyen, 4,566,563.

1,904,711 Cities in the World

Best known result by Keld Helsgaun, 7,516,146,716

Benchmark Repository
http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/

Heuristic Approaches for TSP

Simulated annealing Exponential neighborhood local search Space filling heuristic LKH heuristic Tabu search Branch and bound (40-60) Simulated electric field Petri net Adaptive i Ad ti ring Cutting plane Memetic algorithm Elastic net Hopfield neural network Self-organizing map Genetic algorithm Evolutionary strategy y gy Genetic programming Artificial immune algorithm Ant l A t colony system t Particle swarm

JOB SHOP SCHEDU ING PROB EMS CHEDULING ROBLEMS

Problem Definition
n Jobs that must be processed on m Machines with the following rules:

Each job must be processed in a certain order (precedent constraints) Each machine can only process one job at a time E h jjob can only b processed b one machine at a ti Each b l be d by hi t time Each job must be process by each machine exactly once
Computational complexity: (n!)m Objective: Determine schedule with minimum makespan, or the minimum time for all jobs to finish processing, for n jobs on m machines while adhering to the problems constraints

Job 1: Job 3: Job 5: Job 7: Job 9:

Machine Sequence (Time) 2 (21) 1 (53) 5 (95) 4 (55) 3 (34) Job 2: 1 (21) 4 (52) 5 (16) 3 (26) 2 (71) 4 (39) 5 (98) 2 (42) 3 (31) 1 (12) Job 4: 2 (77) 1 (55) 4 (79) 2 (66) 3 (77) 1 (83) 4 (34) 3 (64) 2 (19) 5 (37) Job 6: 2 (54) 3 (43) 5 (79) 1 (92) 3 (62) 4 (69) 5 (77) 2 (87) 3 (87) 1 (93) Job 8: 3 (38) 1 (60) 2 (41) 4 (24) 5 (83) 4 (17) 2 (49) 5 (25) 1 (44) 3 (98) Job 10: 5 (77) 4 (79) 3 (43) 2 (75) 1 (96)

Classifications of Schedules
Semi-Active Schedules

Semi-active schedules
are schedules in which operations are scheduled at the earliest allowable time. No machine is kept idle unnecessarily.
Job 1: 1(3); 2(5); 3(2) Job 2: 1(5); 3(1); 2(4) Job 3: 2(4); 1(2); 3(1)

No operation can be started earlier without altering the operating sequence of any machine

Active Schedules

Active schedules are schedules where

no operation can be started earlier without d l i the total processing ti ith t delaying th t t l i time of any machine or breaking a precedent constraint. An optimal schedule is an active schedule.

Semi-active Schedules Active Schedules

If possible to alter the operating sequence of the machine to produce a schedule with a smaller makespan and preserve the precedent constraints

Non-Delay Schedules smallest class of schedules. These are active schedules i which no ti h d l in hi h machine is kept idle at any time, when it could be processing an operation.

Non-delay schedules are the

Semi-active Schedules Active Schedules

Non-delay Schedules

Shown together below, it is easy to see that non-delay schedules are not always optimal.

Optimal Schedule
Schedules that are not semi-active schedule are not optimal. However, semi-active schedule is not necessary optimal. In general, they are not optimal. Optimal schedule lie in the space of active schedules. Optimal schedule is not necessary a non-delay schedule. However, it should be obvious that optimal schedule will most likely be schedules where the amount of delay times for any given machine is kept to a minimum.

Parameterized Active Schedules

Allows machines to be idle for a

specified parameter parameter.

Semi-active Schedules Active Schedules

Parameterized Active Schedules Non-delay Schedules

Non-delay schedules are

parameterized active schedules with a parameter of 0. t f0

May or may not contain the optimal

schedule.

Many times optimal solutions will lie just out side the non-delay set, so non-delay schedule building will not work, but searching the whole space of active schedules is very inefficient

LA03 ( 0 x 5) Opt a So ut o 03 (10 Optimal Solution Solution that is just barely outside of non-delay space and into parameterized active schedule space.

More Combinatorial Optimization

0-1 Knapsack Problem

Prisoner Dilemma Problem