Hybrid Imperialist Competitive Algorithm for Solving Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery

TANG Jie-kai; HU Rong; QIAN Bin; JIN Huai-ping; XIANG Feng-hong

doi:10.12263/DZXB.20210320

您当前的位置：

首页 >

文章列表页 >

Hybrid Imperialist Competitive Algorithm for Solving Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery

PAPERS | 更新时间：2025-12-08

- Hybrid Imperialist Competitive Algorithm for Solving Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery
- ACTA ELECTRONICA SINICA Vol. 50, Issue 7, Pages: 1621-1630(2022)
- 作者机构：
  
  1.昆明理工大学信息工程与自动化学院，云南昆明 650500
  2.昆明理工大学云南省人工智能重点实验室，云南昆明 650500
- 作者简介：
- 基金信息：
- DOI：10.12263/DZXB.20210320
  CLC： TP273;
- Received：07 March 2021，
  
  Revised：2021-07-20，
  
  Published：25 July 2022
- 稿件说明：
移动端阅览
唐捷凯,胡蓉,钱斌等.混合帝国竞争算法求解带多行程批量配送的多工厂集成调度问题[J].电子学报,2022,50(07):1621-1630.

TANG Jie-kai,HU Rong,QIAN Bin,et al.Hybrid Imperialist Competitive Algorithm for Solving Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery[J].ACTA ELECTRONICA SINICA,2022,50(07):1621-1630.
唐捷凯,胡蓉,钱斌等.混合帝国竞争算法求解带多行程批量配送的多工厂集成调度问题[J].电子学报,2022,50(07):1621-1630. DOI： 10.12263/DZXB.20210320.

TANG Jie-kai,HU Rong,QIAN Bin,et al.Hybrid Imperialist Competitive Algorithm for Solving Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery[J].ACTA ELECTRONICA SINICA,2022,50(07):1621-1630. DOI： 10.12263/DZXB.20210320.

摘要

针对供应链中一类广泛存在的带多行程批量配送的多工厂集成调度问题（Multi-Factory Integrated Scheduling Problem with Multi-Trip Batch Delivery，MFISP_MTBD），建立其数学模型并提出基于贝叶斯统计推断的混合帝国竞争算法（Hybrid Bayesian statistical inference-based Imperialist Competitive Algorithm，HBICA）进行求解.根据MFISP_MTBD问题特性，结合多行程标签机制设计新型编解码策略，并基于该策略构造新型启发式规则以提高初始解的质量.为有效保留优质解的模式信息，采用贝叶斯概率模型学习机制替换标准帝国竞争算法中的同化机制.为更加明确地引导搜索方向，算法每代均利用各帝国中的精英国家（即精英解或个体）重构贝叶斯概率模型，进而对其采样生成新种群.利用9种有效邻域操作动态构造各帝国中每个国家的局部搜索，并对由各帝国内部相邻国家间竞争所确定的强势国家（即获胜国）执行其局部搜索，进而对各帝国中的殖民国家（即该帝国内的最强国家）依次执行所有弱势国家的局部搜索.仿真实验和算法比较验证了所提算法可有效求解MFISP_MTBD.

Abstract

Aiming at a kind of widely existing multi-factory integrated scheduling problem with multi-trip batch delivery(MFISP_MTBD) in the supply chain

this paper establishes the mathematical model

and a hybrid Bayesian statistical inference-based imperialist competitive algorithm(HBICA) is proposed to solve it. According to the characteristics of the MFISP_MTBD

a new encoding and decoding strategy based on multi-trip labeling mechanism is proposed

on this basis

a new heuristic rule is constructed to improve the quality of the initial solution. To effectively preserve the pattern information of the high-quality solution

the Bayesian probability model learning mechanism is used to replace the assimilation mechanism in the imperial competition algorithm. Afterwards

each generation of the algorithm reconstructs the Bayesian probability model by using the elite countries(i.e. elite solution or individual) in each empire to guide the search direction explicitly

and new population is generated by sampling it. The local search for each country in each empire is dynamically constructed by 9 effective neighborhood operations. Local search is carried out on the strong country(i.e. the winning country) determined by the competition among neighboring countries within the empire

and local search of weak countries is carried out in turn for the colonial countries in each empire(i.e. the strongest countries in the empire). Simulation experiments and comparisons on different instances demonstrate that the proposed algorithm can effectively solve MFISP_MTBD.

关键词

Keywords

references

GHARAEI A , JOLAI F . A multi-agent approach to the integrated production scheduling and distribution problem in multi-factory supply chain [J]. Applied Soft Computing , 2018 , 65 : 577 - 589 .

MOONS S , RAMAEKERS K , CARIS A , et al . Integrating production scheduling and vehicle routing decisions at the operational decision level: A review and discussion [J]. Computers & Industrial Engineering , 2017 , 104 : 224 - 245 .

ZHEN L , MA C L , WANG K , et al . Multi-depot multi-trip vehicle routing problem with time windows and release dates [J]. Transportation Research Part E: Logistics and Transportation Review , 2020 , 135 : 101866 .

WANG Y , LEI L F , ZHANG D X , et al . Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels [J]. Transportation Research Part B: Methodological , 2020 , 139 : 38 - 63 .

WASSAN N , WASSAN N , NAGY G , et al . The multiple trip vehicle routing problem with backhauls: Formulation and a two-level variable neighbourhood search [J]. Computers & Operations Research , 2017 , 78 : 454 - 467 .

LEE J , KIM B I , JOHNSON A L , et al . The nuclear medicine production and delivery problem [J]. European Journal of Operational Research , 2014 , 236 ( 2 ): 461 - 472 .

WANG J , YAO S , SHENG J C , et al . Minimizing total carbon emissions in an integrated machine scheduling and vehicle routing problem [J]. Journal of Cleaner Production , 2019 , 229 : 1004 - 1017 .

GANJI M , KAZEMIPOOR H , HADJI MOLANA S M , et al . A green multi-objective integrated scheduling of production and distribution with heterogeneous fleet vehicle routing and time windows [J]. Journal of Cleaner Production , 2020 , 259 : 120824 .

ABDOLLAHZADEH V , NAKHAIKAMALABADI I , HAJIMOLANA S M , et al . A multifactory integrated production and distribution scheduling problem with parallel machines and immediate shipments solved by improved whale optimization algorithm [J]. Complexity , 2018 , 2018 : 5120640 .

詹文法 , 邵志伟 . 一种集成电路测试流程分级动态调整方法 [J]. 电子学报 , 2020 , 48 ( 8 ): 1623 - 1630 .

ZHAN W F , SHAO Z W . Hierarchical dynamic adjustment method for integrated circuit testing process [J]. Acta Electronica Sinica , 2020 , 48 ( 8 ): 1623 - 1630 . (in Chinese)

何小娟 , 曾建潮 . 基于Bayesian统计推理的分布估计算法求解柔性作业车间调度问题 [J]. 系统工程理论与实践 , 2012 , 32 ( 2 ): 380 - 388 .

HE X J , ZENG J C . Solving flexible job-shop scheduling problems with Bayesian statistical inference-based estimation of distribution algorithm [J]. Systems Engineering-Theory & Practice , 2012 , 32 ( 2 ): 380 - 388 . (in Chinese)

姚友杰 , 钱斌 , 董钰明 , 等 . 基于EDA的绿色零等待作业车间调度问题求解 [J]. 电子学报 , 2021 , 49 ( 2 ): 225 - 232 .

YAO Y J , QIAN B , DONG Y M , et al . EDA-based for the green no-wait job shop scheduling problem [J]. Acta Electronica Sinica , 2021 , 49 ( 2 ): 225 - 232 . (in Chinese)

CHEN S F , QIAN B , LIU B , et al . Bayesian Statistical Inference-Based Estimation of Distribution Algorithm for the re-Entrant Job-Shop Scheduling Problem with Sequence-Dependent Setup Times [M]// Intelligent Computing Methodologies . Cham : Springer International Publishing , 2014 : 686 - 696 .

杨晓林 , 胡蓉 , 钱斌 , 等 . 增强分布估计算法求解低碳分布式流水线调度 [J]. 控制理论与应用 , 2019 , 36 ( 5 ): 803 - 815 .

YANG X L , HU R , QIAN B , et al . Enhanced estimation of distribution algorithm for low carbon scheduling of distributed flow shop problem [J]. Control Theory & Applications , 2019 , 36 ( 5 ): 803 - 815 . (in Chinese)

PÉREZ-RODRÍGUEZ R , HERNÁNDEZ-AGUIRRE A . Simulation optimization for the vehicle routing problem with time windows using a Bayesian network as a probability model [J]. The International Journal of Advanced Manufacturing Technology , 2016 , 85 ( 9/10/11/12 ): 2505 - 2523 .

李明 , 雷德明 . 基于新型帝国竞争算法的高维多目标柔性作业车间调度 [J]. 控制理论与应用 , 2019 , 36 ( 6 ): 893 - 901 .

LI M , LEI D M . Novel imperialist competitive algorithm for many-objective flexible job shop scheduling [J]. Control Theory & Applications , 2019 , 36 ( 6 ): 893 - 901 . (in Chinese)

LEI D M , LI M , WANG L . A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold [J]. IEEE Transactions on Cybernetics , 2019 , 49 ( 3 ): 1097 - 1109 .

ARDALAN Z , KARIMI S , POURSABZI O , et al . A novel imperialist competitive algorithm for generalized traveling salesman problems [J]. Applied Soft Computing , 2015 , 26 : 546 - 555 .

HOSSEINI S , KHALED A AL . A survey on the imperialist competitive algorithm metaheuristic: Implementation in engineering domain and directions for future research [J]. Applied Soft Computing , 2014 , 24 : 1078 - 1094 .

MARANDI F , FATEMI GHOMI S M T . Integrated multi-factory production and distribution scheduling applying vehicle routing approach [J]. International Journal of Production Research , 2019 , 57 ( 3 ): 722 - 748 .

裴小兵 , 于秀燕 , 王尚磊 . 混合帝国竞争算法求解旅行商问题 [J]. 浙江大学学报(工学版) , 2019 , 53 ( 10 ): 2003 - 2012 .

PEI X B , YU X Y , WANG S L . Solution of traveling salesman problem by hybrid imperialist competitive algorithm [J]. Journal of Zhejiang University(Engineering Science) , 2019 , 53 ( 10 ): 2003 - 2012 . (in Chinese)

QIAN B , WANG L , HUANG D X , et al . An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers [J]. Computers & Operations Research , 2009 , 36 ( 1 ): 209 - 233 .

MONTGOMERY D C . Design and Analysis of Experiments [M]. Hoboken : John Wiley and Sons , 2005 .

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Hybrid Three-Dimensional Estimation of Distribution Algorithm for Integrated Scheduling Problem of Distributed Production Assembly and Vehicle Delivery

Hyper-Heuristic Three-Dimensional Estimation of Distribution Algorithm for Solving Distributed Permutation Flow-Shop and Vehicle Transportation Integrated Scheduling Problem

Related Author

YANG Shao-wen

QIAN Bin

HU Rong

ZHANG Zi-qi

ZHOU Feng-shun

HU Rong

QIAN Bin

ZHANG Chang-sheng

Related Institution

Faculty of Information Engineering and Automation， Kunming University of Science and Technology

Yunnan Key Laboratory of Artificial Intelligence

School of Information Engineering and Automation, Kunming University of Science and Technology

Yunnan Key Laboratory of Artificial Intelligence, Kunming University of Science and Technology

Yunnan Key Laboratory of Artificial Intelligence， Kunming University of Science and Technology

⁰