Generation method and device for planned route of vehicle

Abstract

The invention is applied to the field of logistics, and provides a generation method and device for a planned route of a vehicle. The method comprises the following steps: initializing an ant colony and ants, and determining a vehicle to be arranged; when the next delivery node is arranged for the vehicle to be arranged, taking a requirement of a hard time window, carrying capacity and a requirement of a soft time window into consideration; calculating penalty cost caused by the violation of the vehicle to be arranged against the soft time window, cyclically generating N ants after edge cost and current ant total cost are calculated according to the penalty cost and the delivery cost of the vehicle, obtaining a route map of each ant and the total cost of each ant, and finally obtaining an optimal delivery route of the vehicle according to the route map of each ant and the total cost of each ant. According to the method and the device, when a route is planned for the vehicle, the four models of VRPMVT (Vehicle Routing Problems with Multiple Vehicle Types), VRPTW (Vehicle Routing Problems with Time Windows), VRPSTW (Vehicle Routing Problems with Soft Time Windows) and VRPPD (Vehicle Routing Problems with Pickup and Delivery) are taken into consideration, and higher-practicability complex optimization problems are solved, so that the requirements of multiple practical applications are met.

Description

technical field

[0001] The invention belongs to the field of logistics, and in particular relates to a method and a device for generating a vehicle planning route. Background technique

[0002] Vehicle routing problem (Vehicle Routing Problems, VRP) refers to a certain number of customers, each with a different quantity of goods demand, the distribution center provides goods to customers, and a team is responsible for distributing goods, organizing appropriate driving routes, so that vehicles have Arrive at each customer address sequentially, and achieve the goal of a certain problem (such as The shortest distance, the least cost, the least possible time, the fewest number of vehicles used, etc.).

[0003] In the vehicle routing problem with mixed vehicle types (VRP with multiple vehicle types, VRPMVT), the cost and payload of delivery vehicles vary. Considering that the demand point has requirements on the time when the vehicle arrives at the destination address, adding a...

Images