Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem. The most effective methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms or quantum annealing. Those hybrid algorithms use a powerful local search inside a population-based algorithm. This paper presents a new memetic algorithm based on one of the most ...

We introduce a novel evolutionary algorithm (EA) with a semantic network-based representation. For enabling this, we establish new formulations of EA variation operators, crossover and mutation, that we adapt to work on semantic networks. The algorithm employs commonsense reasoning to ensure all operations preserve the meaningfulness of the networks, using ConceptNet and WordNet knowledge bases...

In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. The problem of multiprocessor scheduling can be stated as finding a schedule for a general task graph to be executed on a multiprocessor system so that the schedule length can be minimize. This scheduling problem is know...

In this paper, we propose a hybrid fine-tuned multiobjective memetic algorithm hybridizing different solution fitness evaluation methods for global exploitation and exploration. To search across all regions in objective space, the algorithm uses a widely diversified set of weights at each generation, and employs a simulated annealing to optimize each utility function. For broader exploration, a...

In the recent restructured power system scenario and complex market strategy, operation at absolute minimum cost is no longer the only criterion for dispatching electric power. The economic load dispatch (ELD) problem which accounts for minimization of both generations cost and power loss is itself a multiple conflicting objective function problem. In this paper, a modified shuffled frog-leapin...

Researchers laid the foundation of evolutionary algorithms in the late 60s and since then, heuristic algorithms have been widely applied to several complex scheduling and sequencing problems during the recent studies. In this paper, memetic algorithm (MA), genetic algorithm (GA) and simulated annealing (SA) are applied to a complex sequencing problem. The problem under study concerns about sequ...

We present a memetic algorithm that dynamically optimizes the design of a wireless sensor network towards energy conservation and extension of the life span of the network, taking into consideration application-specific requirements, communication constraints and energy consumption of operation and communication tasks of the sensors. The memetic algorithm modifies an already successful genetic ...

in this study, an optimization model is proposed to design a global supply chain (gsc) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of economic cooperation organization trade agreement (ecota) is...

A scheduling problem treats the allocation of resources, taking into account the execution of a set of operations, and with an objective, subject to a set of restrictions. The problem discussed here is one of scheduling the tasks in identical parallel machines. In this problem, we worked with a set of n tasks and m identical parallel machines, with the objective of minimizing the makespan. The ...

due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. the significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. this paper proposes a flexible mixed-integer programming model to ...