Subterranean insect Colony Optimization ACO: Applications to Scheduling

0
0
1605 days ago, 580 views
PowerPoint PPT Presentation

Presentation Transcript

Slide 1

Subterranean insect Colony Optimization (ACO): Applications to Scheduling Franco Villongco IEOR 4405 4/28/09

Slide 2

Definition Metaheuristic: like hereditary calculations, reenacted strengthening and so on. Sufficiently adaptable to be connected to combinatorial advancement issues.

Slide 3

Inspiration Foraging conduct of genuine ants Blind ants convey through stigmergy Leave pheromone trails to make a specific way more inclined to be crossed by different ants

Slide 4

Two-connect Experiment FOOD NEST

Slide 5

Two-connect Experiment FOOD NEST

Slide 6

Problem Representation ( S, f , Ω) S : set of competitor arrangement f : target capacity of s є S Ω: set of limitations Set C ={ c 1 , c 2 … c N } where N is the quantity of segments Problem states are characterized as x = ( c i , c j … c h ) We call χ the arrangement of all states

Slide 7

Problem Representation Nonempty set S* of ideal arrangements G C = (C,L) whose hubs are the parts. Simulated ants then form arrangements by performing strolls on the entire chart Like in the two-connect analyze, circular segments (trails) that have more pheromone will have a higher likelihood of being picked.

Slide 8

Scheduling Applications Jm||C max We utilize Ant System calculation G C = (C,L) comprises of the considerable number of operations and two extra hubs for a source and sink hub. Our requirements Ω are essentially the priority imperatives.

Slide 9

Scheduling Applications Pheromone trail τ ij on the circular segment ( i,j ) demonstrates the attractive quality of picking operation j specifically after operation i. heuristic data connected with that operation η j

Slide 10

Scheduling Applications At every emphasis of the development methodology, m ants simultaneously assemble arrangements After every cycle, pheromone dissipation will be connected on all circular segments: Where the parameter ρ є (0,1)

Slide 11

Scheduling Applications The better C max is for the arrangement built by a specific subterranean insect k , the more pheromone there will be to the bends comparing to that arrangement:

Slide 12

Scheduling Applications Any insect at hub i will pick hub j with likelihood Where N k is the arrangement of achievable operations n j is the heuristic esteem relative to the measure of work staying relating to the occupation of the operation considered

Slide 13

Scheduling Applications 1||σ T j w j We utilize the Ant Colony System calculation Same AS however with contrasts in pheromone overhauls and insect choice control For our development diagram, we have for our hub the n positions and n employments Pheromone trail τ ij show the allure of planning occupation j to position i heuristic data η j conversely corresponding to employment j 's due date

Slide 14

Scheduling Applications Main contrasts Pheromone redesign (worldwide): Only the best-so-far arrangement increments in pheromone For all (i,j ) in s bs (best-so-far arrangement) and where

Slide 15

Scheduling Applications Pheromone upgrade (neighborhood): connected amid the cycle to the curves ( i,j ) that were navigated

Slide 16

Scheduling Applications Now, in picking the following occupation j to plan the likelihood of picking occupation j is Where J is the arbitrary variable that will rise to j with likelihood

Slide 17

Thank You!

SPONSORS