CN113705966A - Vehicle transportation scheduling method for meeting road load rate in closed plant area - Google Patents
Vehicle transportation scheduling method for meeting road load rate in closed plant area Download PDFInfo
- Publication number
- CN113705966A CN113705966A CN202110820115.5A CN202110820115A CN113705966A CN 113705966 A CN113705966 A CN 113705966A CN 202110820115 A CN202110820115 A CN 202110820115A CN 113705966 A CN113705966 A CN 113705966A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- end point
- starting point
- load rate
- road load
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 15
- 238000013507 mapping Methods 0.000 claims abstract description 4
- 238000013461 design Methods 0.000 claims description 7
- 238000004364 calculation method Methods 0.000 claims description 5
- 239000000463 material Substances 0.000 description 9
- 229910000831 Steel Inorganic materials 0.000 description 4
- 238000006243 chemical reaction Methods 0.000 description 4
- 239000010959 steel Substances 0.000 description 4
- 238000005457 optimization Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- XEEYBQQBJWHFJM-UHFFFAOYSA-N Iron Chemical compound [Fe] XEEYBQQBJWHFJM-UHFFFAOYSA-N 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000003245 coal Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06315—Needs-based resource requirements planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- 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/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- 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 relates to the technical field of vehicle scheduling, and discloses a vehicle transportation scheduling method for meeting road load rate in a closed plant, which comprises the following steps: s1, data acquisition: drawing a factory floor base map, acquiring factory floor base map data, and acquiring road network information, vehicle information and cargo information through the base map data; s2, vehicle and goods matching: constructing a vehicle resource pool and a cargo resource pool, and mapping the vehicle resource pool and the cargo resource pool, wherein vehicles in the vehicle resource pool are used for transporting cargos in the cargo resource pool; s3, determining a start point-end point pair of transportation: determining a starting point and an end point of transportation according to business requirements, forming a starting point-end point pair by each starting point and the corresponding end point, and marking the starting point-end point pair in road network information; s4, constructing a scheduling model; and S5, planning the path through the constructed scheduling model. The invention avoids the overload work and damage of roads and nodes in operation, and provides reasonable path planning for goods transportation, thereby saving cost.
Description
Technical Field
The invention relates to the technical field of vehicle scheduling, in particular to a vehicle transportation scheduling method for meeting road load rate in a closed factory.
Background
Vehicle scheduling refers to the planning of a driving route, so that a vehicle orderly passes through a series of loading points and unloading points under the condition of meeting a certain constraint condition.
In a closed plant area, such as a closed steel plant area, there are numerous workshops, intersections and gates, and there is a need for transporting a large amount of materials, such as a large amount of coal, iron powder and the like; the starting point node of the material transporting vehicle must be a workshop, the end point node must also be the workshop, and because the transportation volume is large, the transportation of materials from a certain starting point to the end point generally needs a plurality of times to meet the transportation volume requirement, so the constraint conditions such as road load and the like need to be considered. Meanwhile, due to the particularity of certain special materials, the vehicles can only pass through special road sections, and one-way passing roads may exist in a factory area. Because the closed steel mill area is relatively small, but the transportation volume is huge, the constraint condition is complex, the operation is mostly carried out by depending on the experience of a driver at present, the efficiency is low, the congestion is easily caused, the overload work of a road is damaged, and the manpower, material resources and financial resources are consumed.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a vehicle transportation scheduling method for meeting the road load rate in a closed plant area to solve the problems.
In order to solve the technical problems, the invention adopts the following technical scheme:
a vehicle transportation scheduling method for meeting road load rate in a closed plant area comprises the following steps:
s1, data acquisition: drawing a factory floor base map, acquiring factory floor base map data, and acquiring road network information, vehicle information and cargo information through the base map data;
s2, vehicle and goods matching: constructing a vehicle resource pool and a cargo resource pool, and mapping the vehicle resource pool and the cargo resource pool, wherein vehicles in the vehicle resource pool are used for transporting cargos in the cargo resource pool;
s3, determining a start point-end point pair of transportation: determining a starting point and an end point of transportation according to business requirements, forming a starting point-end point pair by each starting point and the corresponding end point, and marking the starting point-end point pair in the road network information;
s4, constructing a scheduling model;
and S5, planning the path through the constructed scheduling model.
As optimization, in step S1, the road network information includes a workshop coordinate, a gate coordinate, a route endpoint coordinate, a road width, truck scale nodes, and connectivity of all routes, and the start point and the end point of transportation are workshops; the vehicle information comprises vehicle load, oil consumption and cargo type; the cargo information comprises cargo type and cargo amount, wherein the vehicle information and the cargo information correspond to the starting point-end point pair one to one.
As an optimization, in S4, the specific steps of constructing the scheduling model are as follows:
s4.1, generating a directed graph according to road network information, wherein the starting point-end point pairs are marked in the directed graph, each starting point-end point pair comprises at least one path, the truck scale nodes are arranged on the paths, and the road load rate of each path and the node operation rate of each truck scale node are calculated;
s4.2, calculating a shortest path of one starting point-terminal point pair, and if the shortest path exists, calculating the shortest path and entering S4.3; if no shortest path exists, the starting point-end point pair is marked, and the starting point returns to the step to recalculate the shortest path of another starting point-end point pair;
s4.3, updating road load rates of all paths and node operation rates of truck scale nodes;
s4.4, judging whether the updated road load rate exceeds a road load rate threshold value or not, and if the road load rate of the path exceeds the road load rate threshold value, setting the path as impassable; meanwhile, whether the updated node operation rates of all truck scale nodes exceed a node operation rate threshold value is judged, and if the node operation rates of the truck scale nodes exceed the node operation rate threshold value, the truck scale nodes are set to be unviable;
s4.5, judging whether all unmarked starting point-end point pairs find the shortest path, if so, ending; if not, S4.2 is entered, and the shortest path of the remaining unmarked starting point-end point pairs is searched.
As optimization, the specific calculation formula of the road load rate is as follows:
road load rate ═ Σ (vehicle count × conversion factor) × peak factor/design traffic capacity;
the invention has the beneficial effects that:
the road load condition of each path and the operation condition of the nodes can be calculated, the road and the nodes are prevented from being overloaded and damaged in actual operation, and reasonable path planning is provided for freight transportation, so that cost is saved.
Detailed Description
The present invention is further described with reference to specific examples to enable those skilled in the art to better understand the present invention and to practice the same, but the examples are not intended to limit the present invention. The technical solutions in the embodiments of the present invention will be described below in a clear and complete manner in conjunction with the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, rather than all embodiments, and the following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the present invention, its application, or uses. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present invention without any creative effort belong to the protection scope of the present invention. It is to be understood that the positional terms, such as "front" and "back", are used merely to facilitate describing the invention and to simplify the description, and in the absence of a contrary indication, these positional terms are not intended to indicate or imply that the apparatus or component so referred to must have a particular orientation or be constructed and operated in a particular orientation and therefore should not be considered as limiting the scope of the invention.
A vehicle transportation scheduling method for meeting road load rate in a closed plant area comprises the following steps:
s1, data acquisition: drawing a base map of the steel factory area through cad software, then acquiring factory area base map data through a corresponding technology, and acquiring road network information, vehicle information and cargo information through the base map data; specifically, the base map is drawn manually by cad, then the cad is converted into an shp map layer by arcmap, points and line segments are extracted by using a self-contained interface, and corresponding point coordinates are obtained, so that road network information (coordinates and connectivity of each road segment endpoint) is obtained
S2, vehicle and goods matching: constructing a vehicle resource pool and a cargo resource pool, and mapping the vehicle resource pool and the cargo resource pool, wherein vehicles in the vehicle resource pool are used for transporting cargos in the cargo resource pool; for example, when a certain cargo is transported from a starting point to an end point, a corresponding transportable vehicle is found according to the cargo resource pool, the vehicle is matched with the vehicle resource pool, if a plurality of vehicles are satisfied, one vehicle is selected immediately, and then the resource pool is updated.
S3, determining a start point-end point pair of transportation: determining a starting point and an end point of transportation according to business requirements, forming a starting point-end point pair by each starting point and the corresponding end point, and marking the starting point-end point pair in the road network information;
according to the service requirement, a certain starting point can correspond to a plurality of end points, so that the data can be sorted into a plurality of starting point-end point pairs.
S4, constructing a scheduling model;
and S5, planning the path through the constructed scheduling model.
In this embodiment, in step S1, the road network information includes a workshop coordinate, a gate coordinate, a path endpoint coordinate, a road width, truck scale nodes, and connectivity of all paths, and the start point and the end point of transportation are both a workshop; the vehicle information comprises vehicle load, oil consumption and cargo type; the cargo information comprises cargo type and cargo amount, wherein the vehicle information and the cargo information correspond to the starting point-end point pair one to one. That is, one vehicle corresponds to one start point and one end point; one starting point has only one kind of goods, and one end point can require a plurality of kinds of goods.
In this embodiment, the model construction has the following basic assumptions:
(1) one vehicle is only allowed to load one material and is only allowed to serve one workshop, namely, one vehicle corresponds to one starting point and one ending point in the transportation process of the same batch;
(2) if a workshop (terminal) needs more materials and needs more than 1 vehicle for transportation, it is assumed that the arrival time of a plurality of vehicles on a certain road section is the same, (that is, the arrival time difference between the front and the back of the vehicles can be ignored, and the vehicles are considered to arrive at the same time) rather than the successive vehicles. And any material transportation, as well as empty vehicles, may exist in each section of the route;
meanwhile, the model is constructed with the following constraints:
(1) road load rate constraint: the road load rate is required to be met during vehicle transportation;
(2) and (3) road directivity constraint: some paths can only pass in one direction due to particularity;
(3) and (3) node constraint of the truck scale: certain materials must pass through a fixed place during transportation, and the node operation rate of the point is met;
(4) and (3) load capacity constraint: the vehicle cannot be overloaded.
The specific steps for constructing the scheduling model are as follows:
s4.1, generating a directed graph according to road network information, wherein the starting point-end point pairs are marked in the directed graph, each starting point-end point pair comprises at least one path, the truck scale nodes are arranged on the paths, and the road load rate of each path and the node operation rate of each truck scale node are calculated; inputting the road network information into a python library network x to generate a directed graph;
s4.2, calculating a shortest path of one starting point-terminal point pair, and if the shortest path exists, calculating the shortest path and entering S4.3; if the shortest path does not exist, the starting point-end point pair is marked, the starting point-end point pair is recorded into a file, and the step of returning to the starting point to recalculate the shortest path of another starting point-end point pair is carried out. If the starting point-end point pair needs to pass through the truck scale node, the obtained shortest path must include the truck scale node, and the condition that the shortest path does not exist in the starting point-end point pair means that the load rate of a certain road section in all paths from the starting point to the end point reaches a threshold value and cannot reach the end point from the starting point, and at the moment, the processing is carried out according to the business requirements, such as the processing is carried out in the next day.
The shortest path may be found by an open source shortest path algorithm, such as Dijkstra (Dijkstra) algorithm, and the like.
And S4.3, updating the road load rates of all paths and the node operation rate of the truck scale nodes.
After the shortest path of a certain starting point-end point pair is obtained, the vehicle quantity, the vehicle type, whether the vehicle needs to pass through the truck scale and other data of the shortest path are obtained, so the road load rate of the shortest path and the node operation rate of the truck scale node are changed and need to be updated in time.
S4.4, judging whether the updated road load rate exceeds a road load rate threshold value or not, and if the road load rate of the path exceeds the road load rate threshold value, setting the path as impassable; and meanwhile, judging whether the updated node operation rates of all truck scale nodes exceed a node operation rate threshold value or not, and if the node operation rates of the truck scale nodes exceed the node operation rate threshold value, setting the truck scale nodes as impassable. The starting point-end point pair does not have the shortest path, which indicates that the road load rate of the path corresponding to the starting point-end point pair reaches the threshold value, the vehicle cannot pass through continuously, the road load rate and the node operation rate are increased once every time the road load rate and the node operation rate are updated, and the road section which reaches the threshold value before cannot be reduced any more, so that the situation that the shortest path exists in the starting point-end point pair marked to have no shortest path before after the road load rate and the node operation rate are updated does not occur.
Firstly, according to the actual situation, threshold values of road load rate and node operation rate are given, for example: the road load rate threshold and the node operation rate threshold are both (0,1), and the threshold is given by human, for example, default 0.8, and can be adjusted.
Then, each time the shortest path is calculated, the current road load rate and the node operation rate are obtained and compared with the threshold value. Setting up the non-communication session, and dynamically modifying the road network graph information in the calculation process, for example, changing the connectivity of the current two points into non-communication.
S4.5, judging whether all unmarked starting point-end point pairs find the shortest path, if so, ending; if not, S4.2 is entered, and the shortest path of the remaining unmarked starting point-end point pairs is searched.
In this embodiment, the specific calculation formula of the road load rate is as follows:
road load rate ═ Σ (vehicle count × conversion factor) × peak factor/design traffic capacity;
wherein, the value range of the conversion coefficient is 1-2: the value range of the peak coefficient is 1-2; because the calculation of the road load rate is based on the marked vehicle (the default is the empty vehicle), if the marked vehicle is required to be converted into the heavy vehicle, the conversion coefficient is related to the vehicle weight, and if the conversion coefficient is 1.5; the peak coefficient simulates the peak time situation, for example, the peak coefficient is 1.2.
Vehicle conversion factors are as follows:
the peak factor is designed by itself, for example, by estimating 50% of the day at peak operation, 80% of the total number of vehicles are to be operated, and the peak factor may be 0.8/0.5-1.6.
Roads outside the steel plant are generally second-level roads, and the basic section design traffic capacity of the roads is as follows:
the design traffic capacity of the second-level road section and the third-level road section is selected according to the design speed and the proportion of the inaccurate overtaking area in the road section according to the table 3.4.1.
TABLE 3.4.1 design traffic capacities for second and third level road sections
In this embodiment, the node operation rate is a ratio of actual transit time in one day to total time of day, and the specific formula is
Finally, it should be noted that: various modifications and alterations of this invention may be made by those skilled in the art without departing from the spirit and scope of this invention. Thus, it is intended that the present invention cover the modifications and variations of this invention provided they come within the scope of the appended claims and their equivalents.
Claims (5)
1. A vehicle transportation scheduling method for meeting road load rate in a closed plant area is characterized by comprising the following steps:
s1, data acquisition: drawing a factory floor base map, acquiring factory floor base map data, and acquiring road network information, vehicle information and cargo information through the base map data;
s2, vehicle and goods matching: constructing a vehicle resource pool and a cargo resource pool, and mapping the vehicle resource pool and the cargo resource pool, wherein vehicles in the vehicle resource pool are used for transporting cargos in the cargo resource pool;
s3, determining a start point-end point pair of transportation: determining a starting point and an end point of transportation according to business requirements, forming a starting point-end point pair by each starting point and the corresponding end point, and marking the starting point-end point pair in road network information;
s4, constructing a scheduling model;
and S5, planning the path through the constructed scheduling model.
2. The vehicle transportation scheduling method meeting the road load rate in the closed plant area according to claim 1, wherein in step S1, the road network information includes a workshop coordinate, a gate coordinate, a path end point coordinate, a road width, a truck scale node and connectivity of all paths, and a start point and an end point of transportation are workshops; the vehicle information comprises vehicle load, oil consumption and cargo type; the cargo information includes cargo type and cargo amount.
3. The vehicle transportation scheduling method satisfying the road load rate in the closed plant area according to claim 2, wherein in S4, the specific steps of constructing the scheduling model are as follows:
s4.1, generating a directed graph according to road network information, wherein the starting point-end point pairs are marked in the directed graph, each starting point-end point pair comprises at least one path, the truck scale nodes are arranged on the paths, and the road load rate of each path and the node operation rate of each truck scale node are calculated;
s4.2, calculating a shortest path of one starting point-terminal point pair, and if the shortest path exists, calculating the shortest path and entering S4.3; if no shortest path exists, the starting point-end point pair is marked, and the starting point returns to the step to recalculate the shortest path of another starting point-end point pair;
s4.3, updating road load rates of all paths and node operation rates of truck scale nodes;
s4.4, judging whether the updated road load rate exceeds a road load rate threshold value or not, and if the road load rate of the path exceeds the road load rate threshold value, setting the path as impassable; meanwhile, whether the updated node operation rates of all truck scale nodes exceed a node operation rate threshold value is judged, and if the node operation rates of the truck scale nodes exceed the node operation rate threshold value, the truck scale nodes are set to be unviable;
s4.5, judging whether all unmarked starting point-end point pairs find the shortest path, if so, ending; if not, S4.2 is entered, and the shortest path of the remaining unmarked starting point-end point pairs is searched.
4. The vehicle transportation scheduling method satisfying the road load rate in the closed plant area according to claim 1, wherein the specific calculation formula of the road load rate is as follows:
road load rate ∑ (vehicle count ×) peak factor/design capacity.
5. The vehicle transportation scheduling method for satisfying road load rate in closed plant area according to claim 3, wherein said method is characterized in that
。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110820115.5A CN113705966B (en) | 2021-07-20 | 2021-07-20 | Vehicle transportation scheduling method for meeting road load rate in closed factory |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110820115.5A CN113705966B (en) | 2021-07-20 | 2021-07-20 | Vehicle transportation scheduling method for meeting road load rate in closed factory |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113705966A true CN113705966A (en) | 2021-11-26 |
| CN113705966B CN113705966B (en) | 2024-01-26 |
Family
ID=78649020
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110820115.5A Active CN113705966B (en) | 2021-07-20 | 2021-07-20 | Vehicle transportation scheduling method for meeting road load rate in closed factory |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113705966B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117273606A (en) * | 2023-09-19 | 2023-12-22 | 中油管道物资装备有限公司 | Unmanned carrier scheduling method and system based on intelligent warehouse |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2777502A1 (en) * | 2009-05-05 | 2010-11-11 | Exxonmobil Research And Engineering Company | Method for optimizing a transportation scheme |
| CN110210666A (en) * | 2019-05-31 | 2019-09-06 | 合肥工业大学 | Intelligent recommendation method, system and storage medium based on vehicle and goods matching |
| CN110986990A (en) * | 2019-12-25 | 2020-04-10 | 西安主函数智能科技有限公司 | Method and system for planning paths of unmanned engineering vehicle in closed environment |
| CN111174797A (en) * | 2020-01-16 | 2020-05-19 | 湖南大学 | Closed area global path planning method |
| KR102190164B1 (en) * | 2019-11-15 | 2020-12-11 | (주)오픈메이트 | Loaded vehicle inspection detour decision system and control method thereof |
| CN112580849A (en) * | 2020-11-13 | 2021-03-30 | 重庆恢恢信息技术有限公司 | Method for carrying out vehicle scheduling work on construction site according to block chain network |
-
2021
- 2021-07-20 CN CN202110820115.5A patent/CN113705966B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2777502A1 (en) * | 2009-05-05 | 2010-11-11 | Exxonmobil Research And Engineering Company | Method for optimizing a transportation scheme |
| CN110210666A (en) * | 2019-05-31 | 2019-09-06 | 合肥工业大学 | Intelligent recommendation method, system and storage medium based on vehicle and goods matching |
| KR102190164B1 (en) * | 2019-11-15 | 2020-12-11 | (주)오픈메이트 | Loaded vehicle inspection detour decision system and control method thereof |
| CN110986990A (en) * | 2019-12-25 | 2020-04-10 | 西安主函数智能科技有限公司 | Method and system for planning paths of unmanned engineering vehicle in closed environment |
| CN111174797A (en) * | 2020-01-16 | 2020-05-19 | 湖南大学 | Closed area global path planning method |
| CN112580849A (en) * | 2020-11-13 | 2021-03-30 | 重庆恢恢信息技术有限公司 | Method for carrying out vehicle scheduling work on construction site according to block chain network |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117273606A (en) * | 2023-09-19 | 2023-12-22 | 中油管道物资装备有限公司 | Unmanned carrier scheduling method and system based on intelligent warehouse |
| CN117273606B (en) * | 2023-09-19 | 2024-04-12 | 中油管道物资装备有限公司 | Unmanned carrier scheduling method and system based on intelligent warehouse |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113705966B (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109308540B (en) | Distribution plan generation method, device and system for distribution vehicle | |
| CN110659839A (en) | Intelligent logistics stowage scheduling method | |
| CN106803136A (en) | A kind of fresh dispatching real-time optimization method based on genetic algorithm | |
| CN108364105A (en) | A kind of purpose optimal method of logistics distribution circuit | |
| CN102542395A (en) | Emergency material dispatching system and calculating method | |
| US20200327497A1 (en) | System and method for linehaul optimization | |
| CN113962639B (en) | Distribution path planning method and system based on global map | |
| De Jong et al. | Distribution and modal split models for freight transport in The Netherlands | |
| CN107862493A (en) | A kind of goods stock matching travels on the way the numerical value determination methods of goods nearby | |
| Shpak et al. | Strategic development of cargo transit services: a case study analysis | |
| CN114580750A (en) | Improved analysis method of regional vehicle path planning dynamic analysis model | |
| Royo et al. | Solving a longdistance routing problem using ant colony optimization | |
| CN113705966A (en) | Vehicle transportation scheduling method for meeting road load rate in closed plant area | |
| Moutaoukil et al. | A comparison of homogeneous and heterogeneous vehicle fleet size in green vehicle routing problem | |
| CN117196457A (en) | Logistics transportation path planning method based on Internet | |
| CN110705781A (en) | Truck and logistics transportation matching method | |
| CN113379102B (en) | Multi-network trunk transport optimization method, computer equipment and storage medium | |
| CN114492904A (en) | Transportation path optimization method of logistics management system | |
| Zhang et al. | Application and validation of dynamic freight simulation–assignment model to large-scale intermodal rail network: Pan-European case | |
| CN111126913A (en) | Rapid logistics transfer processing method and system | |
| CN109034494A (en) | Bus dispatching method | |
| Jakara et al. | VEHICLE ROUTING PROBLEM-CASE STUDY ON LOGISTICS COMPANY IN CROATIA. | |
| CN112069391B (en) | Geohash-based cargo forward road carpooling method | |
| Lemardelé et al. | Does size really matter? Dual distribution channel with vans and autonomous delivery devices | |
| Carreira et al. | Inland intermodal freight transport modelling |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |