CN109191826B - Vehicle scheduling method and vehicle scheduling server - Google Patents
Vehicle scheduling method and vehicle scheduling server Download PDFInfo
- Publication number
- CN109191826B CN109191826B CN201811014273.6A CN201811014273A CN109191826B CN 109191826 B CN109191826 B CN 109191826B CN 201811014273 A CN201811014273 A CN 201811014273A CN 109191826 B CN109191826 B CN 109191826B
- Authority
- CN
- China
- Prior art keywords
- loading
- unloading
- vehicle
- container
- equipment
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/20—Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
- G08G1/202—Dispatching vehicles on the basis of a location, e.g. taxi dispatching
-
- 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
-
- 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
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Development Economics (AREA)
- General Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
The embodiment of the invention provides a vehicle dispatching method, which comprises the following steps: receiving a transportation task; determining port machine equipment for loading the container to be transported according to the loading address; calculating the end time of the loading and unloading task being executed by the port machine equipment; acquiring the current position of each vehicle in the harbor district, and estimating the time of each vehicle from the current position to the loading address; and calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task which is being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported. The invention provides a vehicle scheduling scheme with high intellectualization, high automation degree and high resource utilization rate by comprehensively considering the task being executed by port machine equipment in a port and the arrival time of the vehicle. In addition, the embodiment of the invention also provides a vehicle dispatching server.
Description
Technical Field
The embodiment of the invention relates to the field of vehicle scheduling, in particular to a vehicle scheduling method and a vehicle scheduling server.
Background
This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
In recent years, technologies such as the internet of things, big data and artificial intelligence are rapidly developed, and important support is provided for the construction of intelligent ports. The intelligent vehicle dispatching system is constructed, so that the ship loading and unloading efficiency can be effectively improved, the turnover of the vehicles and the ships is accelerated, the freight transportation time and cost are reduced, and the freight transportation handling capacity of a port is improved.
Disclosure of Invention
In the process of implementing the invention, the inventor finds that: the vehicle scheduling of the traditional port is mainly carried out by means of manual scheduling, the automation degree is low, the resource utilization rate is low, when a logistics distribution task is carried out, a vehicle is manually scheduled to travel to a loading and unloading place, the time of the vehicle reaching the loading and unloading place and the operation condition of port machinery equipment are not considered in the scheduling process, for example, when a container loading and transporting task is carried out, the vehicle is manually scheduled to travel to a wharf, and when the vehicle arrives, a shore crane is carrying out other container hoisting tasks, and under the condition, the vehicle needs to wait.
Therefore, the invention provides a vehicle dispatching method and a vehicle dispatching server, and provides a vehicle dispatching scheme with high intellectualization, automation degree and resource utilization rate by comprehensively considering the task being executed by port machine equipment in a port and the arrival time of a vehicle.
In a first aspect of embodiments of the present invention, there is provided a vehicle scheduling method applied to a port, including:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported;
determining port machine equipment for loading the container to be transported according to the loading address;
calculating the end time of the loading and unloading task being executed by the port machine equipment;
acquiring the current position of each vehicle in a harbor district, and estimating the time for each vehicle to travel from the current position to reach the loading address;
and calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task which is being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
In a second aspect of an embodiment of the present invention, there is provided a vehicle dispatching server, including a processor, a memory, and a computer program stored on the memory and operable on the processor, wherein the processor executes the vehicle dispatching method applied to a port when the computer program is executed.
In a third aspect of embodiments of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the vehicle scheduling method applied to a port described above.
In a fourth aspect of the embodiments of the present invention, there is provided a vehicle scheduling method applied to a relatively closed area, including:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported;
determining a loading and unloading device for loading the container to be transported according to the loading address;
calculating the end time of the loading and unloading task which is being executed by the loading and unloading equipment;
acquiring the current position of each vehicle, and estimating the time for each vehicle to travel from the current position to reach the loading address;
and calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task which is being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
In a fifth aspect of an embodiment of the present invention, there is provided a vehicle dispatching server, comprising a processor, a memory and a computer program stored on the memory and executable on the processor, wherein the processor executes the vehicle dispatching method applied to a relatively closed area.
In a sixth aspect of an embodiment of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the vehicle scheduling method as described above as applied to a relatively enclosed area.
By means of the technical scheme, in the port field, when a transport task needs to dispatch the vehicle, the operation condition of the port machine for loading and unloading the containers to be delivered is considered, the time of the port machine for finishing the task which is executed by the port machine is calculated, and the time of each vehicle for reaching the loading address is calculated, so that the vehicle with the least waiting time when reaching the loading address is dispatched, and the optimal utilization of the transport resources in the port is realized.
Drawings
The above and other objects, features and advantages of exemplary embodiments of the present invention will become readily apparent from the following detailed description read in conjunction with the accompanying drawings. Several embodiments of the invention are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which:
fig. 1 schematically shows a flow of a vehicle scheduling method applied to a port according to an embodiment of the present invention;
FIG. 2 schematically illustrates a flow of a vehicle dispatch method applied to a relatively enclosed area, in accordance with an embodiment of the present invention;
in the drawings, the same or corresponding reference numerals indicate the same or corresponding parts.
Detailed Description
The principles and spirit of the present invention will be described with reference to a number of exemplary embodiments. It is understood that these embodiments are given solely for the purpose of enabling those skilled in the art to better understand and to practice the invention, and are not intended to limit the scope of the invention in any way. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
As will be appreciated by one skilled in the art, embodiments of the present invention may be embodied as a system, apparatus, device, method, or computer program product. Accordingly, the present disclosure may be embodied in the form of: entirely hardware, entirely software (including firmware, resident software, micro-code, etc.), or a combination of hardware and software.
It should be noted that the terminal according to the embodiment of the present invention may include, but is not limited to, a mobile phone, a Personal Digital Assistant (PDA), a wireless handheld device, a wireless netbook, a Personal computer, a portable computer, an MP3 player, an MP4 player, and the like.
The term "closed logistics area" as referred to in the present invention means an area having logistics distribution business, which is relatively closed compared to the external environment, such as a road port, a sea-facing port, a mine site, an airport, a cargo collection place, a park, etc.
In this document, any number of elements in the drawings is by way of example and not by way of limitation, and any nomenclature is used solely for differentiation and not by way of limitation.
The invention provides a vehicle dispatching method, which is applied to dispatching vehicles in ports, and as shown in figure 1, the method comprises the following steps:
step S100, receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported.
According to the port service characteristics, the loading address is generally the dock where the ship where the container to be transported is located is to be unloaded in the ship unloading service, and the loading address is generally the box area where the container to be transported is stored in the ship loading service.
And S101, determining port equipment for loading the container to be transported according to the loading address.
It should be noted that the port machinery equipment referred to in the present invention includes but is not limited to: the crane comprises a front crane, a container empty container stacking machine, a forklift, a port rubber-tyred crane (such as a tire crane), a material grabbing machine, an overhead crane, a portal crane, a rail type container gantry crane (such as a rail type gantry crane), a rubber-tyred container gantry crane (such as a tire type gantry crane) and a shore container crane (such as a shore crane). For example, in the ship unloading business, the port machinery used for loading the container to be transported is generally a shore crane located on a wharf of the ship unloading business, and in the ship loading business, the port machinery used for loading the container to be transported is generally a tire crane and a gantry crane located in a box area.
In one embodiment, this step may be implemented as follows: and determining the port machine equipment positioned at the loading address as the port machine equipment used for loading the container to be transported.
In another embodiment, this step may be implemented as follows: the method comprises the steps of storing each port machine device and the area in charge of the port device in a port area in advance, judging the area to which a loading address of a container to be transported belongs in a current transportation task, and then determining the port machine device in charge of the area as the port machine device for loading the container to be transported.
In specific implementation, when a port machine device located at a loading address or a port machine device in a region to which the loading address belongs has a fault, the step may also be implemented according to the following manner: and determining other port machine equipment for executing loading and unloading tasks instead of the port machine equipment with the fault, and determining the other port machine equipment as the port machine equipment for loading the containers to be delivered.
In a specific implementation, the port machine device that executes the loading and unloading task instead of the port machine device that has the fault may be another port machine device closest to the port machine device that has the fault.
And step S102, calculating the end time of the loading and unloading task executed by the port machine equipment.
Specifically, each time a port equipment receives a loading and unloading task, the time required by the loading and unloading task can be calculated according to the average operation time of the port equipment and the number of containers required to be operated by the loading and unloading task.
In one embodiment, the average working time of the port machinery equipment can be calculated by the following method: recording the total consumed time of the port machine equipment for executing each loading and unloading task and the total number of the operated containers, calculating the average time of the port machine equipment for loading and unloading one container in each loading and unloading task (obtained by dividing the total consumed time of each loading and unloading task by the total number of the operated containers), calculating the average time of the port machine equipment for loading and unloading one container in the previous loading and unloading tasks, and determining the average time as the average operation time of the port machine equipment.
Where the time a port machine apparatus is loading or unloading a container is the time it takes the port machine apparatus to load or unload a container, for example the time it takes a shore crane to load a container from a ship onto a vehicle, or the time it takes a tyre crane to unload a container from a vehicle to a container bay.
The operational stability of port equipment varies due to environmental factors of port operations, which may result in large fluctuations in the time the same port equipment operates containers under different environmental conditions, e.g. when weather conditions are good, it takes less time to load and unload a container, and when weather conditions are not good, it takes more time to load and unload a container. In view of this, in one embodiment, the average working time of the port equipment may be calculated as follows: the total time consumed by the port machine equipment to execute the latest loading and unloading task and the total number of loaded and unloaded containers are recorded, the time required by the port machine equipment to load and unload one container in the latest loading and unloading task on average is calculated (the time is obtained by dividing the total time consumed by the latest loading and unloading task by the total number of loaded and unloaded containers), and the time required by the port machine equipment to load and unload one container on average in the latest loading and unloading task is determined as the average operation time of the port machine equipment.
And step S103, acquiring the current position of each vehicle in the harbor district, and estimating the time for each vehicle to travel from the current position to reach the loading address.
Specifically, this step may determine the current position of each vehicle by acquiring positioning information of an on-board GPS device of each vehicle.
In specific implementation, this step may use a path planning algorithm (e.g., Dijkstra algorithm) used in existing map navigation to calculate the time required for each vehicle to travel from the current location to the loading address.
Considering that the congestion condition and the speed limit condition of roads in a port can influence the time required by the vehicles to travel to reach the loading address, the step can firstly predict the route planning of each vehicle from the current position to the loading address through the existing map navigation technology, then obtain the distance of the roads related to the route planning, the current congestion state and the speed limit information, and finally calculate the time required by each vehicle to reach the loading address by combining the information.
In specific implementation, before this step, the working state of each vehicle in the port area may be obtained (for example, other transportation tasks are being executed, idling, failure, maintenance, and the like), and then in this step, only the position of the vehicle that can receive the current transportation task needs to be obtained.
And step S104, calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
Through this step, the time when the vehicle finally scheduled reaches the loading address is closest to the end time of the loading/unloading task being executed by the port equipment, and the time required for waiting after the vehicle reaches is shortest.
Based on the vehicle scheduling method shown in fig. 1, when a transport task needs to schedule a vehicle, the operation condition of a port machine device for loading and unloading containers to be delivered is considered, the time of the port machine device for finishing the task is calculated, and the time of each vehicle for reaching a loading address is calculated, so that the vehicle with the least waiting time when reaching the loading address is scheduled, and the optimal utilization of the transport resources in the port is realized.
Based on the same inventive concept, the present invention further provides a vehicle dispatching server, which is used for executing the vehicle dispatching method of steps S100-S104, and is specifically described below.
The invention provides a vehicle dispatching server, which comprises a first processor, a first memory and a computer program which is stored on the first memory and can be run on the first processor, wherein the first processor executes the following steps when running the computer program:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported; determining port machine equipment for loading the container to be transported according to the loading address; calculating the end time of the loading and unloading task being executed by the port machine equipment; acquiring the current position of each vehicle in a harbor district, and estimating the time for each vehicle to travel from the current position to reach the loading address; and calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task which is being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
The method executed when the computer program in the first memory is executed is implemented based on the same inventive concept as the vehicle dispatching method shown in fig. 1, and has the same non-limiting embodiment, which specifically refers to the description of the method shown in fig. 1, and will not be described herein again.
Alternatively, in the present invention, the first processor may be implemented by a circuit, a chip, or other electronic components. For example, the first processor may also include one or more microcontrollers, one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more integrated circuits, or the like.
Alternatively, in the present invention, the first memory may be implemented by a circuit, a chip, or other electronic components. For example, the first memory may include one or more of Read Only Memory (ROM), Random Access Memory (RAM), flash memory, electrically programmable memory (EPROM), electrically programmable and erasable memory (EEPROM), embedded multimedia card (eMMC), a hard drive, or any volatile or non-volatile media, among others.
Based on the inventive concept of the present invention, the present invention also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the vehicle scheduling method shown in fig. 1. The storage medium may be one or more of Read Only Memory (ROM), Random Access Memory (RAM), flash memory, electrically programmable memory (EPROM), electrically programmable and erasable memory (EEPROM), embedded multimedia card (eMMC), a hard drive, or any volatile or non-volatile media, among others.
Based on the same inventive concept, the invention also provides a vehicle dispatching method, which can be applied to any closed logistics distribution area, such as road ports, sea ports, mines, airports, cargo collection and distribution sites, parks and the like.
As shown in fig. 2, the method includes:
step S200, receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported.
Step S201, determining the loading and unloading equipment for loading the container to be transported according to the loading address.
It should be noted that the loading and unloading device referred to in the present invention is a device for loading, unloading, moving, and lifting a cargo box in the field to which the vehicle dispatching method is applied, and includes but is not limited to: a forklift, a crane, a lifter, a conveyor, a carrier, a robot arm having a transfer function controlled by a computer, and the like.
In one embodiment, this step may be implemented as follows: and determining the loading and unloading equipment positioned at the loading address as the loading and unloading equipment for loading the container to be transported.
In another embodiment, this step may be implemented as follows: the method comprises the steps of storing each loading and unloading device and the area in charge of the loading and unloading device in a closed logistics distribution area (such as a highway port, a sea-facing port, a mine field, an airport, a cargo collection and distribution place, a park and the like) in advance, judging the area to which the loading address of a container to be transported belongs in the current transportation task, and then determining the loading and unloading device in charge of the area as the loading and unloading device for loading the container to be transported.
In a specific implementation, when the loading and unloading device located at the loading address or the loading and unloading device responsible for the area to which the loading address belongs has a fault, the step can be further implemented according to the following mode: determining other loading and unloading devices for carrying out loading and unloading tasks instead of the faulted loading and unloading device, and determining the other loading and unloading devices as the loading and unloading devices for loading the containers to be delivered.
In the case of implementation, the other load handling equipment that performs the load handling task instead of the malfunctioning load handling equipment may be the closest load handling equipment to the malfunctioning load handling equipment.
Step S202 is to calculate the end time of the loading/unloading task being executed by the loading/unloading device.
Specifically, each time the loading and unloading equipment receives a loading and unloading task, the time required by the loading and unloading task can be calculated according to the average operation time of the loading and unloading equipment and the number of containers required to be operated by the loading and unloading task.
In one embodiment, the average working time of the handling equipment may be calculated as follows: the total time consumed by the loading and unloading equipment to execute each loading and unloading task and the total number of the containers loaded and unloaded by the loading and unloading equipment are recorded, the average time required by the loading and unloading equipment to load and unload one container in each loading and unloading task is calculated (the average time is obtained by dividing the total time consumed by each loading and unloading task by the total number of the containers operated), the average value of the average time required by the loading and unloading equipment to load and unload one container in the previous loading and unloading tasks is calculated, and the average value is determined as the average operation time of the loading and unloading equipment.
The time it takes for the loading and unloading device to load or unload a container is the time it takes for the loading and unloading device to load or unload a container, for example the time it takes for a forklift to load a container from a warehouse to a vehicle, or the time it takes for a crane to unload a container from a vehicle to a warehouse.
In another embodiment, the average working time of the handling equipment can also be calculated as follows: the total time of the loading and unloading device for executing the latest loading and unloading task and the total number of the loading and unloading containers are recorded, the average time required by the loading and unloading device for loading and unloading one container in the latest loading and unloading task is calculated (the average time is obtained by dividing the total time of the latest loading and unloading task by the total number of the loaded and unloading containers), and the average time required by the loading and unloading device for loading and unloading one container in the latest loading and unloading task is determined as the average operation time of the loading and unloading device.
Step S203, obtaining the current position of each vehicle, and estimating the time for each vehicle to travel from the current position to reach the loading address.
Specifically, this step may determine the current position of each vehicle by acquiring positioning information of an on-board GPS device of each vehicle.
In specific implementation, this step may use a path planning algorithm (e.g., Dijkstra algorithm) used in existing map navigation to calculate the time required for each vehicle to travel from the current location to the loading address.
Considering that the congestion condition and the speed limit condition of the road can influence the time required by the vehicle to reach the loading address, the step can firstly predict the route planning of each vehicle from the current position to the loading address through the existing map navigation technology, then obtain the distance of the road, the current congestion state and the speed limit information related to the route planning, and finally calculate the time required by each vehicle to reach the loading address by combining the information.
In a specific implementation, before this step, the working status (for example, other transportation tasks are being performed, idling, breakdown, maintenance, etc.) of each vehicle in the closed logistics distribution area (for example, highway harbor, seaward harbor, mine site, airport, cargo collection area, park, etc.) may be obtained, and then only the position of the vehicle capable of receiving the transportation task in this step needs to be obtained.
And step S204, calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
In this step, the time required for the vehicle to arrive at the loading address, which is finally scheduled, is closest to the end time of the loading/unloading task being executed by the loading/unloading device, and the time required for waiting until the vehicle arrives is shortest.
Based on the vehicle scheduling method shown in fig. 2, when a transportation task needs to schedule a vehicle, the operation condition of the loading and unloading equipment for loading and unloading the container to be delivered is considered, the time for the loading and unloading equipment to finish the task is calculated, and the time for each vehicle to reach the loading address is calculated, so that the vehicle with the least waiting time when the vehicle reaches the loading address is scheduled, and the optimal utilization of transportation resources in a relatively closed area such as a road port, a sea port, a mine field, an airport, a cargo collection and distribution area is realized.
Based on the same inventive concept, the present invention further provides a vehicle dispatching server, which is used for executing the vehicle dispatching method of steps S200-S204, and is specifically described below.
The invention provides a vehicle dispatching server, which comprises a second processor, a second memory and a computer program which is stored on the second memory and can be run on the second processor, wherein the second processor executes the following steps when running the computer program:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported; determining a loading and unloading device for loading the container to be transported according to the loading address; calculating the end time of the loading and unloading task which is being executed by the loading and unloading equipment; acquiring the current position of each vehicle, and estimating the time for each vehicle to travel from the current position to reach the loading address; and calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task which is being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported.
The method executed when the computer program in the second memory is executed is implemented based on the same inventive concept as the vehicle dispatching method shown in fig. 2, and has the same non-limiting embodiment, which can specifically refer to the description of the method shown in fig. 2, and will not be described herein again.
Alternatively, in the present invention, the second processor may be implemented by a circuit, a chip, or other electronic components. For example, the second processor may also include one or more microcontrollers, one or more Field Programmable Gate Arrays (FPGAs), one or more application specific circuits (ASICs), one or more Digital Signal Processors (DSPs), one or more integrated circuits, etc.
Alternatively, in the present invention, the second memory may be implemented by a circuit, a chip, or other electronic components. For example, the second memory may include one or more of Read Only Memory (ROM), Random Access Memory (RAM), flash memory, electrically programmable memory (EPROM), electrically programmable and erasable memory (EEPROM), embedded multimedia card (eMMC), a hard drive, or any volatile or non-volatile media, among others.
Based on the inventive concept of the present invention, the present invention also provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, performs the vehicle scheduling method shown in fig. 2. The storage medium may be one or more of Read Only Memory (ROM), Random Access Memory (RAM), flash memory, electrically programmable memory (EPROM), electrically programmable and erasable memory (EEPROM), embedded multimedia card (eMMC), a hard drive, or any volatile or non-volatile media, among others.
It should be noted that while the operations of the method of the present invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.
While the spirit and principles of the invention have been described with reference to several particular embodiments, it is to be understood that the invention is not limited to the disclosed embodiments, nor is the division of aspects, which is for convenience only as the features in such aspects may not be combined to benefit. The invention is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Those of skill in the art will further appreciate that the various illustrative logical blocks, units, and steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate the interchangeability of hardware and software, various illustrative components, elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present embodiments.
The various illustrative logical blocks, or elements, or devices described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. For example, a storage medium may be coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may be located in a user terminal. In the alternative, the processor and the storage medium may reside in different components in a user terminal.
In one or more exemplary designs, the functions described above in connection with the embodiments of the invention may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media that facilitate transfer of a computer program from one place to another. Storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, such computer-readable media can include, but is not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to carry or store program code in the form of instructions or data structures and which can be read by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Additionally, any connection is properly termed a computer-readable medium, and, thus, is included if the software is transmitted from a website, server, or other remote source via a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wirelessly, e.g., infrared, radio, and microwave. Such discs (disk) and disks (disc) include compact disks, laser disks, optical disks, DVDs, floppy disks and blu-ray disks where disks usually reproduce data magnetically, while disks usually reproduce data optically with lasers. Combinations of the above may also be included in the computer-readable medium.
Claims (14)
1. A vehicle scheduling method, comprising:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported;
determining port machine equipment for loading the container to be transported according to the loading address;
calculating the end time of the loading and unloading task being executed by the port machine equipment;
acquiring the current position of each vehicle in a harbor district, and estimating the time for each vehicle to travel from the current position to reach the loading address;
calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported;
wherein, calculating the end time of the loading and unloading task being executed by the port machine equipment comprises:
calculating the product of the average operation time of the port machine equipment and the number of containers needing to be operated in the loading and unloading tasks being executed, and obtaining the time needed by the loading and unloading tasks being executed;
the average operation time of the port machine equipment is calculated according to the following mode:
recording the total time consumed by the port machine equipment to execute the latest loading and unloading task and the total number of the containers operated;
calculating the average time required by the port machine equipment to load and unload a container in the latest loading and unloading task;
and determining the average time required by the port machine equipment to load and unload one container in the latest loading and unloading task as the average operation time of the port machine equipment.
2. The vehicle dispatching method of claim 1, wherein determining a port machine device for loading the container to be transported according to the loading address comprises: and determining the port machine equipment positioned at the loading address as the port machine equipment used for loading the container to be transported.
3. The vehicle dispatching method of claim 1, wherein determining a port machine device for loading the container to be transported according to the loading address comprises:
pre-storing each port machine device and the area responsible for the port machine device in a port area;
and judging the area to which the loading address belongs, and determining the port machine equipment in charge of the area as the port machine equipment for loading the container to be transported.
4. A vehicle dispatching method according to claim 2 or 3, wherein a port equipment for loading the container to be transported is determined according to the loading address, further comprising:
when a port machine device located at the loading address or a port machine device in charge of the area to which the loading address belongs has a fault,
and determining other port machine equipment for executing loading and unloading tasks instead of the port machine equipment with the fault, and determining the other port machine equipment as the port machine equipment for loading the containers to be delivered.
5. The vehicle scheduling method of claim 1, wherein estimating the time for each vehicle to travel from the current location to the loading address comprises:
predicting the route planning of each vehicle from the current position to the loading address;
and calculating the time required for each vehicle to travel from the current position to reach the loading address according to the distance of the road, the congestion state and the speed limit information of the road involved in the route planning.
6. A vehicle scheduling server comprising a processor, a memory and a computer program stored on and executable on the memory, characterized in that the processor, when executing the computer program, performs the method of any of claims 1-5.
7. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 5.
8. A vehicle scheduling method, comprising:
receiving a transportation task, wherein the transportation task comprises a loading address of a container to be transported;
determining a loading and unloading device for loading the container to be transported according to the loading address;
calculating the end time of the loading and unloading task which is being executed by the loading and unloading equipment;
acquiring the current position of each vehicle, and estimating the time for each vehicle to travel from the current position to reach the loading address;
calculating the difference between the time of each vehicle reaching the loading address and the end time of the loading and unloading task being executed, and scheduling the vehicle corresponding to the minimum calculated difference to transport the container to be transported;
wherein calculating the end time of the loading and unloading task being executed by the loading and unloading equipment comprises:
calculating the product of the average operation time of the loading and unloading equipment and the number of containers needing to be loaded and unloaded in the loading and unloading task being executed, and obtaining the time required by the loading and unloading task being executed;
the average working time of the handling equipment is calculated as follows:
recording the total time consumed by the loading and unloading equipment to execute the latest loading and unloading task and the total number of loaded and unloaded containers;
calculating the average time required by the loading and unloading equipment to load and unload one container in the last loading and unloading task;
and determining the average time required by the loading and unloading equipment to load and unload one container in the latest loading and unloading task as the average operation time of the loading and unloading equipment.
9. The vehicle dispatching method of claim 8, wherein determining a loading and unloading device for loading the container to be transported according to the loading address comprises: and determining the loading and unloading equipment positioned at the loading address as the loading and unloading equipment for loading the container to be transported.
10. The vehicle dispatching method of claim 8, wherein determining a loading and unloading device for loading the container to be transported according to the loading address comprises:
pre-storing each loading and unloading device and the area responsible for the loading and unloading device;
and judging the area to which the loading address belongs, and determining the loading and unloading equipment in charge of the area as the loading and unloading equipment for loading the container to be transported.
11. The vehicle dispatching method of claim 9 or 10, wherein the determining of the loading and unloading device for loading the container to be transported according to the loading address further comprises:
when the loading and unloading equipment positioned at the loading address or the loading and unloading equipment in charge of the area to which the loading address belongs has a fault, other loading and unloading equipment for executing loading and unloading tasks instead of the fault loading and unloading equipment is determined, and the other loading and unloading equipment is determined as the loading and unloading equipment for loading the containers to be delivered.
12. The vehicle scheduling method of claim 8, wherein estimating the time for each vehicle to travel from the current location to the loading address comprises:
predicting the route planning of each vehicle from the current position to the loading address;
and calculating the time required for each vehicle to travel from the current position to reach the loading address according to the distance of the road, the congestion state and the speed limit information of the road involved in the route planning.
13. A vehicle scheduling server comprising a processor, a memory and a computer program stored on and executable on the memory, characterized in that the processor, when executing the computer program, performs the method of any of claims 8-12.
14. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 8 to 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811014273.6A CN109191826B (en) | 2018-08-31 | 2018-08-31 | Vehicle scheduling method and vehicle scheduling server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811014273.6A CN109191826B (en) | 2018-08-31 | 2018-08-31 | Vehicle scheduling method and vehicle scheduling server |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109191826A CN109191826A (en) | 2019-01-11 |
| CN109191826B true CN109191826B (en) | 2020-10-09 |
Family
ID=64917309
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811014273.6A Active CN109191826B (en) | 2018-08-31 | 2018-08-31 | Vehicle scheduling method and vehicle scheduling server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109191826B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111489110A (en) * | 2019-01-25 | 2020-08-04 | 北京京东尚科信息技术有限公司 | Transportation equipment scheduling method and device |
| CN109637145A (en) * | 2019-02-13 | 2019-04-16 | 何世全 | A kind of road management method and device |
| WO2020177847A1 (en) * | 2019-03-04 | 2020-09-10 | Volvo Construction Equipment Ab | A method and system for controlling unloading of a load-carrying vehicle |
| CN113449053B (en) * | 2020-03-26 | 2023-09-26 | 北京京东振世信息技术有限公司 | Vehicle scheduling method and device |
| CN112381255A (en) * | 2020-11-13 | 2021-02-19 | 天津矿山工程有限公司 | Digital mine mining and transporting equipment scheduling method and system, intelligent terminal and storage medium |
| CN113762689A (en) * | 2021-01-12 | 2021-12-07 | 西安京迅递供应链科技有限公司 | Scheduling method, device, equipment and storage medium |
| CN113011792B (en) * | 2021-04-29 | 2024-03-26 | 上海华兴数字科技有限公司 | Mine vehicle dispatching method and system |
| CN114455338B (en) * | 2022-01-06 | 2023-06-23 | 东风柳州汽车有限公司 | Port loading and unloading control system |
| CN115456474B (en) * | 2022-10-13 | 2023-11-10 | 深圳中科天巡信息技术有限公司 | Port operation scheduling method and system based on artificial intelligence |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060271234A1 (en) * | 2005-05-31 | 2006-11-30 | Lockheed Martin Corporation | Dock management system and method |
| CN101727616A (en) * | 2008-10-24 | 2010-06-09 | 清华大学深圳研究生院 | Full-field intelligent dispatch method of container wharf trailer |
| CN103164782A (en) * | 2011-12-16 | 2013-06-19 | 招商局国际信息技术有限公司 | Intelligent dispatching system and intelligent dispatching method of container trucks |
| CN105427075A (en) * | 2015-11-24 | 2016-03-23 | 山东科技大学 | Hybrid dynamic scheduling method used for port container truck |
-
2018
- 2018-08-31 CN CN201811014273.6A patent/CN109191826B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060271234A1 (en) * | 2005-05-31 | 2006-11-30 | Lockheed Martin Corporation | Dock management system and method |
| CN101727616A (en) * | 2008-10-24 | 2010-06-09 | 清华大学深圳研究生院 | Full-field intelligent dispatch method of container wharf trailer |
| CN103164782A (en) * | 2011-12-16 | 2013-06-19 | 招商局国际信息技术有限公司 | Intelligent dispatching system and intelligent dispatching method of container trucks |
| CN105427075A (en) * | 2015-11-24 | 2016-03-23 | 山东科技大学 | Hybrid dynamic scheduling method used for port container truck |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109191826A (en) | 2019-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109191826B (en) | Vehicle scheduling method and vehicle scheduling server | |
| US11948121B2 (en) | System for automatic loading / unloading and related devices | |
| US20210132610A1 (en) | System for realizing automated transport of goods and related apparatus | |
| Facchini et al. | Optimal dry port configuration for container terminals: A non-linear model for sustainable decision making | |
| CN114023094B (en) | Wharf vehicle scheduling system, method, equipment and medium | |
| JP2022515809A (en) | Accurate truck stop methods, devices and systems in the quay crane area | |
| EP3822722A1 (en) | System for realizing automated transport of goods and related apparatus | |
| AU2018409987B2 (en) | Autonomous vehicle control method and autonomous driving control device | |
| CN111724015B (en) | Method, device, equipment and storage medium for switching transport tasks | |
| CN108275476A (en) | Container terminal horizontal transport vehicle dispatch system | |
| CN114415610B (en) | Scheduling method and device for robot, electronic equipment and storage medium | |
| CN109685436A (en) | The cross-border transportation system of automatic driving vehicle and relevant device | |
| JP6818325B2 (en) | Container terminal system utilizing artificial intelligence | |
| JP6818326B2 (en) | Distributed placement system for cargo handling machines utilizing artificial intelligence | |
| CN109002027B (en) | Central control method and central control system | |
| CN114331075A (en) | Yard trailer scheduling method, device, equipment and storage medium | |
| CN105473352A (en) | Tire management system, and tire management method | |
| BR102013019349A2 (en) | METHOD AND SYSTEM | |
| US20230100809A1 (en) | Battery distribution method, device, system, equipment and medium | |
| CN114492904A (en) | Transportation path optimization method of logistics management system | |
| CN113762562B (en) | Method, device and storage medium for generating load information | |
| Dong et al. | A new formulation for the combined maritime fleet deployment and inventory management problem | |
| US11922360B2 (en) | Managing delivery by utilizing multiple vehicles | |
| US20180349833A1 (en) | Managing usage of cargo transportation units | |
| Henesey et al. | Smart container stacking in the yard |
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 | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200330 Address after: 101300, No. two, 1 road, Shunyi Park, Zhongguancun science and Technology Park, Beijing, Shunyi District Applicant after: BEIJING TUSENZHITU TECHNOLOGY Co.,Ltd. Address before: 101300, No. two, 1 road, Shunyi Park, Zhongguancun science and Technology Park, Beijing, Shunyi District Applicant before: TuSimple |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |