Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain

QI Yuan-hang; CAI Yan-guang; CAI Hao; YANG Liang; YAO Yeboah

doi:10.3969/j.issn.0372-2112.2019.07.006

您当前的位置：

首页 >

文章列表页 >

Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain

更新时间：2025-07-16

- Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain
- Acta Electronica Sinica Vol. 47, Issue 7, Pages: 1434-1442(2019)
- 作者机构：
  
  1. 电子科技大学中山学院计算机学院,广东,中山,528402
  2. 广东工业大学自动化学院,广东,广州,510006
  3. 奥尔堡大学健康科学与工程系, 丹麦奥尔堡,9220
  4. 电子科技大学中山学院计算机学院,广东,中山,528402
  5. 广东工业大学自动化学院,广东,广州,510006
  6. 奥尔堡大学健康科学与工程系丹麦奥尔堡,9220
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2019.07.006
  CLC： TP301
- Published Online：25 July 2019，
  
  Published：2019
- 稿件说明：
移动端阅览
QI Yuan-hang, CAI Yan-guang, CAI Hao, et al. Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain[J]. Acta Electronica Sinica, 2019, 47(7): 1434-1442.
DOI：

QI Yuan-hang, CAI Yan-guang, CAI Hao, et al. Two-Level Bat Algorithm with Variable Neighborhood Search for Capacitated Vehicle Routing Problem in Supply Chain[J]. Acta Electronica Sinica, 2019, 47(7): 1434-1442. DOI： 10.3969/j.issn.0372-2112.2019.07.006.

摘要

本文考虑了多个供应商、多个制造商和多个零售商的三级供应链物流运输调度，以最大限度地降低采购、加工和运输成本为目标，提出了带容量约束的供应链物流运输调度模型（Capacitated Vehicle Routing Problem in Supply Chain，CVRPSC）.进一步地，本文构造了求解CVRPSC的双层变邻域蝙蝠算法（Two-Level Bat Algorithm with Variable Neighborhood Search，TLBAVNS）.该算法提出了一种双层蝙蝠位置的定义，引入了相应的蝙蝠算法的更新操作，采用变邻域局部搜索策略加强算法的寻优能力.实验证明：TLBAVNS能在合理的时间内求解CVRPSC；在大部分测试算例中，该算法相对于对比算法均表现出了更强的寻优能力和稳定性.

Abstract

Considering a two-level vehicle routing problem in a three-echelon supply chain with multiple suppliers

multiple manufacturers and multiple stockists

with the aim of minimizing the cost of purchasing

production and transportation

this paper proposes a model for the capacitated vehicle routing problem in supply chain (CVRPSC). Further

a two-level bat algorithm with variable neighborhood search (TLBAVNS) is presented to solve CVRPSC. The algorithm proposes a definition of two-level bat position and introduces the corresponding operations of the bat algorithm. In addition

a variable neighborhood local search is proposed to enhance the optimizing capability of TLBAVNS. The experiments have shown that TLBAVNS can effectively solve the instances of CVRPSC within a suitable amount of time and significantly outperforms all the other alternatives in most of the cases.

关键词

Keywords

references

Views

239

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Artificial Bee Colony Algorithm Based on Multiple Information Guidance

A Data Analysis Method for RFID Supply Chain Based on Time Series

A Supply Chain Modeling Technology Based on RFID Discovery Service

Chaotic Hybrid Discrete Bat Algorithm for Traveling Salesman Problem

Related Author

GUO Jing-lei

WU Yan-lin

LIU Ying

ZHOU Xin-yu

FONT

WANG Li-fu

ZHANG Shi-kun

YE Wei

Related Institution

School of Computer Science， Central China Normal University

School of Computer and Communication Engineering， Changsha University of Science and Technology

School of Computer and Information Engineering， Jiangxi Normal University

[JZ]3.北京大学信息科学技术学院软件研究所高可信软件技术教育部重点实验室

北京大学软件工程国家工程研究中心

⁰