In this paper, a new version of multi-objective differential evolution with dynamically adaptable mutation factor is used for Pareto optimization of a 5-degree of freedom vehicle vibration model excited by non-stationary random road profile. In this way, non-dominated sorting algorithm and crowding distance criterion have been combined to differential evolution with fuzzified mutation in order ...

The resource-constrained project scheduling problem is to find a schedule that minimizes the project duration subject to precedence relations and resource constraints. To further account for economic aspects of the project, one may add an objective of cash nature to the problem. In addition, dynamic nature and variations in real world are known to introduce uncertainties into data. Therefore, t...

design and expansion of distribution systems seems inevitable in view of the need to satisfy the rise in energy consumption in a technical and economical way. optimal location, sizing and determining the service area of substations is one of the principle problems in expansion of distribution systems. also uncertainty is one of the important factors that increase risk of exact decision makings....

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than cu...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

Recently, a number of papers have shown that for many domains, using multiple heuristics in independent searches performs better than combining them into a single heuristic. Furthermore, using a large number of “weak” heuristics could potentially eliminate the need for the careful design of a few. The standard approach to distribute computation in these multi-heuristic searches is to rotate thr...

This paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: 1) diversi...cation 2) improvement 3) reference set update 4) subset generation, and 5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used...