大家好，又见面了，我是你们的朋友全栈君。如果您正在找激活码,请点击查看最新教程,关注关注公众号 “全栈程序员社区” 获取激活教程,可能之前旧版本教程已经失效.最新Idea2022.1教程亲测有效,一键激活。
Jetbrains全系列IDE使用 1年只要46元 售后保障 童叟无欺
Kuo, R. J., Lu, S. H., Lai, P. Y., & Mara, S. T. W. (2022). Vehicle routing problem with drones considering time windows. Expert Systems with Applications, 191, 116264.
Highlights
- Vehicle routing problem with drones and time window constraints is discussed.
- A mixed-integer programming formulation is presented.
- The model is solved with a metaheuristic based on variable neighborhood search.
- Comparison analysis to the benchmark algorithm is performed.
- Managerial insights are derived based on the results.
Sacramento, D., Pisinger, D., & Ropke, S. (2019). An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones. Transportation Research Part C: Emerging Technologies, 102, 289-315.
Highlights
- New optimization problem for delivery activities using drones in collaboration with trucks.
- Fleet of delivery trucks, each of them equipped with a single drone.
- Focus on cost-minimization objective function with maximum duration time for all routes.
- Noteworthy cost-savings with respect to the case of only using trucks.
- Efficient metaheuristic is proposed to solve this problem.
Euchi, J., & Sadok, A. (2021). Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones. Physical Communication, 44, 101236.
Abstract：Energy consumption has become a crucial problem in the design of vehicle routing problems, hence the need to use another delivery method powered by batteries. Unmanned aerial vehicles have become fundamental tools in tasks for which man has limited skills that prevent a superlative optimization of time. The increasing use of drones by commercial companies such as Amazon, Google, and DHL has given birth to a new variant of vehicle routing problem (VRP) called VRP with drones (VRPD) which has a positive influence on the environment. Where vehicles and drones are used to deliver packages or goods to customers. In VRPD, vehicles and drones make dependent or independent deliveries. In the case of a dependent delivery, at a given point (customer or depot) the drone takes off from a vehicle to serve a customer and then return to travel with the same vehicle, as long as the capacity and endurance constraints for a drone are satisfied. In the other case, each type of vehicle travels independently to others. A MILP model is presented to describe the problem, and then we confirm the formulation via a CPLEX software with small instances. We propose a hybrid genetic algorithm to solve the VRPD. Experiments are carried out on the instances taken from the literature in different settings. The results show the performance of the proposed algorithm to solve this variant.
发布者：全栈程序员-站长，转载请注明出处：https://javaforall.net/170579.html原文链接：https://javaforall.net
![navicate premium mac激活码[最新免费获取]](https://javaforall.net/wp-content/uploads/2020/11/2020110817443450-480x300.jpg)
