assessing the performance of bio inspired heuristics for single row layout problems n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Assessing the performance of bio-inspired heuristics for single row layout problems PowerPoint Presentation
Download Presentation
Assessing the performance of bio-inspired heuristics for single row layout problems

Loading in 2 Seconds...

play fullscreen
1 / 41

Assessing the performance of bio-inspired heuristics for single row layout problems - PowerPoint PPT Presentation


  • 139 Views
  • Uploaded on

Assessing the performance of bio-inspired heuristics for single row layout problems. Berna ULUTAŞ B.Burak ULUTA Ş Eskisehir Osmangazi University Department of Industrial Engineering. 30 June-2 July 2010 Oprerations Research and Industrial Engineering Conference

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'Assessing the performance of bio-inspired heuristics for single row layout problems' - brilliant


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
assessing the performance of bio inspired heuristics for single row layout problems

Assessing the performance of bio-inspired heuristics for single row layout problems

Berna ULUTAŞ B.Burak ULUTAŞ

Eskisehir Osmangazi University

Department of Industrial Engineering

30 June-2 July 2010 Oprerations Research and Industrial Engineering Conference

Sabanci University , Istanbul Turkey

outline
Outline
  • Single row facility layout problem (SRFLP)
  • Literature review
  • The algorithms to solve SRFLP
  • Experiments for the test problems
  • Results and discussion
the single row facility layout problem
The Single Row Facility Layout Problem
  • Arrangement of n machines/departments on a straight line in a given direction
  • Named as
    • One dimensional layout
    • Linear Ordering Problem (LOP) where all machines have unit length
slide4
Objective is to minimize the total material handling costs and to find the optimum layout for machines in one dimension
literature review for srflp
Literature review for SRFLP
  • Karp and Held (1967) Dynamic programming
  • Simmons (1969, 1971) Branch and bound algorithm
  • Love and Wong (1976) Linear mixed integer program
  • Picard and Queyranne (1981) Dynamic programming
  • Heragu and Kusiak (1988)Two heuristic constructive algorithms
  • Heragu and Kusiak (1991) Nonlinear model
  • Braglia (1997) Heuristics derived from scheduling problem
  • Djellab and Gourgand (2001) An iterative construction procedure
  • Ponnambalam and Ramkumar (2001), Chen et al. (2001), Ficko et al. (2004)GA
literature review for srflp cont
Literature review for SRFLP (cont’)
  • Ponnambalam and Ramkumar (2001) GA+SA
  • Ponnambalam et al. (2005) Hybrid search heuristics (Flow Line Analysis (FLA)+SA, FLA +GA, FLA+GA+SA)
  • Anjos et al. (2005) Semidefinite programming relaxation
  • Solimanpur et al. (2005)ACO
  • Amaral et al. (2005)SA
  • Amaral (2006) Linear mixed integer program
  • Teo and Ponnambalam (2008) ACO+PSO
  • Amaral (2009) Linear programming
  • Samarghandi and Eshghi (2010) TS
  • Samarghandi et al. (2010) PSO
slide9

The dimensions of the machines either are not considered or are assumed to be equal (Braglia, 1996)

  • The locations of facilities are predetermined (Kumar et al., 1995; Braglia, 1996)
  • The size of the machines is only considered in the physical layout of the machines (Heragu and Kusiak, 1988)
  • The method requires too much time to construct a layout, especially when applied to large instances of the SRFLP (Anjos et al., 2005).
the problem in concern
The problem in concern
  • Large size departments
  • Unequal dimensions (length)
  • No clearence
  • No backtracking
biologically inspired computing
Biologically inspired computing
  • genetic algorithms ↔ evolution
  • neural networks ↔ the brain
  • artificial immune systems ↔ immune system
  • emergent systems ↔ ants, bees
  • rendering (computer graphics) ↔ patterning and rendering of animal skins, bird feathers, mollusk shells and bacterial colonies
  • cellular automata ↔ life
slide12

Clonal selection

  • Bacterial foraging
slide14

AIS algorithms

Population based

Network based

Clonal selection

Continuousmodels

Bone marrow

Discrete models

Negative selection

slide15

m5

m2

m1

m6

m4

m3

Encoding

[m5 m2 m1 m6 m4 m3] = [5 2 1 6 4 3]

Representation

step 1 initialization
Step 1: Initialization
  • The antibodies are randomly generated based on the predetermined population size
step 2 evaluation
Step 2: Evaluation
  • For each antibody in the population, the objective function value is calculated
slide18

Selection of antibodies are made based on their objective valuesFor example, layouts that have lower cost values have the largest share on the wheel

Step 3: Selection and cloning

step 4 hypermutation
Step 4: Hypermutation
  • For each antibody in the population, hypermutationoperator is applied
  • Then, objective value of the mutated antibody is calculated
  • If there is an improvement, the existing antibody is replaced with the mutated one
step 5 receptor editing operator
Step 5: Receptor editing operator
  • A percentage of the antibodies (worst R% of the whole population) in the antibody population are eliminated and randomly created antibodies are replaced with them.
  • This procedure enables the algorithm to search new regions in the solution space.
step 6 repeat steps 2 5 until termination criterion is met
Step 6: Repeat Steps 2-5 until termination criterion is met
  • The algorithm is terminated if the best feasible solution has not improved after a predetermined number of iterations (i.e., 250).
slide24
BFA
  • is based on the foraging (i.e., searching food) strategy of Escherichia coli bacteria
step 1 initialization1
Step 1.Initialization
  • The bacteria are randomly generated based on the predetermined population size
step 2 chemotaxis
Step 2. Chemotaxis
  • is a foraging strategy that implements a type of local optimization
  • the bacteria try to climb up the nutrient concentration, avoid noxious substances
  • search for ways out of neutral media
  • is similar with biased random walk model
step 3 s warming
Step 3. Swarming
  • the bacteria move out from their respective places in ring of cells by moving up to the minimal value
  • bacteria usually tumble, followed by another tumble or tumble followed by run or swim
  • if the cost at present is better than the cost at the previous time or duration then the bacteria takes one more step in that direction
slide28

Nclones copies of the solution are generated so that there are (Nclones+1) identical solutions

  • Inverse mutation is applied to each of the Nclones copies
  • The solution surviving the mutation is the non-dominated solution among the mutated solutions
  • All other solutions are discarded
  • Repeat the procedure for all the solutions in the population

Tavakkoli-Moghaddam et al. (2007) A hybrid multi objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness

step 4 reproduction
Step 4. Reproduction
  • the bacteria are stored in ascending order based on their fitness
  • percent of the least healthy bacteria dies and others split into two which are placed in the same location
  • the population of bacteria remains constant
step 5 repeat steps 2 4 until termination criterion is met
Step 5. Repeat Steps 2-4 until termination criterion is met
  • The algorithm steps are repeated until the termination criterion is succeeded
algorithm parameters
Algorithm parameters
  • Population size : 10
  • Receptor editing / Reproduction rate : 10%
conclusions and results
Conclusions and Results
  • The performance metrics:
    • solution quality
    • speed of convergence
    • frequency of hitting the optimum
  • CSA and BFA outperformed best known results available in the literature
  • CSA obtained better results than BFA
further studies
Further studies
  • Design of experiments to determine the optimum parameters
  • Experiments with different termination criteria and larger population size
  • New strategies to improve BFA search capabilities
    • Considering the elimination and dispersal events that are based on population level long-distance mobile behavior
  • Real life application of SRLP