Modeling of Biological Intelligence for SCM System Optimization

This article summarizes some methods from biological intelligence for modeling and optimization of supply chain management (SCM) systems, including genetic algorithms, evolutionary programming, differential evolution, swarm intelligence, artificial immune, and other biological intelligence related methods. An SCM system is adaptive, dynamic, open self-organizing, which is maintained by flows of information, materials, goods, funds, and energy. Traditional methods for modeling and optimizing complex SCM systems require huge amounts of computing resources, and biological intelligence-based solutions can often provide valuable alternatives for efficiently solving problems. The paper summarizes the recent related methods for the design and optimization of SCM systems, which covers the most widely used genetic algorithms and other evolutionary algorithms

Meta-heuristic based Construction Supply Chain Modelling and Optimization

Driven by the severe competition within the construction industry, the necessity of improving and optimizing the performance of construction supply chain has been aroused. This thesis proposes three problems with regard to the construction supply chain optimization from three perspectives, namely, deterministic single objective optimization, stochastic optimization and multi-objective optimization respectively. Mathematical models for each problem are constructed accordingly and meta-heuristic algorithms are developed and applied for resolving these three problems

On the use of biased-randomized algorithms for solving non-smooth optimization problems

Soft constraints are quite common in real-life applications. For example, in freight transportation, the fleet size can be enlarged by outsourcing part of the distribution service and some deliveries to customers can be postponed as well; in inventory management, it is possible to consider stock-outs generated by unexpected demands; and in manufacturing processes and project management, it is frequent that some deadlines cannot be met due to delays in critical steps of the supply chain. However, capacity-, size-, and time-related limitations are included in many optimization problems as hard constraints, while it would be usually more realistic to consider them as soft ones, i.e., they can be violated to some extent by incurring a penalty cost. Most of the times, this penalty cost will be nonlinear and even noncontinuous, which might transform the objective function into a non-smooth one. Despite its many practical applications, non-smooth optimization problems are quite challenging, especially when the underlying optimization problem is NP-hard in nature. In this paper, we propose the use of biased-randomized algorithms as an effective methodology to cope with NP-hard and non-smooth optimization problems in many practical applications. Biased-randomized algorithms extend constructive heuristics by introducing a nonuniform randomization pattern into them. Hence, they can be used to explore promising areas of the solution space without the limitations of gradient-based approaches, which assume the existence of smooth objective functions. Moreover, biased-randomized algorithms can be easily parallelized, thus employing short computing times while exploring a large number of promising regions. This paper discusses these concepts in detail, reviews existing work in different application areas, and highlights current trends and open research lines

Bio-inspired multi-agent systems for reconfigurable manufacturing systems

The current market’s demand for customization and responsiveness is a major challenge for producing intelligent, adaptive manufacturing systems. The Multi-Agent System (MAS) paradigm offers an alternative way to design this kind of system based on decentralized control using distributed, autonomous agents, thus replacing the traditional centralized control approach. The MAS solutions provide modularity, flexibility and robustness, thus addressing the responsiveness property, but usually do not consider true adaptation and re-configuration. Understanding how, in nature, complex things are performed in a simple and effective way allows us to mimic nature’s insights and develop powerful adaptive systems that able to evolve, thus dealing with the current challenges imposed on manufactur- ing systems. The paper provides an overview of some of the principles found in nature and biology and analyses the effectiveness of bio-inspired methods, which are used to enhance multi-agent systems to solve complex engineering problems, especially in the manufacturing field. An industrial automation case study is used to illustrate a bio-inspired method based on potential fields to dynamically route pallets

Designing a manufacturing cell system by assigning workforce

Purpose: In this paper, we have proposed a new model for designing a Cellular Manufacturing System (CMS) for minimizing the costs regarding a limited number of cells to be formed by assigning workforce. Design/methodology/approach: Pursuing mathematical approach and because the problem is NP-Hard, two meta-heuristic methods of Simulated Annealing (SA) and Particle Swarm Optimization (PSO) algorithms have been used. A small randomly generated test problem with real-world dimensions has been solved using simulated annealing and particle swarm algorithms. Findings: The quality of the two algorithms has been compared. The results showed that PSO algorithm provides more satisfactory solutions than SA algorithm in designing a CMS under uncertainty demands regarding the workforce allocation. Originality/value: In the most of the previous research, cell production has been considered under certainty production or demand conditions, while in practice production and demand are in a dynamic situations and in the real settings, cell production problems require variables and active constraints for each different time periods to achieve better design, so modeling such a problem in dynamic structure leads to more complexity while getting more applicability. The contribution of this paper is providing a new model by considering dynamic production times and uncertainty demands in designing cells.Peer Reviewe

Cloud computing resource scheduling and a survey of its evolutionary approaches

A disruptive technology fundamentally transforming the way that computing services are delivered, cloud computing offers information and communication technology users a new dimension of convenience of resources, as services via the Internet. Because cloud provides a finite pool of virtualized on-demand resources, optimally scheduling them has become an essential and rewarding topic, where a trend of using Evolutionary Computation (EC) algorithms is emerging rapidly. Through analyzing the cloud computing architecture, this survey first presents taxonomy at two levels of scheduling cloud resources. It then paints a landscape of the scheduling problem and solutions. According to the taxonomy, a comprehensive survey of state-of-the-art approaches is presented systematically. Looking forward, challenges and potential future research directions are investigated and invited, including real-time scheduling, adaptive dynamic scheduling, large-scale scheduling, multiobjective scheduling, and distributed and parallel scheduling. At the dawn of Industry 4.0, cloud computing scheduling for cyber-physical integration with the presence of big data is also discussed. Research in this area is only in its infancy, but with the rapid fusion of information and data technology, more exciting and agenda-setting topics are likely to emerge on the horizon

Preface: Swarm Intelligence, Focus on Ant and Particle Swarm Optimization

In the era globalisation the emerging technologies are governing engineering industries to a multifaceted state. The escalating complexity has demanded researchers to find the possible ways of easing the solution of the problems. This has motivated the researchers to grasp ideas from the nature and implant it in the engineering sciences. This way of thinking led to emergence of many biologically inspired algorithms that have proven to be efficient in handling the computationally complex problems with competence such as Genetic Algorithm (GA), Ant Colony Optimization (ACO), Particle Swarm Optimization (PSO), etc. Motivated by the capability of the biologically inspired algorithms the present book on ""Swarm Intelligence: Focus on Ant and Particle Swarm Optimization"" aims to present recent developments and applications concerning optimization with swarm intelligence techniques. The papers selected for this book comprise a cross-section of topics that reflect a variety of perspectives and disciplinary backgrounds. In addition to the introduction of new concepts of swarm intelligence, this book also presented some selected representative case studies covering power plant maintenance scheduling; geotechnical engineering; design and machining tolerances; layout problems; manufacturing process plan; job-shop scheduling; structural design; environmental dispatching problems; wireless communication; water distribution systems; multi-plant supply chain; fault diagnosis of airplane engines; and process scheduling. I believe these 27 chapters presented in this book adequately reflect these topics

Multi-objective discrete particle swarm optimisation algorithm for integrated assembly sequence planning and assembly line balancing

In assembly optimisation, assembly sequence planning and assembly line balancing have been extensively studied because both activities are directly linked with assembly efficiency that influences the final assembly costs. Both activities are categorised as NP-hard and usually performed separately. Assembly sequence planning and assembly line balancing optimisation presents a good opportunity to be integrated, considering the benefits such as larger search space that leads to better solution quality, reduces error rate in planning and speeds up time-to-market for a product. In order to optimise an integrated assembly sequence planning and assembly line balancing, this work proposes a multi-objective discrete particle swarm optimisation algorithm that used discrete procedures to update its position and velocity in finding Pareto optimal solution. A computational experiment with 51 test problems at different difficulty levels was used to test the multi-objective discrete particle swarm optimisation performance compared with the existing algorithms. A statistical test of the algorithm performance indicates that the proposed multi-objective discrete particle swarm optimisation algorithm presents significant improvement in terms of the quality of the solution set towards the Pareto optimal set