Application Research for Multiobjective Low-Carbon Flexible Job-Shop Scheduling Problem Based on Hybrid Artificial Bee Colony Algorithm

نویسندگان

چکیده

This paper proposes a hybrid artificial bee colony (HABC) to solve the multiobjective low-carbon flexible job-shop scheduling problem (MLFJSP). HABC algorithm uses two-layer coding method establish initial population as nectar source for employed bees. In optimization process, phase and onlooker adopt improved crossover mutation strategies adaptive neighborhood search generate new sources, greedy is used retain better solutions. The scout update mechanism prevents from falling into local optimum enhances convergence of algorithm. order prevent loss optimal solution, results each are saved in Pareto archive (PA). Finally, two sets international standard instances carry out simulation experiments. After analyzing results, it concluded that an effective job shop problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Artificial Immune Algorithm for Flexible Job Shop Scheduling Problem

Flexible Job shop scheduling is very important in production management and combinatorial optimization. It is NP-hard problem and consists of two sub-problems: sequencing and assignment. Multiobjective Flexible Job-Shop Scheduling Problems (MFJSSP) is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. ...

متن کامل

A Hybrid Artificial Bee Colony Algorithm for Flexible Job Shop Scheduling Problems

In this paper, we propose a hybrid Pareto-based artificial bee colony (HABC) algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each food sources is represented by two vectors, i.e., the machine assignment vector and the operation scheduling vector. The artificial bee is divided into three groups, namely, employed bees, onlookers, and scouts...

متن کامل

Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems

This paper presents a hybrid Pareto-based discrete artificial bee colony algorithm for solving the multi-objective flexible job shop scheduling problem. In the hybrid algorithm, each solution corresponds to a food source, which composes of two components, i.e., the routing component and the scheduling component. Each component is filled with discrete values. A crossover operator is developed fo...

متن کامل

A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion

This study addresses the scheduling problem in remanufacturing engineering. The purpose of this paper is to model effectively to solve remanufacturing scheduling problem. The problem is modeled as flexible job-shop scheduling problem (FJSP) and is divided into two stages: scheduling and re-scheduling when new job arrives. The uncertainty in timing of returns in remanufacturing is modeled as new...

متن کامل

An Artificial Bee Colony Algorithm for the Job Shop Scheduling Problem with Random Processing Times

Due to the influence of unpredictable random events, the processing time of each operation should be treated as random variables if we aim at a robust production schedule. However, compared with the extensive research on the deterministic model, the stochastic job shop scheduling problem (SJSSP) has not received sufficient attention. In this paper, we propose an artificial bee colony (ABC) algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3117270