Pub Date : 2017-08-01DOI: 10.1109/COASE.2017.8256137
Peng Lin, Xiang T. R. Kong, Ming Li, Jian Chen, G. Huang
Ecommerce has been an efficient way for manufacturing enterprises to receive customer orders. One typical characteristics of Ecommerce production orders is that they usually require several different types of products. Synchronous production of different products for one customer orders, referred to synchronization in this paper, plays a critical role in lowering inventory level and meeting customer delivery demand. To facilitate the synchronization, an advanced planning and scheduling (APS) system is developed by using the Physical Internet (PI) technology. Several innovations are significant. Firstly, execution-level activities are integrated with planning and scheduling decisions through PI to support real-time data collection for synchronization. Secondly, the production progresses of products and customer orders are monitored real-timely and fully considered in scheduling. Thirdly, scheduling is conducted by the joint efforts of schedulers and workshop supervisors to further guarantee the synchronization.
电子商务已经成为制造企业接收客户订单的有效方式。电子商务生产订单的一个典型特征是，它们通常需要几种不同类型的产品。针对一个客户的订单同步生产不同的产品，本文称之为同质化，对于降低库存水平，满足客户的交货期需求起着至关重要的作用。为了实现同步，利用物理互联网(Physical Internet, PI)技术开发了一种先进的APS (planning and scheduling)系统。有几项创新意义重大。首先，通过PI将执行级活动与计划和调度决策集成在一起，以支持实时数据收集以实现同步。其次，实时监控产品的生产进度和客户订单，并在调度中充分考虑。第三，调度由调度员和车间主管共同完成，进一步保证了同步。
{"title":"IoT-enabled manufacturing synchronization for ecommerce","authors":"Peng Lin, Xiang T. R. Kong, Ming Li, Jian Chen, G. Huang","doi":"10.1109/COASE.2017.8256137","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256137","url":null,"abstract":"Ecommerce has been an efficient way for manufacturing enterprises to receive customer orders. One typical characteristics of Ecommerce production orders is that they usually require several different types of products. Synchronous production of different products for one customer orders, referred to synchronization in this paper, plays a critical role in lowering inventory level and meeting customer delivery demand. To facilitate the synchronization, an advanced planning and scheduling (APS) system is developed by using the Physical Internet (PI) technology. Several innovations are significant. Firstly, execution-level activities are integrated with planning and scheduling decisions through PI to support real-time data collection for synchronization. Secondly, the production progresses of products and customer orders are monitored real-timely and fully considered in scheduling. Thirdly, scheduling is conducted by the joint efforts of schedulers and workshop supervisors to further guarantee the synchronization.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133939462","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256170
M. Hammouche, P. Lutz, M. Rakotondrabe
This paper addresses the problem of automated grasping tasks using a piezoelectric microgripper, based on two piezoelectric tube actuators, for an accurate and rapid micro/nano manipulations. For this matter, we propose a strategy to control the position of one actuator and a hybrid approach that switches between force and position control of the second actuator. However, the nonlinearities and the uncertainties that characterize the piezoelectric actuators and the different properties of the manipulated objects make the control of such system not a trivial task. To handle this problem we propose to model the microgripper system by linear interval system, that embraces the parameters uncertainties, and synthesize a robust controller to control the interval system based on the classical output-feedback control design. The robust control synthesis consists on the search of robust gains for the controller that ensure the inclusion of the eigenvalues of the interval closed-loop system in a desired region of the complex plane. The effectiveness of the control strategy is illustrated by a real experimentation where the position and the manipulation force control show to maintain the desired performances under system uncertainties.
{"title":"Robust feedback control for automated force/position control of piezoelectric tube based microgripper","authors":"M. Hammouche, P. Lutz, M. Rakotondrabe","doi":"10.1109/COASE.2017.8256170","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256170","url":null,"abstract":"This paper addresses the problem of automated grasping tasks using a piezoelectric microgripper, based on two piezoelectric tube actuators, for an accurate and rapid micro/nano manipulations. For this matter, we propose a strategy to control the position of one actuator and a hybrid approach that switches between force and position control of the second actuator. However, the nonlinearities and the uncertainties that characterize the piezoelectric actuators and the different properties of the manipulated objects make the control of such system not a trivial task. To handle this problem we propose to model the microgripper system by linear interval system, that embraces the parameters uncertainties, and synthesize a robust controller to control the interval system based on the classical output-feedback control design. The robust control synthesis consists on the search of robust gains for the controller that ensure the inclusion of the eigenvalues of the interval closed-loop system in a desired region of the complex plane. The effectiveness of the control strategy is illustrated by a real experimentation where the position and the manipulation force control show to maintain the desired performances under system uncertainties.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122361586","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256121
Sarah Haas, Andreas Wallner, Ronald Toegl, Thomas Ulz, C. Steger
Mobile robots are used to replace conveyors in production facilities as they provide more flexibility and are easier to install or replace. These robots suffer from higher safety risks than conveyors as they move freely, necessitating extended security needs. A major point is the need for authentication to prevent unauthorized persons from manipulating a robot's software or configuration. Traditional username and password schemes are unwildy and insufficient for industrial mobile robots as administration and maintenance do not scale well. We propose the use of one-time passwords for authentication on robots based on a shared secret and a counter. The authentication mechanism is further supported by secure elements to allow secured storage of the key and secured password derivation. We also provide a threat analysis for the proposed methods.
{"title":"A secured offline authentication approach for industrial mobile robots","authors":"Sarah Haas, Andreas Wallner, Ronald Toegl, Thomas Ulz, C. Steger","doi":"10.1109/COASE.2017.8256121","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256121","url":null,"abstract":"Mobile robots are used to replace conveyors in production facilities as they provide more flexibility and are easier to install or replace. These robots suffer from higher safety risks than conveyors as they move freely, necessitating extended security needs. A major point is the need for authentication to prevent unauthorized persons from manipulating a robot's software or configuration. Traditional username and password schemes are unwildy and insufficient for industrial mobile robots as administration and maintenance do not scale well. We propose the use of one-time passwords for authentication on robots based on a shared secret and a counter. The authentication mechanism is further supported by secure elements to allow secured storage of the key and secured password derivation. We also provide a threat analysis for the proposed methods.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435314","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256115
Yijie Peng, Edward Huang, Jie Xu, Chun-Hung Chen
Team coordination and information sharing are important in concurrent engineering (CE), where multiple design teams execute their tasks simultaneously and then share information to update their designs, e.g., through integrated tests. The process then iterates until the global design objective is optimized. When properly controlled and executed, CE can be an effective method to speed up the design process for complex and large-scale projects thanks to its parallel nature. Recently, a coordinate optimization framework is proposed in [1] to model and control the information sharing in CE. It can be shown that under a convexity assumption, CE converges to a globally optimal design. In this paper, we study how the coordinate optimization framework can be applied to CE in a general environment where the objective function is non-convex. We propose a simulation optimization method using a domain space cutting and optimal computing budget allocation to efficiently select the initial points from which the coordinate optimization can be applied under a mild local convexity condition. The proposed approach has broad potentials in decentralized control and optimization of complex and large-scale systems in automation. Numerical experiments show that the optimal selection of the initial points allow coordination optimization to efficiently find the global optimum.
{"title":"An optimization approach for team coordination through information sharing","authors":"Yijie Peng, Edward Huang, Jie Xu, Chun-Hung Chen","doi":"10.1109/COASE.2017.8256115","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256115","url":null,"abstract":"Team coordination and information sharing are important in concurrent engineering (CE), where multiple design teams execute their tasks simultaneously and then share information to update their designs, e.g., through integrated tests. The process then iterates until the global design objective is optimized. When properly controlled and executed, CE can be an effective method to speed up the design process for complex and large-scale projects thanks to its parallel nature. Recently, a coordinate optimization framework is proposed in [1] to model and control the information sharing in CE. It can be shown that under a convexity assumption, CE converges to a globally optimal design. In this paper, we study how the coordinate optimization framework can be applied to CE in a general environment where the objective function is non-convex. We propose a simulation optimization method using a domain space cutting and optimal computing budget allocation to efficiently select the initial points from which the coordinate optimization can be applied under a mild local convexity condition. The proposed approach has broad potentials in decentralized control and optimization of complex and large-scale systems in automation. Numerical experiments show that the optimal selection of the initial points allow coordination optimization to efficiently find the global optimum.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129114918","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256195
Matthew Matl, Jeffrey Mahler, Ken Goldberg
In this paper, we present an algorithm that improves the rate of successful grasp transfer between 3D mesh models by breaking each mesh into functional subsegments and transferring grasps between similar subsegments rather than between full models. This algorithm combines prior research on grasp transfer with mesh segmentation techniques from computer graphics to successfully transfer contact points more often while potentially preserving task-specific knowledge across transfers. The algorithm extracts subsegments from each mesh model with a customized segmentation algorithm designed for speed and then groups similar subsegments with D2 shape descriptors and Gaussian mixture models (GMMs). Grasps are then transferred by aligning similar subsegments with Super4PCS, a global point cloud registration algorithm. We experimentally evaluated this algorithm against a non-segmenting baseline on over 20,000 grasp transfers across a set of 80 objects and found that the segmentation-based algorithm improved the success rate for finding a transferred grasp from 82% to 98%. Additionally, grasps transferred with our algorithm were only 8.7% less robust on average than the original grasps without any local re-planning.
{"title":"An algorithm for transferring parallel-jaw grasps between 3D mesh subsegments","authors":"Matthew Matl, Jeffrey Mahler, Ken Goldberg","doi":"10.1109/COASE.2017.8256195","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256195","url":null,"abstract":"In this paper, we present an algorithm that improves the rate of successful grasp transfer between 3D mesh models by breaking each mesh into functional subsegments and transferring grasps between similar subsegments rather than between full models. This algorithm combines prior research on grasp transfer with mesh segmentation techniques from computer graphics to successfully transfer contact points more often while potentially preserving task-specific knowledge across transfers. The algorithm extracts subsegments from each mesh model with a customized segmentation algorithm designed for speed and then groups similar subsegments with D2 shape descriptors and Gaussian mixture models (GMMs). Grasps are then transferred by aligning similar subsegments with Super4PCS, a global point cloud registration algorithm. We experimentally evaluated this algorithm against a non-segmenting baseline on over 20,000 grasp transfers across a set of 80 objects and found that the segmentation-based algorithm improved the success rate for finding a transferred grasp from 82% to 98%. Additionally, grasps transferred with our algorithm were only 8.7% less robust on average than the original grasps without any local re-planning.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115845478","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256244
Fei Gao, Siyang Gao
This paper studies the problem of selecting a subset of good designs from a finite set of simulated designs. We develop an approach to select r good enough designs instead of the exact top r designs from k alternatives, where good enough designs are defined as the top g designs (r ≤ g < k). Our approach aims to improve the selection efficiency while ensuring the performance of the selected designs in an acceptable range. Using the optimal computing budget allocation (OCBA) framework, we formulate the problem as that of maximizing the probability of correctly selecting r good enough designs under a simulation budget constraint. Based on the approximate measure of the probability of correct selection, we derive an asymptotically optimal selection procedure for selecting a good enough design subset. The proposed method demonstrates good empirical performance on some typical selection problems, including a practical inventory system problem.
{"title":"Selecting good enough simulated designs","authors":"Fei Gao, Siyang Gao","doi":"10.1109/COASE.2017.8256244","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256244","url":null,"abstract":"This paper studies the problem of selecting a subset of good designs from a finite set of simulated designs. We develop an approach to select r good enough designs instead of the exact top r designs from k alternatives, where good enough designs are defined as the top g designs (r ≤ g < k). Our approach aims to improve the selection efficiency while ensuring the performance of the selected designs in an acceptable range. Using the optimal computing budget allocation (OCBA) framework, we formulate the problem as that of maximizing the probability of correctly selecting r good enough designs under a simulation budget constraint. Based on the approximate measure of the probability of correct selection, we derive an asymptotically optimal selection procedure for selecting a good enough design subset. The proposed method demonstrates good empirical performance on some typical selection problems, including a practical inventory system problem.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876188","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256153
Yebin Wang, Devesh K. Jha, Yukiyasu Akemi
Path planning for automated parking remains challenged by the demand to balance general parking scenarios and computational efficiency. This paper proposes a two-stage rapid-exploring random tree (RRT) algorithm to improve the computational efficiency. At first the proposed algorithm performs space exploration and establishes prior knowledge, represented as waypoints, using cheap computation. Secondly a waypoint-guided RRT algorithm, with a sampling scheme biased by the waypoints, constructs a kinematic tree connecting the initial and goal configurations. Numerical study demonstrates that the two-stage algorithm achieves at least 2X faster than the baseline one-stage algorithm.
{"title":"A two-stage RRT path planner for automated parking","authors":"Yebin Wang, Devesh K. Jha, Yukiyasu Akemi","doi":"10.1109/COASE.2017.8256153","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256153","url":null,"abstract":"Path planning for automated parking remains challenged by the demand to balance general parking scenarios and computational efficiency. This paper proposes a two-stage rapid-exploring random tree (RRT) algorithm to improve the computational efficiency. At first the proposed algorithm performs space exploration and establishes prior knowledge, represented as waypoints, using cheap computation. Secondly a waypoint-guided RRT algorithm, with a sampling scheme biased by the waypoints, constructs a kinematic tree connecting the initial and goal configurations. Numerical study demonstrates that the two-stage algorithm achieves at least 2X faster than the baseline one-stage algorithm.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117260063","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256308
Godwin Ponraj, S. K. Kirthika, N. Thakor, C. Yeow, S. Kukreja, Hongliang Ren
The ability to sense and measure object properties based on touch is known as tactile sensing. The flexibility and dexterity of soft robots can be fully explored, only with efficient tactile feedback from the environment or the objects the robot interact with. This paper discusses about the development of a soft fabric based piezoresistive tactile sensor, the related calibration experiments and procedures. Fabric based sensors are flexible, stretchable and can confer to both hard and soft surfaces easily. The ability of the tactile sensor to enhance the efficiency of robotic activities is demonstrated in a simple cutting task. The robotic end effector used is a pneumatically controlled soft gripper. Experimental results show that the feedback from the tactile sensor developed is successfully used to detect the completion of the cutting task.
{"title":"Development of flexible fabric based tactile sensor for closed loop control of soft robotic actuator","authors":"Godwin Ponraj, S. K. Kirthika, N. Thakor, C. Yeow, S. Kukreja, Hongliang Ren","doi":"10.1109/COASE.2017.8256308","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256308","url":null,"abstract":"The ability to sense and measure object properties based on touch is known as tactile sensing. The flexibility and dexterity of soft robots can be fully explored, only with efficient tactile feedback from the environment or the objects the robot interact with. This paper discusses about the development of a soft fabric based piezoresistive tactile sensor, the related calibration experiments and procedures. Fabric based sensors are flexible, stretchable and can confer to both hard and soft surfaces easily. The ability of the tactile sensor to enhance the efficiency of robotic activities is demonstrated in a simple cutting task. The robotic end effector used is a pneumatically controlled soft gripper. Experimental results show that the feedback from the tactile sensor developed is successfully used to detect the completion of the cutting task.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"123 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116703314","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256340
J. A. Paredes, Carlos Saito, Monica Abarca, F. Cuéllar
The effects of low air density (characteristic at high-altitude environments) on small-sized Unmanned Aerial Vehicles (UAVs) are studied in this paper. Flight data from a fixed-wing aircraft and a quadcopter (in representation of multicopters) is examined to substantiate the influence high altitude conditions have on small UAVs' flight. By using aeronautical theoretical background to construct a hypothesis concerning how altitude affects the energy consumption and, consequently, flight time of both types of UAV, a qualitative analysis of flight missions held at different altitudes will be performed to find a correlation between the energy consumption and target altitude to determine if low altitude flight missions could be used to predict consumption at high-altitude environments. Finally, guidelines abstracted from these flight experiences will be given to help in the future design of UAVs with high altitude applications.
{"title":"Study of effects of high-altitude environments on multicopter and fixed-wing UAVs' energy consumption and flight time","authors":"J. A. Paredes, Carlos Saito, Monica Abarca, F. Cuéllar","doi":"10.1109/COASE.2017.8256340","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256340","url":null,"abstract":"The effects of low air density (characteristic at high-altitude environments) on small-sized Unmanned Aerial Vehicles (UAVs) are studied in this paper. Flight data from a fixed-wing aircraft and a quadcopter (in representation of multicopters) is examined to substantiate the influence high altitude conditions have on small UAVs' flight. By using aeronautical theoretical background to construct a hypothesis concerning how altitude affects the energy consumption and, consequently, flight time of both types of UAV, a qualitative analysis of flight missions held at different altitudes will be performed to find a correlation between the energy consumption and target altitude to determine if low altitude flight missions could be used to predict consumption at high-altitude environments. Finally, guidelines abstracted from these flight experiences will be given to help in the future design of UAVs with high altitude applications.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114890725","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 : 2017-08-01DOI: 10.1109/COASE.2017.8256314
Hong Lu, F. Qiao
In recent years, there has been growing interest in reducing energy consumption in manufacturing industry. This paper focuses on the parallel machine scheduling problem extracting from the high-energy heating process in iron and steel enterprises. We first present a mixed integer mathematic model with the objective of minimizing the total energy consumption. Next, we propose an improved genetic algorithm (IGA) to find high-quality solutions to this mathematic model. Since the scheduling problem is NP-hard, the proposed IGA improves standard genetic algorithm (SGA) in following aspects: crossover operation and mutation operation based on problem characteristics and adaptive adjustment. To evaluate the proposed algorithm, we select two comparison algorithms: SGA and adaptive genetic algorithm (AGA), and conduct a serial of experiments with the case scenarios generated according to real-world production process. The results show that the proposed IGA has superior performance to the other two algorithms.
{"title":"An improved genetic algorithm for a parallel machine scheduling problem with energy consideration","authors":"Hong Lu, F. Qiao","doi":"10.1109/COASE.2017.8256314","DOIUrl":"https://doi.org/10.1109/COASE.2017.8256314","url":null,"abstract":"In recent years, there has been growing interest in reducing energy consumption in manufacturing industry. This paper focuses on the parallel machine scheduling problem extracting from the high-energy heating process in iron and steel enterprises. We first present a mixed integer mathematic model with the objective of minimizing the total energy consumption. Next, we propose an improved genetic algorithm (IGA) to find high-quality solutions to this mathematic model. Since the scheduling problem is NP-hard, the proposed IGA improves standard genetic algorithm (SGA) in following aspects: crossover operation and mutation operation based on problem characteristics and adaptive adjustment. To evaluate the proposed algorithm, we select two comparison algorithms: SGA and adaptive genetic algorithm (AGA), and conduct a serial of experiments with the case scenarios generated according to real-world production process. The results show that the proposed IGA has superior performance to the other two algorithms.","PeriodicalId":445441,"journal":{"name":"2017 13th IEEE Conference on Automation Science and Engineering (CASE)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128056851","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
扫码关注我们
求助内容：
应助结果提醒方式：