Multi-user reservation scheduling route planning method and relevant device

Abstract

The application discloses a multi-user reservation scheduling route planning method which comprises the following steps: constructing a time window variable according to a time limit that an access toa destination is allowed in route planning; constructing a matching degree variable according to a matching degree of each actor in the route planning and the destination; adding the time window variable and the matching degree variable into an ant colony algorithm, so as to obtain a multi-user reservation scheduling ant colony algorithm; planning a route by adopting the multi-user reservation scheduling ant colony algorithm. A variant of the ant colony algorithm is obtained by adding the time window variable and the matching degree variable into the original ant colony algorithm according tothe multi-user reservation scheduling route planning, a scheduled route of each actor can be obtained under the condition of multi-user reservation scheduling by adding parameter data in calculation,and the problem of multi-user reservation scheduling route planning is solved. The application also discloses a multi-user reservation scheduling route planning device, a computer and a computer readable storage medium which have the beneficial effects.

Description

technical field [0001] The present application relates to the field of computer technology, and in particular to a multi-person reservation scheduling route planning method, a multi-person reservation scheduling route planning device, a computer, and a computer-readable storage medium. Background technique [0002] With the development of computing power of computers, solutions of realistic planning problems can also be calculated in computers according to different algorithms. Among them, the most widely used is in solving path planning problems. Human resources can be allocated efficiently through computers and corresponding planning algorithms, and with the enhancement of computer performance, the allocation speed is getting faster and faster. Algorithms currently applied to such problems include ant colony algorithm, particle swarm algorithm, tabu algorithm, genetic algorithm, simulated annealing algorithm, etc. [0003] In the continuous application of computer-aided p...

AI Technical Summary

Problems solved by technology

This kind of problem is based on the pure multi-person path planning problem, which limits the time period limit of the visiting target and requires sufficient matching between the visitor and the visited in some aspects.

Under the new constraints of the path planning problem, it is more difficult to solve the optimal total path planning, and the original path planning algorithm is no longer applicable to this type of algorithm, resulting in a certain degree of computational difficulty

Images