An AIS-based hybrid algorithm for static job shop scheduling problem

link_to_OA_fulltex

CAN LINEAR PROGRAMMING ASSIST METAHEURISTICS IN FOREST PRODUCTION PLANNING PROBLEM?

The planning of forest production requires the adoption of mathematical models to optimize the utilization of available resources. Hence, studies involving the improvement of decision-making processes must be performed. Herein, we evaluate an alternative method for improving the performance of metaheuristics when they are applied for identifying solutions to problems in forest production planning. The inclusion of a solution obtained by rounding the optimal solution of linear programming to a relaxed problem is investigated. Such a solution is included in the initial population of the clonal selection algorithm, genetic algorithm, simulated annealing, and variable neighborhood search metaheuristics when it is used to generate harvest and planting plans in an area measuring 4,210 ha comprising 120 management units with ages varying between 1 and 6 years. The same algorithms are executed without including the solutions mentioned in the initial population. Results show that the performance of the clonal selection algorithm, genetic algorithm, and variable neighborhood search algorithms improved significantly. Positive effects on the performance of the simulated annealing metaheuristic are not indicated. Hence, it is concluded that rounding off the solution to a relaxed problem is a good alternative for generating an initial solution for metaheuristics

Application of an evolutionary algorithm-based ensemble model to job-shop scheduling

In this paper, a novel evolutionary algorithm is applied to tackle job-shop scheduling tasks in manufacturing environments. Specifically, a modified micro genetic algorithm (MmGA) is used as the building block to formulate an ensemble model to undertake multi-objective optimisation problems in job-shop scheduling. The MmGA ensemble is able to approximate the optimal solution under the Pareto optimality principle. To evaluate the effectiveness of the MmGA ensemble, a case study based on real requirements is conducted. The results positively indicate the effectiveness of the MmGA ensemble in undertaking job-shop scheduling problems

Diseño de una heurística eficiente basada en Teoría de Restricciones para la programación de sistemas Job Shop

Los procesos y procedimientos en las industrias requieren de tres elementos básicos para una gestión adecuada: la planeación, la programación y el control de la producción. En particular, el tema de la programación de la producción es uno de los elementos neurálgicos en diversas compañías, por lo que se constituye en una respuesta operativa para optimizar la producción de un bien o servicio. Esto significa que mediante la programación se puede predecir donde podrían estar las pérdidas de tiempo o las sobrecargas entre los centros de producción o procesos. Así mismo permite el control diario y periódico de las tareas y la correcta toma de decisiones. Todo ello para cumplir con los plazos de entrega establecidos y tener un óptimo uso de los recursos. El objetivo de este documento es ofrecer una visión de este problema y las variables que influyen para la realización de la producción en empresas de ambientes Job Shop, teniendo en cuenta sus inicios hasta la actualidad, destacando las referencias y las propuestas de los principales autores y comparando las herramientas más influyentes.Universidad Libre Seccional Barranquilla -- Facultad de Ingeniería -- Ingeniería Industria

Artificial immune system for static and dynamic production scheduling problems

Over many decades, a large number of complex optimization problems have brought researchers' attention to consider in-depth research on optimization. Production scheduling problem is one of the optimization problems that has been the focus of researchers since the 60s. The main problem in production scheduling is to allocate the machines to perform the tasks. Job Shop Scheduling Problem (JSSP) and Flexible Job Shop Scheduling Problem (FJSSP) are two of the areas in production scheduling problems for these machines. One of the main objectives in solving JSSP and FJSSP is to obtain the best solution with minimum total completion processing time. Thus, this thesis developed algorithms for single and hybrid methods to solve JSSP and FJSSP in static and dynamic environments. In a static environment, no change is needed for the produced solution but changes to the solution are needed. On the other hand, in a dynamic environment, there are many real time events such as random arrival of jobs or machine breakdown requiring solutions. To solve these problems for static and dynamic environments, the single and hybrid methods were introduced. Single method utilizes Artificial Immune System (AIS), whereas AIS and Variable Neighbourhood Descent (VND) are used in the hybrid method. Clonal Selection Principle (CSP) algorithm in the AIS was used in the proposed single and hybrid methods. In addition, to evaluate the significance of the proposed methods, experiments and One-Way ANOVA tests were conducted. The findings showed that the hybrid method was proven to give better performance compared to single method in producing optimized solution and reduced solution generating time. The main contribution of this thesis is the development of an algorithm used in the single and hybrid methods to solve JSSP and FJSSP in static and dynamic environment

Atölye tipi çizelgeleme problemlerinde evrimsel algoritmalar ile yapay arı kolonisi algoritmasının bütünleşik bir yaklaşımı

06.03.2018 tarihli ve 30352 sayılı Resmi Gazetede yayımlanan “Yükseköğretim Kanunu İle Bazı Kanun Ve Kanun Hükmünde Kararnamelerde Değişiklik Yapılması Hakkında Kanun” ile 18.06.2018 tarihli “Lisansüstü Tezlerin Elektronik Ortamda Toplanması, Düzenlenmesi ve Erişime Açılmasına İlişkin Yönerge” gereğince tam metin erişime açılmıştır.Hayatımızın birçok alanında çok önemli bir yeri olan çizelgeleme problemlerinin çözümü ile ilgili olarak yıllardır çok ciddi çalışmalar yapılmıştır. Bu çalışmaların yapılmasında şüphesiz en büyük sebep, mevcut çizelgeye göre daha iyilerinin geliştirilmesini sağlamaya çalışmak ve daha büyük kazanç ve verimlilikler ortaya koymaktır. Bundan dolayı, doğru ve etkin bir çizelgeleme, hem insanlar hem de işletmeler için büyük önem arz etmektedir. Bu bağlamda özellikle son yıllarda çizelgeleme problemlerinin çözümünde sezgisel algoritmaların araştırmacılar tarafından yoğun bir biçimde kullanıldığı görülmektedir. Bu tez çalışmasında, atölye tipi çizelgeleme problemlerinin çözümünün eniyilemesi için bütünleşik bir yaklaşım önerilmiştir. Bu bağlamda sürü zekâsına dayalı sezgisel algoritmalardan olan yapay arı kolonisi algoritması ile evrimsel algoritmalar bütünleşik yaklaşım için kullanılmıştır. Önerilen metot, atölye tipi çizelgeleme ile ilgili data setlerine uygulanmış ve elde edilen sonuçlar ortalama bağıl hata yüzdesi (ARPE) ile ortalama bağıl sapma yüzdesi (ARPD) kriterleri kullanılarak, karınca kolonisi optimizasyon (ACO) tekniği, kuş sürüsü algoritması (PSO) ve diferansiyel gelişim (DE) algoritması ile kıyaslanmıştır. Sonuçlar kıyaslanırken, parametrik ve parametrik olmayan testler kullanılarak metotlar arasında istatistiksel olarak anlamlı farklar olup olmadığı kurulan hipotezlerle araştırılmıştır. ARPE kriterine göre, önerilen yaklaşım ile ACO tekniği sonuçları arasında istatistiksel olarak anlamlı farklar gözlemlenirken, önerilen metot ile PSO ve DE algoritmalarının sonuçları arasında ise istatistiksel olarak anlamlı farklar olmadığı görülmüştür. Yapılan testler sonucunda, önerilen metot ile elde edilen ARPE değeri, ACO metodu ile elde edilen ARPE değerinden 4,3 puan (yüzdesel değişim olarak) daha düşük olduğundan daha etkin bir netice vermiştir. ARPD kriterine göre ise, önerilen yaklaşım ile diğer tüm algoritmaların sonuçları arasında istatistiksel olarak anlamlı farklar olduğu yapılan testlerle ortaya konmuştur. Yapılan testler sonucunda, önerilen metot ile elde edilen ARPD değeri, ACO metodu ile elde edilen ARPD değerinden 6,3 puan, PSO metodu ile elde edilen ARPD değerinden 0,6 puan, DE metodu ile elde edilen ARPD değerinden ise 0,7 puan daha düşük olduğundan daha kararlı ve etkin neticeler vermiştir. Yapılan testler sonucunda, çizelgelemesi yapılacak olan iş veya makine sayısının 20 ve 20'den az olduğu durumlarda önerilen metodun çok daha hızlı ve etkin sonuçlar verdiği gözlemlenmiştir.There have been a lot of research made about solution of scheduling problems that have a very important place in many areas of our lives for years. The cause of these researches is to develop better than the current schedule and achieve greater profits. Therefore, there is great importance of efficient scheduling for both humans and businesses. In this context, heuristic algorithms are used extensively by researchers for solving scheduling problems in recent years. In this dissertation study, an integrated approach has been developed for optimizing the solution of job shop scheduling problems. In this context, artificial bee colony algorithm and evolutionary algorithms are used for the integrated approach. The proposed hybrid method has been applied to data sets related to job shop scheduling. The obtained results have been compared with the results of different optimization techniques that these techniques are ant colony optimization (ACO), particle swarm optimization (PSO) and differential evolution algorithm (DE) using the average relative error percentage (ARPE) and average relative percentage deviation (ARPD) criteria. It has investigated whether statistically significant differences among methods using parametric and non-parametric tests with the founded hypotheses for the comparisons. According to the ARPE criterion, statistically significant differences have been obtained between the results of the recommended approach and ACO technique. According to the same criterion, statistically significant differences have not been observed between the result of the proposed method with PSO and DE algorithms. ARPE value of the recommended approach yielded 4.3 points (as percentage changes) more effective than ARPE value of the ACO technique according to the results of the tests. According to the ARPD criterion, statistically significant differences have been obtained between the results of the recommended approach and other all techniques. According to the results of the tests, ARPD value of the proposed method yielded more effective and stable of 6.3 points than ARPE value of the ACO technique, of 0.6 points than ARPE value of the PSO algorithm, of 0.7 points than ARPE value of the DE algorithm. According to the results of the tests, it observed that the proposed method has much faster and more effective results in conditions less than 20 number of machines or jobs which will be scheduling

Numerical and Evolutionary Optimization 2020

This book was established after the 8th International Workshop on Numerical and Evolutionary Optimization (NEO), representing a collection of papers on the intersection of the two research areas covered at this workshop: numerical optimization and evolutionary search techniques. While focusing on the design of fast and reliable methods lying across these two paradigms, the resulting techniques are strongly applicable to a broad class of real-world problems, such as pattern recognition, routing, energy, lines of production, prediction, and modeling, among others. This volume is intended to serve as a useful reference for mathematicians, engineers, and computer scientists to explore current issues and solutions emerging from these mathematical and computational methods and their applications