Abstract Every year, new ontology matching approaches have been published to address the heterogeneity problem in ontologies. It is well known that no one able stand out from others all aspects. An meta-matcher combines different alignment techniques explore various aspects of avoid performance being restricted some characteristics. The meta-matching process consists several stages execution, a...

We present a state-of-the-art survey of parallel meta-heuristic strategies, developments, and results. We discuss general design and implementation principles that apply to most metaheuristic classes and instantiate these principles for neighborhood and population-based metaheuristics. We also identify a number of trends and promising research directions.

time-dependent vehicle routing problem is one of the most applicable but least-studied variants of routing and scheduling problems. in this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. to deal with the traffic congestions, we also considered that the vehicles are not forced to come...

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

This paper provides a test method to make a fair comparison between different heuristics in structure optimization. When statistical methods are applied to the structural optimization (namely heuristics or meta-heuristics with several tunable parameters and starting seeds), the "one problem - one result" is extremely far from the fair comparison. From statistical point of view, the minimal requ...

This paper browses through some well-known meta-heuristic search strategies, and briefly discusses some of their recent applications to the VLSI layout design process. It starts with very brief description of the different phases of VLSI layout design, and a brief overview of Meta-Heuristic search strategies. Since most of the VLSI layout design problems are hard optimization problems, the conc...

In this paper, we present a comparative study of static and proole-based heuristics for inlining. Our motivation for this study is to use the results to design the best inlining algorithm that we can for the Jalape~ no dynamic optimizing compiler for Java 6]. We use a well-known approximation algorithm for the knapsack problem as a common \meta-algorithm" for the inlining heuristics studied in ...