optimization of cutting conditions is a non-linear optimization with constraint and it is very important to the increase of productivity and the reduction of costs. in recent years, several evolutionary and meta-heuristic optimization algorithms were introduced. the cuckoo optimization algorithm (coa) is one of several recent and powerful meta-heuristics which is inspired by the cuckoos and the...

the mathematical modeling of fracture networks is critical for the exploration and development ofnatural resources. fractures can help the production of petroleum, water, and geothermal energy. theyalso greatly influence the drainage and production of methane gas from coal beds. orientation andspatial distribution of fractures in rocks are important factors in controlling fluid flow. the object...

a facility layout problem is concerned with determining the best position of departments, cells, or machines on the plant. an efficient layout contributes to the overall efficiency of operations. it’s been proved that, when system characteristics change, it can cause a significant increase in material handling cost. consequently, the efficiency of the current layout decreases or is lost and it ...

this paper deals with the problem of user-server assignment in online social network systems. online social network applications such as facebook, twitter, or instagram are built on an infrastructure of servers that enables them to communicate with each other. a key factor that determines the facility of communication between the users and the servers is the expected transmission time (ett). a ...

Cloud computing environments facilitate applications by providing visualized resources that can be provisioned dynamically. The advent of cloud computing as a new model of service provisioning in distributed systems, encourages researchers to investigate its benefits and drawbacks in executing scientific applications such as workflows. One of the fundamental issues in this environment is relate...

In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...

In this paper, we propose sequential Monte Carlo simulated annealing (SMC-SA), a populationbased simulated annealing algorithm, for continuous global optimization. SMC-SA incorporates the sequential Monte Carlo method to track the converging sequence of Boltzmann distributions in simulated annealing, such that the empirical distribution will converge weakly to the uniform distribution on the se...

This article presents sequential and parallel metaheuristics to solve the virtual machines subletting problem in cloud systems, which deals with allocating virtual machine requests into prebooked resources from a cloud broker, maximizing the broker profit. Three metaheuristic are studied: Simulated Annealing, Genetic Algorithm, and hybrid Evolutionary Algorithm. The experimental evaluation over...

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...