CN113469466A - Vehicle scheduling method and device, electronic equipment and storage medium - Google Patents
Vehicle scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN113469466A CN113469466A CN202111021280.0A CN202111021280A CN113469466A CN 113469466 A CN113469466 A CN 113469466A CN 202111021280 A CN202111021280 A CN 202111021280A CN 113469466 A CN113469466 A CN 113469466A
- Authority
- CN
- China
- Prior art keywords
- mixing
- pump
- truck
- trucks
- vehicle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0835—Relationships between shipper or supplier and carriers
- G06Q10/08355—Routing methods
Abstract
The invention discloses a vehicle scheduling method, a vehicle scheduling device, electronic equipment and a storage medium. Acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixer truck; determining the number of the pump trucks and the number of the mixing trucks according to the vehicle demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck; acquiring a vehicle state of a pump truck and a vehicle state of a mixing truck; determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing truck vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks; acquiring the position of each pump truck in the first pump truck vehicle set and the position of each mixing truck in the first mixing truck vehicle set; and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set. The scheme provided by the invention can realize the optimal scheduling of the pump truck and the mixing truck.
Description
Technical Field
The invention relates to the technical field of route planning, in particular to a vehicle scheduling method, a vehicle scheduling device, electronic equipment and a storage medium.
Background
At present, in the concrete industry, the dispatching of a pump truck and a mixer truck mainly depends on manual calling of personnel, the working idle condition of the pump truck is tracked by a telephone, and the position of the mixer truck is tracked by the telephone. This kind of operation mode needs managers to invest a large amount of daily time to pay close attention to the work of every vehicle and reaches, and the situation that the trucd runs wrong building site, the pump truck trucd and waits for each other easily appears, leads to the inefficiency of vehicle and personnel, and the vehicle turnover rate is not enough, and the construction cycle is prolonged, leads to the cost waste finally.
Disclosure of Invention
In order to solve the technical problem that the pump truck and the mixing truck are unreasonably scheduled, the embodiment of the invention provides a vehicle scheduling method and device, electronic equipment and a storage medium.
The technical scheme of the embodiment of the invention is realized as follows:
the embodiment of the invention provides a vehicle scheduling method, which comprises the following steps:
acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
determining the number of the pump trucks and the number of the mixing trucks according to the truck demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
acquiring a vehicle state of the pump truck and a vehicle state of the mixing truck;
determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks;
acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set;
and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set.
In the above scheme, determining the number of the pump trucks and the number of the mixer trucks according to the vehicle demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixer truck includes:
determining the number of the pump truck using the following formula (1):
formula (1) of N1= B/C/A1
Wherein N1 represents the number of pump truck, B represents the total demand in the demand of the pump truck, C represents the total duration in the demand of the pump truck, and A1 represents the delivery capacity of a single pump truck;
determining the number of used vehicles of the mixer vehicle by using the following formula (2):
n2= a1 (1 + T)/a 2 formula (2)
Where N2 represents the number of cars in the mix, a1 represents the delivery capacity of a single pump truck, a1 represents the delivery capacity of a single mix, and T represents the estimated time of arrival of the mix, obtained by the path length/average speed calculation.
In the foregoing solution, the determining a first pump truck vehicle set according to the number of pump trucks and the vehicle state of the pump truck includes:
acquiring the number of first pump trucks with idle vehicle states;
judging whether the number of the first pump trucks is larger than or equal to the number of the pump trucks;
and when the number of the first pump trucks is larger than or equal to the number of the pump trucks, taking the vehicles corresponding to the first pump truck number as a first pump truck vehicle set.
In the above scheme, the method further comprises:
when the number of the first pump trucks is smaller than the number of the pump trucks, acquiring the number of second pump trucks with the remaining operation time of the pump trucks within a preset first range;
judging whether the sum of the first pump truck quantity and the second pump truck quantity is larger than or equal to the pump truck quantity;
when the first pump truck quantity and the second pump truck quantity are larger than or equal to the pump truck consumption quantity, taking the vehicles corresponding to the first pump truck quantity and the second pump truck quantity as a first pump truck set; when the number of the first pump trucks and the number of the second pump trucks are smaller than the number of the pump trucks, obtaining the number of the third pump trucks with the remaining operation time of the pump trucks within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the number of the first pump trucks plus the number of the third pump trucks is larger than or equal to the number of the pump trucks; when the first pump truck quantity and the third pump truck quantity are larger than or equal to the pump truck consumption quantity, taking vehicles corresponding to the first pump truck quantity and the third pump truck quantity as a first pump truck set; and when the first pump truck quantity and the third pump truck quantity are smaller than the pump truck quantity, repeating the steps until the first pump truck quantity and the Nth pump truck quantity are larger than or equal to the pump truck quantity.
In the foregoing solution, the determining a first mix vehicle set according to the number of used vehicles of the mix vehicle and the vehicle state of the mix vehicle includes:
acquiring the number of first mixing trucks with idle vehicle states;
judging whether the number of the first mixing vehicles is larger than or equal to the number of the mixing vehicles;
and when the first mixing number is larger than or equal to the using number of the mixing vehicles, taking the vehicles corresponding to the first mixing number as a first mixing vehicle set.
In the above scheme, the method further comprises:
when the number of the first mixing trucks is smaller than the number of the used mixing trucks, acquiring the number of second mixing trucks with the remaining operation time within a preset first range;
judging whether the sum of the first vehicle mixing number and the second vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing;
when the first number of the mixing vehicles and the second number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the second number of the mixing vehicles as a first mixing vehicle set; when the first number of the mixing vehicles and the second number of the mixing vehicles are smaller than the number of the mixing vehicles, obtaining a third number of the mixing vehicles with the remaining operation time within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the sum of the first vehicle mixing number and the third vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing; when the first number of the mixing vehicles and the third number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the third number of the mixing vehicles as a first mixing vehicle set; when the first number of the first mixing trucks and the third number of the mixing trucks are smaller than the number of the used mixing trucks, the same is done until the first number of the mixing trucks and the N-th number of the mixing trucks are larger than or equal to the number of the used mixing trucks.
In the foregoing solution, determining the scheduling order of the pump trucks and the scheduling order of the mix trucks according to the position of each pump truck in the first set of pump trucks and the position of each mix truck in the first set of mix trucks further includes:
determining a distance between a location of each pump truck in the first set of pump truck vehicles and a target location;
sequencing the distance between the position of each pump truck and the target site in the order from small to large;
determining the dispatching sequence of the pump trucks according to the sequence;
determining a distance between a position of each of the first set of mixer vehicles and a target location;
sequencing the distance between the position of each mixing truck and the target site in a descending order;
and determining the scheduling sequence of the mixing trucks according to the sequence.
The embodiment of the invention also provides a vehicle dispatching device, which comprises:
the first acquisition module is used for acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
the second acquisition module is used for acquiring the delivery capacity of the single pump truck and the delivery capacity of the single mixing truck;
the first determining module is used for determining the number of the pump trucks and the number of the mixing trucks according to the vehicle using requirements, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
the third acquisition module is used for acquiring the vehicle state of the pump truck and the vehicle state of the mixing truck;
the second determining module is used for determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks and determining the first mixing truck vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks;
the fourth acquisition module is used for acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set;
and the third determining module is used for determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck vehicle set and the position of each mixing truck in the first mixing truck vehicle set.
An embodiment of the present invention further provides an electronic device, including: a processor and a memory for storing a computer program capable of running on the processor; wherein the content of the first and second substances,
the processor is adapted to perform the steps of any of the methods described above when running the computer program.
The embodiment of the invention also provides a storage medium, wherein a computer program is stored in the storage medium, and when the computer program is executed by a processor, the steps of any one of the methods are realized.
According to the vehicle scheduling method and device, the electronic equipment and the storage medium, the vehicle using requirements of the pump truck and the mixing truck are obtained; the vehicle demand comprises total demand and total duration; acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck; determining the number of the pump trucks and the number of the mixing trucks according to the truck demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck; acquiring a vehicle state of the pump truck and a vehicle state of the mixing truck; determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks; acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set; and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set. The scheme provided by the invention can realize the optimal scheduling of the pump truck and the mixing truck.
Drawings
FIG. 1 is a schematic flow chart of a vehicle scheduling method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a collaboration system according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a collaboration process according to an embodiment of the present invention;
FIG. 4 is a schematic structural diagram of a vehicle dispatching device according to an embodiment of the invention;
fig. 5 is an internal structural diagram of a computer device according to an embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples.
An embodiment of the present invention provides a vehicle scheduling method, as shown in fig. 1, the method includes:
step 101: acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
step 102: acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
step 103: determining the number of the pump trucks and the number of the mixing trucks according to the truck demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
step 104: acquiring a vehicle state of the pump truck and a vehicle state of the mixing truck;
step 105: determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks;
step 106: acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set;
step 107: and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set.
Specifically, the vehicle using requirements of the pump truck and the mixing truck can be determined according to the user requirements.
In practical application, the pump truck may have multiple models, and different models respectively correspond to different delivery capacities, so that when the delivery capacity of a single pump truck is obtained, the delivery capacity of the single pump truck of the model can be determined according to the model of the pump truck. For example, a pump truck model a, delivery capacity a; the pump truck with the model B has the delivery capacity of B. The deliverability here refers to the amount of work a pump truck can perform to complete a transport. Also, since the mixer may have multiple models, with different models corresponding to different deliverabilities, the deliverability of a single mixer may be determined based on the model of the mixer when the deliverability of the single mixer is obtained.
Further, in an embodiment, the determining the number of the pump trucks and the number of the mixer trucks according to the vehicle demand, the delivery capacity of the single pump truck and the delivery capacity of the single mixer truck includes:
determining the number of the pump truck using the following formula (1):
formula (1) of N1= B/C/A1
Wherein N1 represents the number of pump truck, B represents the total demand in the demand of the pump truck, C represents the total duration in the demand of the pump truck, and A1 represents the delivery capacity of a single pump truck;
determining the number of used vehicles of the mixer vehicle by using the following formula (2):
n2= a1 (1 + T)/a 2 formula (2)
Where N2 represents the number of cars in the mix, a1 represents the delivery capacity of a single pump truck, a1 represents the delivery capacity of a single mix, and T represents the estimated time of arrival of the mix, obtained by the path length/average speed calculation.
In practical applications, since some vehicles may still be in the task execution plan, some vehicles may have already executed and wait for the task to be assigned. Therefore, in order to realize reasonable dispatching of the pump truck and the mixing truck, the vehicle dispatching needs to be carried out according to the vehicle states of the pump truck and the mixing truck. Here, the vehicle state includes whether the vehicle is idle; the vehicle executes the task, but the remaining working time is in the range of A; the vehicle performs the task, but the remaining operating time is within the range of B, etc.
Further, in an embodiment, the determining the first pump truck set according to the number of pump trucks and the vehicle state of the pump truck includes:
acquiring the number of first pump trucks with idle vehicle states;
judging whether the number of the first pump trucks is larger than or equal to the number of the pump trucks;
and when the number of the first pump trucks is larger than or equal to the number of the pump trucks, taking the vehicles corresponding to the first pump truck number as a first pump truck vehicle set.
Accordingly, in an embodiment, the method further comprises:
when the number of the first pump trucks is smaller than the number of the pump trucks, acquiring the number of second pump trucks with the remaining operation time of the pump trucks within a preset first range;
judging whether the sum of the first pump truck quantity and the second pump truck quantity is larger than or equal to the pump truck quantity;
when the first pump truck quantity and the second pump truck quantity are larger than or equal to the pump truck consumption quantity, taking the vehicles corresponding to the first pump truck quantity and the second pump truck quantity as a first pump truck set; when the number of the first pump trucks and the number of the second pump trucks are smaller than the number of the pump trucks, obtaining the number of the third pump trucks with the remaining operation time of the pump trucks within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the number of the first pump trucks plus the number of the third pump trucks is larger than or equal to the number of the pump trucks; when the first pump truck quantity and the third pump truck quantity are larger than or equal to the pump truck consumption quantity, taking vehicles corresponding to the first pump truck quantity and the third pump truck quantity as a first pump truck set; and when the first pump truck quantity and the third pump truck quantity are smaller than the pump truck quantity, repeating the steps until the first pump truck quantity and the Nth pump truck quantity are larger than or equal to the pump truck quantity.
The preset first range, the preset second range and the preset nth range can be set according to the situation information. Generally, the preset first range is smaller than the preset second range, the preset second range is smaller than the preset third range, and so on.
The remaining work time here can be obtained from the path length/average speed calculation. The path length here is the remaining path length of the vehicle from the destination.
Further, in an embodiment, the determining a first set of mixer vehicles based on the number of used vehicles of the mixer and the vehicle status of the mixer includes:
acquiring the number of first mixing trucks with idle vehicle states;
judging whether the number of the first mixing vehicles is larger than or equal to the number of the mixing vehicles;
and when the first mixing number is larger than or equal to the using number of the mixing vehicles, taking the vehicles corresponding to the first mixing number as a first mixing vehicle set.
Accordingly, in an embodiment, the method further comprises:
when the number of the first mixing trucks is smaller than the number of the used mixing trucks, acquiring the number of second mixing trucks with the remaining operation time within a preset first range;
judging whether the sum of the first vehicle mixing number and the second vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing;
when the first number of the mixing vehicles and the second number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the second number of the mixing vehicles as a first mixing vehicle set; when the first number of the mixing vehicles and the second number of the mixing vehicles are smaller than the number of the mixing vehicles, obtaining a third number of the mixing vehicles with the remaining operation time within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the sum of the first vehicle mixing number and the third vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing; when the first number of the mixing vehicles and the third number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the third number of the mixing vehicles as a first mixing vehicle set; when the first number of the first mixing trucks and the third number of the mixing trucks are smaller than the number of the used mixing trucks, the same is done until the first number of the mixing trucks and the N-th number of the mixing trucks are larger than or equal to the number of the used mixing trucks.
The preset first range, the preset second range and the preset nth range can be set according to the situation information. Generally, the preset first range is smaller than the preset second range, the preset second range is smaller than the preset third range, and so on.
The remaining work time here can be obtained from the path length/average speed calculation. The path length here is the remaining path length of the vehicle from the destination.
Further, in an embodiment, the determining the scheduling order of the pump trucks and the scheduling order of the mix trucks according to the position of each pump truck in the first set of pump trucks and the position of each mix truck in the first set of mix trucks further includes:
determining a distance between a location of each pump truck in the first set of pump truck vehicles and a target location;
sequencing the distance between the position of each pump truck and the target site in the order from small to large;
determining the dispatching sequence of the pump trucks according to the sequence;
determining a distance between a position of each of the first set of mixer vehicles and a target location;
sequencing the distance between the position of each mixing truck and the target site in a descending order;
and determining the scheduling sequence of the mixing trucks according to the sequence.
The vehicle scheduling is realized through the distance, namely, the vehicle is scheduled according to the shortest distance principle, and the optimal vehicle scheduling can be realized.
According to the vehicle scheduling method provided by the embodiment of the invention, the vehicle using requirements of a pump truck and a mixing truck are obtained; the vehicle demand comprises total demand and total duration; acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck; determining the number of the pump trucks and the number of the mixing trucks according to the truck demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck; acquiring a vehicle state of the pump truck and a vehicle state of the mixing truck; determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks; acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set; and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set. The scheme provided by the invention can realize the optimal scheduling of the pump truck and the mixing truck.
The present invention will be described in further detail with reference to the following application examples.
The embodiment provides a pump truck and mixer truck cooperative system based on positioning and real-time production state monitoring. In the system, a mode of synchronous development of a web page end and an APP end is adopted in consideration of convenience.
Specifically, referring to fig. 2, the collaboration system logic is as follows:
a first part: basic operation logic
(1) Each vehicle is additionally provided with a positioning module, a flow detector and other terminals to provide a positioning function and a flow monitoring function.
(2) After the customer demands are obtained from the ordering system (the demands include total demand, time plan, etc.), the system generates an order. According to the delivery capacity of a single vehicle, the specific quantity requirements of the pump trucks and the mixing trucks are measured and calculated in a split mode.
(3) The real-time states of the pump truck and the mixing truck are combined, the matching scheme of pre-arranged vehicles and the supply plan of a specific work place are determined according to the nearby principle and the idle matching priority principle.
(4) During the transportation process of the vehicle, the system can monitor the specific position in real time. The estimated time of arrival at the destination is known.
(5) And predicting the residual operation time and the whole work completion degree according to the flow detection condition on the site. The whole process is uniformly controlled and supervised.
(6) After all the operations are finished, the operation is fed back to the order system for filing.
Further, in the whole system operation process, the principle of control cooperation has 6 aspects:
pump mixing separation, priority selection when idle, proximity of initial position, shortest running path, prejudgment of operation process and real-time dynamic adjustment.
(1) Pump stirring separation: the pump truck and the mixing truck are used as two independent bodies. There is no fixed dependency relationship, and the inevitable correspondence relationship between the pump truck and the mixer truck is not set. However, each work must be combined with each other, and the two vehicles cooperate with each other.
The calculation method of the number of vehicles is shown in the formula (1) and the formula (2).
(2) And (3) idle selection is given priority: the vehicle in the idle state is used as a main dispatching object.
Vehicles with the remaining time of the last job being less than 30 minutes are also listed as scheduling objects and are regarded as secondary selection objects.
If all vehicles are not idle at a certain time, the remaining time is used as priority.
(3) The starting position is nearby: the distance L between the pump truck and the mixer truck and the destination is an important considered parameter.
(4) Shortest path of travel: the shortest path Problem is an important issue in operations research, and is a typical TSP traveler Problem (travel Salesman clearance) in the context of the present invention. We use the optimized dynamic programming equations for solution.
Let d (i, V ') denote the shortest path length from vertex i through each vertex in V' (which is a set of points) once and only once, and finally back to the starting point s, assuming that it starts from vertex s.
Derivation: (discussed case by case)
(a) When V 'is an empty set, then d (i, V') indicates that i returns to s without passing any point. At this time d (i, V') = Cis (i.e. the distance from destination i to destination s).
(b) If V' is not null, then it is the optimal solution to the sub-problem. It is necessary to try each one in the set of cities V' and find the optimal solution.
d(i, V’)=min{Cik + d(k, V’-{k})}
Note: cik denotes the distance of the destination you choose from and destination i, d (k, V' - { k }) is a sub-problem.
In conclusion, the dynamic programming equation of the TSP problem is obtained.
(5) Predicting the operation process: and predicting the remaining operation time t of the mixer according to the data of the flow detector and the initial capacity of the mixer.
This time will also serve as an important assessment of the remaining operating time of the pump truck. The remaining time T of the pump truck = ∑ T + transit time + tail clearing time.
The two times are finally fed back to the monitoring center, so that the real-time progress of the order delivery process can be conveniently and timely known.
(6) And (3) real-time dynamic adjustment:
and dynamically adjusting a vehicle combination collocation scheme according to the latest vehicle positioning, the latest idle state, the latest residual time prediction and the latest optimal path recommendation, and pushing the latest path plan.
(7) And based on the 6 factors, comprehensively optimizing and finding an optimized comprehensive cooperation scheme of the pump truck and the mixer truck.
Specifically, referring to fig. 3, the integrated collaborative process is: and (5) pump mixing separation, and calculating the quantity demand of the vehicles according to the customer demand. The idle state of the vehicle is confirmed, and if the vehicle is idle, the idle state of the vehicle is most preferred; if the vehicle is busy, the remaining operation time is evaluated, and the remaining time is suboptimal. Determining an initial vehicle combination scheme, solving by using a dynamic programming equation of the TSP problem, and determining a vehicle shortest path scheme. And carrying out latest vehicle positioning, latest idle state confirmation, latest operation time evaluation, and finally solving by utilizing a DOP dynamic optimization heuristic algorithm, and dynamically optimizing and adjusting the vehicle combination and the latest path.
A second part: further applications
(1) And (3) process statistical analysis: and (4) counting the vehicle states of the pump truck and the mixing truck related to the concrete station, the turnover times, turnover time, single path, production results and the like of the specific vehicles, and automatically generating reports.
(2) Tracking the track of the vehicle: and monitoring the running track of the vehicle in real time, and sending out reminding and warning for serious deviation from the recommended route and the like. In consideration of the problems of GPS offset, positioning accuracy and the like, a dynamic time warping mode is adopted to carry out intelligent tracking and difference identification on the vehicle travelling track.
A Dynamic Time Warping (DTW) scheme is a method for measuring similarity of two time sequences with different lengths, and is mainly applied to the fields of isolated word voice recognition, gesture recognition, data mining and the like.
In the context of the present invention, two discrete time sequences
And
respectively defined as a planned vehicle trajectory and an actual traveling vehicle trajectory.
Suppose that
The two time sequences are aligned in a way that the lengths of the two time sequences are n and m respectively, then
May be represented as a pair of lengths
Vector of (2)
. Wherein
And
the regular paths of x and y, respectively. Based on the set of vectors
The dynamic time warping distance can be defined as
Wherein the content of the first and second substances,
for all possible alignment paths and
is the euclidean distance. Based on this optimization goal, the time steps between the two time series can be aligned and the similarity between the two time series is calculated based on the alignment pattern. The conventional gaussian kernel function is defined as:
. Wherein
The euclidean distance can only be used to measure the similarity between equal length vectors. Using DTW distance to replace Euclidean distance to obtain a time sequence alignment kernel
。
(3) Optimizing the vehicle path: and the running route of the vehicle is self-optimized by combining common navigation software and real-time revision of driver feedback. Even for the situation that no navigation software route recommendation is available in the construction site group, the system recommends available paths based on an improved TSP algorithm dynamic planning equation, and an optimized vehicle path planning scheme is obtained quickly.
(4) And (3) nearby dispatching of vehicles between construction sites: based on the operational research principle, the states of the pump trucks at different target construction sites are monitored, and the pump trucks which complete the work are temporarily cooperated to support the adjacent construction sites by combining an optimization algorithm, so that the maximization of the use efficiency of the vehicle is promoted.
(5) Predicting half an hour ahead, and dynamically adjusting the vehicle plan: and accounting is carried out on the order quantity based on the working state of each vehicle, and the residual working time is measured and calculated in real time. Rolling and adjusting the vehicle schedule half an hour in advance, and the like. The working hours are prevented from being lengthened due to sudden abnormality of the vehicle. And the maximum utilization of resources is realized to the maximum extent.
And a third part: the whole system is provided with two terminal pages of WEB and APP.
(1) On the web side, it is mainly an administrator operation. The method mainly comprises the steps of splitting an order, monitoring the vehicle state in real time, sending a scheduling instruction, checking a statistical analysis form and the like.
(2) At the APP end, a driver can receive the instruction and check information such as an optimal path, a next single destination and the like.
The embodiment can realize the optimization of resource allocation by the cooperation of the pump truck and the mixing truck in the concrete industry. The distribution path is optimized, and the order delivery time is shortened. The cooperation of the whole operation process also enables the efficiency of the vehicle to reach the maximum.
In order to implement the method according to the embodiment of the present invention, an embodiment of the present invention further provides a vehicle dispatching device, as shown in fig. 4, the vehicle dispatching device 400 includes: a first obtaining module 401, a second obtaining module 402, a first determining module 403, a third obtaining module 404, a second determining module 405, a fourth obtaining module 406, and a third determining module 407; wherein the content of the first and second substances,
the first obtaining module 401 is used for obtaining vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
a second acquiring module 402 for acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixer truck;
a first determining module 403, configured to determine, according to the vehicle demand, the delivery capacity of a single pump vehicle and the delivery capacity of a single mixer vehicle, the number of vehicles used by the pump vehicle and the number of vehicles used by the mixer vehicle;
a third obtaining module 404, configured to obtain a vehicle state of the pump truck and a vehicle state of the mixer truck;
a second determining module 405, configured to determine a first pump truck vehicle set according to the number of used pump trucks and the vehicle state of the pump truck, and determine the first mix truck vehicle set according to the number of used mix trucks and the vehicle state of the mix truck;
a fourth obtaining module 406, configured to obtain a position of each pump truck in the first set of pump trucks and a position of each mixer truck in the first set of mixer trucks;
a third determining module 407, configured to determine a scheduling order of the pump trucks and a scheduling order of the mixer trucks according to a position of each pump truck in the first set of pump trucks and a position of each mixer truck in the first set of mixer trucks.
In practical applications, the first obtaining module 401, the second obtaining module 402, the first determining module 403, the third obtaining module 404, the second determining module 405, the fourth obtaining module 406, and the third determining module 407 may be implemented by a processor in the vehicle scheduling apparatus.
It should be noted that: the above-mentioned apparatus provided in the above-mentioned embodiment is only exemplified by the division of the above-mentioned program modules when executing, and in practical application, the above-mentioned processing may be distributed to be completed by different program modules according to needs, that is, the internal structure of the terminal is divided into different program modules to complete all or part of the above-mentioned processing. In addition, the apparatus provided by the above embodiment and the method embodiment belong to the same concept, and the specific implementation process thereof is described in the method embodiment and is not described herein again.
To implement the method of the embodiments of the present invention, the embodiments of the present invention also provide a computer program object, which includes computer instructions, the computer instructions being stored in a computer readable storage medium. A processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the steps of the above-described method.
Based on the hardware implementation of the program module, in order to implement the method according to the embodiment of the present invention, an electronic device (computer device) is also provided in the embodiment of the present invention. Specifically, in one embodiment, the computer device may be a terminal, and its internal structure diagram may be as shown in fig. 5. The computer apparatus includes a processor a01, a network interface a02, a display screen a04, an input device a05, and a memory (not shown in the figure) connected through a system bus. Wherein processor a01 of the computer device is used to provide computing and control capabilities. The memory of the computer device comprises an internal memory a03 and a non-volatile storage medium a 06. The nonvolatile storage medium a06 stores an operating system B01 and a computer program B02. The internal memory a03 provides an environment for the operation of the operating system B01 and the computer program B02 in the nonvolatile storage medium a 06. The network interface a02 of the computer device is used for communication with an external terminal through a network connection. The computer program is executed by the processor a01 to implement the method of any of the above embodiments. The display screen a04 of the computer device may be a liquid crystal display screen or an electronic ink display screen, and the input device a05 of the computer device may be a touch layer covered on the display screen, a button, a trackball or a touch pad arranged on a casing of the computer device, or an external keyboard, a touch pad or a mouse.
Those skilled in the art will appreciate that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects apply, as particular computing devices may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
The device provided by the embodiment of the present invention includes a processor, a memory, and a program stored in the memory and capable of running on the processor, and when the processor executes the program, the method according to any one of the embodiments described above is implemented.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program object. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program object embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application has been described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program objects according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include transitory computer readable media (transmyedia) such as modulated data signals and carrier waves.
It will be appreciated that the memory of embodiments of the invention may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. Among them, the nonvolatile Memory may be a Read Only Memory (ROM), a Programmable Read Only Memory (PROM), an Erasable Programmable Read-Only Memory (EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), a magnetic random access Memory (FRAM), a Flash Memory (Flash Memory), a magnetic surface Memory, an optical disk, or a Compact Disc Read-Only Memory (CD-ROM); the magnetic surface storage may be disk storage or tape storage. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of illustration and not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Synchronous Static Random Access Memory (SSRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate Synchronous Dynamic Random Access Memory (DDRSDRAM), Enhanced Synchronous Dynamic Random Access Memory (ESDRAM), Enhanced Synchronous Dynamic Random Access Memory (Enhanced DRAM), Synchronous Dynamic Random Access Memory (SLDRAM), Direct Memory (DRmb Access), and Random Access Memory (DRAM). The described memory for embodiments of the present invention is intended to comprise, without being limited to, these and any other suitable types of memory.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A vehicle scheduling method, characterized in that the method comprises:
acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
acquiring the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
determining the number of the pump trucks and the number of the mixing trucks according to the truck demand, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
acquiring a vehicle state of the pump truck and a vehicle state of the mixing truck;
determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks, and determining a first mixing vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks;
acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set;
and determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set.
2. The method of claim 1, wherein determining the number of pump trucks and the number of mixer trucks based on the vehicle demand, the delivery capacity of the single pump truck, and the delivery capacity of the single mixer truck comprises:
determining the number of the pump truck using the following formula (1):
formula (1) of N1= B/C/A1
Wherein N1 represents the number of pump truck, B represents the total demand in the demand of the pump truck, C represents the total duration in the demand of the pump truck, and A1 represents the delivery capacity of a single pump truck;
determining the number of used vehicles of the mixer vehicle by using the following formula (2):
n2= a1 (1 + T)/a 2 formula (2)
Where N2 represents the number of cars in the mix, a1 represents the delivery capacity of a single pump truck, a1 represents the delivery capacity of a single mix, and T represents the estimated time of arrival of the mix, obtained by the path length/average speed calculation.
3. The method of claim 1, wherein determining a first set of pump truck vehicles based on the number of pump truck uses and the vehicle state of the pump truck comprises:
acquiring the number of first pump trucks with idle vehicle states;
judging whether the number of the first pump trucks is larger than or equal to the number of the pump trucks;
and when the number of the first pump trucks is larger than or equal to the number of the pump trucks, taking the vehicles corresponding to the first pump truck number as a first pump truck vehicle set.
4. The method of claim 3, further comprising:
when the number of the first pump trucks is smaller than the number of the pump trucks, acquiring the number of second pump trucks with the remaining operation time of the pump trucks within a preset first range;
judging whether the sum of the first pump truck quantity and the second pump truck quantity is larger than or equal to the pump truck quantity;
when the first pump truck quantity and the second pump truck quantity are larger than or equal to the pump truck consumption quantity, taking the vehicles corresponding to the first pump truck quantity and the second pump truck quantity as a first pump truck set; when the number of the first pump trucks and the number of the second pump trucks are smaller than the number of the pump trucks, obtaining the number of the third pump trucks with the remaining operation time of the pump trucks within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the number of the first pump trucks plus the number of the third pump trucks is larger than or equal to the number of the pump trucks; when the first pump truck quantity and the third pump truck quantity are larger than or equal to the pump truck consumption quantity, taking vehicles corresponding to the first pump truck quantity and the third pump truck quantity as a first pump truck set; and when the first pump truck quantity and the third pump truck quantity are smaller than the pump truck quantity, repeating the steps until the first pump truck quantity and the Nth pump truck quantity are larger than or equal to the pump truck quantity.
5. The method of claim 1, wherein determining a first set of mixer vehicles based on the number of used vehicles of the mixer and the vehicle status of the mixer comprises:
acquiring the number of first mixing trucks with idle vehicle states;
judging whether the number of the first mixing vehicles is larger than or equal to the number of the mixing vehicles;
and when the first mixing number is larger than or equal to the using number of the mixing vehicles, taking the vehicles corresponding to the first mixing number as a first mixing vehicle set.
6. The method of claim 5, further comprising:
when the number of the first mixing trucks is smaller than the number of the used mixing trucks, acquiring the number of second mixing trucks with the remaining operation time within a preset first range;
judging whether the sum of the first vehicle mixing number and the second vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing;
when the first number of the mixing vehicles and the second number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the second number of the mixing vehicles as a first mixing vehicle set; when the first number of the mixing vehicles and the second number of the mixing vehicles are smaller than the number of the mixing vehicles, obtaining a third number of the mixing vehicles with the remaining operation time within a preset second range; wherein the preset second range is larger than the preset first range; judging whether the sum of the first vehicle mixing number and the third vehicle mixing number is larger than or equal to the vehicle using number of the vehicle mixing; when the first number of the mixing vehicles and the third number of the mixing vehicles are larger than or equal to the number of the used mixing vehicles, taking the vehicles corresponding to the first number of the mixing vehicles and the third number of the mixing vehicles as a first mixing vehicle set; when the first number of the first mixing trucks and the third number of the mixing trucks are smaller than the number of the used mixing trucks, the same is done until the first number of the mixing trucks and the N-th number of the mixing trucks are larger than or equal to the number of the used mixing trucks.
7. The method of claim 1, wherein determining the pump truck dispatch order and the mix truck dispatch order based on the location of each pump truck in the first set of pump truck vehicles and the location of each mix truck in the first set of mix trucks further comprises:
determining a distance between a location of each pump truck in the first set of pump truck vehicles and a target location;
sequencing the distance between the position of each pump truck and the target site in the order from small to large;
determining the dispatching sequence of the pump trucks according to the sequence;
determining a distance between a position of each of the first set of mixer vehicles and a target location;
sequencing the distance between the position of each mixing truck and the target site in a descending order;
and determining the scheduling sequence of the mixing trucks according to the sequence.
8. A vehicle scheduling apparatus, characterized by comprising:
the first acquisition module is used for acquiring vehicle using requirements of a pump vehicle and a mixing vehicle; the vehicle demand comprises total demand and total duration;
the second acquisition module is used for acquiring the delivery capacity of the single pump truck and the delivery capacity of the single mixing truck;
the first determining module is used for determining the number of the pump trucks and the number of the mixing trucks according to the vehicle using requirements, the delivery capacity of a single pump truck and the delivery capacity of a single mixing truck;
the third acquisition module is used for acquiring the vehicle state of the pump truck and the vehicle state of the mixing truck;
the second determining module is used for determining a first pump truck vehicle set according to the number of the pump trucks and the vehicle state of the pump trucks and determining the first mixing truck vehicle set according to the number of the mixing trucks and the vehicle state of the mixing trucks;
the fourth acquisition module is used for acquiring the position of each pump truck in the first pump truck set and the position of each mixing truck in the first mixing truck set;
and the third determining module is used for determining the dispatching sequence of the pump trucks and the dispatching sequence of the mixing trucks according to the position of each pump truck in the first pump truck vehicle set and the position of each mixing truck in the first mixing truck vehicle set.
9. An electronic device, comprising: a processor and a memory for storing a computer program capable of running on the processor; wherein the content of the first and second substances,
the processor is adapted to perform the steps of the method of any one of claims 1 to 7 when running the computer program.
10. A storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, performs the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111021280.0A CN113469466A (en) | 2021-09-01 | 2021-09-01 | Vehicle scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111021280.0A CN113469466A (en) | 2021-09-01 | 2021-09-01 | Vehicle scheduling method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113469466A true CN113469466A (en) | 2021-10-01 |
Family
ID=77867990
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111021280.0A Pending CN113469466A (en) | 2021-09-01 | 2021-09-01 | Vehicle scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113469466A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113643010A (en) * | 2021-10-18 | 2021-11-12 | 氢山科技有限公司 | Order dispatching method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102324061A (en) * | 2011-05-19 | 2012-01-18 | 三一重工股份有限公司 | Pump-truck and agitating-truck combined-operation dispatching system, method thereof, agitating truck and pump truck |
| CN103593556A (en) * | 2013-09-11 | 2014-02-19 | 上海绿地建设(集团)有限公司 | Method for computing number of concrete mixer trucks |
| CN105551232A (en) * | 2015-12-14 | 2016-05-04 | 华北电力科学研究院有限责任公司 | Power service vehicle scheduling method, terminal, server and system |
| CN112288373A (en) * | 2020-11-18 | 2021-01-29 | 建国混凝土集团有限公司 | Vehicle distribution method and system |
| CN112529332A (en) * | 2020-12-25 | 2021-03-19 | 树根互联技术有限公司 | Concrete transport vehicle scheduling method and device, terminal equipment and readable storage medium |
-
2021
- 2021-09-01 CN CN202111021280.0A patent/CN113469466A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102324061A (en) * | 2011-05-19 | 2012-01-18 | 三一重工股份有限公司 | Pump-truck and agitating-truck combined-operation dispatching system, method thereof, agitating truck and pump truck |
| CN103593556A (en) * | 2013-09-11 | 2014-02-19 | 上海绿地建设(集团)有限公司 | Method for computing number of concrete mixer trucks |
| CN105551232A (en) * | 2015-12-14 | 2016-05-04 | 华北电力科学研究院有限责任公司 | Power service vehicle scheduling method, terminal, server and system |
| CN112288373A (en) * | 2020-11-18 | 2021-01-29 | 建国混凝土集团有限公司 | Vehicle distribution method and system |
| CN112529332A (en) * | 2020-12-25 | 2021-03-19 | 树根互联技术有限公司 | Concrete transport vehicle scheduling method and device, terminal equipment and readable storage medium |
Non-Patent Citations (4)
| Title |
|---|
| （加）杨天若等编著: "《移动智能》", 31 January 2014, 国防工业出版社 * |
| 丁军: ""车辆轨迹数据的若干处理方法研究"", 《交通信息与安全》 * |
| 唐连生 著: "《突发事件下的车辆路径问题研究》", 30 November 2011, 中国物资出版社 * |
| 宁涛 著: "《基于混合智能优化算法的车辆路径优化研究》", 30 June 2018, 中国铁道出版社 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113643010A (en) * | 2021-10-18 | 2021-11-12 | 氢山科技有限公司 | Order dispatching method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Pillac et al. | A review of dynamic vehicle routing problems | |
| US20120259540A1 (en) | Methods and systems for workforce management | |
| US20180314998A1 (en) | Resource Allocation in a Network System | |
| Cai et al. | Rescheduling policies for large-scale task allocation of autonomous straddle carriers under uncertainty at automated container terminals | |
| CN109596132A (en) | Vehicle dispatching method and device | |
| US20180349850A1 (en) | Transport Plan Generating Method and Transport Plan Generating System | |
| Mar-Ortiz et al. | A decision support system for a capacity management problem at a container terminal | |
| Bohnen et al. | Systematic procedure for leveling of low volume and high mix production | |
| Ma et al. | Stochastic programming approach for unidirectional quay crane scheduling problem with uncertainty | |
| Li et al. | A hybrid simulated annealing heuristic for multistage heterogeneous fleet scheduling with fleet sizing decisions | |
| KR20210008581A (en) | System for providing logistics transportation service for multi pick up and delivery with imporved navigation algorithm | |
| US20200250627A1 (en) | Method and system for cyclic scheduling | |
| Dong et al. | MIP model for inventory routing in industrial gases supply chain | |
| CN113469466A (en) | Vehicle scheduling method and device, electronic equipment and storage medium | |
| Chang et al. | Dynamic rolling strategy for multi-vessel quay crane scheduling | |
| Naumov et al. | Model of the Delivery Routes Forming Process as a Service Provided by Forwarding Companies | |
| Lee et al. | Improving fleet utilization for carriers by interval scheduling | |
| Benlaajili et al. | Optimization of truck-shovel allocation problem in open-pit mines | |
| US20140350984A1 (en) | Project management system and method | |
| Narayanan et al. | Using Lagrangian relaxation to solve ready mixed concrete dispatching problems | |
| CN110325937A (en) | System and method for selecting route to vehicle and vehicle being arranged to take | |
| He et al. | Beyond rebalancing: Crowd-sourcing and geo-fencing for shared-mobility systems | |
| Wang et al. | Robust optimization for the integrated berth allocation and quay crane assignment problem | |
| KR102285469B1 (en) | Cloud-based operation schedule providing device | |
| CN114781874A (en) | Dispatching method and system of transport vehicle and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20211001 |