CN115115172A - Intelligent dispatching system for passenger and cargo vehicles and storage medium - Google Patents
Intelligent dispatching system for passenger and cargo vehicles and storage medium Download PDFInfo
- Publication number
- CN115115172A CN115115172A CN202210525982.0A CN202210525982A CN115115172A CN 115115172 A CN115115172 A CN 115115172A CN 202210525982 A CN202210525982 A CN 202210525982A CN 115115172 A CN115115172 A CN 115115172A
- Authority
- CN
- China
- Prior art keywords
- vehicle
- warehouse
- information
- platform
- station
- 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
- 238000007726 management method Methods 0.000 claims abstract description 50
- 238000013439 planning Methods 0.000 claims abstract description 48
- 238000012544 monitoring process Methods 0.000 claims abstract description 25
- 230000006855 networking Effects 0.000 claims abstract description 9
- 238000004891 communication Methods 0.000 claims abstract description 5
- 238000013459 approach Methods 0.000 claims description 12
- 238000012384 transportation and delivery Methods 0.000 claims description 5
- 238000004590 computer program Methods 0.000 claims description 3
- 238000012790 confirmation Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 4
- 238000000034 method Methods 0.000 description 15
- 230000006870 function Effects 0.000 description 11
- 230000006399 behavior Effects 0.000 description 9
- 230000006872 improvement Effects 0.000 description 7
- 230000008569 process Effects 0.000 description 7
- 238000003032 molecular docking Methods 0.000 description 5
- 230000011218 segmentation Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 238000013461 design Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 3
- 230000018109 developmental process Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003993 interaction Effects 0.000 description 3
- 238000007781 pre-processing Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 238000012549 training Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 201000010099 disease Diseases 0.000 description 1
- 208000037265 diseases, disorders, signs and symptoms Diseases 0.000 description 1
- 238000003708 edge detection Methods 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000002068 genetic effect Effects 0.000 description 1
- 230000015654 memory Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000000630 rising effect Effects 0.000 description 1
- 238000004904 shortening Methods 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
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/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/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
-
- 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
-
- 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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- 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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Tourism & Hospitality (AREA)
- Theoretical Computer Science (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to an intelligent dispatching system for a passenger-cargo vehicle, which comprises an information management subsystem, an information inquiry subsystem, an internet-of-vehicles data subsystem and a transportation sequence planning subsystem; the information management subsystem is configured to manage vehicle information and platform/warehouse information; the information inquiry subsystem is configured to inquire vehicle information, order information, vehicle and goods matching information, driver information and goods warehouse matching information; the vehicle networking data subsystem is configured for platform/warehouse information management, vehicle shift information management and vehicle driving behavior monitoring; the transportation sequence planning subsystem is configured for planning a vehicle driving path. The system can improve the information collection capacity, the data processing capacity, the overall coordination capacity and the information release capacity, enhance the information communication and exchange capacity between the vehicle and the command center, and further improve the safety management efficiency of the running vehicle.
Description
Technical Field
The present disclosure relates to transportation, and more particularly to an intelligent dispatching system for passenger and cargo vehicles and a storage medium.
Background
In recent years, the demand of people on transportation is increasing day by day, and the trend of rapid growth is presented, the rapid development of highway construction in all parts of the country brings rapid development conditions for the transportation market of coaches and freight vehicles, the development of the urban passenger and freight transport industry is rapid, and the quantity and the scale of passenger transport and freight transport vehicles are also in the trend of rising.
The informatization level of the transportation safety management in partial areas of China is not very high, so that the running of the passenger transportation dangerous vehicles still lacks effective management and monitoring, the running management effect is not high, and the speed condition of the running vehicles cannot be known and controlled. "two passengers and one dangerous" refers to a chartered bus engaged in travel, a passenger train with more than three classes of lines, and a special road vehicle for transporting dangerous chemicals, fireworks and crackers, and civil explosive. Due to the relatively poor operation management and scheduling and dispatching capacity of the large vehicles engaged in the transportation industry, management defects and common diseases are brought: management confusion in the automobile transportation industry, low vehicle operation efficiency, high management cost of vehicles and working drivers, scattered plans for departure and dispatching of vehicles, and the like.
Disclosure of Invention
In view of the prior art, the technical problem to be solved by the invention is to provide an intelligent dispatching system for passenger-cargo vehicles, which improves the information collection capability, the data processing capability, the overall coordination capability and the information release capability, enhances the information communication and exchange capability between the vehicles and a command center, and further improves the safety management efficiency of the running vehicles.
In order to solve the technical problems, the technical scheme of the invention is as follows:
in a first aspect, the invention provides an intelligent dispatching system for a passenger-cargo vehicle, which comprises an information management subsystem, an information inquiry subsystem, an internet of vehicles data subsystem and a transportation sequence planning subsystem;
the information management subsystem is configured to manage vehicle information and platform/warehouse information;
the information inquiry subsystem is configured for inquiring vehicle information, order information, vehicle and cargo matching information, driver information and cargo cabin matching information;
the vehicle networking data subsystem is configured for platform/warehouse information management, vehicle shift information management and vehicle driving behavior monitoring;
the transportation sequence planning subsystem is configured for planning a vehicle driving path.
In the technical scheme, the passenger-cargo vehicle intelligent scheduling system is used for solving a series of problems of detection service, real-time scheduling, information service and the like at the end of a driver through the mutual cooperation of the information management subsystem, the information inquiry subsystem, the Internet of vehicles data subsystem and the transportation sequence planning subsystem, realizing the real-time tracking and analysis of vehicles which are in danger of two passengers and one passenger, performing relevant early warning processing, realizing the functions of early warning before accidents occur, tracing after the accidents occur and the like, and further reducing the accident rate.
As a further improvement of the invention, the planning of the vehicle running path is to plan the optimal loading path of the vehicle according to the station/warehouse serial number of the order and the scheduling information of the vehicles at each station/warehouse, provide the order and schedule of loading and loading for the driver, and monitor and position the driver in real time by combining the corresponding management mechanism, thereby improving the loading and unloading efficiency, shortening the queuing time and improving the operating efficiency of the vehicle. The optimal loading path planning comprises the following steps:
identifying vehicle information for vehicles entering a passenger station/warehouse;
acquiring order information corresponding to the vehicle and passenger/storage information corresponding to the order;
planning a passenger carrying/goods taking sequence with the minimum time cost for the vehicle according to the queuing condition of the existing platform/warehouse information, and updating the planning scheme to the queuing information of the warehouse in the park;
sending a goods taking sequence to a mobile phone end of a driver, and simultaneously updating a vehicle database of a platform/warehouse;
monitoring the arrival condition of the vehicle, and allowing the planning of parking, passenger carrying and goods taking of the vehicle;
when the vehicle carries passengers \ picks up goods and leaves, the receiving driver submits passengers \ picks up goods confirmation, the vehicle position section information is updated until all the passengers \ picks up goods are completed, and the vehicle is allowed to leave the passenger station \ park after the monitoring information is verified to be correct.
As a further improvement of the invention, a 'two-passenger one-dangerous' vehicle path model is constructed, a passenger carrying and loading sequence and a timetable are provided for a driver, and the driver is monitored and positioned in real time by combining a corresponding management mechanism, so that the loading and unloading efficiency is improved, the queuing time is shortened, and the vehicle operation efficiency is improved. The minimum passenger carrying or goods taking path sequence is obtained through the following steps:
establishing a starting and ending point and path platform/warehouse set N, and acquiring the distance d between each platform/warehouse ij Establishing a communication network G, wherein the distance set is D, and G is (N, D);
obtaining the running time T between each station/warehouse ij ；
The vehicle travel path is obtained by causing the following objective function to satisfy the following constraint condition:
an objective function:
constraint conditions are as follows:
(1) the running time of each passing platform/warehouse is as follows:
(2) and (3) weight restraint:
(3) distance constraint:
(4) cargo volume or passenger number constraints:
(5) flow conservation constraint:
(6) each approach platform/warehouse must be serviced by a single vehicle at a time:
(7) vehicle entering from starting point and exiting from terminal:
∑ j∈N X Ojk ＝∑ j∈N X jOk ，
(8) time for vehicle to arrive at approach station/warehouse:
(9) time when the vehicle leaves the passing platform/warehouse:
(10) service time of approach station/warehouse i:
(11) queuing time of approach station \ warehouse i:
(12) and (3) eliminating sub-loop constraint:
U ik -U jk +n·X ijk ≤n-1，
in the formula:
X ijk represents the j platforms/warehouses from the ith platform/warehouse of the vehicle k; k denotes a set of delivery vehicles, K ═ {1, 2, …, K }; p is a radical of i Queuing time for the vehicle at the ith station/warehouse; t is ij Represents the running time of the vehicle from the ith platform/warehouse to the j platforms/warehouses; v is the vehicle speed; l is k Is the maximum distance traveled by vehicle k; d ij The distance from the ith station \ warehouse to the j stations \ warehouses; a is the set of all nodes, a ═ {1, 2, …, n }, n is the total number of nodes; q. q of i The passenger capacity and the goods taking capacity of the vehicle at the ith platform and warehouse; q k Loading the vehicle k; v k Representing the volume, v, of the vehicle k i The volume or maximum passenger capacity of the cargo loaded on the ith platform/warehouse for the vehicle; c 1 Vehicle transportation cost per unit mileage; c 2 Vehicle queuing cost per unit time; hh is the time required to process a unit; EE i The busy time of the ith station/warehouse is the upper limit; LL (LL) i Indicating busy time of i-th station/warehouseA lower bound; SE1 ik Time for vehicle K to arrive at the ith station/warehouse; SE2 ik The time that vehicle K leaves the ith station/warehouse; s i Representing the service time of the vehicle at the ith station \ warehouse; u is an auxiliary variable to avoid generating a self loop in a circuit; o denotes a station entry, and O ═ 1 }.
As a further improvement of the above technical solution: the objective function utilizes the ant colony algorithm to solve the paths meeting the constraint conditions, and utilizes the strong global search capability of the ant colony algorithm to converge in a short time, so that the current optimal path is obtained.
In the above technical scheme: the vehicle information comprises a license plate, a vehicle type, a size, a rated load, a driver name, an identification photo and a contact phone, and the vehicle information is managed by taking the license plate as a keyword.
As a further improvement of the above technical solution, in the vehicle shift scheduling path and time planning process, the vehicle shift information of the vehicle platform/warehouse has a core influence on the output result of the model. Therefore, on the basis of inquiring vehicle matching list and warehouse information, the use condition of each docking station/warehouse needs to be mastered in real time, so that the scheduling condition of each station/warehouse in a future period of time can be predicted, and effective input quantity can be obtained. In addition, in order to prevent the driver from being unable to arrive at the designated stop point in time or not loading goods according to the planned route due to wrong route, and also to prevent the driver from fatigue driving or illegal speeding or other illegal driving problems, it is necessary to design a module for monitoring whether the driver arrives at the designated platform/warehouse on time and an early warning module. The vehicle networking data subsystem comprises a platform/warehouse information management module, a vehicle scheduling information management module and a vehicle driving behavior monitoring module;
the platform \ warehouse information management module is configured for receiving information fed back by scanning of a platform \ warehouse camera in real time, updating the using state of the platform \ warehouse and updating the using state of the platform \ warehouse synchronously with the queuing information of the warehouse; the busy period for each docking station/warehouse is planned based on the time of the first inbound vehicle that is present on the day. The first vehicle enters the platform/warehouse, all the platforms/warehouses are in an idle state, and the platform number to be loaded and the working busy time are determined by planning the loading path. The platform receives the information fed back by the platform \ warehouse camera scanning in real time, updates the using state of the platform \ warehouse and updates synchronously with the queuing condition of the warehouse. When the next vehicle enters the platform \ warehouse for carrying passengers or loading goods, if the previous vehicle has not finished carrying passengers or loading goods, the busy time period for the platform \ warehouse which is busy originally during the planning of the passenger carrying \ assembly path will be changed.
The vehicle scheduling information management module is configured to update and record vehicle queuing and station entering and exiting information of each station/warehouse on the day in real time, so that vehicle scheduling and station entering time are reasonably arranged, and time and space resources of the station/warehouse are utilized to the maximum extent.
The vehicle driving behavior monitoring module is configured to monitor whether the vehicle is loaded according to a planned path, whether the vehicle violates a rule, whether the vehicle illegally drives, and whether the vehicle reaches a specified platform/warehouse within a specified time. If the system does not receive the notification of the change of the vehicle section information, the system indicates that the vehicle reaches the appointed platform/warehouse within the specified time according to the planned path; if the system receives the notification of the change of the vehicle section information, the model needs to be called to plan the loading path for the driver again based on the real-time situation. If the system receives illegal driving behaviors such as overspeed, fatigue driving and the like, early warning is sent to a driver to remind the driver of normative driving operation; and if the illegal and illegal driving notice is not received, the vehicle is driven normally.
As a further improvement of the above technical solution: the vehicle networking data subsystem comprises a vehicle recognition device, and is used for photographing vehicles through a camera, recognizing license plates through images, and uploading the recognized license plate information to a shared database server. The database server sends a data updating request to the platform system, and the platform searches for the license plate information of the vehicle at the parking vehicle retrieval position after receiving the data updating. The intelligent passenger-cargo vehicle dispatching system finds the order information distributed in advance and passenger station/warehouse information corresponding to the order through the license plate information, and checks the busy time period of the station/warehouse, the position of the station and the inbound/park time of the vehicle. Calculating the station/warehouse which the vehicle needs to go to, avoiding unnecessary queuing and roundabout, outputting the optimal path of the vehicle to the station/warehouse, setting a time window for the vehicle to arrive at the station/warehouse, waiting before the time window, and considering the path as invalid when the vehicle arrives after the time window, and planning the path for the vehicle again.
As a further improvement of the technical scheme: the system also comprises a vehicle outbound and inbound information check module, which is used for planning the vehicle running path output by the transportation sequence planning subsystem according to the license plate obtained by the vehicle recognition device, and judging whether the vehicle carries passengers and takes goods according to the path or whether the passengers and takes goods are finished; and prompting that the vehicle is not matched with the passenger carrying or goods taking information of the current platform/warehouse for the vehicle which is not planned according to the path.
As a further improvement of the above technical solution: the vehicle in-and-out station information checking module identifies a running license plate before the vehicle leaves the station/warehouse, and judges and prompts whether the vehicle runs through passengers or goods according to the vehicle running path plan output by the transportation sequence planning subsystem.
In a second aspect, the invention proposes a computer-readable storage medium storing a computer program that can be loaded by a processor and executed by any of the systems described above.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.
FIG. 1, a block diagram of one embodiment of an intelligent dispatch system for a passenger or cargo vehicle;
FIG. 2 is an interaction diagram of an intelligent dispatching system for a passenger and cargo vehicle in one embodiment.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The informatization level of the transportation safety management in partial areas of China is not very high, so that the operation of passenger transport/dangerous transport vehicles still lacks of effective management and monitoring, the operation management effect is not high, and the speed condition of the running vehicles cannot be known and mastered. Meanwhile, the monitoring platform sometimes alarms and is not linked with the actual situation in the using process, and in the embodiment 1, the intelligent dispatching system for the passenger-cargo vehicles is deployed to carry out overall coordination management on the passenger-cargo vehicles.
As shown in FIG. 1, the intelligent dispatching system for the passenger-cargo vehicles comprises an information management subsystem, an information inquiry subsystem, an internet of vehicles data subsystem and a transportation sequence planning subsystem. The information management subsystem is configured to manage vehicle information and platform/warehouse information; the information inquiry subsystem is configured for inquiring vehicle information, order information, vehicle and cargo matching information, driver information and cargo cabin matching information; the vehicle networking data subsystem is configured for platform/warehouse information management, vehicle shift information management and vehicle driving behavior monitoring; the transportation sequence planning subsystem is configured for planning a vehicle driving path. All the functions and body information of each subsystem are shown in table 1.
TABLE 1
Each subsystem is designed as follows:
(1) information management subsystem
According to the requirement of system design data, the platform is used for butting the original database of the enterprise with 'two guests and one danger', and is combined with the WeChat of the enterprise, so that cross-platform intelligent scheduling management is realized. The information management subsystem comprises four parts of platform \ warehouse information, order information, vehicle information and vehicle parking platform \ warehouse information.
1.1, platform/warehouse information: recording the number, serial number and distribution of the platform/warehouse, the goods category, serial number, name, inventory, remaining available space and the like in the warehouse;
1.2, vehicle information: recording basic information of the vehicle, namely license plate number, vehicle type, size, rated load, driver name, certificate photo, contact phone and the like;
1.3, order information: recording order number, delivery date, transport address, cargo number and class, affiliated platform/warehouse, driver name, driving experience, contact phone and the like;
1.4, docking station/warehouse information: as an illustration.
(2) Information inquiry subsystem
According to the assembly planning data requirement, the usable information is required to be called from the database in the subsystem, so that the fixed input quantity is obtained, and data support is provided for planning the assembly path of the subsequent calling model. The information inquiry subsystem comprises three parts of vehicle information inquiry, inventory information and warehouse information matching:
2.1, vehicle information inquiry: a platform operator inputs a license plate number to inquire information such as the type, the size, the rated load, the name and the telephone of an inbound vehicle;
2.2, bill matching information: inquiring the order details and the delivery date of the vehicle on the basis of the operation;
2.3, matching passenger/warehouse information: and comparing the platform database according to the order information to determine the number of the platform \ warehouse, the platform \ warehouse number and the passenger \ goods category number which need to be taken by passengers or goods.
(3) Internet of vehicles data subsystem
In the vehicle scheduling path and time planning process, the station/warehouse vehicle in-out scheduling information has a core influence on the output result of the model. Therefore, on the basis of inquiring vehicle matching list and warehouse information, the use condition of each docking station/warehouse needs to be mastered in real time, so that the scheduling condition of each station/warehouse in a future period of time can be predicted, and effective input quantity can be obtained. In addition, in order to prevent the driver from being unable to arrive at the designated stop point in time or not loading goods according to the planned route due to wrong route, and also to prevent the driver from fatigue driving or illegal speeding or other illegal driving problems, it is necessary to design a module for monitoring whether the driver arrives at the designated platform/warehouse on time and an early warning module. The vehicle networking data subsystem comprises three parts, namely platform/warehouse information management, vehicle scheduling information management and vehicle driving behavior monitoring.
3.1, a platform/warehouse information management module: the busy period for each docking station/warehouse is scheduled based on the time of the first inbound vehicle on the current day. The first vehicle enters the platform/warehouse, all the platforms/warehouses are in an idle state, and the platform number to be loaded and the working busy time are determined by planning the loading path. The platform receives the information fed back by the platform \ warehouse camera in real time, updates the using state of the platform \ warehouse and synchronously updates the queuing condition of the platform \ warehouse. When the next vehicle enters the platform \ warehouse to get passengers or get goods, if the vehicles in the former period are not completely loaded, the busy time period for originally busy platform \ warehouse will be changed when the passenger carrying \ assembly path is planned.
3.2, a vehicle scheduling information management module: vehicle queuing and station entering and exiting conditions of each station/warehouse on the day are updated and recorded in real time, vehicle scheduling and entering time is reasonably arranged, and time and space resources of the station/warehouse are utilized to the maximum extent;
3.3, a vehicle driving behavior monitoring module: and monitoring whether the vehicle is loaded according to the planned route, and whether the vehicle violates rules, drives illegally and the like. If the system does not receive the notification of the change of the vehicle section information, the vehicle arrives at the appointed station/warehouse within the specified time according to the planned path; if the system receives the notification of the change of the vehicle section information, the model needs to be called to plan the loading path for the driver again based on the real-time situation. If the system receives illegal driving behaviors such as overspeed, fatigue driving and the like, early warning is sent to a driver to remind the driver of normative driving operation; and if the illegal and illegal driving notification is not received, the vehicle is driven normally.
(4) Transportation sequence planning subsystem
The assembly sequence planning subsystem has only one function to be realized: and a fixed-format route schedule is output, so that a driver can clearly determine which time slot goes to which platform/warehouse. Therefore, the optimal loading path planning is carried out on the vehicle according to the station \ warehouse serial number of the order and the scheduling information calling model of the vehicle at each station \ warehouse.
In addition, in order to enable the driver to obtain information feedback in time, the system can further comprise a mobile phone terminal management system: the method is used for information interaction between the cloud platform and the driver mobile phone terminal, and comprises the functions of data sharing and information interaction, namely sending a notice to the mobile phone terminal and receiving terminal information feedback. The mobile phone terminal provides driving sequence, loading time, information condition and other reminders for the driver, monitors the driver behavior, tracks the loading progress of the driver, tracks the order completion state, monitors the driving route of the driver, and effectively reduces cost and improves efficiency of enterprises.
One scenario for a vehicle operating under the above system is illustrated in fig. 2:
1: when a passenger vehicle reaches the entrance of the park;
2: the server at the entrance and the exit identifies the license plate of the vehicle;
3: a platform operator logs in a platform interface, wherein the platform operator can be a driver or a manager;
4: a platform operator inquires orders;
5: a platform operator receives detailed records of orders returned by the system;
6: a platform operator performs warehouse matching query;
7: a monitoring module of the platform/warehouse receives a platform/warehouse scheduling query sent by a system;
8. the monitoring module feeds back platform \ warehouse queuing information to a platform operator;
9: a platform operator sends a request for planning a passenger carrying/goods taking path to a system;
10: the system feeds back a passenger carrying/goods taking path to a driver;
11: the vehicle carries out passenger carrying \ goods taking and sends passenger carrying \ goods loading progress feedback to the system in real time;
12: when the vehicles finish carrying passengers \ picking goods, the vehicles are taken out of the park.
The dispatching management of the goods taking vehicle needs the information sharing of the passenger station/logistics park, the Internet of vehicles and the Internet of things cooperate together, and the information needed by the planning of the goods taking path is taken as a basis. Whether the vehicle carries a passenger according to the route, gets goods and whether accomplish and carry a passenger, gets goods, needs monitored control system, entry monitored control system monitor, as follows to the vehicle design flow that does not carry out according to expectation:
(1) the platform/warehouse monitors wrong vehicle information, prompts a driver that the platform/warehouse is not matched with passenger/goods carrying information of the vehicle at the time, and carries out scoring punishment without carrying passenger/goods carrying;
(2) if the vehicle returns to the originally planned passenger carrying platform \ goods taking warehouse in the specified time, carrying the passengers \ goods taking is carried out according to the originally planned sequence; otherwise, the driver can apply to the platform end to replan the order of loading/picking after the time of loading/picking exceeds the original specified time, the platform checks the information, and the vehicle is taken as a newly-entered vehicle to replan the order;
(3) when the vehicle leaves the park, the license plate information is recognized, the vehicle is detected to be unfinished to take goods through the platform/warehouse monitoring information, the vehicle is prompted to have passengers or goods which are missed to take, and the vehicle does not leave the park or score and punish;
(4) the vehicle can load/pick the passenger/goods according to the specified time, and then the vehicle is old; otherwise, after the original time period of carrying passengers \ picking goods is exceeded, a replanning application is submitted, and the platform replans the picking order.
The system is provided with a vehicle access station information checking module for checking information when a vehicle accesses a park port and accesses a platform \ warehouse, namely: for the license plate obtained by the vehicle recognition device, judging whether the vehicle carries passengers and takes goods according to the path or whether the passengers carrying and taking goods are finished according to the vehicle running path plan output by the transportation sequence planning subsystem; and prompting that the vehicle is not matched with the passenger carrying or goods taking information of the current platform/warehouse for the vehicle which is not planned according to the path.
In the process, the license plate recognition process is as follows:
1. collecting an image: when the vehicle passes through the identification checkpoint, the sensor is triggered, and then the acquisition device starts to operate to complete vehicle image acquisition;
2. image preprocessing: after the acquisition is finished, preprocessing the image, including graying and noise reduction, is required to ensure accurate and efficient subsequent operation;
3. and (3) license plate positioning: in the acquired vehicle image, most areas are background, namely, non-value areas. Therefore, the image after the preprocessing needs to be reprocessed, some useless parts are eliminated, the accurate positioning of the license plate is realized, and the required license plate picture is obtained. The invention discloses a license plate positioning algorithm, which comprises an edge detection-based method, a genetic algorithm-based license plate positioning method based on wavelet transformation and the like. The Roberts is adopted as the positioning operator, and compared with other operators, the Roberts positioning method has the best effect on processing the image with the steep edge, and can form larger response at the edge position of the image. In the license plate positioning, the license plate and the background have better sharpness due to larger color difference, so the Roberts edge operator is preferably adopted for license plate positioning.
4. Character segmentation: and segmenting the accurately positioned image to obtain a single character. Accurate character segmentation can have a crucial impact on character recognition and speed detection. However, the license plate pollution caused by the surrounding environment (billboard, light, etc.) will cause a great hindrance to character segmentation, for example, the correct picture is segmented by mistake or the non-license plate picture is segmented, so the correct algorithm is very important. The license plate character segmentation algorithm with projection characteristics as a core is preferably adopted, and the main idea is to project the gray level image in a specific direction so as to analyze the regular characteristics of the gray level spatial distribution of the target image. After the projection result is analyzed, the positions where the gray values of some images are relatively low in superposition tend to generate wave troughs, and the columns with more points with higher gray values tend to form wave crests. In this way, the vertical projection image of the license plate can generate the situation that the peaks and the troughs are generated successively. Setting a special threshold value in the projection graph, and carrying out standardized division on the position of the projection column exceeding the threshold value so as to obtain a required character area, wherein if the projection column does not exceed the threshold value, the area is defined as a background area, so that the normalized character segmentation is carried out on the license plate.
5. Character recognition: this is the most critical step in a license plate recognition system. The license plate in China is composed of Chinese characters, letters and numbers, so that the difficulty is increased for license plate recognition, and the accuracy of character recognition reflects the performance of a recognition system to a great extent. The invention adopts SVM algorithm to recognize character, which comprises two stages, namely training stage and testing stage. The method mainly comprises the following steps that samples of a training set are subjected to expansion and extraction, and SVM parameters are scientifically set, so that an SVM classifier with excellent performance is obtained; and the latter mainly comprises the steps of carrying out extraction operation on samples of the test set, substituting the characteristics into a prepared SVM classifier, further calculating a corresponding decision value, and analyzing the specific type of the sample by combining the decision value.
6. And importing the identified license plate number into a database so as to perform subsequent scheduling management work. The license plate is used as a keyword to associate information such as license plate, vehicle type, size, rated load, driver name, certificate photo, contact phone and the like.
In the above embodiment, the planning of the vehicle running path is to plan the optimal loading path of the vehicle according to the station \ warehouse number to which the order belongs and the scheduling information of the vehicle at each station \ warehouse; the optimal loading path planning comprises the following steps:
identifying vehicle information for vehicles entering a passenger station/warehouse;
acquiring order information corresponding to the vehicle and passenger/storage information corresponding to the order;
planning a passenger carrying/goods taking sequence with the minimum time cost for the vehicle according to the queuing condition of the existing platform/warehouse information, and updating the planning scheme to the queuing information of the warehouse in the park;
sending a goods taking sequence to a mobile phone end of a driver, and simultaneously updating a vehicle database of a platform/warehouse;
monitoring the arrival condition of the vehicle, and allowing the planning of parking, passenger carrying and goods taking of the vehicle;
when the vehicle carries passengers \ picks up goods and leaves, the receiving driver submits passengers \ picks up goods confirmation, the vehicle position section information is updated until all the passengers \ picks up goods are completed, and the vehicle is allowed to leave the passenger station \ park after the monitoring information is verified to be correct.
The minimum passenger carrying or goods taking path sequence is obtained through the following steps:
establishing a starting and ending point and path platform/warehouse set N, and acquiring the distance d between each platform/warehouse ij Establishing a communication network G, wherein the distance set is D, and G is (N, D);
obtaining the running time T between each station/warehouse ij ；
The vehicle travel path is obtained by causing the following objective function to satisfy the following constraint condition:
an objective function:
constraint conditions are as follows:
(1) the running time of each passing platform/warehouse is as follows:
(2) and (3) weight restraint:
(3) distance constraint:
(4) cargo volume or passenger number constraints:
(5) flow conservation constraint:
(6) each approach platform/warehouse must be serviced by a single vehicle at a time:
(7) vehicle entering from starting point and exiting from terminal:
∑ j∈N X ojk ＝∑ j∈N X jok ，
(8) time for vehicle to arrive at approach station/warehouse:
(9) time when the vehicle leaves the passing platform/warehouse:
SE2 ik ＝SE2 jk +S i +P i ，
(10) service time of approach station/warehouse i:
S i ＝q i ·hh，
(11) queuing time of approach station \ warehouse i:
(12) and (3) eliminating the sub-loop constraint:
U ik -U jk +n·X ijk ≤n-1，
in the formula:
X ijk represents the j stations/warehouses from the ith station/warehouse to the vehicle k; k denotes a set of delivery vehicles, K ═ {1, 2, …, K }; p is a radical of i Queuing time for the vehicle at the ith station/warehouse; t is ij Represents the running time of the vehicle from the ith platform/warehouse to the j platforms/warehouses; v is the vehicle speed; l is k Is the maximum distance traveled by vehicle k; d ij The distance from the ith station \ warehouse to the j stations \ warehouses; a is the set of all nodes, a ═ {1, 2, …, n }, n is the total number of nodes; q. q.s i The passenger capacity/goods taking capacity of the vehicle at the ith station/warehouse; q k Loading the vehicle k; v k Representing the volume, v, of the vehicle k i The volume or maximum passenger capacity of the cargo loaded on the vehicle at the ith station/warehouse; c 1 Vehicle transportation cost per unit mileage; c 2 Vehicle queuing cost per unit time; hh is the time required to process a unit; EE i The busy time of the ith station/warehouse is an upper limit; LL (LL) i A lower bound representing the busy time of the ith station/warehouse; SE1 ik Time for vehicle K to arrive at the ith station/warehouse; SE2 ik Time when vehicle K leaves the i-th station/warehouse; s i Representing the service time of the vehicle at the ith station \ warehouse; u is an auxiliary variable to avoid generating a self loop in the circuit; o denotes a station entry, and O ═ 1 }.
The vehicle path problem belongs to an NP-hard problem, a heuristic algorithm can be adopted for solving, and the ant colony algorithm has the characteristics of strong global search capability, high convergence speed and strong robustness, and is favorable for obtaining an optimal solution. The above describes a passenger-cargo vehicle scheduling scenario in which passengers get on the platform or goods are taken from the warehouse, and the method of the present invention is also suitable for planning a passenger-cargo vehicle scheduling scenario in which passengers get off the platform or get off the warehouse to unload goods without changing the idea of the method of the present invention.
From the above description of the embodiments, those skilled in the art will clearly understand that the method involved in the system or system of the present disclosure can be implemented by software plus necessary general hardware, and certainly can also be implemented by special hardware including special integrated circuits, special CPUs, special memories, special components and the like. Generally, functions performed by computer programs can be easily implemented by corresponding hardware, and specific hardware structures for implementing the same functions may be various, such as analog circuits, digital circuits, or dedicated circuits. However, software program implementation is a more preferred implementation for more of the present disclosure.
Claims (10)
1. The system is characterized by comprising an information management subsystem, an information inquiry subsystem, an Internet of vehicles data subsystem and a transportation sequence planning subsystem;
the information management subsystem is configured to manage vehicle information and platform/warehouse information;
the information inquiry subsystem is configured for inquiring vehicle information, order information, vehicle and cargo matching information, driver information and cargo cabin matching information;
the vehicle networking data subsystem is configured for platform/warehouse information management, vehicle shift information management and vehicle driving behavior monitoring;
the transportation sequence planning subsystem is configured for planning a vehicle driving path.
2. The system of claim 1, wherein the planning of the vehicle driving path is to plan the optimal loading path of the vehicle according to the station \ warehouse number of the order and the scheduling information of the vehicle at each station \ warehouse; the optimal loading path planning comprises the following steps:
identifying vehicle information for vehicles entering a passenger station/warehouse;
acquiring order information corresponding to the vehicle and passenger/storage information corresponding to the order;
planning a passenger carrying \ goods taking sequence with the minimum time cost for the vehicle according to the queuing condition of the existing platform \ warehouse information, and updating the planning scheme to the queuing information of the park warehouse;
sending a goods taking sequence to a mobile phone end of a driver, and simultaneously updating a vehicle database of a platform/warehouse;
monitoring the arrival condition of the vehicle, and allowing the planning of parking, passenger carrying and goods taking of the vehicle;
when the vehicle carries passengers \ picks up goods and leaves, the receiving driver submits passengers \ picks up goods confirmation, the vehicle position section information is updated until all the passengers \ picks up goods are completed, and the vehicle is allowed to leave the passenger station \ park after the monitoring information is verified to be correct.
3. The system of claim 2, wherein the minimum order of passenger or pick-up paths is obtained by:
establishing a starting and ending point and path platform/warehouse set N, and acquiring the distance d between each platform/warehouse ij Establishing a communication network G, wherein the distance set is D, and G is (N, D);
obtaining the running time T between each station/warehouse ij ；
The vehicle travel path is obtained by causing the following objective function to satisfy the following constraint condition:
an objective function:
constraint conditions are as follows:
(1) the running time of each passing platform/warehouse is as follows:
(2) weight restraint:
(3) distance constraint:
(4) cargo volume or passenger number constraints:
(5) flow conservation constraint:
(6) each approach platform/warehouse must be serviced by a single vehicle at a time:
(7) vehicle entering from starting point and exiting from terminal:
(8) time for vehicle to arrive at approach station/warehouse:
(9) time when the vehicle leaves the passing platform/warehouse:
(10) service time of approach station/warehouse i:
(11) queuing time of approach station \ warehouse i:
(12) and (3) eliminating the sub-loop constraint:
in the formula:
X ijk represents the j platforms/warehouses from the ith platform/warehouse of the vehicle k; k denotes a set of delivery vehicles, K ═ {1, 2, …, K }; p is a radical of i Queuing time for the vehicle at the ith station/warehouse; t is ij Represents the running time of the vehicle from the ith platform/warehouse to the j platforms/warehouses; v is the vehicle speed; l is k Is the maximum distance traveled by vehicle k; d ij The distance from the ith station \ warehouse to the j stations \ warehouses; a is the set of all nodes, a ═ {1, 2, …, n }, n is the total number of nodes; q. q.s i The passenger capacity and the goods taking capacity of the vehicle at the ith platform and warehouse; q k Loading the vehicle k; v k Representing the volume, v, of the vehicle k i The volume or maximum passenger capacity of the cargo loaded on the ith platform/warehouse for the vehicle; c 1 Vehicle transportation cost per unit mileage; c 2 Vehicle queuing cost per unit time; hh is treatment unitThe time of demand; EE i The busy time of the ith station/warehouse is an upper limit; LL (LL) i A lower bound representing the busy time of the ith station/warehouse; SE1 ik Time for vehicle K to arrive at the ith station/warehouse; SE2 ik Time when vehicle K leaves the i-th station/warehouse; s i Representing the service time of the vehicle at the ith station \ warehouse; u is an auxiliary variable to avoid generating a self loop in a circuit; o denotes a station entry, and O ═ 1 }.
4. The system of claim 3, wherein the objective function solves paths satisfying constraints by an ant colony algorithm.
5. The system of claim 1, wherein the vehicle information includes a license plate, a vehicle type, a size, a rated load, a driver name, a certificate photo, and a contact phone.
6. The system of claim 1, wherein the vehicle networking data subsystem comprises a platform \ warehouse information management module, a vehicle scheduling information management module, and a vehicle driving behavior monitoring module;
the platform \ warehouse information management module is configured for receiving information fed back by scanning of a platform \ warehouse camera in real time, updating the using state of the platform \ warehouse and updating the using state of the platform \ warehouse synchronously with the queuing information of the warehouse;
the vehicle scheduling information management module is configured to update and record vehicle queuing and station entering and exiting information of each station/warehouse on the same day in real time;
the vehicle driving behavior monitoring module is configured to monitor whether the vehicle is loaded according to a planned path, whether the vehicle violates a rule, whether the vehicle illegally drives, and whether the vehicle reaches a specified platform/warehouse within a specified time.
7. The system of claim 1, wherein the vehicle networking data subsystem comprises a vehicle identification device for taking a picture of the vehicle through the camera and identifying the license plate through the image.
8. The system of claim 7, further comprising a vehicle outbound and inbound information checking module, configured to determine whether the vehicle carries passengers and picks up the goods according to the route or whether the passenger carrying and picking up the goods are completed according to the vehicle driving route plan output by the transportation sequence planning subsystem for the license plate obtained by the vehicle recognition device; and prompting that the vehicle is not matched with the passenger carrying or goods taking information of the current platform/warehouse for the vehicle which is not planned according to the path.
9. The system of claim 8, wherein the vehicle entering and exiting station information checking module identifies the vehicle license plate before the vehicle leaves the station/warehouse, and judges and prompts whether to miss passengers or goods according to the vehicle driving path plan output by the transportation sequence planning subsystem.
10. A computer-readable storage medium characterized by: a computer program loadable by a processor and adapted to execute the system of any of claims 1 to 9.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210525982.0A CN115115172A (en) | 2022-05-13 | 2022-05-13 | Intelligent dispatching system for passenger and cargo vehicles and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210525982.0A CN115115172A (en) | 2022-05-13 | 2022-05-13 | Intelligent dispatching system for passenger and cargo vehicles and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115115172A true CN115115172A (en) | 2022-09-27 |
Family
ID=83326387
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210525982.0A Pending CN115115172A (en) | 2022-05-13 | 2022-05-13 | Intelligent dispatching system for passenger and cargo vehicles and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115115172A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118171894A (en) * | 2024-05-14 | 2024-06-11 | 国网山东省电力公司滨州市沾化区供电公司 | Electric power working vehicle management method, system, terminal and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070194912A1 (en) * | 2006-01-10 | 2007-08-23 | Lg Chem, Ltd. | Method for optimal multi-vehicle dispatch and system for the same |
| CN110782064A (en) * | 2019-09-10 | 2020-02-11 | 浙江工业大学 | Visualization method and system integrating vehicle scheduling optimization and task allocation |
| CN113537883A (en) * | 2021-07-13 | 2021-10-22 | 长安大学 | Method and related device for allocating and monitoring vehicles in logistics park |
| CN114169813A (en) * | 2021-11-16 | 2022-03-11 | 悠桦林信息科技(上海)有限公司 | Transportation scheduling method and device, electronic equipment and storage medium |
-
2022
- 2022-05-13 CN CN202210525982.0A patent/CN115115172A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070194912A1 (en) * | 2006-01-10 | 2007-08-23 | Lg Chem, Ltd. | Method for optimal multi-vehicle dispatch and system for the same |
| CN110782064A (en) * | 2019-09-10 | 2020-02-11 | 浙江工业大学 | Visualization method and system integrating vehicle scheduling optimization and task allocation |
| CN113537883A (en) * | 2021-07-13 | 2021-10-22 | 长安大学 | Method and related device for allocating and monitoring vehicles in logistics park |
| CN114169813A (en) * | 2021-11-16 | 2022-03-11 | 悠桦林信息科技(上海)有限公司 | Transportation scheduling method and device, electronic equipment and storage medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118171894A (en) * | 2024-05-14 | 2024-06-11 | 国网山东省电力公司滨州市沾化区供电公司 | Electric power working vehicle management method, system, terminal and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2021159865A1 (en) | Data calibration-based bus route prediction method and system | |
| WO2021159866A1 (en) | Bus route prediction method and system based on facial recognition | |
| CN100495469C (en) | Vehicle transport dispatch management system based on vehicular intelligent terminal | |
| US11941991B2 (en) | Platooning operation system and platooning operation method | |
| CN103680128A (en) | Intelligent taxi scheduling system | |
| CN111179625B (en) | Method and system for reminding service provider | |
| CN113408903B (en) | Order processing method, order processing device, electronic equipment and readable storage medium | |
| CN112308383B (en) | Vehicle short-distance passenger carrying scheduling method and device based on Internet of things | |
| CN111598368A (en) | Risk identification method, system and device based on stopping abnormity after stroke ends | |
| CN111598371A (en) | Risk prevention method, system, device and storage medium | |
| CN111988351A (en) | Dynamic management system and method for engineering crew operation | |
| CN115115172A (en) | Intelligent dispatching system for passenger and cargo vehicles and storage medium | |
| CN115545975A (en) | Management method, system and storage medium based on scenic spot parking lot data | |
| CN112598923B (en) | Airport taxi passenger intelligence joint debugging system based on big data | |
| CN112200922B (en) | Lane exception handling method, device, equipment and storage medium | |
| CN111598370A (en) | Female safety risk prevention method and system | |
| CN111639973B (en) | Public transport passenger flow OD derivation method and device based on multivariate fusion big data | |
| CN116934560A (en) | Intelligent management technology for automobile passenger station | |
| CN110942158B (en) | Railway train passenger adding inspection system | |
| CN113393080A (en) | Passenger information management system and method for public transport passenger transport mechanism | |
| CN114898476B (en) | Free flow system for ferry of automobile | |
| JP7382200B2 (en) | Boarding and alighting determination device, boarding and alighting determination method, and boarding and alighting determination program | |
| CN117854016A (en) | Method and device for detecting abnormal vehicle based on expressway | |
| CN111368626A (en) | Vehicle identification method and device, electronic equipment and storage medium | |
| CN116071858A (en) | Smart park management method, device, equipment and computer readable storage medium |
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 |