Pub Date : 2018-04-10DOI: 10.1109/CoDIT.2018.8394841
Nour El Houda Ben Chaabene, Maha Mallek
Statistics are still the best tool for analyzing political, economic and social phenomena. Among other things, they allow projections and forecasts to be used to assist in decision-making. The today's information society, and the era of “Big Data”, have facilitated access to information. However, most of the available data is unstructured and, as a result, is not readily available for use by the IT tool, particularly statistical data. In the context of a research project whose objective is to extract statistical in-formation from the results of a Web search, it is imperative to recognize the statistical variables dealt with and their values associated. One of the primordial stages and the assignment, to a given variable, of the different instances corresponding to it. We propose in this work an approach for identifying these statistical data in order to represent them in the form of structured data that are easy to process with the help of computers.
{"title":"Learning statistics from raw text documents","authors":"Nour El Houda Ben Chaabene, Maha Mallek","doi":"10.1109/CoDIT.2018.8394841","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394841","url":null,"abstract":"Statistics are still the best tool for analyzing political, economic and social phenomena. Among other things, they allow projections and forecasts to be used to assist in decision-making. The today's information society, and the era of “Big Data”, have facilitated access to information. However, most of the available data is unstructured and, as a result, is not readily available for use by the IT tool, particularly statistical data. In the context of a research project whose objective is to extract statistical in-formation from the results of a Web search, it is imperative to recognize the statistical variables dealt with and their values associated. One of the primordial stages and the assignment, to a given variable, of the different instances corresponding to it. We propose in this work an approach for identifying these statistical data in order to represent them in the form of structured data that are easy to process with the help of computers.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132597920","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}
Pub Date : 2018-04-10DOI: 10.1109/CODIT.2018.8394797
Rong-Huei Chen, Shi-Chung Chang, P. Luh
Online knowledge sharing networks (KSNets) have made significant impacts on the economy as well as wellbeing of societies through sharing. One of the most successful KSNets is Wikipedia that allows users to create contents in a collaborative manner and to provide fast and easy access at no cost to users. Recent research, however, has shown that the numbers of “Wikipedians” and new page creations have been declining, reflecting decrease in user contributions and in new contents. To facilitate management for sustainability, this paper aims at quantitatively modeling how the decline in new contents affects the number of Wikipedians and in turn content creations, and predicting decline start time and speed based on available Wikipedia data. The novel modeling approach adopts auto-regression with an extended Bass Diffusion model (AREBDM) embedded to describe the Wikipedia-wide evolutions of the number of Wikipedians and content developments. Model parameters are then extracted by a nonlinear least square method from early Wikipedia data. Simulation predictions match well with actual Wikipedia decline trajectories of later stages. Our analysis shows that the decline of new page creation leads in time the decline of the number of new Wikipedians, and the decline speed increases with the decrease of new contents. Our approach therefore has the potential to predict decline time and speed so that proactive actions can be taken as early as possible.
{"title":"Modeling of Decline Dynamics of Knowledge Sharing Networks (KSNets) - A Wikipedia Case","authors":"Rong-Huei Chen, Shi-Chung Chang, P. Luh","doi":"10.1109/CODIT.2018.8394797","DOIUrl":"https://doi.org/10.1109/CODIT.2018.8394797","url":null,"abstract":"Online knowledge sharing networks (KSNets) have made significant impacts on the economy as well as wellbeing of societies through sharing. One of the most successful KSNets is Wikipedia that allows users to create contents in a collaborative manner and to provide fast and easy access at no cost to users. Recent research, however, has shown that the numbers of “Wikipedians” and new page creations have been declining, reflecting decrease in user contributions and in new contents. To facilitate management for sustainability, this paper aims at quantitatively modeling how the decline in new contents affects the number of Wikipedians and in turn content creations, and predicting decline start time and speed based on available Wikipedia data. The novel modeling approach adopts auto-regression with an extended Bass Diffusion model (AREBDM) embedded to describe the Wikipedia-wide evolutions of the number of Wikipedians and content developments. Model parameters are then extracted by a nonlinear least square method from early Wikipedia data. Simulation predictions match well with actual Wikipedia decline trajectories of later stages. Our analysis shows that the decline of new page creation leads in time the decline of the number of new Wikipedians, and the decline speed increases with the decrease of new contents. Our approach therefore has the potential to predict decline time and speed so that proactive actions can be taken as early as possible.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126355359","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}
Pub Date : 2018-04-10DOI: 10.1109/CoDIT.2018.8394934
Siddhant Vibhute
In this paper, Adaptive Dynamic Programming (ADP) technique is utilized to achieve optimal motion control of Autonomous Underwater Vehicle (AUV) System. The paper proposes a model-free based method that takes into consideration the actuator input and obstacle position while tracing an optimal path. The concept of machine learning enables to develop a path-planner which aims to avoid collisions with static obstacles. The ADP approach is realized to approximate the solution of the cost functional for optimization purpose by which the positions of the locally situated obstacles need not be priori-known until they are within a designed approximation safety envelope. The methodology is implemented to achieve the path-planning objective using dynamic programming technique. The Least-squares policy method serves as a recursive algorithm to approximate the value function for the domain, providing an approach for the finite space discrete control system. The concept behind the design of an obstacle-free path finder is to generate an optimal action that minimizes the local cost, defined by a functional, under constrained optimization. The most advantageous value function is described by the Hamilton Jacobi Bellman (HJB) equation, that is impractical to solve using analytical methods. To overcome the complex calculations subject to HJB, a method based on Reinforcement Learning (RL), called ADP is implemented. This paper outlines the concept of machine learning to realize a real time obstacle avoidance system.
{"title":"Adaptive Dynamic Programming Based Motion Control of Autonomous Underwater Vehicles","authors":"Siddhant Vibhute","doi":"10.1109/CoDIT.2018.8394934","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394934","url":null,"abstract":"In this paper, Adaptive Dynamic Programming (ADP) technique is utilized to achieve optimal motion control of Autonomous Underwater Vehicle (AUV) System. The paper proposes a model-free based method that takes into consideration the actuator input and obstacle position while tracing an optimal path. The concept of machine learning enables to develop a path-planner which aims to avoid collisions with static obstacles. The ADP approach is realized to approximate the solution of the cost functional for optimization purpose by which the positions of the locally situated obstacles need not be priori-known until they are within a designed approximation safety envelope. The methodology is implemented to achieve the path-planning objective using dynamic programming technique. The Least-squares policy method serves as a recursive algorithm to approximate the value function for the domain, providing an approach for the finite space discrete control system. The concept behind the design of an obstacle-free path finder is to generate an optimal action that minimizes the local cost, defined by a functional, under constrained optimization. The most advantageous value function is described by the Hamilton Jacobi Bellman (HJB) equation, that is impractical to solve using analytical methods. To overcome the complex calculations subject to HJB, a method based on Reinforcement Learning (RL), called ADP is implemented. This paper outlines the concept of machine learning to realize a real time obstacle avoidance system.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126517741","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}
Pub Date : 2018-04-10DOI: 10.1109/CoDIT.2018.8394786
D. Krokavec, A. Filasová
The linear matrix inequalities approach is proposed to discrete-time linear positive system control design, reflecting enhanced and D-stability region approaches. Coupling together the set of linear matrix inequalities warranting the system positive structure and the structure guaranteing circle D-stability, the design conditions are outlined to raise the positive closed-loop system, considering a nonnegative control gain matrix. Some related properties are deduced to demonstrate diagonal stabilizability of the positive systems.
{"title":"Enhanced Conditions in Design of Linear Discrete-time Positive System Control","authors":"D. Krokavec, A. Filasová","doi":"10.1109/CoDIT.2018.8394786","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394786","url":null,"abstract":"The linear matrix inequalities approach is proposed to discrete-time linear positive system control design, reflecting enhanced and D-stability region approaches. Coupling together the set of linear matrix inequalities warranting the system positive structure and the structure guaranteing circle D-stability, the design conditions are outlined to raise the positive closed-loop system, considering a nonnegative control gain matrix. Some related properties are deduced to demonstrate diagonal stabilizability of the positive systems.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125296320","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}
Pub Date : 2018-04-10DOI: 10.1109/CoDIT.2018.8394888
Bilal Bou Saleh, A. E. Moudni, M. Hajjar, O. Barakat
The efficient management of a surgical block must allow to the realization of pre-planned surgical procedures but also to cope with all the aleas and disturbances as emergencies or late cancellations and this by adapting dynamically the schedule already in progress. This study focuses on the local cooperative control model to manage the surgical operating room process in the completion phase. More precisely: An application of the Contract Net Protocol (CNP) for task decomposition and task assignment in multi-agent systems is presented; we show that it can be used to get the best real-time solution in terms of cost for the assignment of emergency surgery that can happen at any time of the day. By the use at any time of the auction protocols algorithm called “simulated trading” (ST), the schedule for remaining time can be improved significantly. The solution of the rescheduling problem emerges from local decision-making and problem-solving rules. Since the local cooperative control system will include policies that optimize local performance and responsiveness. MAS solve the problem of dynamic planning by controlling the progress of the process during the day. Thus, it is designed as an online system with anytime algorithms. The proposed control model, which is still lacking today, is required to address uncertainties inherent in the surgical block process. Research focus: distributed task allocation with multi-agent systems
{"title":"A Cooperative Control Model Foroperating Theaterscheduling","authors":"Bilal Bou Saleh, A. E. Moudni, M. Hajjar, O. Barakat","doi":"10.1109/CoDIT.2018.8394888","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394888","url":null,"abstract":"The efficient management of a surgical block must allow to the realization of pre-planned surgical procedures but also to cope with all the aleas and disturbances as emergencies or late cancellations and this by adapting dynamically the schedule already in progress. This study focuses on the local cooperative control model to manage the surgical operating room process in the completion phase. More precisely: An application of the Contract Net Protocol (CNP) for task decomposition and task assignment in multi-agent systems is presented; we show that it can be used to get the best real-time solution in terms of cost for the assignment of emergency surgery that can happen at any time of the day. By the use at any time of the auction protocols algorithm called “simulated trading” (ST), the schedule for remaining time can be improved significantly. The solution of the rescheduling problem emerges from local decision-making and problem-solving rules. Since the local cooperative control system will include policies that optimize local performance and responsiveness. MAS solve the problem of dynamic planning by controlling the progress of the process during the day. Thus, it is designed as an online system with anytime algorithms. The proposed control model, which is still lacking today, is required to address uncertainties inherent in the surgical block process. Research focus: distributed task allocation with multi-agent systems","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052067","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}
Pub Date : 2018-04-01DOI: 10.1109/CoDIT.2018.8394944
C. Yfoulis, S. Papadopoulou, Dimitris Trigkas, S. Voutetakis
The design of simple linear control laws via linear mathematical models is a standard part of every control systems laboratory in a standard undergraduate curriculum. A typical example is the design of PI control laws for the speed control problem of DC motors. Embedded control is taught nowadays using cheap take-home equipment based on low-cost microprocessors like Arduino and dc micro-motors. Although offering ease for the demonstration of simple PI control laws, these motors exhibit nonlinear characteristics, which can be dealt with the application of more advanced control laws. The paper's purpose is twofold: first, to explore the possibilities offered by low-cost equipment, as a test bed for the “proof of concept” of more sophisticated switching control laws; and secondly to unfold the possibilities offered by this new environment for teaching, demonstration, project work, as well as research purposes, in the current laboratory practice.
{"title":"Switching PI speed control of a nonlinear laboratory dc micro-motor using low-cost embedded control hardware and software","authors":"C. Yfoulis, S. Papadopoulou, Dimitris Trigkas, S. Voutetakis","doi":"10.1109/CoDIT.2018.8394944","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394944","url":null,"abstract":"The design of simple linear control laws via linear mathematical models is a standard part of every control systems laboratory in a standard undergraduate curriculum. A typical example is the design of PI control laws for the speed control problem of DC motors. Embedded control is taught nowadays using cheap take-home equipment based on low-cost microprocessors like Arduino and dc micro-motors. Although offering ease for the demonstration of simple PI control laws, these motors exhibit nonlinear characteristics, which can be dealt with the application of more advanced control laws. The paper's purpose is twofold: first, to explore the possibilities offered by low-cost equipment, as a test bed for the “proof of concept” of more sophisticated switching control laws; and secondly to unfold the possibilities offered by this new environment for teaching, demonstration, project work, as well as research purposes, in the current laboratory practice.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114992881","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}
Pub Date : 2018-04-01DOI: 10.1109/CoDIT.2018.8394826
A. Elalouf, Dmitry Tsadikovich, E. Levner
We focus on improving a two-echelon blood sample collection chain with an application for MEUHEDET, the second largest health maintenance organization (HMO) in Israel. The effectiveness of the chain is influenced by two contradictory factors: (a) how many clinics should be activated to satisfy all customers' demand and (b) how many vehicles should be employed to deliver the collected samples to the testing lab in time and in a cost-effective manner. Determining the optimal balance between these two aspects while satisfying timing and quality constraints constitute the main focus of our work. To find a solution, a novel approach based on a combination of the vehicle routing heuristic with the fully polynomial time approximation scheme (FPTAS) is developed.
{"title":"A location-routing problem within blood sample collection chains","authors":"A. Elalouf, Dmitry Tsadikovich, E. Levner","doi":"10.1109/CoDIT.2018.8394826","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394826","url":null,"abstract":"We focus on improving a two-echelon blood sample collection chain with an application for MEUHEDET, the second largest health maintenance organization (HMO) in Israel. The effectiveness of the chain is influenced by two contradictory factors: (a) how many clinics should be activated to satisfy all customers' demand and (b) how many vehicles should be employed to deliver the collected samples to the testing lab in time and in a cost-effective manner. Determining the optimal balance between these two aspects while satisfying timing and quality constraints constitute the main focus of our work. To find a solution, a novel approach based on a combination of the vehicle routing heuristic with the fully polynomial time approximation scheme (FPTAS) is developed.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124278028","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}
Pub Date : 2018-04-01DOI: 10.1109/CoDIT.2018.8394953
Kahina Louadj, Fethi Demim, A. Nemra, M. Aidène, P. Marthon, Hocine Iddir
The main objective of an energy regulation of a building is to maintain internal thermal comfort, as well as minimize energy consumption, or reduce the peak of electrical consumption. The dynamic programming has been used to minimize a cost function, accounting for a high peak electricity tariff, under constraints related to comfort (minimal temperature, maximal temperature variation) and the maximum heating power. The proposed energy management consists in over-heating the building during the hours before the peak knowing in advance the weather, occupation and internal gains for the day. The method has been tested in a case study corresponding to a house of a four-person family with performance levels: high construction and poorly insulated old house.
{"title":"Optimization of Electricity Consumption in a building","authors":"Kahina Louadj, Fethi Demim, A. Nemra, M. Aidène, P. Marthon, Hocine Iddir","doi":"10.1109/CoDIT.2018.8394953","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394953","url":null,"abstract":"The main objective of an energy regulation of a building is to maintain internal thermal comfort, as well as minimize energy consumption, or reduce the peak of electrical consumption. The dynamic programming has been used to minimize a cost function, accounting for a high peak electricity tariff, under constraints related to comfort (minimal temperature, maximal temperature variation) and the maximum heating power. The proposed energy management consists in over-heating the building during the hours before the peak knowing in advance the weather, occupation and internal gains for the day. The method has been tested in a case study corresponding to a house of a four-person family with performance levels: high construction and poorly insulated old house.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125813917","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}
Pub Date : 2018-04-01DOI: 10.1109/CoDIT.2018.8394967
Sourav K. Bhowmick, S. Panja
The objective of this paper is to investigate lag-bipartite consensus of linear multiagent systems (MAS) with a non-autonomous leader. The principle focus of this work is to study the collective behaviour of MAS over a signed graph called lag-bipartite consensus in which a group of follower agents tracks the leader trajectory with a certain time-delay, and the other group tracks the opposite of the leader trajectory with the same amount of time-delay. The study is carried out under both static and adaptive couplings. Static coupling uses global information while adaptive coupling uses only relative information between agents and system parameters. It is shown that if the communication topology is connected, then with the design of suitable distributed state-feedback controllers based on static and adaptive coupling gains, and feedback gain matrices, lag-bipartite consensus among the followers and the leader is achieved. The theoretical developments are verified with the numerical simulation results.
{"title":"Adaptive Lag-Bipartite Consensus of Linear Multiagent Systems with a Non-autonomous Leader over Signed Graph","authors":"Sourav K. Bhowmick, S. Panja","doi":"10.1109/CoDIT.2018.8394967","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394967","url":null,"abstract":"The objective of this paper is to investigate lag-bipartite consensus of linear multiagent systems (MAS) with a non-autonomous leader. The principle focus of this work is to study the collective behaviour of MAS over a signed graph called lag-bipartite consensus in which a group of follower agents tracks the leader trajectory with a certain time-delay, and the other group tracks the opposite of the leader trajectory with the same amount of time-delay. The study is carried out under both static and adaptive couplings. Static coupling uses global information while adaptive coupling uses only relative information between agents and system parameters. It is shown that if the communication topology is connected, then with the design of suitable distributed state-feedback controllers based on static and adaptive coupling gains, and feedback gain matrices, lag-bipartite consensus among the followers and the leader is achieved. The theoretical developments are verified with the numerical simulation results.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124350776","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}
Pub Date : 2018-04-01DOI: 10.1109/CoDIT.2018.8394892
D. Tayachi, N. Zaddem
In this paper, we tackle the Maximum Vertex-Weighted Clique Problem MVWCP. This problem consists to find in any weighted and non-oriented graph a clique with the maximum weight, i.e. a complete subgraph which has a maximum weight. MVWCP is an NP-hard combinatorial optimization problem with many practical applications. The objective of this work is to provide good quality solutions in reasonable computational times. Thus, we propose an iterated local search method ILS-CHC which explores the search space using a combined local search method and two levels of perturbation. Experimental studies conducted on the DIMACS benchmark instances show that the proposed approach compares favorably with the state-of-the-art methods and that it is even able to find better cliques than those found in the literature in many instances.
{"title":"An Iterated Local Search ILS-CHC for the Maximum Vertex-Weighted Clique Problem","authors":"D. Tayachi, N. Zaddem","doi":"10.1109/CoDIT.2018.8394892","DOIUrl":"https://doi.org/10.1109/CoDIT.2018.8394892","url":null,"abstract":"In this paper, we tackle the Maximum Vertex-Weighted Clique Problem MVWCP. This problem consists to find in any weighted and non-oriented graph a clique with the maximum weight, i.e. a complete subgraph which has a maximum weight. MVWCP is an NP-hard combinatorial optimization problem with many practical applications. The objective of this work is to provide good quality solutions in reasonable computational times. Thus, we propose an iterated local search method ILS-CHC which explores the search space using a combined local search method and two levels of perturbation. Experimental studies conducted on the DIMACS benchmark instances show that the proposed approach compares favorably with the state-of-the-art methods and that it is even able to find better cliques than those found in the literature in many instances.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124088018","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
扫码关注我们
求助内容：
应助结果提醒方式：