In this paper, Optimization is considered as the main impact of insight problem and heuristic methods. A proposed method is represented by using two optimization algorithms; cuckoo optimization; is heuristic method and Genetic algorithm; is meta-heuristic method in order to increase the optimization level and speed of calculation as possible. The proposed methodology and technique still a subje...

This paper presents a novel efficient meta-heuristic optimization algorithm called Colliding Bodies Optimization (CBO), for optimization. This algorithm is based on one-dimensional collisions between bodies, with each agent solution being considered as an object or body with mass. After a collision of two moving bodies having specified masses and velocities, these bodies are separated with new ...

This article introduces POPMUSIC a meta heuristic that has been successfully applied to various combinatorial optimization problems This meta heuristic is especially useful for designing heuristic methods for large combinatorial problems that can be partially optimized The basic idea is to optimize sub parts of solutions until a local optimum is reached Implementations of the technique to large...

Here, a mixed-integer linear programming model is developed to represent transportation system of students traveling from/to university campus. The concept ridesharing used and the mechanism combinatorial auctions incorporated within routing-based model. mathematical based on vehicle routing problem along with appropriate constraints accommodating features that express auction clearing phase. A...

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

Earthquake time history records are required to perform dynamic nonlinear analyses. In order to provide a suitable set of such records, they are scaled to match a target spectrum as introduced in the well-known design codes. Corresponding scaling factors are taken similar in practice however, optimizing them reduces extra-ordinary economic charge for the seismic design. In the present work a ne...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

This study is devoted to seismic collapse safety analysis of performance based optimally seismic designed steel chevron braced frame structures. An efficient meta-heuristic algorithm namely, center of mass optimization is utilized to achieve the seismic optimization process. The seismic collapse performance of the optimally designed steel chevron braced frames is assessed by performing incremen...