Benjamin Baran

Prof. Benjamin Baran

Unioversidad Comunera - UCOM

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2015
Verified
Conference Paper
Closed access
NRNery Riquelme
Nery Riquelme
CLChristian Von Lucken
Christian Von Lucken
BBBenjamin Baran
Benjamin Baran
In the last decades, a large number of metrics has been proposed to compare the performance of different evolutionary approaches in multi-objective optimization. This situation leads to difficulties when comparisons among the output of different algorithms are needed and appropriate metrics must be selected to perform those comparisons. Hence, no complete agreement on what metrics should be used exists. This paper presents a review and analysis of 54 multi-objective-optimization metrics in the specialized literature, discussing the usage, tendency and advantages/disadvantages of the most cited ones in order to give researchers enough information when choosing metrics is necessary. The review process performed in this work indicates that the hypervolume is the most used metric, followed by the generational distance, the epsilon indicator and the inverted generational distance.

20 February 2014 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
CLChristian von Lücken
Christian von Lücken
BBBenjamin Baran
Benjamin Baran
Carlos BrizuelaCarlos Brizuela
Carlos Brizuela

1 January 2005 in Advances in Engineering Software
Verified
Journal Article
Closed access
BBBenjamin Baran
Benjamin Baran
CLChristian von Lücken
Christian von Lücken
ASAldo Sotelo
Aldo Sotelo

1 May 2015
Verified
Conference Paper
Closed access
FPFabio Lopez Pires
Fabio Lopez Pires
BBBenjamin Baran
Benjamin Baran
Cloud computing data enters dynamically provide millions of virtual machines (VMs) in actual cloud markets. In this context, Virtual Machine Placement (VMP) is one of the most challenging problems in cloud infrastructure management, considering the large number of possible optimization criteria and different formulations that could be studied. VMP literature include relevant research topics such as energy efficiency, Service Level Agreement (SLA), Quality of Service (QoS), cloud service pricing schemes and carbon dioxide emissions, all of them with high economical and ecological impact. This work classifies an extensive up-to-date survey of the most relevant VMP literature proposing a novel taxonomy in order to identify research opportunities and define a general vision on this research area.

1 December 2011 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
JRJuan Ricart
Juan Ricart
GHGermán Hüttemann
Germán Hüttemann
JLJoaquín Lima
Joaquín Lima
BBBenjamin Baran
Benjamin Baran
Harmony Search metaheuristic is successfully used in several applications of science and engineering. However, its effectiveness in solving multiobjective optimization problems using the concepts of Pareto optimality, remains unproved. This paper presents two proposals of the Harmony Search metaheuristic for multiobjective optimization, using the ZDT functions as a test bed. Performance metrics for experimental results show that the proposals are competitive even when compared to NSGA-II evolutionary algorithm

1 December 2013
Verified
Conference Paper
Closed access
FPFabio Lopez Pires
Fabio Lopez Pires
BBBenjamin Baran
Benjamin Baran
The process of selecting which virtual machines should be located (i.e. executed) at each physical machine of a Data center is known as Virtual Machine Placement - VMP. This work proposes for the first time a multi-objective formulation of the VMP considering Service Level Agreement. A novel multiobjective memetic algorithm is also proposed to solve the formulated multi-objective problem. This proposal is validated comparing experimental results of the proposed algorithm with a brute force exhaustive search algorithm. Simulations prove the correctness of the proposed memetic algorithm and its scalability considering different experimental scenarios.