The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a novel population based optimization algorithm called Andean Condor Algorithm (ACA) for solving cell formation problems. The ACA metaheuristic is inspired by the movement pattern of the Andean Condor when it searches for food. This pattern of movement corresponds to the flight distance traveled by the Andean Condor from its nest to the place where food is found. This distance...
The cell formation problem is a classic optimization problem devoted to the manufacturing industry. Such a problem proposes to divide a manufacturing plant in a set of cells, where each cell is composed of machines which in turn process product parts. The goal is to design a plant division in such a way the need for part interchange among cells is minimized. The idea is to reduce cost and increase...
The manufacturing cell design problem (MCDP) aims to minimise the movements of parts between the production cells. The MCDP is an NP-Hard optimisation problem with a binary domain. For the resolution of the MCDP, the authors employ the firefly algorithm (FA) metaheuristic. FA is a metaheuristic with a real domain; therefore, an efficient method for transfer and discretisation from the real domain...
The machine-part cell formation (MPCF) problem is to organize an assembly as a set of cells, where each cell contains certain machines that process a sub-set of parts. In recent years, different types of metaheuristics have been used to solve the problem of MPCF. This publication focuses on solving the MPCF problem using a metaheuristic inspired on birds, called Migrating Birds Optimization (MBO)...
This research focuses on modeling and solving the Manufacturing Cell Design Problem (MCDP) through a Firefly Algorithm (FA). The MCDP consists in creating an optimal design of production plants, through the creation of cells that group machines and parts. The goal of the problem is to minimize movements and exchange of material between the cells. The FA is a metaheuristic based on the mating behavior...
Manufacturing Cell Design is a problem that is aimed at distributing the different machines of a center of production in cells, so that the parts of the final product to be manufactured with the least amount of travel in its manufacturing process. Bat Algorithm is an algorithm inspired by the behavior of echolocation in bats. Using a balance sheet of the frequency and automatic tuning of exploration...
Machine-Part Cell Formation consists on organizing a plant as a set of cells, each one of them processing machines containing different part types. In recent years, different techniques have been used to solve this problem ranging from exact to approximate methods. This paper focuses on solving new instances of this problem for which no optimal value exists by using the classic Boctor�s mathematical...
Open pit mining problems aims at correctly identifying the set of blocks to be mined in order to maximize the net present value of the extracted ore. Different constraints can be involved and may vary the difficulty of the problem. In particular, the Open-Pit Long-Term Production Planning Problem is one of the variants that better models the real mining operation. It considers, among others, limited...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.