The present study is concerned with optimal shape determination of inhomogeneous and temperature dependent domains under steady state heat conduction. Such situations are important in many thermal design problems, especially in shape design of electronic components and chips. In the present paper, we formulate the shape optimization problem based on volume minimization of heat conductive materi...

Ant Colony Optimization (ACO) is a bioinspired metaheuristic based on ants foraging used to solve different classes of problems. In this paper, we show how, using a Two-Stage approach the quality of the solutions of ACO is improved. The Two-Stage approach can be applied to different ACO. The performance of this new approach is studied in the Traveling Salesman Problem and Quadratic Assignment P...

The conventional Unconstrained Binary Quadratic Programming (UBQP) problem is known to be a unified modeling and solution framework for many combinatorial optimization problems. This paper extends the single-objective UBQP to the multiobjective case (mUBQP) where multiple objectives are to be optimized simultaneously. We propose a hybrid metaheuristic which combines an elitist evolutionary mult...

This report is devoted to Multiobjective Combinatorial Optimization techniques. In particular, the Ant Colony Optimization metaheuristic and its possible multi-criteria extensions are analysed and impirically investigated on the wellknown Traveling Salesman Problem. The second part of this work presents a quite novel approach for doing Relational Multicriteria Clustering. Besides providing the ...

In this work, we present a methodology to minimize the number of potential conflicts between aircraft trajectories based on route-slot allocation techniques. The traffic assignment problem is modeled as a combinatorial optimization problem for which two metaheuristic optimization algorithms are developed and implemented. The first algorithm relies on a standard simulated annealing, while the se...

Particle swarm optimization (PSO) is an increasingly popular metaheuristic algorithm for solving complex optimization problems. Its popularity is due to its repeated successes in finding an optimum or a near optimal solution for problems in many applied disciplines. The algorithm makes no assumption of the function to be optimized and for biomedical experiments like those presented here, PSO ty...

In this paper, a comparative analysis of the metaheuristic maintenance optimization of refuse collection vehicles (RCV) using the Taguchi experimental design is presented based on a RCV model as a multi-state degradation system with two dependent subsystems. The model which is based on a probabilistic approach includes two stochastic degradation processes, a random failure process and a set of ...

This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems, when good local optimization algorithms are available. The paper also presents an effective loc...