MLDP的复杂性
Complexity of MLDP
摘要：
我们进行了显式检查的NP-硬度的双目标优化问题，以尽量减少距离和延迟的单车辆路线设计，以服务于一组客户端请求。除了是一个哈密尔顿循环的路线是最小化车辆的行驶距离以及总的等待时间的客户端沿着路线。
英文摘要：
We carry out an explicit examination of the NP-hardness of a bi- objective optimization problem to minimize distance and latency of a single-vehicle route designed to serve a set of client requests. In addition to being a Hamiltonian cycle the route is to minimize the traveled distance of the vehicle as well as the total waiting time of the clients along the route.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
