CN101944200A - Method and system for dispatching container trucks - Google Patents
Method and system for dispatching container trucks Download PDFInfo
- Publication number
- CN101944200A CN101944200A CN201010231666XA CN201010231666A CN101944200A CN 101944200 A CN101944200 A CN 101944200A CN 201010231666X A CN201010231666X A CN 201010231666XA CN 201010231666 A CN201010231666 A CN 201010231666A CN 101944200 A CN101944200 A CN 101944200A
- Authority
- CN
- China
- Prior art keywords
- task
- time
- executing
- current
- card
- 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
- 238000000034 method Methods 0.000 title claims abstract description 32
- 238000012545 processing Methods 0.000 claims abstract description 7
- 238000003860 storage Methods 0.000 claims description 36
- 238000001514 detection method Methods 0.000 claims description 22
- 238000004364 calculation method Methods 0.000 claims description 11
- 230000006855 networking Effects 0.000 claims description 7
- 230000008569 process Effects 0.000 claims description 3
- 238000005457 optimization Methods 0.000 abstract description 6
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000013459 approach Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003187 abdominal effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to the dispatching field of container trucks, and discloses a method and a system for dispatching the container trucks. The method of the invention has small calculated amount, and can obtain the optimized result of the container truck dispatching; the method of the invention optimizes the container truck dispatching according to the current dock state, is beneficial for processing the sudden condition, and is closer to the actual condition. The system is easy to expand, and reserves a procedure interface, is easy to fuse the yard management and the shore bridge management to the whole system, is convenient for the realization of the integrated optimization of the shore bridges, the container trucks and the yards, can dynamically adjust the use amount of the container trucks according to the dock state, and is easy to realize the different optimizing purposes.
Description
Technical Field
The invention relates to the field of dispatching of container trucks, in particular to a dispatching method and a dispatching system of a container truck.
Background
With the increase of the container trade volume and the development of large-scale ships, the utilization rate of operation resources of a plurality of container terminals reaches or approaches saturation, and with the continuous increase of the throughput of each terminal, how to ensure that the parked ships obtain timely service while putting as little investment as possible becomes an important problem faced by the container terminals. The growth of container transportation and the trend of large-scale and high-speed container ships require that the loading and unloading efficiency of the wharf be continuously improved, and the production scheduling of the container wharf is a key point. In port competition, technical conditions, operation efficiency and management level of ports are important factors representing the competitiveness of ports in addition to the geographical position and the abdominal economic condition of the ports. Therefore, to gain greater benefit in port competition, the operation must be systematized and rationalized, and an effective way to achieve this goal is to optimize and intelligentize the allocation and scheduling of port resources.
In the traditional truck dispatching, the subjective activity of operators is fully exerted to complete the operation of a storage yard by adopting a computer-aided dispatching mode based on the rule that a truck is bound with a shore bridge. This scheduling mode has several problems: the card collection drives in the empty state in about 50% of the time, and the utilization rate is not high; in order to ensure the operation of the shore bridge, under the condition that the shore bridge is far away from the corresponding container yard, the truck serving the shore bridge can only be added to ensure the completion of the task, and once the ship is close to the corresponding shore bridge, a part of the trucks are idle, so that the great waste of resources and cost is caused. Therefore, the truck dispatching has short-term practical significance and long-term significance for the wharf, the short-term significance means that the trucks can complete tasks in a shorter path when meeting the service requirements of the quay crane, oil consumption is saved, and therefore the cost of the wharf is reduced, and the long-term significance means that the scale of the trucks can be reduced while the requirements of the quay crane are met.
Disclosure of Invention
The invention aims to provide a dispatching method and a dispatching system of a container truck, which can better realize the dispatching of a container terminal truck, ensure that the truck can dynamically serve different shore bridges and ships, allocate tasks for each truck and determine the sequence and the running path of each truck for completing the tasks, thereby reducing the waiting time of loading and unloading bridges (shore bridges), saving the total running path of the truck, reducing the no-load rate and achieving the purpose of improving the loading and unloading efficiency of the container terminal.
The technical scheme of the invention is as follows:
a method of dispatching a container truck, comprising the steps of:
s100: carrying out initialization operation;
s200: detecting whether the current hub card i has a task, and if not, executing the step S300; if the task exists, executing S400;
s300: distributing a new task for the concentrator card i, and then executing the step S400;
s400: running a task detection function of the container truck i, and detecting the current task state of the container truck i;
s500: let i be i +1, then perform step S600;
s600: judging whether the container truck i is larger than the total container truck number, if not, executing S200; if yes, executing S700;
s700: detecting the task running states of all the shore bridges, and if any one shore bridge has a task which is not finished, setting the state value of the total task table to be 1;
s800: detecting task running states of all storage yards, and if any storage yard has tasks which are not finished, making the state value of a total task table equal to 1;
s900: setting the current time as the current time + 1;
s1000: judging whether the state value of the total task table is equal to 0 or not, and if so, ending the process; if not, the step S100 is returned to.
The dispatching method of the container truck, wherein the step S100 specifically includes:
s110: making the current time of the timer equal to 0;
s120: making the state value of the total task table equal to 0;
s130: let i equal 0.
The dispatching method of the container truck, wherein the step S400 specifically comprises the following steps:
s410: judging whether the current task completion time of the hub card i is equal to the current time of the timer or not, if so, executing the step S420; if not, executing step S440;
s420: reassigning the task completion time of the concentrator card to be smaller than the current time;
s430: adding a new task service container card to the corresponding shore bridge or storage yard, and then executing the step S450;
s440: judging whether the task of the card concentrator i is not finished, if so, executing the step S450; if not, executing step S460;
s450: let the state value of the overall task table be 1.
The dispatching method of the container truck, wherein the step S700 further comprises:
s710: judging whether a task in a task list of the shore bridge is not finished, if so, executing a step S720, and if not, executing a step S780;
s720: judging whether the current task completion time of the shore bridge is equal to the current time of the timer or not, if so, executing the step S730; if not, executing step S770;
s730: calling a task updating function of a hub of the shore bridge service, and updating various task parameters in a hub task list;
s740: removing the current task of the shore bridge, and updating the completion time and the net working time of the next task of the shore bridge;
s750: judging whether a task is not finished in a task list of the shore bridge, if so, executing a step S770, and if not, executing a step S760;
s760: updating the total running time of the system;
s770: let the state value of the overall task table be 1.
The dispatching method of the container truck, wherein the step S730 further comprises:
s731: calling a task removing function to remove the current task in the task list;
s732: judging whether the task of the card concentrator is not completed, if so, executing a step S733; if not, go to step S736;
s733: updating the time for the card concentrator to complete a new task, and updating the total transportation time of the card concentrator;
s734: judging whether the starting point and the end point of the new task are at the same position, if so, executing the step S735;
s735: calling a detection function of the collection card, and detecting the task state of the collection card;
s736: and calling a task allocation function of the collection card to allocate a new task to the collection card.
The dispatching method of the container truck, wherein the step S800 further comprises:
s810: judging whether a task is not completed in a task list of the yard, if so, executing a step S820, otherwise, executing a step S880;
s820: judging whether the current task completion time of the yard is equal to the current time of the timer or not, if so, executing a step S830; if not, executing step S870;
s830: calling a task updating function of a container yard service container truck, and updating various task parameters in a container truck task list;
s840: removing the current task of the stock dump, and updating the completion time and the net working time of the next task of the stock dump;
s850: judging whether tasks in a task list of the yard are not finished, if so, executing a step S870, otherwise, executing a step S860;
s860: updating the total running time of the system;
s870: let the total task table state value be 1.
A dispatching system of container truck comprises a container truck, a shore bridge and a storage yard, wherein the dispatching system also comprises a general timer, a general task table, a core processing module and functional modules respectively corresponding to the container truck, the shore bridge and the storage yard,
the total timer is used for recording the running time of the wharf maneuvering system, and the recorded time is the current time of the total timer; the total task table is used for storing all tasks of the wharf; the core processing module is used for controlling the operation of the whole system;
the function module corresponding to the hub card comprises:
the collection card task table is used for recording tasks distributed to the collection card;
the collecting card task completion time calculation module is used for recording the current operation completion time;
the collecting card task detection module is used for detecting the current task state of the collecting card;
the collecting card task updating module is used for adding a new task to the collecting card and changing the states of the collecting card task list and the collecting card task completion time calculating module;
the corresponding functional modules of the shore bridge are as follows:
the bank bridge task table is used for recording tasks distributed to the bank bridge;
the quayside container crane task completion time calculation module is used for recording the current operation completion time;
the shore bridge task detection module is used for detecting the current task state of the shore bridge;
the shore bridge task updating module is used for adding a new task to the shore bridge;
the corresponding main functional modules of the stock dump are as follows:
the stock dump task table is used for recording tasks allocated to the stock dump;
the stock yard task completion time calculation module is used for recording the current operation completion time;
the stock dump task detection module is used for detecting the current task state of the stock dump;
and the stock dump task updating module is used for adding a new task to the stock dump.
The invention has the beneficial effects that: the dispatching method of the container truck has small calculated amount, can obtain the optimized result of the truck dispatching in real time, and is favorable for handling emergent situations and closer to practical situations because the truck dispatching is optimized only according to the current wharf situation. The system is easy to expand and leaves a program interface. The storage yard management and the shore bridge management are easy to further integrate into the whole system, and the integral optimization of the shore bridge, the container truck and the storage yard is conveniently realized later. The use number of the trucks can be dynamically adjusted according to the working state of the wharf. Different optimization objectives are easily achieved.
Drawings
FIG. 1 is a dispatch system for a container truck according to an embodiment of the present invention;
FIG. 2 is a main flow chart of a method for scheduling container trucks according to an embodiment of the present invention;
FIG. 3 is a flowchart of a hub task detection provided by an embodiment of the present invention;
fig. 4 is a task detection flowchart of a shore bridge and a yard according to an embodiment of the present invention;
fig. 5 is a flowchart of updating a hub task according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer and clearer, the present invention will be described in further detail below with reference to the accompanying drawings and examples.
English explanation list:
total task table state value have _ work
Current _ time of current time
Task completion time finish _ time
Task removal function task _ move
Total runtime all _ time of system
Detecting check
Task addition function task _ add
Task update function renew _ task
Job time tmp _ time of next task
Working time busy _ time
Referring to fig. 1, a dispatching system of a container truck is provided according to an embodiment of the invention. The scheduling of the wharf mainly includes the allocation of tasks on the hub 100, the shore bridge 400 and the yard 300. Container trucks, hub for short; the hub 100 is used to transport goods; the shore bridge 400 is used for loading goods on a container truck and transporting the goods away; the yard 300 is used for a site where goods are stacked. The scheduling system 200 mainly includes: a general timer 201, a general task table 202, a core processing module 220. Wherein, the total timer 201 is used for recording the running time of the terminal maneuvering system, and the recorded time is current-time (current time); the general task table 202 is used for storing all tasks of the wharf; the core processing module 220 is used for controlling the operation of the whole system. There is a total timer 201 input to all objects corresponding to the hub 100, the shore bridge 400, and the yard 300, and all objects perform corresponding operations according to the synchronization of the timer. The timer is clocked every 1 second and the system cycles every 1 second. Then, in each loop, it is determined whether the object check timing variable (i.e. the time current-time of the total timer) of the container truck 100, the shore bridge 400 and the yard 300 is equal to the completion time (finish-time) of the task being executed, if so, the corresponding operation is taken (see below), otherwise, the current operation task is executed continuously.
The system 200 further includes functional modules corresponding to the container truck 100, the shore bridge 400, and the yard 300. Wherein,
the main functional modules corresponding to the card concentrator 100 include: the hub task table 203 is used for recording tasks allocated to the hub; a container truck task completion time calculation module 204 (container truck finish-time module) for recording the current job completion time; a hub task detection module 205 (hub check module) for detecting the current task state of the hub; a container truck task update module 206 (container truck renew-task module) for adding a new task to the container truck and changing the states of the container truck task table and the container truck task completion time calculation module.
The main functional modules corresponding to the shore bridge 400 are: the shore bridge task table 207 is used for recording tasks allocated to the shore bridge; a shore bridge task completion time calculation module 208 (shore bridge finish-time module) for recording the current job completion time; the shore bridge task detection module 209 (shore bridge check module) is used for detecting the current task state of the shore bridge, and if a new task is available, updating the completion time of the new task, the net working time of the shore bridge, and the like; the shore bridge task update module 210 (shore bridge task-add module) is used to add new tasks to the shore bridge.
The storage yard 300 has the following main functional modules: the yard task table 211 is used for recording tasks assigned to the yard; a yard task completion time calculation module 212 (yard finish-time module) for recording the current job completion time; the stock dump task detection module 213 (stock dump check module) is used for detecting the current task state of the stock dump, and if a new task updates the completion time of the new task, the net working time of the stock dump, and the like; the yard task update module 214 (yard task-add module) is used to add new tasks to the yard.
The following were found in the course of verifying the results of the container truck's dispatch method with the simulation model: in the case that the task path allocated by each vehicle is the same, the working start time of each vehicle is set to different values (within 20 seconds in a small time range), and the final result is that although the empty rate of the container truck is kept unchanged, the difference of the total time of a certain quay bridge to complete all tasks of the quay bridge can reach 10%, namely, the difference of 20 seconds can cause the difference of more than 2000 seconds to be very different. In the actual situation, the starting time, the running speed and the loading and unloading time of the shore bridge yard of each vehicle are not completely fixed values, so that the randomness is realized. This indicates that: assigning the task of each vehicle based only on initial conditions is not a viable approach, even if the best solution is obtained in theory, it may not be a good solution in practical situations. The assignment of tasks to vehicles must be a dynamic assignment, i.e. each vehicle, after completing one task, should assign its next task according to the current situation at the quay.
On the basis of establishing a system, the invention establishes a dynamic optimization method for the dispatching of the hub cards, and the detailed process is as follows:
(1) each vehicle selects one task from the dock's general task table 202 as the next task at the beginning of the job or after completing one job task. The selected task satisfies the following conditions: the empty time + projected wait time of the hub is minimal. Because the loading and unloading tasks of one wharf do not exceed 1 ten thousand per day, and many tasks in the 1 ten thousand tasks are all conveyed from a certain storage yard to a certain shore bridge or from a certain shore bridge to a certain storage yard, the invention can classify the tasks according to the characteristics, so that the obtained task types are about 100, and then a task which can minimize the empty driving distance and the predicted waiting time of the container truck can be found in a short time by using an exhaustive method.
Wherein the expected wait time is made up of the sum of the wait time of the container trucks at the yard and the wait time at the shore bridge. The waiting time of the container truck at the storage yard means the time when the container truck arrives at the storage yard and the storage yard has tasks being executed, and the container truck waits for the storage yard to finish all the tasks. After each truck is scheduled with a task, the task enters a task list of a storage yard, and the time t1 when the storage yard completes all the tasks can be obtained by checking the existing task list of the storage yard, and the invention can also predict the time t2 when the truck arrives at the storage yard, if t1 is greater than t2, the waiting time of the truck at the storage yard is t1-t2, otherwise, the waiting time of the truck at the shore bridge can be obtained by calculation, if 0.
(2) After the truck selects a task, the selected task is added into the truck task table 203, and the total task table of the wharf (namely, the task in the total task table is removed), the scheduled task completion time of the shore bridge and the yard bridge (namely, the finish-time of the shore bridge and the finish-time of the yard), and the current task completion time of the truck (namely, the finish-time of the truck) are updated.
Fig. 2 is a main flow chart of a scheduling method of a container truck according to an embodiment of the present invention. The dispatching method of the container truck mainly comprises the following steps:
s100: the system is initialized.
The step S100 further includes the steps of:
s110: let current-time equal to 0, i.e. the value of the initialization timer.
S120: let have-work be 0, i.e. assume that all tasks in the wharf master task table have been completed.
S130: let i equal 0, i.e. run the test from the first truck.
S200: detecting whether the current hub card i has a task, and if not, executing the step S300; if there is a task, S400 is executed.
S300: a new task is assigned to the hub i, and then step S400 is performed.
S400: and running a task detection function of the hub card i, and detecting the current task state of the hub card i.
Fig. 3 is a flowchart of detecting a truck-collecting task according to an embodiment of the present invention. The main functions of the task detection function are: it is checked whether the current task completion time (finish-time) and the total timer time (current-time) coincide. If the consistency indicates that the transportation task is completed, setting the finish-time to be-1 (the finish-time can be set to other values as long as the finish-time is less than the current-time). And calling a task adding function of a corresponding shore bridge or a storage yard according to the destination of the task, and setting the have-work to be 1 (indicating that the whole system still needs to do the task and the system continues to run). And if not, detecting whether the tasks in the task table are not finished. If there are not completed tasks in the task list, let have-work be 1 (indicating that there are tasks in the whole system to be done, the system continues to run).
The step S400 further includes the steps of:
s410: judging whether the current task completion time (finish-time) of the container card i is equal to the current time (current-time) of the timer or not, if yes, executing the step S420; if not, go to step S440.
S420: the finish-time is reassigned to be less than the current-time. For example: let finish-time be-1.
S430: and adding a new task service container card to the corresponding shore bridge or storage yard. Then, step S450 is performed.
The system calls a corresponding shore bridge or yard task adding function to add a new task to the shore bridge or yard to serve the current truck which finishes the transportation task.
S440: judging whether the task of the card concentrator i is not finished, if so, executing the step S450; if not, go to step S460.
S450: let have-work equal to 1.
S460: return call point
S500: let i be i +1, and then step S600 is performed.
Let i be i +1 for cyclically detecting each card concentrator; and the dynamic detection of each card concentrator by the system is realized.
S600: judging whether i is larger than the total number of the collecting cards, if not, executing S200; if yes, go to S700.
If not, the concentrator card is not detected, and the detection is required to be continued; yes indicates that the hub has already detected once, and the detection of the shore bridge or the yard can be started.
S700: detecting the task running states of all the shore bridges, and if any one of the shore bridges has a task which is not finished, making the state value of a total task table have-work equal to 1;
fig. 4 is a task detection flowchart of a shore bridge and a yard according to an embodiment of the present invention. Since the operation modes of the shore bridge and the storage yard are almost the same, and the average hoisting time is different, the shore bridge and the storage yard define the same check () function. The main functions are as follows: firstly, checking whether tasks in a task table of a shore bridge or a storage yard are not finished, and if not, returning to a program calling point. It is checked whether the current task completion time finish-time and the global timer time current-time coincide.
If so, then: and calling a task update function renew-task () of the current service set card. And calling a task-move () function to remove the current task of the shore bridge or the yard and obtain the operation time tmp-time of the next task. Updating the completion time of the newly added tasks of the shore bridge or the stock dump: the finish-time is current-time + tmp-time. Updating the working time of the whole shore bridge or storage yard: and busy-time is tmp-time + busy-time. If the job chain is empty, updating all-time as current-time.
If the two values are not consistent, let have-work be 1.
The step S700 further includes the steps of:
s710: and judging whether a task in the task list of the shore bridge is not finished, if so, executing the step S720, and if not, executing the step S780.
S720: judging whether the current task completion time (finish-time) of the shore bridge is equal to the current time (current-time) of the timer or not, if so, executing the step S730; if not, executing step S770.
S730: and calling a task updating function of the service hub card, and updating various task parameters in the hub card task list. For example: removing the original task, calculating the completion time of the newly added task, counting the total transportation time of the container truck i and the like.
Referring to fig. 5, which is a flowchart of the renew _ task () function, when a quay crane or a yard finishes a task of loading and unloading a container truck, the renew _ task () function of the corresponding container truck is called, and its main functions are: calling task _ move () to remove the first task (i.e. the current task) in the task list; if the task list has the incomplete task, updating finish _ time as the running distance/the truck running speed + the current time of the current task. The check () function is called if the start and end points of the current task are the same location (meaning no further travel to the next destination is required). And if the task list has no unfinished task (the task is empty), calling a truck task allocation function of the wharf class.
S731: and calling a function task-move to remove the current task in the task list.
S732: judging whether the task of the card concentrator is not completed, if so, executing a step S733; if not, go to step S736.
S733: and updating the time for the card concentrator to complete the new task, and updating the total transportation time of the card concentrator.
S734: judging whether the starting point and the end point of the new task are at the same position, if so, executing the step S735; if not, go to step S737.
S735: and calling a detection function of the collection card, detecting the task state of the collection card, and executing the step S737.
The method for detecting the task state of the container truck comprises the following specific steps: s410 to S460.
S736: and calling a task allocation function of the collection card to allocate a new task to the collection card.
S737: and returning to the calling point of the program.
S740: and removing the current task of the shore bridge, and updating the completion time and the net working time of the next task of the shore bridge.
S750: and judging whether tasks are not finished in the task list of the shore bridge, if so, executing step S770, and otherwise, executing step S760.
S760: the total run time (all-time) of the system is updated. If the timer starts to time from 0, making all-time equal to current-time; if the timer adopts the actual clock time, the all-time is the current-time-start-time.
S770: let have-work equal to 1.
S780: return program call point
S800: detecting task running states of all storage yards, and if any storage yard has tasks which are not finished, making a state value of a general task table have-work equal to 1;
the step S800 further includes the steps of:
s810: and judging whether the task list of the storage yard has tasks which are not finished, if so, executing step S820, and otherwise, executing step S880.
S820: judging whether the current task completion time (finish-time) of the storage yard is equal to the current time (current-time) of the timer or not, if so, executing the step S830; if not, go to step S870.
S830: and calling a task updating function of the service hub card, and updating various task parameters in the hub card task list. For example: removing the original task, calculating the completion time of the newly added task, counting the total transportation time of the container truck i and the like.
Specifically, steps S731 to S737 are included.
S840: the current task of the yard is removed and the completion time and the net work time (busy-time) of the next task of the yard are updated.
S850: and judging whether the tasks in the task list of the storage yard are not finished, if so, executing the step S870, and otherwise, executing the step S860.
S860: the total run time (all-time) of the system is updated. If the timer starts to time from 0, making all-time equal to current-time; if the timer adopts the actual clock time, the all-time is the current-time-start-time.
S870: let have-work equal to 1.
S880: and returning to the program calling point.
S900: let current-time be current-time +1, i.e. the total timer value plus 1.
S1000: judging whether the have-work is equal to 0 or not, and if so, ending the program system to stop working; if not, executing S120 in step S100.
In the method, each card concentrator is regarded as an intelligent Agent, and the intelligent Agent can select one task which enables self-generation to be most efficient (namely, has minimum useless overhead) from the incomplete tasks of the whole wharf according to the current situation of the wharf and the position of the intelligent Agent. When all the trucks of the wharf can work with higher efficiency, the corresponding whole wharf has higher working efficiency, thereby realizing the purposes of reducing the waiting time of a loading bridge (shore bridge), saving the total path of vehicle driving, reducing the idle load rate and improving the loading and unloading efficiency of the container wharf.
Wharf data in a paper of Chenfangding tripod of Dalian maritime university (container truck scheduling research based on swarm intelligence algorithm) is used as experimental data, the same number of trucks (10 trucks) is set in the paper, and the obtained optimization result is as follows: average idle rate 35%, all task completion time 14566 seconds. The average idle rate of the results is better than 46% in its paper, and the time for completion of all tasks is 18628 seconds.
If the number of the trucks is set to 15, the obtained optimization result is as follows: the average idle rate is 42%, and the all-task completion time is 10844 seconds, which is about 15% more than the ideal shortest operation time (i.e. under the condition that the trucks are enough, the shore bridge crane does not stop working without waiting time).
It is to be understood that the invention is not limited to the examples described above, but that modifications and variations may be effected thereto by those of ordinary skill in the art in light of the foregoing description, and that all such modifications and variations are intended to be within the scope of the invention as defined by the appended claims.
Claims (7)
1. A method of dispatching a container truck, comprising the steps of:
s100: carrying out initialization operation;
s200: detecting whether the current hub card i has a task, and if not, executing the step S300; if the task exists, executing S400;
s300: distributing a new task for the concentrator card i, and then executing the step S400;
s400: running a task detection function of the container truck i, and detecting the current task state of the container truck i;
s500: let i be i +1, then perform step S600;
s600: judging whether the container truck i is larger than the total container truck number, if not, executing S200; if yes, executing S700;
s700: detecting the task running states of all the shore bridges, and if any one shore bridge has a task which is not finished, setting the state value of the total task table to be 1;
s800: detecting task running states of all storage yards, and if any storage yard has tasks which are not finished, making the state value of a total task table equal to 1;
s900: setting the current time as the current time + 1;
s1000: judging whether the state value of the total task table is equal to 0 or not, and if so, ending the process; if not, the step S100 is returned to.
2. The method for dispatching container trucks according to claim 1, wherein said step S100 specifically comprises:
s110: making the current time of the timer equal to 0;
s120: making the state value of the total task table equal to 0;
s130: let i equal 0.
3. The method for dispatching container trucks according to claim 1, wherein step S400 specifically comprises:
s410: judging whether the current task completion time of the hub card i is equal to the current time of the timer or not, if so, executing the step S420; if not, executing step S440;
s420: reassigning the task completion time of the concentrator card to be smaller than the current time;
s430: adding a new task service container card to the corresponding shore bridge or storage yard, and then executing the step S450;
s440: judging whether the task of the card concentrator i is not finished, if so, executing the step S450; if not, executing step S460;
s450: let the state value of the overall task table be 1.
4. The method of dispatching a container truck according to claim 1, wherein step S700 further comprises:
s710: judging whether a task in a task list of the shore bridge is not finished, if so, executing a step S720, and if not, executing a step S780;
s720: judging whether the current task completion time of the shore bridge is equal to the current time of the timer or not, if so, executing the step S730; if not, executing step S770;
s730: calling a task updating function of a hub of the shore bridge service, and updating various task parameters in a hub task list;
s740: removing the current task of the shore bridge, and updating the completion time and the net working time of the next task of the shore bridge;
s750: judging whether a task is not finished in a task list of the shore bridge, if so, executing a step S770, and if not, executing a step S760;
s760: updating the total running time of the system;
s770: let the state value of the overall task table be 1.
5. The method of dispatching a container truck according to claim 5, wherein step S730 further comprises:
s731: calling a task removing function to remove the current task in the task list;
s732: judging whether the task of the card concentrator is not completed, if so, executing a step S733; if not, go to step S736;
s733: updating the time for the card concentrator to complete a new task, and updating the total transportation time of the card concentrator;
s734: judging whether the starting point and the end point of the new task are at the same position, if so, executing the step S735;
s735: calling a detection function of the collection card, and detecting the task state of the collection card;
s736: and calling a task allocation function of the collection card to allocate a new task to the collection card.
6. The method of dispatching a container truck according to claim 1, wherein step S800 further comprises:
s810: judging whether a task is not completed in a task list of the yard, if so, executing a step S820, otherwise, executing a step S880;
s820: judging whether the current task completion time of the yard is equal to the current time of the timer or not, if so, executing a step S830; if not, executing step S870;
s830: calling a task updating function of a container yard service container truck, and updating various task parameters in a container truck task list;
s840: removing the current task of the stock dump, and updating the completion time and the net working time of the next task of the stock dump;
s850: judging whether tasks in a task list of the yard are not finished, if so, executing a step S870, otherwise, executing a step S860;
s860: updating the total running time of the system;
s870: let the total task table state value be 1.
7. A dispatching system of container truck comprises a container truck, a shore bridge and a storage yard, and is characterized by also comprising a total timer, a total task list, a core processing module and functional modules respectively corresponding to the container truck, the shore bridge and the storage yard, wherein,
the total timer is used for recording the running time of the wharf maneuvering system, and the recorded time is the current time of the total timer; the total task table is used for storing all tasks of the wharf; the core processing module is used for controlling the operation of the whole system;
the function module corresponding to the hub card comprises:
the collection card task table is used for recording tasks distributed to the collection card;
the collecting card task completion time calculation module is used for recording the current operation completion time;
the collecting card task detection module is used for detecting the current task state of the collecting card;
the collecting card task updating module is used for adding a new task to the collecting card and changing the states of the collecting card task list and the collecting card task completion time calculating module;
the corresponding functional modules of the shore bridge are as follows:
the bank bridge task table is used for recording tasks distributed to the bank bridge;
the quayside container crane task completion time calculation module is used for recording the current operation completion time;
the shore bridge task detection module is used for detecting the current task state of the shore bridge;
the shore bridge task updating module is used for adding a new task to the shore bridge;
the corresponding main functional modules of the stock dump are as follows:
the stock dump task table is used for recording tasks allocated to the stock dump;
the stock yard task completion time calculation module is used for recording the current operation completion time;
the stock dump task detection module is used for detecting the current task state of the stock dump;
and the stock dump task updating module is used for adding a new task to the stock dump.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010231666XA CN101944200A (en) | 2010-07-15 | 2010-07-15 | Method and system for dispatching container trucks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010231666XA CN101944200A (en) | 2010-07-15 | 2010-07-15 | Method and system for dispatching container trucks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101944200A true CN101944200A (en) | 2011-01-12 |
Family
ID=43436182
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010231666XA Pending CN101944200A (en) | 2010-07-15 | 2010-07-15 | Method and system for dispatching container trucks |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101944200A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104182777A (en) * | 2014-08-13 | 2014-12-03 | 成都四威高科技产业园有限公司 | RFID (Radio Frequency Identification)-based AGV (Automatic Guided Vehicle) multi-task positioning method |
| CN105319988A (en) * | 2015-11-16 | 2016-02-10 | 北京科技大学 | An emulation system and method for a multi-layer shuttle-based storage and retrieval system |
| CN107492061A (en) * | 2017-07-28 | 2017-12-19 | 武汉依迅北斗空间技术有限公司 | A kind of turn out for work verification method and system for slag-soil truck |
| CN108596446A (en) * | 2018-04-03 | 2018-09-28 | 宁波诺丁汉大学 | Truck distributing method in the port of subject container crane task queue constraint |
| CN110790143A (en) * | 2019-10-30 | 2020-02-14 | 河北工业大学 | Dispatching method of automatic wharf crane |
| CN114792159A (en) * | 2022-04-02 | 2022-07-26 | 山东港口科技集团日照有限公司 | Unmanned container terminal truck-collecting dispatching method and system for shore-following type full-automatic container terminal |
| CN115619197A (en) * | 2022-11-16 | 2023-01-17 | 湖南洋马信息有限责任公司 | Container wharf ship unloading scheduling management method and system |
| CN115724159A (en) * | 2022-11-24 | 2023-03-03 | 深圳海星智驾科技有限公司 | Method, device and system for adjusting loading and unloading sequence of containers in storage yard |
-
2010
- 2010-07-15 CN CN201010231666XA patent/CN101944200A/en active Pending
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104182777A (en) * | 2014-08-13 | 2014-12-03 | 成都四威高科技产业园有限公司 | RFID (Radio Frequency Identification)-based AGV (Automatic Guided Vehicle) multi-task positioning method |
| CN104182777B (en) * | 2014-08-13 | 2017-05-03 | 成都四威高科技产业园有限公司 | RFID (Radio Frequency Identification)-based AGV (Automatic Guided Vehicle) multi-task positioning method |
| CN105319988A (en) * | 2015-11-16 | 2016-02-10 | 北京科技大学 | An emulation system and method for a multi-layer shuttle-based storage and retrieval system |
| CN107492061A (en) * | 2017-07-28 | 2017-12-19 | 武汉依迅北斗空间技术有限公司 | A kind of turn out for work verification method and system for slag-soil truck |
| CN108596446A (en) * | 2018-04-03 | 2018-09-28 | 宁波诺丁汉大学 | Truck distributing method in the port of subject container crane task queue constraint |
| CN108596446B (en) * | 2018-04-03 | 2020-12-01 | 宁波诺丁汉大学 | Port container truck dispatching method constrained by container crane task queue |
| CN110790143A (en) * | 2019-10-30 | 2020-02-14 | 河北工业大学 | Dispatching method of automatic wharf crane |
| CN114792159A (en) * | 2022-04-02 | 2022-07-26 | 山东港口科技集团日照有限公司 | Unmanned container terminal truck-collecting dispatching method and system for shore-following type full-automatic container terminal |
| CN114792159B (en) * | 2022-04-02 | 2023-05-23 | 山东港口科技集团日照有限公司 | Unmanned integrated card dispatching method and system for coastal full-automatic container terminal |
| CN115619197A (en) * | 2022-11-16 | 2023-01-17 | 湖南洋马信息有限责任公司 | Container wharf ship unloading scheduling management method and system |
| CN115724159A (en) * | 2022-11-24 | 2023-03-03 | 深圳海星智驾科技有限公司 | Method, device and system for adjusting loading and unloading sequence of containers in storage yard |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101944200A (en) | Method and system for dispatching container trucks | |
| CN114023094B (en) | Wharf vehicle scheduling system, method, equipment and medium | |
| Tang et al. | Modeling and solution of the joint quay crane and truck scheduling problem | |
| CN105427075A (en) | Hybrid dynamic scheduling method used for port container truck | |
| CN111563672B (en) | Method for configuring number of multiple AGV | |
| CN112070296B (en) | Fuzzy reasoning based truck-mounted dispatching method | |
| CN110942203A (en) | Automatic container terminal AGV path optimization method | |
| CN115649722B (en) | Dispatching method and device for storage vehicles | |
| CN111353706B (en) | Task scheduling method for preventing deadlock of multi-load automatic guided vehicle | |
| Xing et al. | Dispatch problem of automated guided vehicles for serving tandem lift quay crane | |
| CN112415953B (en) | Scheduling method and device of elevator | |
| CN114331075A (en) | Yard trailer scheduling method, device, equipment and storage medium | |
| Nguyen et al. | Heuristic algorithms for constructing transporter pools in container terminals | |
| CN112016810A (en) | Intelligent scheduling method for same-rail double-crossing straddle carrier | |
| CN117875641A (en) | Steel coil transportation task allocation method, device and equipment for cold rolling mill | |
| CN112559951A (en) | Container transport AGV scheduling method, equipment, electronic terminal and storage medium | |
| CN109409603B (en) | Scheduling algorithm applied to multiple traveling vehicles | |
| CN115796553B (en) | AGV task scheduling method, device and AGV scheduling system | |
| CN108596446B (en) | Port container truck dispatching method constrained by container crane task queue | |
| CN115963797A (en) | Scheduling method, system, RGV, electronic device and computer medium | |
| CN113743739B (en) | AGV scheduling method based on mixed integer programming and combined optimization algorithm | |
| KR20020061293A (en) | Method for dispatching a transporter of a port container terminal | |
| CN115187096A (en) | Dispatching optimization method for getting-on operation of automatic driving electric container | |
| Chen et al. | Optimization research of joint quay crane scheduling and block selection in container terminals | |
| Nguyen et al. | Dispatching vehicles considering uncertain handling times at port container terminals |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20110112 |