A new evolutionary optimization algorithm with hybrid guidance mechanism for truck-multi drone delivery system

旅行商问题 计算机科学 局部搜索(优化) 数学优化 无人机 选择(遗传算法) 进化算法 过程(计算) 贪婪算法 车辆路径问题 布线(电子设计自动化) 算法 人工智能 数学 生物 操作系统 遗传学 计算机网络
作者
Cemal Yılmaz,Enes Cengiz,Hamdi Tolga Kahraman
出处
期刊:Expert Systems With Applications [Elsevier BV]
卷期号:245: 123115-123115 被引量:21
标识
DOI:10.1016/j.eswa.2023.123115
摘要

Synchronization of the Traveling Salesman Problem with Drone (TSP-D) is one of the most complex NP-hard combinatorial routing problems in the literature. The speeds, capacities and optimization constraints of the truck-drone pair are different from each other. These differences lead to the search space of TSP-D having a high geometric complexity and a large number of local solution traps. Being able to avoid local solution traps in the search space of TSP-D and accurately converge to the global optimal solution is the main challenge for evolutionary search algorithms. The way to overcome this challenge is to dynamically adapt exploitation and exploration behaviors during the search process and maintain these two in a balanced manner depending on the geometric structure of TSP-D's search space. To overcome this challenge, research consisting of three steps was conducted in this article: (i) three different guide selection methods, namely greedy, random and FDB-score based, were used to provide exploitation, exploration and balanced search capabilities, (ii) by hybridizing these three methods at different rates, guide selection strategies with different search capabilities were developed, (iii) by associating these hybrid guide selection strategies with different stages of the search process, the guidance mechanism was given a dynamic behavioral ability. Thus, the Fitness-Distance Balance-based evolutionary search algorithm (FDB-EA) was designed to achieve a sustainable exploitation-exploration balance in the search space of TSP-D and stably avoid local solution traps. To test the performance of the FDB-EA, the number of delivery points was set to 30, 50, 60, 80, and 100 and compared with twenty-seven powerful and current competing algorithms. According to the non-parametric Wilcoxon pairwise comparison results, FDB-EA outperformed all competing algorithms in all five different TSP-D problems. According to the results obtained from the stability analysis, the success rates and calculation times of FDB-EA, EA and AGDE algorithms were 88.00% (6308.79 sec), 58.40% (7377.43 sec) and 13.460% (34664.19 sec) respectively.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
deemo发布了新的文献求助20
1秒前
陈_完成签到,获得积分10
3秒前
snow完成签到 ,获得积分10
3秒前
5秒前
11完成签到 ,获得积分10
6秒前
7秒前
咯噔完成签到,获得积分10
7秒前
麦芽完成签到,获得积分10
8秒前
lzd发布了新的文献求助10
8秒前
11完成签到,获得积分10
8秒前
守望完成签到,获得积分10
9秒前
stubborn_cat完成签到 ,获得积分10
10秒前
李孟林完成签到,获得积分10
12秒前
看日落去发布了新的文献求助10
13秒前
行者完成签到,获得积分10
14秒前
莎莎完成签到 ,获得积分10
14秒前
15秒前
海蓝云天应助zhuling采纳,获得10
17秒前
17秒前
Syea完成签到 ,获得积分10
19秒前
李孟林发布了新的文献求助10
20秒前
weiwei完成签到,获得积分10
21秒前
21秒前
22秒前
科研小白完成签到,获得积分10
22秒前
江南即梦完成签到 ,获得积分20
23秒前
24秒前
香蕉觅云应助科研通管家采纳,获得10
24秒前
24秒前
24秒前
24秒前
24秒前
25秒前
25秒前
幽默的雪冥完成签到,获得积分10
25秒前
26秒前
wanci应助jbq采纳,获得10
26秒前
blue完成签到,获得积分10
26秒前
quan完成签到,获得积分10
28秒前
30秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
PowerCascade: A Synthetic Dataset for Cascading Failure Analysis in Power Systems 2000
Picture this! Including first nations fiction picture books in school library collections 1500
Signals, Systems, and Signal Processing 610
Unlocking Chemical Thinking: Reimagining Chemistry Teaching and Learning 555
Photodetectors: From Ultraviolet to Infrared 500
Cancer Targets: Novel Therapies and Emerging Research Directions (Part 1) 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6359486
求助须知:如何正确求助?哪些是违规求助? 8173484
关于积分的说明 17214544
捐赠科研通 5414555
什么是DOI,文献DOI怎么找? 2865497
邀请新用户注册赠送积分活动 1842839
关于科研通互助平台的介绍 1691052