• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于容量车辆路径问题的离散野马优化器。

A discrete wild horse optimizer for capacitated vehicle routing problem.

作者信息

Fang Chuncheng, Cai Yanguang, Wu Yanlin

机构信息

School of Automation, Guangdong University of Technology, Guangzhou, 510006, China.

Department of Mechanical and Electrical Engineering, Jieyang Polytechnic, Jieyang, 522051, China.

出版信息

Sci Rep. 2024 Sep 11;14(1):21277. doi: 10.1038/s41598-024-72242-0.

DOI:10.1038/s41598-024-72242-0
PMID:39261633
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11390905/
Abstract

The wild horse optimizer (WHO) is a novel metaheuristic algorithm, which has been successfully applied to solving continuous engineering problems. Considering the characteristics of the wild horse optimizer, a discrete version of the algorithm, named discrete wild horse optimizer (DWHO), is proposed to solve the capacitated vehicle routing problem (CVRP). By incorporating three local search strategies-swap operation, reverse operation, and insertion operation-along with the introduction of the largest-order-value (LOV) decoding technique, the precision and quality of the solutions have been enhanced. Experimental results conducted on 44 benchmark instances indicate that, in most test cases, the solving capability of discrete wild horse optimizer surpasses that of basic wild horse optimizer (BWHO), hybrid firefly algorithm, dynamic space reduction ant colony optimization (DSRACO), and discrete artificial ecosystem-based optimization (DAEO). The discrete wild horse optimizer provides a novel approach for solving the capacitated vehicle routing problem and also offers a new perspective for addressing other discrete problems.

摘要

野马优化器(WHO)是一种新颖的元启发式算法,已成功应用于解决连续工程问题。考虑到野马优化器的特点,提出了一种离散版本的算法,即离散野马优化器(DWHO),用于解决容量车辆路径问题(CVRP)。通过结合三种局部搜索策略——交换操作、反向操作和插入操作——并引入最大订单值(LOV)解码技术,提高了求解的精度和质量。在44个基准实例上进行的实验结果表明,在大多数测试案例中,离散野马优化器的求解能力超过了基本野马优化器(BWHO)、混合萤火虫算法、动态空间缩减蚁群优化(DSRACO)和基于离散人工生态系统的优化(DAEO)。离散野马优化器为解决容量车辆路径问题提供了一种新颖的方法,也为解决其他离散问题提供了新的视角。

相似文献

1
A discrete wild horse optimizer for capacitated vehicle routing problem.一种用于容量车辆路径问题的离散野马优化器。
Sci Rep. 2024 Sep 11;14(1):21277. doi: 10.1038/s41598-024-72242-0.
2
A modified coronavirus herd immunity optimizer for capacitated vehicle routing problem.一种用于容量受限车辆路径问题的改进型冠状病毒群体免疫优化器。
J King Saud Univ Comput Inf Sci. 2022 Sep;34(8):4782-4795. doi: 10.1016/j.jksuci.2021.06.013. Epub 2021 Jun 24.
3
Hybrid modified ant system with sweep algorithm and path relinking for the capacitated vehicle routing problem.结合扫描算法和路径重连的混合改进蚁群系统求解容量受限车辆路径问题
Heliyon. 2021 Sep 21;7(9):e08029. doi: 10.1016/j.heliyon.2021.e08029. eCollection 2021 Sep.
4
A Grey Wolf Optimizer Algorithm for Multi-Objective Cumulative Capacitated Vehicle Routing Problem Considering Operation Time.一种考虑运营时间的多目标累积容量车辆路径问题的灰狼优化算法
Biomimetics (Basel). 2024 May 30;9(6):331. doi: 10.3390/biomimetics9060331.
5
A Hybrid Ant Colony Optimization Algorithm for the Extended Capacitated Arc Routing Problem.一种用于扩展容量弧路由问题的混合蚁群优化算法
IEEE Trans Syst Man Cybern B Cybern. 2011 Aug;41(4):1110-23. doi: 10.1109/TSMCB.2011.2107899. Epub 2011 Feb 14.
6
Improved slime mould algorithm based on hybrid strategy optimization of Cauchy mutation and simulated annealing.基于柯西变异和模拟退火混合策略优化的改进粘菌算法。
PLoS One. 2023 Jan 25;18(1):e0280512. doi: 10.1371/journal.pone.0280512. eCollection 2023.
7
A Bilevel Ant Colony Optimization Algorithm for Capacitated Electric Vehicle Routing Problem.一种用于带容量限制的电动车辆路径规划问题的双层蚁群优化算法。
IEEE Trans Cybern. 2022 Oct;52(10):10855-10868. doi: 10.1109/TCYB.2021.3069942. Epub 2022 Sep 19.
8
A Novel Approach to Combinatorial Problems: Binary Growth Optimizer Algorithm.一种解决组合问题的新方法:二进制增长优化器算法。
Biomimetics (Basel). 2024 May 9;9(5):283. doi: 10.3390/biomimetics9050283.
9
Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem.显式进化多任务在组合优化中的应用:以带能力约束的车辆路径问题为例。
IEEE Trans Cybern. 2021 Jun;51(6):3143-3156. doi: 10.1109/TCYB.2019.2962865. Epub 2021 May 18.
10
Dynamic vehicle routing with time windows in theory and practice.带时间窗的动态车辆路径规划:理论与实践
Nat Comput. 2017;16(1):119-134. doi: 10.1007/s11047-016-9550-9. Epub 2016 Apr 9.

引用本文的文献

1
The Two-Echelon Unmanned Ground Vehicle Routing Problem: Extreme-Weather Goods Distribution as a Case Study.两级无人地面车辆路径规划问题:以极端天气下的货物配送为例
Biomimetics (Basel). 2025 Apr 22;10(5):255. doi: 10.3390/biomimetics10050255.

本文引用的文献

1
A modified particle swarm optimization algorithm for a vehicle scheduling problem with soft time windows.一种用于带软时间窗车辆调度问题的改进粒子群优化算法。
Sci Rep. 2023 Oct 26;13(1):18351. doi: 10.1038/s41598-023-45543-z.
2
A solution for the rational dispatching of concrete transport vehicles.一种混凝土运输车辆合理调度的解决方案。
Sci Rep. 2022 Oct 6;12(1):16770. doi: 10.1038/s41598-022-21011-y.
3
Improving energy consumption prediction for residential buildings using Modified Wild Horse Optimization with Deep Learning model.
使用改进的野马优化算法与深度学习模型提高住宅建筑能耗预测。
Chemosphere. 2022 Dec;308(Pt 1):136277. doi: 10.1016/j.chemosphere.2022.136277. Epub 2022 Sep 1.