Christoph F. Eick: Using EC to Solve Transportation Problems On Initialization and Mutation 1.Values t ij have to be between 0 and min(source(i),distination(j))

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems Introduction.
Advertisements

Crew Pairing Optimization with Genetic Algorithms
Load Balancing Parallel Applications on Heterogeneous Platforms.
Local Search Algorithms
Chapter Matrices Matrix Arithmetic
Managerial Decision Making and Problem Solving Computer Lab Notes 1.
Transportation Problem (TP) and Assignment Problem (AP)
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
Chapter 4 Randomized Blocks, Latin Squares, and Related Designs
Experimental Design, Response Surface Analysis, and Optimization
Part 3 Linear Programming 3.4 Transportation Problem.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
Hybridization of Search Meta-Heuristics Bob Buehler.
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Branch and Bound Similar to backtracking in generating a search tree and looking for one or more solutions Different in that the “objective” is constrained.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.
Reporter : Mac Date : Multi-Start Method Rafael Marti.
Iterative Improvement Algorithms
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Linear Programming Applications
Brandon Andrews.  What are genetic algorithms?  3 steps  Applications to Bioinformatics.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
HOW TO SOLVE IT? Algorithms. An Algorithm An algorithm is any well-defined (computational) procedure that takes some value, or set of values, as input.
Ranga Rodrigo April 6, 2014 Most of the sides are from the Matlab tutorial. 1.
Genetic Algorithm.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
1 / 20 Arkadij Zakrevskij United Institute of Informatics Problems of NAS of Belarus A NEW ALGORITHM TO SOLVE OVERDEFINED SYSTEMS OF LINEAR LOGICAL EQUATIONS.
Chapter 12 Recursion, Complexity, and Searching and Sorting
Chapter 7 Handling Constraints
Algebra 3: Section 5.5 Objectives of this Section Find the Sum and Difference of Two Matrices Find Scalar Multiples of a Matrix Find the Product of Two.
Christoph F. Eick: Applications of GAs Ideas for the Transportation Problem  Although the textbook’s initialization procedure has some flaws (which?),
Applying Genetic Algorithm to the Knapsack Problem Qi Su ECE 539 Spring 2001 Course Project.
Fuzzy Genetic Algorithm
Christoph F. Eick: Using EC to Solve Transportation Problems Transportation Problems.
Exact and heuristics algorithms
Local Search Pat Riddle 2012 Semester 2 Patricia J Riddle Adapted from slides by Stuart Russell,
Applications of Genetic Algorithms TJHSST Computer Systems Lab By Mary Linnell.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Introduction to Genetic Algorithms. Genetic Algorithms We’ve covered enough material that we can write programs that use genetic algorithms! –More advanced.
Tetris Agent Optimization Using Harmony Search Algorithm
Biologically inspired algorithms BY: Andy Garrett YE Ziyu.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Christoph F. Eick: Thoughts on Designing Michigan-style Classifier Systems Thoughts on Selection Methods in Michigan-style Classifier Systems  When solving.
Class Scheduling Using Constraint Satisfaction Victoria Donelson Garrett Grimsley.
Constrained Optimization by the  Constrained Differential Evolution with an Archive and Gradient-Based Mutation Tetsuyuki TAKAHAMA ( Hiroshima City University.
Genetic Algorithm(GA)
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Implementation & Integration Research Paper Presentation Nick Conway.
NAME THAT ALGORITHM #2 HERE ARE SOME PROBLEMS. SOLVE THEM. GL HF.
Genetic Algorithms.
Analysis of Algorithms
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
NAME: OLUWATOSIN UTHMAN ZUBAIR (145919) COURSE: NETWORK FLOW
Example: Applying EC to the TSP Problem
Example: Applying EC to the TSP Problem
Branch and Bound.
Example: Applying EC to the TSP Problem
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Alex Bolsoy, Jonathan Suggs, Casey Wenner
Presentation transcript:

Christoph F. Eick: Using EC to Solve Transportation Problems On Initialization and Mutation 1.Values t ij have to be between 0 and min(source(i),distination(j)) 2.I can compute delta_t ij =min(Source(i)  Sum j tij, destination(j)  Sum i tij), which is how much tij has to be increased/decreased to satisfy the constraints 3.Simple Initialization Procedure: Set tij to 0 initially, and visit tij in some random order and assign the maximum allowed value (delta_tij) to it---[[but tij is larger than min(source(i),distination(j)) (or less than 0) it is set to min(source(i),distination(j)) (set to 0)]] 4.Complex initialization procedure: Use multiple loops and assign a percentage of the maximum increase to tij, and set it to tij+delta_tij in the last iteration. 5.Reverse initialization procedure: assign min(source(i),destination(j) to tij and reduce it… 6.Mutation: Change tij by adding/subtracting a number from it, not violating condition 1, and reuse the simple (complex??) initialization procedure: negative delta_tij values result in a reduction of the amount transported

Christoph F. Eick: Using EC to Solve Transportation Problems Ideas for the Transportation Problem  If M1 and M2 are legal solutions, a*M1 + b*M2 (with a,b>0 a+b=1) are also legal solutions. This provides as with a quite natural crossover operator. This operator is called arithmetical crossover in the EC numerical optimization literature.  Boundary Mutation (that sets the value of one (possibly more) elements of the matrix to its minimum (0) or maximum possible value (min(source(i), dest(j))), might also have some merit.

Christoph F. Eick: Using EC to Solve Transportation Problems Some Initial Thoughts on the Course Project  Have a general theme  Compare at least 2 approaches (could be similar or the second approach could be kind of trivial)  Run algorithms at least 3 times (you might just be unlucky)  Report the results of running the benchmark transparently and completely  Interpret your results (even if there is no clear evidence pointing into one direct); explain your results (could be speculative)  Report the history of the project.  What was expected, what was unexpected?

Christoph F. Eick: Using EC to Solve Transportation Problems Conducting Experiments in General and in the Context of the Transportation Problem  Things to observe when running an EC-system  Average fitness  Best solution found so far  Diversity in the current population (expensive)  Degree of change from generation to generation  Visualizing the current best solutions could be helpful  Size of searched solutions; building blocks in the searched solutions  Complexity: runtime, storage, number of genetic operators applied,…  What parts of the search space are searched (hard to analyze)  Things to report when summarizing experiments  Experimental Environment: Operators used and probabilities of their application, selection method, population size, best found solution, best average fitness.  Observed Results: Best solution found, best fitness/average fitness over time, diversity over time.

Christoph F. Eick: Using EC to Solve Transportation Problems Reverse Initialization Algorithm Let row(I) the sum of elements in the I-th row Let col(j) the sum of the elements in the j-th column Let sour(I) the sum of the supplies of the I-th row Let dest(j) the demand for the j-th colums Let dest(j)=<col(j) and source(I)=<row(I) for I,j=… Visit the matrix elements (possibly excluding some elements) in some randomly selected order and do the following with the visited element v ij with its current value v:  maxred= min(col(j)-dist(j), row(i)-sour(i))  r= min(v, maxred)  v ij =v ij -r; row(i)=row(i)-r; col(j)=col(j); 2001 Material

Christoph F. Eick: Using EC to Solve Transportation Problems Boundary Mutation Boundary Mutation: 1.Selection an element of the matrix 2.Set it to its maximum possible value (4 in the example) 3.Rerun a reverse initialization algorithm (the normal initialization algorithm) that reduces the elements of a matrix until the source and destination amounts are correct Material