A Multi-Objective and Multi-Dimensional Optimization Scheduling Method Using a Hybrid Evolutionary Algorithms with a Sectional Encoding Mode

• Main Authors: Wenxiang Xu, Shunsheng Guo
• Format: Article
• Language: English
• Published: MDPI AG 2019-03-01
• Series: Sustainability
• Subjects: green scheduling; automated guided vehicle; flexible manufacturing system; multi-objective and multi-dimensional; energy consumption; genetic algorithm; discrete particle swarm optimization
• Online Access: http://www.mdpi.com/2071-1050/11/5/1329

Aimed at the problem of the green scheduling problem with automated guided vehicles (AGVs) in flexible manufacturing systems (FMS), the multi-objective and multi-dimensional optimal scheduling process is defined while considering energy consumption and multi-function of machines. The process is a complex and combinational process, considering this characteristic, a mathematical model was developed and integrated with evolutionary algorithms (EAs), which includes a sectional encoding genetic algorithm (SE-GA), sectional encoding discrete particle swarm optimization (SE-DPSO) and hybrid sectional encoding genetic algorithm and discrete particle swarm optimization (H-SE-GA-DPSO). In the model, the encoding of the algorithms was divided into three segments for different optimization dimensions with the objective of minimizing the makespan and energy consumption of machines and the number of AGVs. The sectional encoding described the sequence of operations of related jobs, the matching relation between transfer tasks and AGVs (AGV-task), and the matching relation between operations and machines (operation-machine) respectively for multi-dimensional optimization scheduling. The effectiveness of the proposed three EAs was verified by a typical experiment. Besides, in the experiment, a comparison among SE-GA, SE-DPSO, H-SE-GA-DPSO, hybrid genetic algorithm and particle swarm optimization (H-GA-PSO) and a tabu search algorithm (TSA) was performed. In H-GA-PSO and TSA, the former just takes the sequence of operations into account, and the latter takes both the sequence of operations and the AGV-task into account. According to the result of the comparison, the superiority of H-SE-GA-DPSO over the other algorithms was proved.