A Framework of Genetic Algorithm Improvement for Optimal Block Division in Lining Layout Planning

Badarudin, I. M.; Sultan, A. B. M.; Sulaiman, M. N.; Mamat, A.; Mohamed, M. T. M.
May 2012
Journal of Artificial Intelligence;2012, Vol. 5 Issue 2, p64
Academic Journal
This study focuses on the Genetic Algorithm (GA) as solution strategy for block division in Lining Layout Planning (LLP). Block division is optimal when the combined shapes in an area promote no empty space. This problem requires huge number of possible solutions to be analyzed and it is considered as a set of space allocation problems. Classical Genetic Algorithm (CGA) with basic operators was applied to find optimal solution. Despite CGA is able to promote the optimal result however it has opportunity to improve time efficiency. Therefore, a framework of GA improvement (IGA) for block division was introduced by looking into the genes of chromosome for problem representation and prior to the processes of crossover and mutation. The IGA involves three strategies which are; (1) specific random value for chromosome representation, (2) deterministic crossover is to avoid from the same result of crossover process and (3) deterministic mutation is to protect overlapping shapes. This paper reported the theoretical analysis of possible improvements and then generates results from the various coordinates of areas to evaluate the performance of the CGA and IGA. The overall result presents that IGA promoted fewer number of repetitions than CGA and as a result IGA expedites processing time to obtain optimal result.


Related Articles

  • PROBLEM SOLVING WITH GENETIC ALGORITHMS. Engel, Bill // Mathematics & Computer Education;Fall2000, Vol. 34 Issue 3, p277 

    The article explores the use of genetic algorithms (GA) in solving complex mathematical problems and natural selection theorem. It describes the computational procedures of GA in the optimization of mathematical functions represented in a cardboard box in the computer program. GA is involved in...

  • Assembly line balancing based on an adaptive genetic algorithm. Jianfeng Yu; Yuehong Yin // International Journal of Advanced Manufacturing Technology;Jul2010, Vol. 48 Issue 1-4, p347 

    An adaptive genetic algorithm is presented as an intelligent algorithm for the assembly line balancing in this paper. The probability of crossover and mutation is dynamically adjusted according to the individual’s fitness value. The individuals with higher fitness values are assigned to...

  • Experimental analysis of crossover and mutation operators on the quadratic assignment problem. Ahmed, Zakir // Annals of Operations Research;Dec2016, Vol. 247 Issue 2, p833 

    In genetic algorithms crossover is the most important operator where pair of chromosomes and crossover site along their common length are selected randomly. Then the information after the crossover site of the parent chromosomes is swapped. On the other hand, mutation operator randomly alters...

  • Efficient Implementations of Some Genetic Mutation Operators for the Permutation Encoding in Scheduling. Nicoară, Simona // Petroleum - Gas University of Ploiesti Bulletin, Mathematics - I;2009, Vol. 61 Issue 2, p67 

    A genetic algorithm is a time consuming technique, especially for the big complex problems. Therefore, any run-time optimization regarding applying the genetic operators is very useful, taking into account that these operators apply many times in every generation. In this paper we propose...

  • Using an Efficient New Gene for Genetic Algorithm to Solve the Multi-buyer Joint Replenishment Problem. Chun-Wei R. Lin; Hsian-Jong Hsiau // Contemporary Management Research;2011, Vol. 7 Issue 4, p313 

    The multi-buyer joint replenishment problem (MJRP) is the multi-item inventory problem which deals with the replenishment of a group of product items that are jointly delivered to multi-buyer. The objective of MJRP is to develop policy to minimize the total cost which consists of the holding...

  • Hybridizing Genetic Algorithm with Biased Chance Local Search. Basikhasteh, Mehdi; Movafaghpour, Mohamad A. // World Academy of Science, Engineering & Technology;Aug2011, Issue 56, p354 

    This paper explores university course timetabling problem. There are several characteristics that make scheduling and timetabling problems particularly difficult to solve: they have huge search spaces, they are often highly constrained, they require sophisticated solution representation schemes,...

  • Image annotation techniques based on feature selection for class-pairs. Jianjiang Lu; Ran Li; Yafei Zhang; Tianzhong Zhao; Zining Lu // Knowledge & Information Systems;Aug2010, Vol. 24 Issue 2, p325 

    Image annotation technique can be formulated as a multi-class classification problem, which can be solved by the ensemble of multiple class-pair classifiers. Support vector machine (SVM) classifiers based on optimal class-pair feature subsets from the multimedia content description interface...

  • SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM. Samanta, Sourav; De, Anwesha; Singha, Satrughna // International Journal of Engineering Science & Technology;2011, Vol. 3 Issue 8, p6622 

    In this paper the implementation and performance of a new unconventional selection operator for Genetic Algorithm have been emphasized. The operator has been tuned specifically to solve the Travelling Salesman Problem. The proposed Selection Operator has been utilized based on Sequential...

  • Genetic algorithm for dyad pattern finding in DNA sequences. Zare-Mirakabad, Fatemeh; Ahrabian, Hayedeh; Sadeghi, Mehdi; Hashemifar, Somaieh; Nowzari-Dalini, Abbas; Goliaei, Bahram // Genes & Genetic Systems;2009, Vol. 84 Issue 1, p81 

    In this paper a novel genetic algorithm is presented for the dyad motif finding problem. The genetic algorithm uses a multi-objective fitness function based on the sum of pairs, the number of matches, and the information content. The individuals required for the population pool in the genetic...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics