Optimization of Route Bundling via Differential Evolution with a Convex Representation
Optimization of Route Bundling via Differential Evolution with a Convex Representation
复制标题
通过凸表示的差分进化优化路由捆绑
DOI：
10.1109/rcar.2017.8311950
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Tomoyuki Miyashita
中科院分区：
文献类型：
--
作者：
Victor Parque;Satoshi Miura;Tomoyuki Miyashita
路由捆绑意味着以中间位置的锚点最小化全局距离度量的方式复合多条路由。路线捆绑的结果是一个树状结构，其中树根（锚点）作为协调点，用于信息、货物和人员的联合运输。在资源和交通工具稀缺/昂贵或环境由于空间有限而固有地难以导航的许多路径规划场景中，路线捆绑是相关的概念构造。在本文中，我们提出了一种基于自适应类的差分进化算法，使用凸表示搜索最优路由束的方法。在有和没有凸障碍物的情况下的计算实验表明，我们的方法的可行性和效率。
Route bundling implies compounding multiple routes in a way that anchoring points at intermediate locations minimize a global distance metric. The result of route bundling is a tree-like structure where the roots of the tree (anchoring points) serve as coordinating locus for the joint transport of information, goods, and people. Route bundling is a relevant conceptual construct in a number of path planning scenarios where the resources and means of transport are scarce/expensive, or where the environments are inherently hard to navigate due to limited space. In this paper we propose a method for searching optimal route bundles based on a self-adaptive class of differential evolution using a convex representation. Computational experiments in scenarios with and without convex obstacles show the feasibility and efficiency of our approach.