A collaborative B2B relationship implies jointly executing business processes. This relationship demands a complete access to available information and knowledge to support decision-making activities between trading partners. To support information interchange between enterprises in collaborative B2B e- commerce there are some XML-based standards technologies, like RosettaNet, ebXML and OAGIS. However, XML does not express semantics by itself. So, these standards only provide an infrastructure to support the information interchange. They are suitable to integrate information but not to support decision-making activities where a common understanding of the information is needed. In this paper we analyze the integration of these standards with ontology to describe the meaning of the information and knowledge interchanged between trading partners to jointly execute business processes. Furthermore, we define the main components of an ontology development environment to support the entire ontology lifecycle.
{"title":"Ontology and XML-based Specifications for Collaborative B2B Relationships","authors":"M. L. Caliusco, M. Galli, O. Chiotti","doi":"10.19153/cleiej.7.1.5","DOIUrl":"https://doi.org/10.19153/cleiej.7.1.5","url":null,"abstract":"\u0000 \u0000 \u0000A collaborative B2B relationship implies jointly executing business processes. This relationship demands a complete access to available information and knowledge to support decision-making activities between trading partners. To support information interchange between enterprises in collaborative B2B e- commerce there are some XML-based standards technologies, like RosettaNet, ebXML and OAGIS. However, XML does not express semantics by itself. So, these standards only provide an infrastructure to support the information interchange. They are suitable to integrate information but not to support decision-making activities where a common understanding of the information is needed. In this paper we analyze the integration of these standards with ontology to describe the meaning of the information and knowledge interchanged between trading partners to jointly execute business processes. Furthermore, we define the main components of an ontology development environment to support the entire ontology lifecycle. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130909681","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Small computing devices are everywhere changing the way people communicate and interact, however applications for these devices are developed more or less with the same tools used for conventional computer applications. Developers of handheld computer applications can find few options for development. In this paper we present MADEE a development and execution environment for mobile information systems running on handheld computers. This environment allows the implementation of mobile information systems faster and easier than using conventional developing tools, including support for conventional computer applications.
{"title":"A development platform and execution environment for mobile applications","authors":"G. Sandoval","doi":"10.19153/cleiej.7.1.4","DOIUrl":"https://doi.org/10.19153/cleiej.7.1.4","url":null,"abstract":"\u0000 \u0000 \u0000Small computing devices are everywhere changing the way people communicate and interact, however applications for these devices are developed more or less with the same tools used for conventional computer applications. Developers of handheld computer applications can find few options for development. In this paper we present MADEE a development and execution environment for mobile information systems running on handheld computers. This environment allows the implementation of mobile information systems faster and easier than using conventional developing tools, including support for conventional computer applications. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132159765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mathmatical Hydrologic models simulate real world environmental processes through different strategies. Each process is calculated by means of methods that utilize physical parameters for representing the real world system. some parameters are obtained from tables, some of them are optimized and others may be calculated using environmental variables. Although the domain software provides a wide range of models, there is not a conceptual architecture that allows the maintenance of the vast knowledge about simulation strategies and parameters collected in environmental management organizations, facilitating the flexible simulation scenarios configuration. The present work shows how to face this problem by means of conceptual analysis models organized in the scope of a general architecture.It's also possible for the given architecture, to analyze and define microarchitectures for software components releated to particular problems.In the present work, conceptual microarchitectures are definesd to construct a knowlegde level for hydrologic models systems starting from a general conceptual Environmental Information Systems architecture. To get the required flexibility for the conceptual and design models, high-level components are identified and different kinds of patterns are applied.
{"title":"Conceptual Microarchitectures for Hydrologic Simulation Models","authors":"A. Urciuolo, R. Iturraspe, A. Parsón","doi":"10.19153/cleiej.7.1.6","DOIUrl":"https://doi.org/10.19153/cleiej.7.1.6","url":null,"abstract":"\u0000 \u0000 \u0000Mathmatical Hydrologic models simulate real world environmental processes through different strategies. Each process is calculated by means of methods that utilize physical parameters for representing the real world system. some parameters are obtained from tables, some of them are optimized and others may be calculated using environmental variables. Although the domain software provides a wide range of models, there is not a conceptual architecture that allows the maintenance of the vast knowledge about simulation strategies and parameters collected in environmental management organizations, facilitating the flexible simulation scenarios configuration. The present work shows how to face this problem by means of conceptual analysis models organized in the scope of a general architecture.It's also possible for the given architecture, to analyze and define microarchitectures for software components releated to particular problems.In the present work, conceptual microarchitectures are definesd to construct a knowlegde level for hydrologic models systems starting from a general conceptual Environmental Information Systems architecture. To get the required flexibility for the conceptual and design models, high-level components are identified and different kinds of patterns are applied. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"403 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Because of its facilities for the generalization and specialization of concepts and the unambiguous terminology they provide, ontologies are being used for the representation of reusable software artifacts. This work describes GRAMO, an ontology-based technique for the specification of domain and user models in Multi-Agent Domain Engineering. ONTODUM, an ontology-based tool supporting GRAMO is also introduced. ONTODUM represents the knowledge of GRAMO. Some case studies developed to evaluate GRAMO are also briefly described.
{"title":"An ontology-based technique for the specification of domain and user models in multi-agent domain","authors":"R. Girardi, C. Faria","doi":"10.19153/cleiej.7.1.7","DOIUrl":"https://doi.org/10.19153/cleiej.7.1.7","url":null,"abstract":"\u0000 \u0000 \u0000Because of its facilities for the generalization and specialization of concepts and the unambiguous terminology they provide, ontologies are being used for the representation of reusable software artifacts. This work describes GRAMO, an ontology-based technique for the specification of domain and user models in Multi-Agent Domain Engineering. ONTODUM, an ontology-based tool supporting GRAMO is also introduced. ONTODUM represents the knowledge of GRAMO. Some case studies developed to evaluate GRAMO are also briefly described. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124707287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very difficult task. In order to attack harder pump-scheduling problems, this work proposes the use of parallel asynchronous evolutionary algorithms as a tool to aid in solving an optimal pump-scheduling problem. In particular, this work considers a pump-scheduling problem having four objectives to be minimized: electric energy cost, maintenance cost, maximum power peak, and level variation in a reservoir. Parallel and sequential versions of different evolutionary algorithms for multi- objective optimization were implemented and their results compared using a set of experimental metrics. Analysis of metric results shows that our parallel asynchronous implementation of evolutionary algorithms is effective in searching for solutions among a wide range of alternative optimal pump schedules to choose from.
{"title":"Pump Scheduling Optimization Using Asynchronous Parallel","authors":"C. V. Lücken, B. Barán, Aldo Sotelo","doi":"10.19153/cleiej.7.2.2","DOIUrl":"https://doi.org/10.19153/cleiej.7.2.2","url":null,"abstract":"\u0000 \u0000 \u0000Optimizing the pump-scheduling is an interesting proposal to achieve cost reductions in water distribution pumping stations. As systems grow, pump-scheduling becomes a very difficult task. In order to attack harder pump-scheduling problems, this work proposes the use of parallel asynchronous evolutionary algorithms as a tool to aid in solving an optimal pump-scheduling problem. In particular, this work considers a pump-scheduling problem having four objectives to be minimized: electric energy cost, maintenance cost, maximum power peak, and level variation in a reservoir. Parallel and sequential versions of different evolutionary algorithms for multi- objective optimization were implemented and their results compared using a set of experimental metrics. Analysis of metric results shows that our parallel asynchronous implementation of evolutionary algorithms is effective in searching for solutions among a wide range of alternative optimal pump schedules to choose from. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128994656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a component-based product line for workflow management systems. The process followed to design the product line was based on the Catalysis method. Extensions were made to represent variability across the process. The domain of workflow management systems has been shown to be appropriate to the application of the product line approach as there are a standard architecture and models established by a regulatory board, the Workflow Management Coalition. In addition, there is a demand for similar workflow management systems but with some different features. The product line architecture was evaluated with Rapide simulation tools. The evaluation was based on selected scenarios, thus, avoiding implementation issues. The strategy that has been used to populate the architecture and experiment with the product line is shown. In particular, the design of the workflow execution manager component is described.
{"title":"A Component-based Product Line for Workflow Management Systems","authors":"I. Gimenes, F.R. Lazilha, E. Junior, L. Barroca","doi":"10.19153/cleiej.7.2.5","DOIUrl":"https://doi.org/10.19153/cleiej.7.2.5","url":null,"abstract":"This paper presents a component-based product line for workflow management systems. The process followed to design the product line was based on the Catalysis method. Extensions were made to represent variability across the process. The domain of workflow management systems has been shown to be appropriate to the application of the product line approach as there are a standard architecture and models established by a regulatory board, the Workflow Management Coalition. In addition, there is a demand for similar workflow management systems but with some different features. The product line architecture was evaluated with Rapide simulation tools. The evaluation was based on selected scenarios, thus, avoiding implementation issues. The strategy that has been used to populate the architecture and experiment with the product line is shown. In particular, the design of the workflow execution manager component is described.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122031781","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Everyday a huge number of new information resources are linked to the web. This way the web is growing very fast, making search tasks more and more difficult with worse results. To solve the problem several initiatives were undertaken and a new area of research and development emerged: the one called Semantic Web.When we refer to the semantic web we are thinking about a network of concepts. Each concept has a group of related resources and can be related to other concepts; we can then use this concept network to navigate among web resources or simply among information resources. From the undertaken initiatives one became an ISO standard: Topic Maps ISO 13250. The aim of this paper is to introduce a Topic Map (TM) Builder, that is a processor that extracts topics and relations from instances of a family of XML documents.A TM-Builder is strongly dependent on the resources structure. So, to extract a topic map for different collections of information resources (sets of documents with different structures) we have to implement several TM-Builders, one for each collection. This is not very easy! To overcome this inconvenient we have created an XML abstraction layer for TM-Builders that enables us to specify the topic map we want to build from a concrete family of resources, in order to generate automatically the intended extractor. To describe that process, i.e. the extraction of knowledge from XML documents to produce a TM, we present a language to specify topic maps for a class of XML documents, that we call XSTM (XML Specification for Topic Maps). We also discuss a XSL processor that automatically generates the Extractor from its formal specification written in XSTM, the XSTM-P.
{"title":"TM-Builder: An Ontology Builder based on XML Topic Maps","authors":"G. Librelotto, J. Ramalho, P. Henriques","doi":"10.19153/cleiej.7.2.4","DOIUrl":"https://doi.org/10.19153/cleiej.7.2.4","url":null,"abstract":"\u0000 \u0000 \u0000Everyday a huge number of new information resources are linked to the web. This way the web is growing very fast, making search tasks more and more difficult with worse results. To solve the problem several initiatives were undertaken and a new area of research and development emerged: the one called Semantic Web.When we refer to the semantic web we are thinking about a network of concepts. Each concept has a group of related resources and can be related to other concepts; we can then use this concept network to navigate among web resources or simply among information resources. From the undertaken initiatives one became an ISO standard: Topic Maps ISO 13250. \u0000The aim of this paper is to introduce a Topic Map (TM) Builder, that is a processor that extracts topics and relations from instances of a family of XML documents.A TM-Builder is strongly dependent on the resources structure. So, to extract a topic map for different collections of information resources (sets of documents with different structures) we have to implement several TM-Builders, one for each collection. This is not very easy! To overcome this inconvenient we have created an XML abstraction layer for TM-Builders that enables us to specify the topic map we want to build from a concrete family of resources, in order to generate automatically the intended extractor. \u0000To describe that process, i.e. the extraction of knowledge from XML documents to produce a TM, we present a language to specify topic maps for a class of XML documents, that we call XSTM (XML Specification for Topic Maps). We also discuss a XSL processor that automatically generates the Extractor from its formal specification written in XSTM, the XSTM-P. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study a class of distributed algorithms, generally known by the name of diffusing computa- tions, that play an important role in all kinds distributed and/or database applications to perform tasks like termination detection, leader election, or propagation of information with feedback. We construct a highly parameterized abstract algorithm and shown that many existing algorithms and their applications can be obtained from this abstract algorithm by instantiating the parameters appropriately and/or refining some of its actions. Subsequently, we show that this use of param- eterization and re-usability of notation and proof leads to a reduction of the effort and cost of developing and verifying distributed diffusing computations. More specific, we show that proving the correctness of any application now boils down to verifying an application-specific safety prop- erty and reusing the termination and safety proofs of the underlying abstract algorithm.
{"title":"Facilitating the Verification of Diffusing Computations and Their Applications","authors":"T. Vos, S. Swierstra","doi":"10.19153/cleiej.8.1.2","DOIUrl":"https://doi.org/10.19153/cleiej.8.1.2","url":null,"abstract":"\u0000 \u0000 \u0000We study a class of distributed algorithms, generally known by the name of diffusing computa- tions, that play an important role in all kinds distributed and/or database applications to perform tasks like termination detection, leader election, or propagation of information with feedback. We construct a highly parameterized abstract algorithm and shown that many existing algorithms and their applications can be obtained from this abstract algorithm by instantiating the parameters appropriately and/or refining some of its actions. Subsequently, we show that this use of param- eterization and re-usability of notation and proof leads to a reduction of the effort and cost of developing and verifying distributed diffusing computations. More specific, we show that proving the correctness of any application now boils down to verifying an application-specific safety prop- erty and reusing the termination and safety proofs of the underlying abstract algorithm. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127913439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The Mobile Computing is a vision of future that promises to modify the way people work and interact today. It has emerged as a new field, distinct from conventional distributed computing by its focus on mobility and its consequence. The physical and logical mobility allows the creation of applications with news requirements: built-in mobility, adaptability and flexibility. So, software production for this global mobility is complex. Challenges include designing applications which service levels and available resources are unpredictable, and the behavior is variable in time and space. To provide a system architecture that simplifies the task of implementing the mobile applications with adaptive behavior is the objective of the ongoing ISAM Project. In order to achieve its goal, ISAM uses as strategies: (a) integrated environment that provides a programming paradigm and its execution environment; (b) uniform treatment of adaptation through multilevel collaborative model, in which both the system and the application contribute for that. The scheduling process – the core of ISAM architecture, manages this collaboration. Introducing HoloLanguage abstractions that express adaptability makes the control of adaptation by part of application. So, adaptation is not fully transparent to applications. In this paper, we present the main decisions used for designing the ISAM Architecture. We also introduce a first taxonomy for mobile applications with adaptive behavior.
{"title":"ISAM: a Software Architecture for Pervasive Computing","authors":"A. Yamin, J. Barbosa, Iara Augustin, C. Geyer","doi":"10.19153/cleiej.8.1.3","DOIUrl":"https://doi.org/10.19153/cleiej.8.1.3","url":null,"abstract":"\u0000 \u0000 \u0000The Mobile Computing is a vision of future that promises to modify the way people work and interact today. It has emerged as a new field, distinct from conventional distributed computing by its focus on mobility and its consequence. The physical and logical mobility allows the creation of applications with news requirements: built-in mobility, adaptability and flexibility. So, software production for this global mobility is complex. Challenges include designing applications which service levels and available resources are unpredictable, and the behavior is variable in time and space. To provide a system architecture that simplifies the task of implementing the mobile applications with adaptive behavior is the objective of the ongoing ISAM Project. In order to achieve its goal, ISAM uses as strategies: (a) integrated environment that provides a programming paradigm and its execution environment; (b) uniform treatment of adaptation through multilevel collaborative model, in which both the system and the application contribute for that. The scheduling process – the core of ISAM architecture, manages this collaboration. Introducing HoloLanguage abstractions that express adaptability makes the control of adaptation by part of application. So, adaptation is not fully transparent to applications. In this paper, we present the main decisions used for designing the ISAM Architecture. We also introduce a first taxonomy for mobile applications with adaptive behavior. \u0000 \u0000 \u0000","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115041166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Katherine Dahiana Vera Escobar, Fabio López-Pires, B. Barán, Fernando Sandoya
The Maximum Diversity (MD) problem is the process of selecting a subset of elements where the diversity among selected elements is maximized. Several diversity measures were already studied in the literature, optimizing the problem considered in a pure mono-objective approach. This work presents for the first time multi-objective approaches for the MD problem, considering the simultaneous optimization of the following five diversity measures: (i) Max-Sum, (ii) Max-Min, (iii) Max-MinSum, (iv) Min-Diff and (v) Min-P-center. Two different optimization models are proposed: (i) Multi-Objective Maximum Diversity (MMD) model, where the number of elements to be selected is defined a-priori, and (ii) Multi-Objective Maximum Average Diversity (MMAD) model, where the number of elements to be selected is also a decision variable. To solve the formulated problems, a Multi-Objective Evolutionary Algorithm (MOEA) is presented. Experimental results demonstrate that the proposed MOEA found good quality solutions, i.e. between 98.85% and 100% of the optimal Pareto front when considering the hypervolume for comparison purposes.
最大多样性(MD)问题是选择一个元素子集的过程，其中所选元素之间的多样性最大化。文献中已经研究了几种多样性措施，优化了纯单目标方法中考虑的问题。这项工作首次提出了MD问题的多目标方法，考虑了以下五个多样性度量的同时优化:(i) Max-Sum， (ii) Max-Min， (iii) Max-MinSum， (iv) Min-Diff和(v) Min-P-center。提出了两种不同的优化模型:(i)多目标最大多样性(MMD)模型，其中需要选择的元素数量是先验定义的;(ii)多目标最大平均多样性(MMAD)模型，其中需要选择的元素数量也是一个决策变量。为了解决上述问题，提出了一种多目标进化算法(MOEA)。实验结果表明，当考虑hypervolume进行比较时，所提出的MOEA找到了良好的质量解，即在最优Pareto front的98.85%到100%之间。
{"title":"Maximum Diversity Problem. A Multi-Objective Approach","authors":"Katherine Dahiana Vera Escobar, Fabio López-Pires, B. Barán, Fernando Sandoya","doi":"10.19153/CLEIEJ.21.2.2","DOIUrl":"https://doi.org/10.19153/CLEIEJ.21.2.2","url":null,"abstract":"The Maximum Diversity (MD) problem is the process of selecting a subset of elements where the diversity among selected elements is maximized. Several diversity measures were already studied in the literature, optimizing the problem considered in a pure mono-objective approach. This work presents for the first time multi-objective approaches for the MD problem, considering the simultaneous optimization of the following five diversity measures: (i) Max-Sum, (ii) Max-Min, (iii) Max-MinSum, (iv) Min-Diff and (v) Min-P-center. Two different optimization models are proposed: (i) Multi-Objective Maximum Diversity (MMD) model, where the number of elements to be selected is defined a-priori, and (ii) Multi-Objective Maximum Average Diversity (MMAD) model, where the number of elements to be selected is also a decision variable. To solve the formulated problems, a Multi-Objective Evolutionary Algorithm (MOEA) is presented. Experimental results demonstrate that the proposed MOEA found good quality solutions, i.e. between 98.85% and 100% of the optimal Pareto front when considering the hypervolume for comparison purposes.","PeriodicalId":418941,"journal":{"name":"CLEI Electron. J.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125831527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：