scholarly journals The Use of a Simulation Model for High-Runner Strategy Implementation in Warehouse Logistics

2020 ◽  
Vol 12 (23) ◽  
pp. 9818
Author(s):  
Gabriel Fedorko ◽  
Vieroslav Molnár ◽  
Nikoleta Mikušová
Keyword(s):  
Genetic Algorithm ◽  
Simulation Model ◽  
Optimization Problem ◽  
Software Tool ◽  
Time Saving ◽  
General Validity ◽  
Resistance Function ◽  
Genetic Algorithm Method ◽  
Working Day ◽  
Enterprise Logistics

This paper examines the use of computer simulation methods to streamline the process of picking materials within warehouse logistics. The article describes the use of a genetic algorithm to optimize the storage of materials in shelving positions, in accordance with the method of High-Runner Strategy. The goal is to minimize the time needed for picking. The presented procedure enables the creation of a software tool in the form of an optimization model that can be used for the needs of the optimization of warehouse logistics processes within various types of production processes. There is a defined optimization problem in the form of a resistance function, which is of general validity. The optimization is represented using the example of 400 types of material items in 34 categories, stored in six rack rows. Using a simulation model, a comparison of a normal and an optimized state is realized, while a time saving of 48 min 36 s is achieved. The mentioned saving was achieved within one working day. However, the application of an approach based on the use of optimization using a genetic algorithm is not limited by the number of material items or the number of categories and shelves. The acquired knowledge demonstrates the application possibilities of the genetic algorithm method, even for the lowest levels of enterprise logistics, where the application of this approach is not yet a matter of course but, rather, a rarity.

scholarly journals Optimized design of concrete-filled steel columns

2022 ◽  
Vol 15 (1) ◽  
Author(s):  
Jéssica Salomão Lourenção ◽  
Paulo Augusto Tonini Arpini ◽  
Gabriel Erlacher ◽  
Élcio Cassimiro Alves
Keyword(s):  
Genetic Algorithm ◽  
Cost Efficiency ◽  
Optimization Problem ◽  
Optimized Design ◽  
Composite Columns ◽  
Steel Columns ◽  
Normal Forces ◽  
Steel Bars ◽  
Genetic Algorithm Method ◽  
Filled Composite

Abstract The objective of this paper is to present the formulation of the optimization problem and its application to the design of concrete-filled composite columns with and without reinforcement steel bars, according to recommendations from NBR 8800:2008, NBR 16239:2013 and EN 1994-1-1:2004. A comparative analysis between the aforementioned standards is performed for various geometries considering cost, efficiency and materials in order to verify which parameters influence the solution of the composite column that satisfies the proposed problems. The solution of the optimization problem is obtained by using the genetic algorithm method featured in MATLAB’s guide toolbox. For the examples analyzed, results show that concretes with compressive strength greater than 50MPa directly influence the solution of the problem regarding cost and resistance to normal forces.

Optimization of Contact Problem by Genetic Algorithm Method

2011 ◽  
Vol 105-107 ◽  
pp. 386-391 ◽  
Author(s):  
Jan Szweda ◽  
Zdenek Poruba
Keyword(s):  
Genetic Algorithm ◽  
Contact Problem ◽  
Shape Optimization ◽  
Optimization Problem ◽  
Optimization Technique ◽  
Contact Problems ◽  
Global Optimum ◽  
Genetic Algorithm Method ◽  
Characteristic Features ◽  
Contact Shape

In this paper is discussed the way of suitable numerical solution of contact shape optimization problem. The first part of the paper is focused on method of global optimization field among which the genetic algorithm is chosen for computer processing and for application on contact problem optimization. The brief description of this method is done with emphasis of its characteristic features. The experiment performed on plane structural problem validates the ability of genetic algorithm in search the area of the global optimum. On the base of the research described in this work, it is possible to recommend optimization technique of genetic algorithm to use for shape optimization of engineering contact problems in which it is possible for any shape to achieve successful convergence of contact task solution.

scholarly journals An Improved MOEA/D Based on Reference Distance for Software Project Portfolio Optimization

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jing Xiao ◽  
Jing-Jing Li ◽  
Xi-Xi Hong ◽  
Min-Mei Huang ◽  
Xiao-Min Hu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithms ◽  
Portfolio Optimization ◽  
Optimization Problem ◽  
Experimental Comparison ◽  
Software Project ◽  
Project Portfolio ◽  
Multiobjective Evolutionary Algorithms ◽  
Reference Distance ◽  
Nondominated Sorting

As it is becoming extremely competitive in software industry, large software companies have to select their project portfolio to gain maximum return with limited resources under many constraints. Project portfolio optimization using multiobjective evolutionary algorithms is promising because they can provide solutions on the Pareto-optimal front that are difficult to be obtained by manual approaches. In this paper, we propose an improved MOEA/D (multiobjective evolutionary algorithm based on decomposition) based on reference distance (MOEA/D_RD) to solve the software project portfolio optimization problems with optimizing 2, 3, and 4 objectives. MOEA/D_RD replaces solutions based on reference distance during evolution process. Experimental comparison and analysis are performed among MOEA/D_RD and several state-of-the-art multiobjective evolutionary algorithms, that is, MOEA/D, nondominated sorting genetic algorithm II (NSGA2), and nondominated sorting genetic algorithm III (NSGA3). The results show that MOEA/D_RD and NSGA2 can solve the software project portfolio optimization problem more effectively. For 4-objective optimization problem, MOEA/D_RD is the most efficient algorithm compared with MOEA/D, NSGA2, and NSGA3 in terms of coverage, distribution, and stability of solutions.

ONE IMPROVED AGENT GENETIC ALGORITHM — RING-LIKE AGENT GENETIC ALGORITHM FOR GLOBAL NUMERICAL OPTIMIZATION

2009 ◽  
Vol 26 (04) ◽  
pp. 479-502 ◽  
Author(s):  
BIN LIU ◽  
TEQI DUAN ◽  
YONGMING LI
Keyword(s):  
Genetic Algorithm ◽  
Numerical Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Genetic Operators ◽  
Global Numerical Optimization ◽  
Candidate Solution ◽  
Low Dimension ◽  
Multi Agent ◽  
Agent Structure

In this paper, a novel genetic algorithm — dynamic ring-like agent genetic algorithm (RAGA) is proposed for solving global numerical optimization problem. The RAGA combines the ring-like agent structure and dynamic neighboring genetic operators together to get better optimization capability. An agent in ring-like agent structure represents a candidate solution to the optimization problem. Any agent interacts with neighboring agents to evolve. With dynamic neighboring genetic operators, they compete and cooperate with their neighbors, and they can also use knowledge to increase energies. Global numerical optimization problems are the most important ones to verify the performance of evolutionary algorithm, especially of genetic algorithm and are mostly of interest to the corresponding researchers. In the corresponding experiments, several complex benchmark functions were used for optimization, several popular GAs were used for comparison. In order to better compare two agents GAs (MAGA: multi-agent genetic algorithm and RAGA), the several dimensional experiments (from low dimension to high dimension) were done. These experimental results show that RAGA not only is suitable for optimization problems, but also has more precise and more stable optimization results.

Sign in / Sign up

Export Citation Format

Share Document