In this paper, a new method is proposed for solving the data clustering problem using Cat Swarm Optimization (CSO) algorithm based on chaotic behavior. The problem of data clustering is an important section in the field of the data mining, which has always been noted by researchers and experts in data mining for its numerous applications in solving real-world problems. The CSO algorithm is one ...

Manufacturing process planning and production scheduling functions are usually performed sequentially, disregarding the dynamic nature of manufacturing system. Integrated process planning and scheduling (IPPS) is to combine both the process planning and scheduling problems in the consideration, with the aim to improve the flexibility and adaptability of the actual process plan and the schedule ...

The quadratic assignment problem (QAP) belongs to the class of NP-Hard problems and also is one of the hardest problems in this class. Today, regarding current hardware, solving the large size instances of this problem, using exact methods, is not possible in reasonable amount of time. In this way many heuristic (Meta-heuristic) and approximation methods and soft-computing approaches have been ...

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...

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...

Multi-objective optimization is widely applied in a number of areas now-a-days. Unfortunately, many combinatorial multi-objective optimization problems are NP-hard. However, it is often unnecessary to have an exact solution. So, heuristic approach can obtain a near-optimal solution in some reasonable time with the smallest possible computational burden. Intelligent Water Drops algorithm (IWD) a...

in this work, harmony search meta-heuristic optimization algorithm has been developed for aerodynamic shape optimization problem for the first time. the aerodynamic shape, which has been investigated, is an airfoil with parces method for its shape parameterization. the problem was minimization of aerodynamic objective function using inverse design method and the objective function has been the ...

due to the fact that the error surface of adaptive infinite impulse response (iir) systems is generally nonlinear and multimodal, the conventional derivative based techniques fail when used in adaptive identification of such systems. in this case, global optimization techniques are required in order to avoid the local minima. harmony search (hs), a musical inspired metaheuristic, is a recently ...

Grid computing could be a style of distributed computing that co-ordinates and provides the ability of resource sharing over varied geographical locations. Resource planning in Grid computing is an advanced task owing to the heterogeneous and dynamic nature of the resources. Bacterial foraging has recently emerged as a world optimization algorithmic program for distributed optimization and mana...

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VRPSPD...