A multi-disciplinary research centre focussed on understanding, modelling, quantification, management and control of RISK Centre for the Analysis of Risk and Optimisation Modelling Applications

The paper presents a comparison of two metaheuristic approaches in solving a constrained transportation scheduling problem (i.e., transport of goods in an emergency situations). We compared Parameter-less Evolutionary Search and Ant-Stigmergy Algorithm. The transportation scheduling

Abstract:- In this paper, the metaheuristic method consisting of the adaptive tabu search (ATS) and the practicing heuristic (PH) technique is proposed to provide optimal solutions of the assembly line balancing (ALB) problems. With the multi-objective approach, the ATS is used to address

This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into the framework of evolutionary algorithms, the proposed approach exhibits several distinguishing features, including a

) to evolve a set of cluster prototypes in the shape of curves/hyper-surfaces. The objective function is modeled using the concept of the mountain function from Yager and Filev's work. The metaheuristic approach can be extended to solid clusters and various shell clusters like circular, elliptical

The p-median problem, like most location problems, is classified as NP-hard, and so, heuristic methods are usually used for solving it. The pmedian problem is a basic discrete location problem with real application that have been widely used to test heuristics. Metaheuristics are frameworks

Abstract not found

Abstract. This paper presents an approach to the calibration of ecological models, using intelligent agents with learning skills and optimization techniques. Model calibration, in complex ecological simulations is typically performed by comparing observed with predicted data and it reveals as a key

is the possibility to obtain guaranteed estimations of global solutions and to demonstrate (under certain analytical conditions) useful global convergence properties. In this talk, some deterministic approaches [4, 5] developed by the authors to construct black-box global optimization methods are discussed

Abstract not found