Application of Genetic Algorithms in Inventory Control

2016 ◽  
pp. 1087-1098
Author(s):  
Vinod Kumar Mishra
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Inventory Control ◽  
Future Trend ◽  
Production Engineering ◽  
Mathematical Sciences ◽  
Adaptive Heuristic ◽  
Definition Of ◽  
Key Terms

The genetic algorithm (GA) is an adaptive heuristic search procedures based on the mechanics of natural selection and natural genetics. Inventory control is widely used in the area of mathematical sciences, management sciences; system science, industrial engineering, production engineering etc. but they have wide differences in mathematical and computation maturity. This chapter enables the reader to understand the basic theory of genetic algorithm and how to apply the genetic algorithms for optimizing the parameters in inventory control The current and future trend of the research with the definition of key terms of genetic algorithm has also incorporated in this chapter.

Application of Genetic Algorithms in Inventory Control

2016 ◽  
pp. 32-46
Author(s):  
Vinod Kumar Mishra
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Inventory Control ◽  
Future Trend ◽  
Production Engineering ◽  
Mathematical Sciences ◽  
Adaptive Heuristic ◽  
Definition Of ◽  
Key Terms

The genetic algorithm (GA) is an adaptive heuristic search procedures based on the mechanics of natural selection and natural genetics. Inventory control is widely used in the area of mathematical sciences, management sciences; system science, industrial engineering, production engineering etc. but they have wide differences in mathematical and computation maturity. This chapter enables the reader to understand the basic theory of genetic algorithm and how to apply the genetic algorithms for optimizing the parameters in inventory control The current and future trend of the research with the definition of key terms of genetic algorithm has also incorporated in this chapter.

Evolutionary Computation and Genetic Algorithms

2011 ◽  
pp. 817-822
Author(s):  
William H. Hsu
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Computer Simulation ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Evolutionary Biology ◽  
Approximate Solutions ◽  
Learning Problems ◽  
Abstract Representations ◽  
Search Optimization

A genetic algorithm (GA) is a method used to find approximate solutions to difficult search, optimization, and machine learning problems (Goldberg, 1989) by applying principles of evolutionary biology to computer science. Genetic algorithms use biologically-derived techniques such as inheritance, mutation, natural selection, and recombination. They are a particular class of evolutionary algorithms. Genetic algorithms are typically implemented as a computer simulation in which a population of abstract representations (called chromosomes) of candidate solutions (called individuals) to an optimization problem evolves toward better solutions. Traditionally, solutions are represented in binary as strings of 0s and 1s, but different encodings are also possible. The evolution starts from a population of completely random individuals and happens in generations. In each generation, multiple individuals are stochastically selected from the current population, modified (mutated or recombined) to form a new population, which becomes current in the next iteration of the algorithm.

Penjadwalan Produksi Dengan Algoritma Genetik Untuk Meniminisasi Makespan di PT AAA

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
M. Ghassan Fattah ◽  
Rosnani Ginting
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Machine Scheduling ◽  
Optimal Timing ◽  
Scheduling Problems ◽  
Fitness Value ◽  
Genetic Algorithm Method

PT. AAA dari bulan Januari sampai Desember mendapat total 88 order dengan jumlah keterlambatan 12 order maka persentase keterlembatan adalah 13,63%. Tujuan penelitian ini adalah untuk merancangan penerapan algoritma genetik yang dapat menghindari keterlambatan order yaitu untuk mengukur makespan produk dan merancang urutan penjadwalan mesin. Penyelesaian masalah penjadwakan dengan algoritma genetik. Algoritma genetik merupakan teknik search stochastic yang berdasarkan mekanisme seleksi alam dan genetika natural dengan melakukan proses inisialisasi awal lalu dicari nilai fitness dari setiap individu, yang akan menjadi induk adalah yang memiliki nilai fitness terbaik lalu dilakukan proses penyilangan dan mutasi dan pemilihan waktu optimal. Dari hasil perhitungan dengan menggunakan metode Algoritma Genetika diperoleh urutan penjadwalan mesin terbaik dan dengan nilai makespan terkecil.   PT. AAA from January to December received a total of 88 orders with the number of delays of 12 orders, the percentage of bridges was 13.63%. The purpose of this study is to design the application of a genetic algorithm that can avoid delay in order to measure product makespan and design the order of machine scheduling. Resolving scheduling problems with genetic algorithms. Genetic algorithm is a search stochastic technique that is based on the mechanism of natural selection and natural genetics by carrying out the initial initialization process and then looks for the fitness value of each individual, who will be the parent who has the best fitness value and then the process of crossing and mutation and optimal timing. From the results of calculations using the Genetic Algorithm method, the best sequence of machine scheduling is obtained and with the smallest makespan value.

Application of Genetic Algorithm for the Support Location Optimization of Beams

1994 ◽  
Author(s):  
Bo Ping Wang ◽  
Jahau Lewis Chen
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Optimal Design ◽  
Design Process ◽  
Evolutionary Process ◽  
Location Optimization ◽  
Adaptive Procedures ◽  
Rigid Supports ◽  
Selection Of

Abstract Genetic algorithms are adaptive procedures that find solutions to problems by an evolutionary process that mimics natural selection. In this paper, the use of genetic algorithms for the selection of optimal support locations of beams is presented. Both elastic and rigid supports are considered. The approach of adapting the genetic algorithms into the optimal design process is described This approach is used to optimize locations of three supports for beam with three types of boundary conditions.

Evolutionary Computation and Genetic Algorithms

2011 ◽  
pp. 477-481
Author(s):  
William H. Hsu
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Natural Selection ◽  
Genetic Programming ◽  
Sexual Reproduction ◽  
Evolutionary Computation ◽  
Evolutionary Biology ◽  
Approximate Solutions ◽  
Biologically Inspired ◽  
Genetic Inheritance

A genetic algorithm (GA) is a procedure used to find approximate solutions to search problems through the application of the principles of evolutionary biology. Genetic algorithms use biologically inspired techniques, such as genetic inheritance, natural selection, mutation, and sexual reproduction (recombination, or crossover). Along with genetic programming (GP), they are one of the main classes of genetic and evolutionary computation (GEC) methodologies.

Parallel Dynamic Optimization of Steel Risers

2010 ◽  
Vol 133 (1) ◽  
Author(s):  
Rafael L. Tanaka ◽  
Clóvis de A. Martins
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Natural Selection ◽  
Dynamic Optimization ◽  
Solution Space ◽  
Optimization Method ◽  
Optimization Techniques ◽  
Objective Functions ◽  
Definition Of

This paper addresses the use of optimization techniques in the design of a steel riser. Two methods are used: the genetic algorithm, which imitates the process of natural selection, and the simulated annealing, which is based on the process of annealing of a metal. Both of them are capable of searching a given solution space for the best feasible riser configuration according to predefined criteria. Optimization issues are discussed, such as problem codification, parameter selection, definition of objective function, and restrictions. A comparison between the results obtained for economic and structural objective functions is made for a case study. Optimization method parallelization is also addressed.

Formulation of Colors Using a Genetic Algorithm

2012 ◽  
Vol 17 (4) ◽  
pp. 241-244
Author(s):  
Cezary Draus ◽  
Grzegorz Nowak ◽  
Maciej Nowak ◽  
Marcin Tokarski
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Production Process ◽  
Computer Technology ◽  
Manual Method ◽  
Apply Genetic ◽  
Computer Aided ◽  
Multiple Samples ◽  
Plastics Industry

Abstract The possibility to obtain a desired color of the product and to ensure its repeatability in the production process is highly desired in many industries such as printing, automobile, dyeing, textile, cosmetics or plastics industry. So far, most companies have traditionally used the "manual" method, relying on intuition and experience of a colorist. However, the manual preparation of multiple samples and their correction can be very time consuming and expensive. The computer technology has allowed the development of software to support the process of matching colors. Nowadays, formulation of colors is done with appropriate equipment (colorimeters, spectrophotometers, computers) and dedicated software. Computer-aided formulation is much faster and cheaper than manual formulation, because fewer corrective iterations have to be carried out, to achieve the desired result. Moreover, the colors are analyzed with regard to the metamerism, and the best recipe can be chosen, according to the specific criteria (price, quantity, availability). Optimaization problem of color formulation can be solved in many diferent ways. Authors decided to apply genetic algorithms in this domain.

Machine Learning Accelerated Genetic Algorithms for Computational Materials Search

2018 ◽  
Author(s):  
Steen Lysgaard ◽  
Paul C. Jennings ◽  
Jens Strabo Hummelshøj ◽  
Thomas Bligaard ◽  
Tejs Vegge
Keyword(s):  
Machine Learning ◽  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Au Nanoparticles ◽  
Learning Model ◽  
Energy Calculations ◽  
Atomic Distribution ◽  
Machine Learning Model ◽  
Fold Reduction ◽  
Computational Materials

A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.

scholarly journals Business E-NeGotiAtion: A Method Using a Genetic Algorithm for Online Dispute Resolution in B2B Relationships

2021 ◽  
Vol 16 (5) ◽  
pp. 1186-1216
Author(s):  
Nikola Simkova ◽  
Zdenek Smutny
Keyword(s):  
Genetic Algorithm ◽  
Dispute Resolution ◽  
Single Case ◽  
Computer Mediated Communication ◽  
Optimal Solution ◽  
Mediated Communication ◽  
Online Dispute Resolution ◽  
B2b Relationships ◽  
Definition Of ◽  
E Mail

An opportunity to resolve disputes as an out-of-court settlement through computer-mediated communication is usually easier, faster, and cheaper than filing an action in court. Artificial intelligence and law (AI & Law) research has gained importance in this area. The article presents a design of the E-NeGotiAtion method for assisted negotiation in business to business (B2B) relationships, which uses a genetic algorithm for selecting the most appropriate solution(s). The aim of the article is to present how the method is designed and contribute to knowledge on online dispute resolution (ODR) with a focus on B2B relationships. The evaluation of the method consisted of an embedded single-case study, where participants from two countries simulated the realities of negotiation between companies. For comparison, traditional negotiation via e-mail was also conducted. The evaluation confirms that the proposed E-NeGotiAtion method quickly achieves solution(s), approaching the optimal solution on which both sides can decide, and also very importantly, confirms that the method facilitates negotiation with the partner and creates a trusted result. The evaluation demonstrates that the proposed method is economically efficient for parties of the dispute compared to negotiation via e-mail. For a more complicated task with five or more products, the E-NeGotiAtion method is significantly more suitable than negotiation via e-mail for achieving a resolution that favors one side or the other as little as possible. In conclusion, it can be said that the proposed method fulfills the definition of the dual-task of ODR—it resolves disputes and builds confidence.

scholarly journals Optimal Sizing and Placement of Capacitor Banks in Distribution Networks Using a Genetic Algorithm

Electricity ◽  
2021 ◽  
Vol 2 (2) ◽  
pp. 187-204
Author(s):  
Gian Giuseppe Soma
Keyword(s):  
Genetic Algorithm ◽  
Electricity Market ◽  
Distribution Systems ◽  
Reactive Power ◽  
Electricity Consumption ◽  
Distribution Networks ◽  
Optimal Placement ◽  
Capacitor Banks ◽  
Control Pattern ◽  
Definition Of

Nowadays, response to electricity consumption growth is mainly supported by efficiency; therefore, this is the new main goal in the development of electric distribution networks, which must fully comply with the system’s constraints. In recent decades, the issue of independent reactive power services, including the optimal placement of capacitors in the grid due to the restructuring of the electricity industry and the creation of a competitive electricity market, has received attention from related companies. In this context, a genetic algorithm is proposed for optimal planning of capacitor banks. A case study derived from a real network, considering the application of suitable daily profiles for loads and generators, to obtain a better representation of the electrical conditions, is discussed in the present paper. The results confirmed that some placement solutions can be obtained with a good compromise between costs and benefits; the adopted benefits are energy losses and power factor infringements, taking into account the network technical limits. The feasibility and effectiveness of the proposed algorithm for optimal placement and sizing of capacitor banks in distribution systems, with the definition of a suitable control pattern, have been proved.

Sign in / Sign up

Export Citation Format

Share Document