Ant Colony Optimization (ACO) is a Swarm Intelligence technique which inspired from the foraging behaviour of real ant colonies. The ants deposit pheromone on the ground in order to mark the route for identification of their routes from the nest to food that should be followed by other members of the colony. This ACO exploits an optimization mechanism for solving discrete optimization problems in various engineering domain. From the early nineties, when the first Ant Colony Optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. Moreover, a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO. This paper review varies recent research and implementation of ACO, and proposed a modified ACO model which is applied for network routing problem and compared with existing traditional routing algorithms.

Review: A survey: Ant Colony Optimization based recent research and implementation on several engineering domain

Traditional job shop scheduling is concentrated on centralized scheduling or semi-distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and distributed manufacturing system supported by novel and emerging manufacturing technologies such as mass customization, Cyber-Physics Systems, Digital Twin, and SMAC (Social, Mobile, Analytics, Cloud). The scheduling research needs to shift its focus to smart distributed scheduling modeling and optimization. In order to transferring traditional scheduling into smart distributed scheduling (SDS), we aim to answer two questions: (1) what traditional scheduling methods and techniques can be combined and reused in SDS and (2) what are new methods and techniques required for SDS. In this paper, we first review existing researches from over 120 papers and answer the first question and then we explore a future research direction in SDS and discuss the new techniques for developing future new JSP scheduling models and constructing a framework on solving the JSP problem under Industry 4.0.

/pdf/review-of-job-shop-scheduling-research-and-its-new-2zwek53yez.pdf

Review of job shop scheduling research and its new perspectives under Industry 4.0

A research survey: review of flexible job shop scheduling techniques

A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities

Flexible job shop scheduling problems &#x0028 FJSP &#x0029 have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence &#x0028 SI &#x0029 and evolutionary algorithms &#x0028 EA &#x0029 are developed, employed and improved for solving them. More than 60&#x0025 of the publications are related to SI and EA. This paper intents to give a comprehensive literature review of SI and EA for solving FJSP. First, the mathematical model of FJSP is presented and the constraints in applications are summarized. Then, the encoding and decoding strategies for connecting the problem and algorithms are reviewed. The strategies for initializing algorithms? population and local search operators for improving convergence performance are summarized. Next, one classical hybrid genetic algorithm &#x0028 GA &#x0029 and one newest imperialist competitive algorithm &#x0028 ICA &#x0029 with variables neighborhood search &#x0028 VNS &#x0029 for solving FJSP are presented. Finally, we summarize, discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions.

A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems

A Knowledge-Based Ant Colony Optimization (KBACO) algorithm is proposed in this paper for the Flexible Job Shop Scheduling Problem (FJSSP). KBACO algorithm provides an effective integration between Ant Colony Optimization (ACO) model and knowledge model. In the KBACO algorithm, knowledge model learns some available knowledge from the optimization of ACO, and then applies the existing knowledge to guide the current heuristic searching. The performance of KBACO was evaluated by a large range of benchmark instances taken from literature and some generated by ourselves. Final experimental results indicate that the proposed KBACO algorithm outperforms some current approaches in the quality of schedules.

/pdf/a-knowledge-based-ant-colony-optimization-for-flexible-job-1n6l55iyg1.pdf

Peng Wang

Papers

A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems