A heuristic approach to solve the elementary sprint optimization problem for non-cross-functional teams in Scrum

2015 ◽  
Vol 14 (4) ◽  
pp. 19-26 ◽  
Author(s):  
Fabian Sobiech ◽  
Beate Eilermann ◽  
Andreas Rausch
Author(s):  
Johan Lo¨o¨f ◽  
Lars Lindkvist ◽  
Rikard So¨derberg

The way parts are located in relation to each other or in fixtures is critical for how geometrical variation will propagate and cause variation in critical product dimensions. Therefore, more emphasis should be put on this activity in early design phases in order to avoid assembly and production problems later on. In earlier literature, locator positions have been defined using optimization to reach a robust locating scheme. This implies that the total robustness of a part is optimized by placing the locators in an optimal way. Sometimes there are areas on parts that are more sensitive to variation than others. Therefore, this paper suggests an approach for optimizing the positions of locators in a locating scheme to maximize robustness in defined critical dimensions. A formulation of an optimization problem is presented, and an algorithm solving this in a heuristic approach is developed. Finally, this algorithm is applied on an industrial example.


Author(s):  
Dawid Połap ◽  
Marcin Woźniak ◽  
Waldemar Hołubowski ◽  
Robertas Damaševičius

AbstractThe third type of neural network called spiking is developed due to a more accurate representation of neuronal activity in living organisms. Spiking neural networks have many different parameters that can be difficult to adjust manually to the current classification problem. The analysis and selection of coefficients’ values in the network can be analyzed as an optimization problem. A practical method for automatic selection of them can decrease the time needed to develop such a model. In this paper, we propose the use of a heuristic approach to analyze and select coefficients with the idea of collaborative working. The proposed idea is based on parallel analyzing of different coefficients and choosing the best of them or average ones. This type of optimization problem allows the selection of all variables, which can significantly affect the convergence of the accuracy. Our proposal was tested using network simulators and popular databases to indicate the possibilities of the described approach. Five different heuristic algorithms were tested and the best results were reached by Cuckoo Search Algorithm, Grasshopper Optimization Algorithm, and Polar Bears Algorithm.


Author(s):  
Mainak Mitra ◽  
Alparslan Emrah Bayrak ◽  
Stefano Zucca ◽  
Bogdan I. Epureanu

This paper investigates methodologies for finding optimal or near-optimal blade arrangements in a bladed disk with inserted blades for minimizing or maximizing blade response amplification due to mistuning in material properties of the blades. The mistuning in the blades is considered to be known, and only their arrangement is modifiable. Hence, this is a problem in discrete optimization, particularly combinatorial optimization where the objective of response amplification is a nonlinear function of the blade arrangement. Previous studies have treated mistuning as a continuous parameter to analyze its effects on the response amplification. Sensitivity metrics have proven to be an important tool in quantifying the effects of mistuning. One such sensitivity metric is used here to formulate an iterative heuristic approach to solve the optimization problem. A component mode mistuning reduced order model is used for fast evaluations of the dynamic responses of a bladed disk with a given blade arrangement. At any iteration the sensitivity of the maximum response of the current rotor design to changes in blade stiffnesses due to changes in the blade arrangement is used to predict the arrangement for the following iteration. In addition to the proposed sensitivity-based approach, we use genetic algorithms to find optimal arrangements and compare results with the heuristic approach.


2019 ◽  
Vol 30 (2) ◽  
pp. 11-23
Author(s):  
Mohd K. Shambour Mohd K. Shambour

t. Every year, more than two million Muslims come to the holy city, Makkah, to perform Hajj (the Islamic pilgrimage). One of Hajj rituals is to spend two to three nights in Mina, one of the holy sites. Distributing Muslim pilgrims in Mina, respecting different kinds of constraints, over limited number of tents is a real-world optimization problem. In this paper, a heuristic based algorithm is proposed, called Mina Tent Distribution Algorithm (MTDA), attempting to better utilize the available capacity of Mina’s area in the best possible way with an efficient use of the available resources. MTDA employs seven functions during the search process to find the best fit accommodation for pilgrims on the available tents of Mina. Experimental results revealed that MTDA achieves better performance compared with eight algorithm schemes in all experimental cases. The best result of MTDA was obtained through allocating 80% of the total number of pilgrims over 76.2% of the total available accommodation space of Mina area.


2012 ◽  
Author(s):  
Kyle P. Ehrhardt ◽  
Janice S. Miller ◽  
Sarah Freeman ◽  
Peter W. Hom
Keyword(s):  

2004 ◽  
Author(s):  
Jeff Johnson ◽  
Talya N. Bauer ◽  
Leslie B. Hammer ◽  
Donald M. Truxillo

TAPPI Journal ◽  
2019 ◽  
Vol 18 (10) ◽  
pp. 607-618
Author(s):  
JÉSSICA MOREIRA ◽  
BRUNO LACERDA DE OLIVEIRA CAMPOS ◽  
ESLY FERREIRA DA COSTA JUNIOR ◽  
ANDRÉA OLIVEIRA SOUZA DA COSTA

The multiple effect evaporator (MEE) is an energy intensive step in the kraft pulping process. The exergetic analysis can be useful for locating irreversibilities in the process and pointing out which equipment is less efficient, and it could also be the object of optimization studies. In the present work, each evaporator of a real kraft system has been individually described using mass balance and thermodynamics principles (the first and the second laws). Real data from a kraft MEE were collected from a Brazilian plant and were used for the estimation of heat transfer coefficients in a nonlinear optimization problem, as well as for the validation of the model. An exergetic analysis was made for each effect individually, which resulted in effects 1A and 1B being the least efficient, and therefore having the greatest potential for improvement. A sensibility analysis was also performed, showing that steam temperature and liquor input flow rate are sensible parameters.


Sign in / Sign up

Export Citation Format

Share Document