Karen Gonzalez, S. Tebbani, D. Dumur, F. Lopes, D. Pareau, S. Givry, Françoise Entzmann
{"title":"Control strategy for continuous lactic acid production from wheat flour","authors":"Karen Gonzalez, S. Tebbani, D. Dumur, F. Lopes, D. Pareau, S. Givry, Françoise Entzmann","doi":"10.1109/CoDIT.2014.6996938","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996938","url":null,"abstract":"In this study, a control strategy for lactic acid production process from wheat flour is proposed. First, the process model to be used in the control strategy is chosen after performing an observability analysis of the system. Then, the optimal setpoint that maximizes the lactic acid productivity is determined based on this simplified model. Finally, the regulation of lactic acid concentration to its optimal value is considered. The designed control law uses a state-feedback linearizing controller in an inner loop together with a proportional integral (PI) regulator in an outer loop. An anti-windup mechanism is added in order to improve the control law performances. The efficiency of the proposed control strategy is illustrated and assessed by means of simulation results.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121124210","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}
{"title":"A linear mathematical model for patients' activities scheduling on hospital resources","authors":"N. E. H. Saadani, Zied Bahroun, Asma Bouras","doi":"10.1109/CoDIT.2014.6996871","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996871","url":null,"abstract":"Hospitals use very costly medical equipment like scanners, RMI, endoscopy equipment or operating rooms. In this paper, we propose a mixed integer model to schedule patients on different hospital resources they can need during their stay in a hospital. We study the case of multiple types of resources and for each type the existence of several parallel units. The objective is to minimize the sum of all patients' stays. We used LINGO11 solver, along with our mathematical formulation, to solve the problem. The results showed that, as expected for an NP-hard problem, the computational times rise exponentially with the size of the instances.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127437900","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}
Nacira Chikhi, R. Benmansour, A. Bekrar, S. Hanafi, Moncef Abbas
{"title":"A case study of a two-stage flow shop with dedicated machines and a single robot","authors":"Nacira Chikhi, R. Benmansour, A. Bekrar, S. Hanafi, Moncef Abbas","doi":"10.1109/CoDIT.2014.6996901","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996901","url":null,"abstract":"This paper considers a two-stage robotic flow shop scheduling problem. The objective is to minimize the makespan. The problem consists of two dedicated machines at the first stage and one common machine at the second stage. Each job is defined by two operations processed on the two-stages in series. Depending on its type, each job is executed on a dedicated machine at the first stage, then it is transported, by a robot or a conveyor, to be executed on the common machine at the second stage. We propose two mixed-integer program (MIP) models to solve this problem which is NP-Hard. These two models can be improved using valid inequalities based on three lower bounds. In addition, due to the NP-hardness of this case, a heuristic is developed to solve approximately large-size problems. The results indicate that the obtained solutions are of high quality and the corresponding CPU time is acceptable.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125164210","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}
{"title":"Handling uncertainties of models inputs in inverse problem: the U-discrete PSO approach","authors":"D. Barchiesi","doi":"10.1109/CoDIT.2014.6996990","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996990","url":null,"abstract":"The inverse problem of unconstrained physical systems consists in finding the set of continuous inputs for its model that minimize fitness function measuring the distance between a target and the result of the model. However either the characterization of the sensitivity of model to each input or a preliminary knowledge on the uncertainties on parameters can reveal different required precision on each input. Therefore a blind search of the best set of parameters could be unnecessarily costing in terms of computational effort on the determination of non significative digits. To overcome this problem a solution consists in searching the best parameter sets within a predefined discrete space of search that is designed from the significative number of digits. The strategy consists in transforming the continuous problem into a discrete one that falls within combinatorial optimization eventually before ending the search of the best continuous inputs if required. The performance of continuous and discrete PSO are compared by their application to the inverse problem of the purple color of the Lycurgus cup. The structure of this ancient glass is recovered from photograph by using a direct model of color generation. The discussion of results is also an opportunity to convince that the heuristic approaches provide solutions to the inverse problem unlike nested loops, from a pedagogical point of view.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357490","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}
{"title":"Hybrid Petri nets for modeling and control of multi-source energy conversion systems","authors":"A. Sava, K. Adjallah, Honore Lagaza","doi":"10.1109/CoDIT.2014.6996947","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996947","url":null,"abstract":"This paper proposes an approach of hybrid Petri nets modeling for hybrid renewable energy production systems structured in micro-grids. This approach is original in the sense that it enables to study the behavior of such systems under various reconfiguration constraints in order to fulfill energy demands for customers. The proposed Petri net model allows to considering the discreet events related to the availability of energy resources or to components' failures in the system as well in the discreet reconfiguration (structural or functional), for control strategies specifications. In addition, an operational research model for cost minimization and availability maximization through reconfiguration is also proposed. The joint implementation of both models should lead to a new approach of design of hybrid renewable energy systems and of their effective cost optimization.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122434854","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}
{"title":"Simple constructive heuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with sequence dependent setup times","authors":"Sara Hatami, Rubén Ruiz, C. Andrés-Romano","doi":"10.1109/CoDIT.2014.6996861","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996861","url":null,"abstract":"In this paper we consider a realistic production setting, referred to the Distributed Assembly Permutation Flowshop Scheduling Problem or DAPFSP in short. The problem consists of two stages, production and assembly. The paper is an extension of the recent work by Hatami et al. [6], that the additional consideration of sequence-dependent setup times (SDST) is added on both production and assembly stages. The resulting problem is very close to the reality of multi-factory scheduling. The production stage as the first stage is composed of f identical flowshop production factories where each factory is a flowshop that produce the different jobs. In the assembly stage, all produced jobs are assembled into final products. The objective is to minimize the overall makespan. As this problem is known to be NP-hard, we propose two simple constructive heuristics to solve the problem. In this paper we detail the proposed heuristics and carry out a comprehensive computational and statistical experiment to analyze their performance.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124041621","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}
{"title":"A hybrid metaheuristic for the Vehicle Routing Problem with Time Windows","authors":"M. Hifi, Lei Wu","doi":"10.1109/CoDIT.2014.6996891","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996891","url":null,"abstract":"In this paper we propose to solve the Vehicle Routing Problem with Time Windows (VRPTW) using a hybrid metaheuristic. The VRPTW is a bi-objective optimization problem where both the number of vehicles and the distance of the travel to use should be minimized. Because it is often difficult to optimize both objectives, we propose an approach that optimizes the distance traveled by a fleet of vehicles. Such a strategy has been already used by several authors in the domain. Herein, an instance of VRPTW is considered as the composition of the Assignment Problem and a series of Traveling Salesman Problems with Time Windows (TSPTW). Both AP and TSPTW are solved by using an ant colony optimization system. Furthermore, in order to enhance the quality of the current solution, a large neighborhood search is introduced. Finally, a preliminary experimental part is presented where the proposed method is evaluated on a set of benchmark instances and its results are compared to the best results obtained by the methods available in the literature. Our preliminary results show that the proposed hybrid method remains competitive and it is able to reach new minimum distances for some tested instances.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121612879","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}
M. Korayem, M. Doosthoseini, B. K. Elyaderani, A. M. Shafei
{"title":"Trajectory closed loop control experiment for a two-link elastic manipulator in presence of load","authors":"M. Korayem, M. Doosthoseini, B. K. Elyaderani, A. M. Shafei","doi":"10.1109/CoDIT.2014.6996948","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996948","url":null,"abstract":"Studying the behavior of a 2-link elastic robotic arm as a manipulator is the purpose of this article. So, all parts of an experimental set up like aluminum links, AC servo motor and its driver, DC motor, strain gauge sensors, high speed digital to analog convertor (DAC) components on an electrical interface board and National Instrument's LABVIEW software package are gathered. In this paper, it is focused on closed loop control of end effector in presence of load with and without PID controller. Decreasing the power consumption in industrial heavy robots requires to reducing the weight of the robot's links. It causes more deflection and vibration in the end effector of robots. Hence eliminating the deflection and vibration of end effector is a substantial goal in robotic and control researches. Here we try to propose ideas for this problem and it works better if all offered theoretical ideas exam on an actual set up that we have prepared. For the first step a PID linear controller has been tested on experimental set up. Eventually it will caused that getting enhancement in some terms of PID will improve some deviations of the direction due to link's vibrations. On the other hand increasing load on the robot end effector is caused to vibration intensification.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132463532","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}
Claude Gangolf, Robert Dochow, G. Schmidt, T. Tamisier
{"title":"SVDD: A proposal for automated credit rating prediction","authors":"Claude Gangolf, Robert Dochow, G. Schmidt, T. Tamisier","doi":"10.1109/CoDIT.2014.6996866","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996866","url":null,"abstract":"Credit rating prediction using clustering algorithms has become more and more important in the financial literature. Expanding the ideas of [4] and [5], we propose an approach to generate models for automated credit rating prediction based on support vector domain description (SVDD) and linear regression (LR). The models include the prediction for sovereign and corporate bonds. Another advantage is, the prediction models contain as many groups as rating grades exist, given by rating agencies like S&P, Fitch and Moody's. Our approach is formulated as a step-by-step procedure and all steps are illustrated by an example with artificial data. A numerical example with real data demonstrates the practical usability of our approach.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130031151","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}
{"title":"Optimal search with bounded daily returns","authors":"Esther Mohr","doi":"10.1109/CoDIT.2014.6996898","DOIUrl":"https://doi.org/10.1109/CoDIT.2014.6996898","url":null,"abstract":"The `reservation price policy' of [1] is based on the assumption that asset prices are arbitrary drawn from a pair of upper an lower bounds, that is, m and M. By defining a set of constants the maximum interday price fluctuation can be bounded in order to reduce market volatility. Arbitrary price movements like a sudden drop from M to m are excluded. We present and analyze online conversion algorithms under bounded daily returns. Results show that an investor solely requires the a-priori information whether the price function is symmetric or not to choose the algorithm with the smallest competitive ratio.","PeriodicalId":161703,"journal":{"name":"2014 International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"29 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130838808","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}