Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

The doctoral research abstracts. Vol:11 2017 / Institute of Graduate Studies, UiTM

Foreword: Congratulation to IGS on the continuous effort to publish the 11th issue of the Doctoral Research Abstracts which highlights the research in various disciplines from science and technology, business and administration to social science and humanities. This research abstract issue features the abstracts from 91 PhD doctorates who will receive their scrolls in this 86th UiTM momentous convocation ceremony. This is a special year for the Institute of Graduate Studies where we are celebrating our 20th anniversary. The 20th anniversary is celebrated with pride with an increase in the number of PhD graduates. In this 86th convocation, the number of PhD graduates has increased by 30% compared to the previous convocation. Each research produces an innovation and this year, 91 research innovations have been successfully recognized to have made contributions to the body of knowledge. This is in line with this year UiTM theme that is “Inovasi Melonjak Persaingan Global (Innovation Soars Global Competition)”. Embarking on PhD research may not have been an easy decision for many of you. It often comes at a point in life when the decision to further one’s studies is challenged by the comfort of status quo. I would like it to be known that you have most certainly done UiTM proud by journeying through the scholarly world with its endless challenges and obstacles, and by persevering right till the very end. Again, congratulations to all PhD graduates. As you leave the university as alumni we hope a new relationship will be fostered between you and UiTM to ensure UiTM soars to greater heights. I wish you all the best in your future endeavor. Keep UiTM close to your heart and be our ambassadors wherever you go. / Prof Emeritus Dato’ Dr Hassan Said Vice Chancellor Universiti Teknologi MAR

Enhancing the bees algorithm using the traplining metaphor

This work aims to improve the performance of the Bees Algorithm (BA), particularly in terms of simplicity, accuracy, and convergence. Three improvements were made in this study as a result of bees’ traplining behaviour. The first improvement was the parameter reduction of the Bees Algorithm. This strategy recruits and assigns worker bees to exploit and explore all patches. Both searching processes are assigned using the Triangular Distribution Random Number Generator. The most promising patches have more workers and are subject to more exploitation than the less productive patches. This technique reduced the original parameters into two parameters. The results show that the Bi-BA is just as efficient as the basic BA, although it has fewer parameters. Following that, another improvement was proposed to increase the diversification performance of the Combinatorial Bees Algorithm (CBA). The technique employs a novel constructive heuristic that considers the distance and the turning angle of the bees’ flight. When foraging for honey, bees generally avoid making a sharp turn. By including this turning angle as the second consideration, it can control CBA’s initial solution diversity. Third, the CBA is strengthened to enable an intensification strategy that avoids falling into a local optima trap. The approach is based on the behaviour of bees when confronted with threats. They will keep away from re-visiting those flowers during the next bout for reasons like predators, rivals, or honey run out. The approach will remove temporarily threatened flowers from the whole tour, eliminating the sharp turn, and reintroduces them again to the habitual tour’s nearest edge. The technique could effectively achieve an equilibrium between exploration and exploitation mechanisms. The results show that the strategy is very competitive compared to other population-based nature-inspired algorithms. Finally, the enhanced Bees Algorithms are demonstrated on two real-world engineering problems, namely, Printed Circuit Board insertion sequencing and vehicles routing problem

Technology and Management for Sustainable Buildings and Infrastructures

A total of 30 articles have been published in this special issue, and it consists of 27 research papers, 2 technical notes, and 1 review paper. A total of 104 authors from 9 countries including Korea, Spain, Taiwan, USA, Finland, China, Slovenia, the Netherlands, and Germany participated in writing and submitting very excellent papers that were finally published after the review process had been conducted according to very strict standards. Among the published papers, 13 papers directly addressed words such as sustainable, life cycle assessment (LCA) and CO2, and 17 papers indirectly dealt with energy and CO2 reduction effects. Among the published papers, there are 6 papers dealing with construction technology, but a majority, 24 papers deal with management techniques. The authors of the published papers used various analysis techniques to obtain the suggested solutions for each topic. Listed by key techniques, various techniques such as Analytic Hierarchy Process (AHP), the Taguchi method, machine learning including Artificial Neural Networks (ANNs), Life Cycle Assessment (LCA), regression analysis, Strength–Weakness–Opportunity–Threat (SWOT), system dynamics, simulation and modeling, Building Information Model (BIM) with schedule, and graph and data analysis after experiments and observations are identified

A study on flexible flow shop and job shop scheduling using meta-heuristic approaches

Scheduling aims at allocation of resources to perform a group of tasks over a period of time in such a manner that some performance goals such as flow time, tardiness, lateness, and makespan can be minimized. Today, manufacturers face the challenges in terms of shorter product life cycles, customized products and changing demand pattern of customers. Due to intense competition in the market place, effective scheduling has now become an important issue for the growth and survival of manufacturing firms. To sustain in the current competitive environment, it is essential for the manufacturing firms to improve the schedule based on simultaneous optimization of performance measures such as makespan, flow time and tardiness. Since all the scheduling criteria are important from business operation point of view, it is vital to optimize all the objectives simultaneously instead of a single objective. It is also essentially important for the manufacturing firms to improve the performance of production scheduling systems that can address internal uncertainties such as machine breakdown, tool failure and change in processing times. The schedules must meet the deadline committed to customers because failure to do so may result in a significant loss of goodwill. Often, it is necessary to reschedule an existing plan due to uncertainty event like machine breakdowns. The problem of finding robust schedules (schedule performance does not deteriorate in disruption situation) or flexible schedules (schedules expected to perform well after some degree of modification when uncertain condition is encountered) is of utmost importance for real world applications as they operate in dynamic environments

Modelling and Optimizing Supply Chain Integrated Production Scheduling Problems

Globalization and advanced information technologies (e.g., Internet of Things) have considerably impacted supply chains (SCs) by persistently forcing original equipment manufacturers (OEMs) to switch production strategies from make-to-stock (MTS) to make-to-order (MTO) to survive in competition. Generally, an OEM follows the MTS strategy for products with steady demand. In contrast, the MTO strategy exists under a pull system with irregular demand in which the received customer orders are scheduled and launched into production. In comparison to MTS, MTO has the primary challenges of ensuring timely delivery at the lowest possible cost, satisfying the demands of high customization and guaranteeing the accessibility of raw materials throughout the production process. These challenges are increasing substantially since industrial productions are becoming more flexible, diversified, and customized. Besides, independently making the production scheduling decisions from other stages of these SCs often find sub-optimal results, creating substantial challenges to fulfilling demands timely and cost-effectively. Since adequately managing these challenges asynchronously are difficult, constructing optimization models by integrating SC decisions, such as customer requirements, supply portfolio (supplier selection and order allocation), delivery batching decisions, and inventory portfolio (inventory replenishment, consumption, and availability), with shop floor scheduling under a deterministic and dynamic environment is essential to fulfilling customer expectations at the least possible cost. These optimization models are computationally intractable. Consequently, designing algorithms to schedule or reschedule promptly is also highly challenging for these time-sensitive, operationally integrated optimization models. Thus, this thesis focuses on modelling and optimizing SC-integrated production scheduling problems, named SC scheduling problems (SCSPs). The objective of optimizing job shop scheduling problems (JSSPs) is to ensure that the requisite resources are accessible when required and that their utilization is maximally efficient. Although numerous algorithms have been devised, they can sometimes become computationally exorbitant and yield sub-optimal outcomes, rendering production systems inefficient. These could be due to a variety of causes, such as an imbalance in population quality over generations, recurrent generation and evaluation of identical schedules, and permitting an under-performing method to conduct the evolutionary process. Consequently, this study designs two methods, a sequential approach (Chapter 2) and a multi-method approach (Chapter 3), to address the aforementioned issues and to acquire competitive results in finding optimal or near-optimal solutions for JSSPs in a single objective setting. The devised algorithms for JSSPs optimize workflows for each job by accurate mapping between/among related resources, generating more optimal results than existing algorithms. Production scheduling can not be accomplished precisely without considering supply and delivery decisions and customer requirements simultaneously. Thus, a few recent studies have operationally integrated SCs to accurately predict process insights for executing, monitoring, and controlling the planned production. However, these studies are limited to simple shop-floor configurations and can provide the least flexibility to address the MTO-based SC challenges. Thus, this study formulates a bi-objective optimization model that integrates the supply portfolio into a flexible job shop scheduling environment with a customer-imposed delivery window to cost-effectively meet customized and on-time delivery requirements (Chapter 4). Compared to the job shop that is limited to sequence flexibility only, the flexible job shop has been deemed advantageous due to its capacity to provide increased scheduling flexibility (both process and sequence flexibility). To optimize the model, the performance of the multi-objective particle swarm optimization algorithm has been enhanced, with the results providing decision-makers with an increased degree of flexibility, offering a larger number of Pareto solutions, more varied and consistent frontiers, and a reasonable time for MTO-based SCs. Environmental sustainability is spotlighted for increasing environmental awareness and follow-up regulations. Consequently, the related factors strongly regulate the supply portfolio for sustainable development, which remained unexplored in the SCSP as those criteria are primarily qualitative (e.g., green production, green product design, corporate social responsibility, and waste disposal system). These absences may lead to an unacceptable supply portfolio. Thus, this study overcomes the problem by integrating VIKORSORT into the proposed solution methodology of the extended SCSP. In addition, forming delivery batches of heterogeneous customer orders is challenging, as one order can lead to another being delayed. Therefore, the previous optimization model is extended by integrating supply, manufacturing, and delivery batching decisions and concurrently optimizing them in response to heterogeneous customer requirements with time window constraints, considering both economic and environmental sustainability for the supply portfolio (Chapter 5). Since the proposed optimization model is an extension of the flexible job shop, it can be classified as a non-deterministic polynomial-time (NP)-hard problem, which cannot be solved by conventional optimization techniques, particularly in the case of larger instances. Therefore, a reinforcement learning-based hyper-heuristic (HH) has been designed, where four solution-updating heuristics are intelligently guided to deliver the best possible results compared to existing algorithms. The optimization model furnishes a set of comprehensive schedules that integrate the supply portfolio, production portfolio (work-center/machine assignment and customer orders sequencing), and batching decisions. This provides numerous meaningful managerial insights and operational flexibility prior to the execution phase. Recently, SCs have been experiencing unprecedented and massive disruptions caused by an abrupt outbreak, resulting in difficulties for OEMs to recover from disruptive demand-supply equilibrium. Hence, this study proposes a multi-portfolio (supply, production, and inventory portfolios) approach for a proactive-reactive scheme, which concerns the SCSP with complex multi-level products, simultaneously including unpredictably dynamic supply, demand, and shop floor disruptions (Chapter 6). This study considers fabrication and assembly in a multi-level product structure. To effectively address this time-sensitive model based on real-time data, a Q-learning-based multi-operator differential evolution algorithm in a HH has been designed to address disruptive events and generate a timely rescheduling plan. The numerical results and analyses demonstrate the proposed model's capability to effectively address single and multiple disruptions, thus providing significant managerial insights and ensuring SC resilience

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

Alternative Sources of Energy Modeling, Automation, Optimal Planning and Operation

An economic development model analyzes the adoption of alternative strategy capable of leveraging the economy, based essentially on RES. The combination of wind turbine, PV installation with new technology battery energy storage, DSM network and RES forecasting algorithms maximizes RES integration in isolated islands. An innovative model of power system (PS) imbalances is presented, which aims to capture various features of the stochastic behavior of imbalances and to reduce in average reserve requirements and PS risk. Deep learning techniques for medium-term wind speed and solar irradiance forecasting are presented, using for first time a specific cloud index. Scalability-replicability of the FLEXITRANSTORE technology innovations integrates hardware-software solutions in all areas of the transmission system and the wholesale markets, promoting increased RES. A deep learning and GIS approach are combined for the optimal positioning of wave energy converters. An innovative methodology to hybridize battery-based energy storage using supercapacitors for smoother power profile, a new control scheme and battery degradation mechanism and their economic viability are presented. An innovative module-level photovoltaic (PV) architecture in parallel configuration is introduced maximizing power extraction under partial shading. A new method for detecting demagnetization faults in axial flux permanent magnet synchronous wind generators is presented. The stochastic operating temperature (OT) optimization integrated with Markov Chain simulation ascertains a more accurate OT for guiding the coal gasification practice