The determination of the Ultimate Pit Limit (UPL) is the first step in the open pit mine planning process. In this stage that parts of the mineral deposit that are economic to mine are determined. There are several mathematical, heuristic and meta-heuristic algorithms to determine UPL. The optimization criterion in these algorithms is maximization of the total profit whilst satisfying...

Meta-heuristics are algorithms which are applied to solve problems when conventional algorithms can not find good solutions in reasonable time; evolutionary algorithms are perhaps the most well-known examples of meta-heuristics. As there are many possible meta-heuristics, finding the most suitable meta-heuristic for a given problem is not a trivial task. In order to make this choice, one can de...

The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...

Meta-heuristics have already received considerable attention in various engineering optimization fields. As one of the most rewarding tasks, eigenvalue optimization of truss structures is concerned in this study. In the proposed problem formulation the fundamental eigenvalue is to be maximized for a constant structural weight. The optimum is searched using Particle Swarm Optimization, PSO and i...

In this paper, an online task scheduling and mapping method based on a fuzzy neural network (FNN) learned by evolutionary multi-objective algorithm (NSGA-II) to jointly optimize the main design challenges of heterogeneous MPSoCs is proposed. approach, first, FNN parameters are trained using NSGA-II-based optimization engine considering including temperature, power consumption, failure rate, exe...

This paper presents a new mathematical model for integrated dynamic cellular manufacturing systems and production planning that minimizes machine purchasing, intra-cell material handling, cell reconfiguration and setup costs. The presented model forms the manufacturing cells and determines the quantity of machine and movements  during each period of time. This problem is NP-hard, so a meta-heur...

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...

Flow shop scheduling of jobs has always been a popular problem that has found solutions in the number of heuristic and meta-heuristic techniques. In this manuscript, two-machine flow shop scheduling problem has been investigated while optimizing makespan and idle time of machines. Uncertainties in the processing time and set up times of jobs involved are also taken into consideration in the for...

this paper addresses a new version of the exible ow line prob- lem, i.e., the budget constrained one, in order to determine the required num- ber of processors at each station along with the selection of the most eco- nomical process routes for products. since a number of parameters, such as due dates, the amount of available budgets and the cost of opting particular routes, are imprecise (fuzz...

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...