Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times

The official published version of the article can be found at the link below.A two-machine flowshop scheduling problem is addressed to minimize setups and makespan where each job is characterized by a pair of attributes that entail setups on each machine. The setup times are sequence-dependent on both machines. It is shown that these objectives conflict, so the Pareto optimization approach is considered. The scheduling problems considering either of these objectives are NP-hard , so exact optimization techniques are impractical for large-sized problems. We propose two multi-objective metaheurisctics based on genetic algorithms (MOGA) and simulated annealing (MOSA) to find approximations of Pareto-optimal sets. The performances of these approaches are compared with lower bounds for small problems. In larger problems, performance of the proposed algorithms are compared with each other. Experimentations revealed that both algorithms perform very similar on small problems. Moreover, it was observed that MOGA outperforms MOSA in terms of the quality of solutions on larger problems.Partial Funding from EPSRC under grant EP/D050863/1

Developing an Agent Based Heuristic Optimisation System for Complex Flow Shops with Customer-Imposed Production Disruptions

The study of complex manufacturing flow-shops has seen a number of approaches and frameworks proposed to tackle various production-associated problems. However, unpredictable disruptions, such as change in sequence of order, order cancellation and change in production delivery due time, imposed by customers on flow-shops that impact production processes and inventory control call for a more adaptive approach capable of responding to these changes. In this research work, a new adaptive framework and agent-based heuristic optimization system was developed to investigate the disruption consequences and recovery strategy. A case study using an Original Equipment Manufacturer (OEM) production process of automotive parts and components was adopted to justify the proposed system. The results of the experiment revealed significant improvement in terms of total number of late orders, order delivery time, number of setups and resources utilization, which provide useful information for manufacturer’s decision-making policies.

Enhancing Facility Layout via Ant Colony Technique (Act)

Cellular manufacturing systems optimization is investigated and manipulated using artificial intelligent (AI) approach combining facility layout and group technology scope. This research applied the ANT COLONY technique  (ACT) optimization where this process was inspired by the real ants and how they move and build colonies by avoiding obstacle and simulate the process to get a procedure that can be adopted on this optimization process. In this research the problem goes in two way first the theory that take account the positions of machines inside the plant and its equations of controlling and second is the routing of part during product life cycle then execute results and applying it on factory configuration. The application of Ants system was carried out on industrial factory of electrical motor where all data was taken from the factory depending on the position and sequence of operations took place. Results were carried out in a way that depending on the showing site plan configurations for each stage and studying the iteration curve response to the parameters changes while testing the system during different environments. The results show high flexibility in ACS (Ant colony system) with fast response and high reduction in the distance crossed by the product part that reached 500m. The ratio of the reduction is 0.625. Keyword: Artificial intelligent (AI), Ant colony (AC), pheromone, genetic algorithm, facility layout, cell manufacturing (CM)

The Application of Ant Colony Optimization

The application of advanced analytics in science and technology is rapidly expanding, and developing optimization technics is critical to this expansion. Instead of relying on dated procedures, researchers can reap greater rewards by utilizing cutting-edge optimization techniques like population-based metaheuristic models, which can quickly generate a solution with acceptable quality. Ant Colony Optimization (ACO) is one the most critical and widely used models among heuristics and meta-heuristics. This book discusses ACO applications in Hybrid Electric Vehicles (HEVs), multi-robot systems, wireless multi-hop networks, and preventive, predictive maintenance

Research Directions in Information Systems for Humanitarian Logistics

This article systematically reviews the literature on using IT (Information Technology) in humanitarian logistics focusing on disaster relief operations. We first discuss problems in humanitarian relief logistics. We then identify the stage and disaster type for each article as well as the article’s research methodology and research contribution. Finally, we identify potential future research directions

A review of discrete-time optimization models for tactical production planning

This is an Accepted Manuscript of an article published in International Journal of Production Research on 27 Mar 2014, available online: http://doi.org/10.1080/00207543.2014.899721[EN] This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively; (6) most works perform numerical experiments with random created instances, while a small number of works were validated by real-world data from industrial firms, of which the most popular are sawmills, wood and furniture, automobile and semiconductors and electronic devices.This study has been funded by the Universitat Politècnica de València projects: ‘Material Requirement Planning Fourth Generation (MRPIV)’ (Ref. PAID-05-12) and ‘Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty Conditions. Application of Solution Strategies based on Hybrid Metaheuristics’ (PAID-06-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Peidro Payá, D. (2014). A review of discrete-time optimization models for tactical production planning. International Journal of Production Research. 52(17):5171-5205. doi:10.1080/00207543.2014.899721S51715205521

Ant Colony Optimization

Ant Colony Optimization (ACO) is the best example of how studies aimed at understanding and modeling the behavior of ants and other social insects can provide inspiration for the development of computational algorithms for the solution of difficult mathematical problems. Introduced by Marco Dorigo in his PhD thesis (1992) and initially applied to the travelling salesman problem, the ACO field has experienced a tremendous growth, standing today as an important nature-inspired stochastic metaheuristic for hard optimization problems. This book presents state-of-the-art ACO methods and is divided into two parts: (I) Techniques, which includes parallel implementations, and (II) Applications, where recent contributions of ACO to diverse fields, such as traffic congestion and control, structural optimization, manufacturing, and genomics are presented

A Brief Review of Bio-Inspired Algorithms in Computational Perspective - Bio Inspired Algorithms

Computing over the years has evolved from being simplex mathematical processing machine to more sophisticated problem solving entity pushing limits around reasoning and intelligence. Along the way, lots scientists and engineers have closely observed some of the biological processes achieving certain things in a more efficient and simple fashion than traditional computational mechanisms. This has led to development of various techniques and algorithms which try and mimic these biological processes and are categorised under, Bio-Inspired Computing