In this paper, we show how cellular structures can be combined with a multi-objective genetic algorithm (MOGA) for improving its search ability to find Pareto-optimal solutions of multi-objective optimization problems. We propose an assignment method of a different search direction to each cell for implementing a cellular MOGA. In our cellular MOGA, every individual in each population exists in...

Supply chain management (SCM) is a subject that has found so much attention among different commercial and industrial organizations due to competing environment of products. Therefore, integration of constituent element of this chain is a great deal. This paper proposes a multi objective production-allocation and distribution planning problem (PADPP) in a multi echelon supply chain network. We ...

This paper focuses on a modified Multi-Depot Unmanned Aerial Vehicle Routing Problem (MMDUAVRP). Comparing to classic multi-depot vehicle routing problem, our studied problem has no constraints restrict the depot where (UAV) departs and returns. work aims minimize number of UAVs total distance traveled by all UAVs. is mathematically formulated in this heuristic-assignment based hybrid large nei...

Increasing interest has recently been shown in analyzing the worst-case behavior of local search algorithms. In particular, the quality of local optima and the time needed to find the local optima by the simplest form of local search has been studied. This paper deals with worst-case performance of local search algorithms for makespan minimization on parallel machines. We analyze the quality of...

In this paper, we study a multi-stage production sourcing problem where tariff concessions can be exploited at the firm level using free trade agreements between countries. To solve the problem, an algorithm which embeds a very large-scale neighborhood (VSLN) search into a simulated annealing framework is developed. A numerical study is conducted to verify the effectiveness of the solution appr...

In this paper, a new genetic algorithm for multi-objective optimization problems is introduced. That is called ”Neighborhood Cultivation GA (NCGA)”. In the recent studies such as SPEA2 or NSGA-II, it is demonstrated that some mechanisms are important; the mechanisms of placement in an archive of the excellent solutions, sharing without parameters, assign of fitness, selection and reflection the...

This paper presents a new multi-objective hybrid model that makes cooperation between the strength of research of neighborhood methods presented by the tabu search (TS) and the important exploration capacity of evolutionary algorithm. This model was implemented and tested in benchmark functions (ZDT1, ZDT2, and ZDT3), using a network of computers. KeywordsMetaheuristics; hybrid method; intensif...

The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on...