Escolar Documentos
Profissional Documentos
Cultura Documentos
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
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.
Benchmark Repository
http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/
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
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
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
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.
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.