arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.10253cs.AI
收藏

利用几何信息的航迹规划约束规划算法

Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information

Department of Engineering University of Ferrara(费拉拉大学工程系)

Alessandro Bertagnon

摘要:

影响人员或货物运输的问题在工商业中比比皆是,而且似乎也是更为复杂的问题的根源。近年来,物流和运输部门在技术进步的支持下不断增长,即公司为了提高竞争力,正在采用旨在提高效率和效益的创新技术。这就是为什么企业越来越多地使用人工智能(AI)、区块链和物联网(IoT)等技术。特别地,人工智能通常用于解决优化问题,以便为用户提供利用可用资源的最有效方式。在这项工作中,我们提出了一个概述,我们目前的研究活动有关的新算法的发展,CLP技术的基础上,利用几何信息本质上存在于其中的许多或在他们的一些变种的路线规划问题。到目前为止,研究主要集中在欧几里德旅行商问题(欧几里德TSP),目的是利用所获得的结果,也对同类的其他问题,如欧几里德车辆路径问题(欧几里德VRP),在未来。

英文摘要:

Problems affecting the transport of people or goods are plentiful in industry and commerce and they also appear to be at the origin of much more complex problems. In recent years, the logistics and transport sector keeps growing supported by technological progress, i.e. companies to be competitive are resorting to innovative technologies aimed at efficiency and effectiveness. This is why companies are increasingly using technologies such as Artificial Intelligence (AI), Blockchain and Internet of Things (IoT). Artificial intelligence, in particular, is often used to solve optimization problems in order to provide users with the most efficient ways to exploit available resources. In this work we present an overview of our current research activities concerning the development of new algorithms, based on CLP techniques, for route planning problems exploiting the geometric information intrinsically present in many of them or in some of their variants. The research so far has focused in particular on the Euclidean Traveling Salesperson Problem (Euclidean TSP) with the aim to exploit the results obtained also to other problems of the same category, such as the Euclidean Vehicle Routing Problem (Euclidean VRP), in the future.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑