Auction-based port collaborative optimization method and system

Abstract

The invention provides an auction-based port collaborative optimization method and system, and relates to the technical field of port berth allocation, and the method comprises the steps: generating a first berth allocation plan of each auction port based on a demand order of each auction port; classifying the demand orders of each auction port to obtain a plurality of auction port orders; constructing a new cost calculation model; based on the first berth allocation plan of each auction port, obtaining an intention auction order of each auction port through a plurality of auction port orders and berth resources of each auction port; auction is carried out based on a plurality of auction ports through a new cost calculation model, and an intention auction order with successful auction is used as a new order of the auction port; and updating the first berth allocation plan of the auction port through the newly added order to obtain a third berth allocation plan, and arranging ship berthing to complete collaborative optimization of berths between ports. The problem that the port operation efficiency and the resource utilization rate are limited by an existing port berth allocation method is solved.

Description

Technical Field

[0001] The present invention relates to the technical field of port berth allocation, and in particular to an auction-based port collaborative optimization method and system. Background Art

[0002] With the rapid development of global trade, ports, as important logistics nodes, have an increasingly greater impact on the overall supply chain through their operational efficiency. Berth allocation for ships in ports is one of the core issues in port operation management, which is directly related to the turnover efficiency of ships and the throughput of ports.

[0003] The berth and quay crane allocation problem is a classic optimization problem in port management, which mainly involves how to reasonably allocate port berths to maximize the port's throughput and efficiency. Traditional berth allocation methods include static berth allocation and dynamic berth allocation. The static berth allocation method assumes that the arrival time and demand of all ships are known before the allocation begins, while the dynamic berth allocation takes into account the uncertainty of the arrival time and demand of ships and adjusts the berth allocation plan in real time.

[0004] Among the existing methods, the berth allocation method based on optimization algorithm requires a lot of computing resources, the computing time is usually long, and the ability to handle emergencies and uncertainties is limited, lacking flexibility. The resource allocation method based on auction mechanism is mainly used for the allocation of single resources. The berth allocation problem is relatively complex, the berth resources are fixed, and it is difficult to fully consider the actual situation such as the arrival time of the ship and the berthing demand. Summary of the invention

[0005] The purpose of the present invention is to provide a port collaborative optimization method and system based on auction to improve the above problems. In order to achieve the above purpose, the technical solution adopted by the present invention is as follows:

[0006] In a first aspect, the present application provides a port collaborative optimization method based on auction, comprising:

[0007] Generate a first berth allocation plan for each bidding port based on the demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time;

[0008] Classify the demand orders of each auction port to obtain multiple auction port orders;

[0009] Build a new cost calculation model;

[0010] Based on the first berth allocation plan of each auction port, a second berth allocation plan of each auction port is generated through multiple auction port orders and the berth resources of each auction port, and the intended auction order of each auction port is obtained;

[0011] Through the newly added cost calculation model, bid for each intended auction order in turn based on multiple auction ports, and use the successfully bid intended auction order as the new order of the auction port;

[0012] The first berth allocation plan of the auction port is updated through the newly added order to obtain a third berth allocation plan, and the ship berthing is arranged based on the third berth allocation plan to complete the coordinated optimization of berths between ports.

[0013] In the second aspect, the present application also provides a port collaborative optimization system based on auction, including:

[0014] A first generating module is used to generate a first berth allocation plan for each bidding port based on a demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time;

[0015] A classification module is used to classify the demand orders of each auction port to obtain multiple auction port orders;

[0016] Model building module, used to build a new cost calculation model;

[0017] The second generation module is used to generate a second berth allocation plan for each auction port based on the first berth allocation plan for each auction port, through multiple auction port orders and berth resources of each auction port, to obtain an intended auction order for each auction port;

[0018] The bidding module is used to bid on each intended auction order in turn based on multiple bidding ports through a new cost calculation model, and use the successfully bid intended auction order as a new order of the bidding port;

[0019] The third generation module is used to update the first berth allocation plan of the auction port through the new order to obtain a third berth allocation plan, arrange ship berthing based on the third berth allocation plan, and complete the coordinated optimization of berths between ports.

[0020] The beneficial effects of the present invention are as follows: the present invention retains the fairness and flexibility of the auction mechanism, and also combines multiple factors in the actual operation of the port, and the resource allocation between ports not only considers the bid, but also takes into account the overall efficiency of the port and the actual needs of the ship. Through dynamic adjustment and optimization, while reducing ship delays, the reasonable allocation of resources and the coordinated development between ports are achieved. This method is not only suitable for simple resource allocation, but also can cope with complex port berth allocation problems, thereby better improving the overall operational efficiency.

[0021] Other features and advantages of the present invention will be set forth in the following description, and in part will become apparent from the description, or may be understood by practicing embodiments of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments are briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without creative work.

[0023] Figure 1 It is a schematic flow chart of the auction-based port collaborative optimization method described in an embodiment of the present invention;

[0024] Figure 2 It is a schematic diagram of the structure of the port collaborative optimization device based on auction described in an embodiment of the present invention;

[0025] Figure 3 It is a schematic diagram of an auction between certain ports described in an embodiment of the present invention.

[0026] Markings in the figure: 800, auction-based port collaborative optimization equipment; 801, processor; 802, memory; 803, multimedia component; 804, I / O interface; 805, communication component. DETAILED DESCRIPTION

[0027] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments. The components of the embodiments of the present invention generally described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0028] It should be noted that similar reference numerals and letters represent similar items in the following drawings, so once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings. At the same time, in the description of the present invention, the terms "first", "second", etc. are only used to distinguish the description and cannot be understood as indicating or implying relative importance.

[0029] Embodiment 1:

[0030] This embodiment provides a port collaborative optimization method based on auction.

[0031] See also Figure 1 , the figure shows that the method includes step S100, step S200, step S300, step S400, step S500, and step S600.

[0032] Step S100: generating a first berth allocation plan for each bidding port based on the demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time;

[0033] Step S200: classifying the demand orders of each auction port to obtain multiple auction port orders;

[0034] The step S200 comprises:

[0035] Get the demand orders for each auction port;

[0036] Generate a berth allocation plan for each auction port through the demand order, the berth allocation plan including the ship's berth location, port entry time, loading and unloading time, port departure time and the number of quay cranes allocated to the ship;

[0037] Arrange berthing of vessels through the berth allocation plan;

[0038] Demand orders with waiting time exceeding the preset threshold or incurring longer delays will be treated as auction port orders.

[0039] In this embodiment, each port collects information such as arrival time, berthing requirements, and ship size of all ships according to order requirements, generates a corresponding berth allocation plan, and allocates berths to ships according to the berth allocation plan.

[0040] At the same time, demand orders are classified according to their waiting time, and orders with longer waiting times are separated and auctioned as auction port orders. This can make full use of berth resources in surrounding ports, effectively divert the loading and unloading pressure of each port, and reduce the waiting time of ships.

[0041] Step S300: constructing a new cost calculation model;

[0042] The step S300 comprises:

[0043] Obtain the ship's berthing position and ideal berth;

[0044] Defines the kilometer loss for each kilometer that a ship cannot dock at an ideal berth;

[0045] Calculating a first cost by using the berthing position, the ideal berth and the kilometer loss;

[0046] Obtain the actual and estimated departure time of the ship;

[0047] Define the time loss per unit time when the ship is unable to leave the port at the expected departure time;

[0048] Calculate a second cost by using the actual departure time, the estimated departure time, and the time loss;

[0049] Obtaining the number of quay cranes allocated to the ship and the use loss of each quay crane per unit time, and calculating the third cost based on the number of quay cranes and the use loss;

[0050] A new cost calculation model is constructed by using the first cost, the second cost and the third cost.

[0051] The formula for the new cost calculation model is:

[0052]

[0053] Where F is the total price of the auction, V is the set of ships, c1 is the loss per kilometer when ship i cannot dock at the ideal berth, and x is i represents the berthing position of ship i, b i represents the ideal berth of ship i, |·| represents the absolute value, c2 represents the time loss per unit time if ship i cannot leave the port at the expected departure time, and f i represents the actual departure time of ship i, d i represents the estimated departure time of ship i, (·) + If it is less than 0, it is taken as 0. c3 represents the loss of each quay crane per unit time. q represents the number of quay cranes allocated to ship i. r itq It means that at time t, if q quay cranes are assigned to ship i, then it is 1, otherwise it is 0, r i max represents the maximum number of quay cranes that ship i can bear, r i min represents the minimum number of quay cranes required for ship i.

[0054] Among them, r i max and r i min All are determined by the shipping company contract.

[0055] Step S400: Based on the first berth allocation plan of each auction port, a second berth allocation plan of each auction port is generated through multiple auction port orders and the berth resources of each auction port, and the intended auction order of each auction port is obtained;

[0056] Step S500: by adding a new cost calculation model, bidding on each intended auction order in turn based on multiple bidding ports, and taking the successfully bid intended auction order as a new order of the bidding port;

[0057] By adding a new cost calculation model, before bidding on each intended auction order in turn based on multiple bidding ports, it also includes:

[0058] It is determined in turn whether each intended auction order of each bidding port conflicts with the first berth allocation plan of the bidding port. If so, the bidding port gives up bidding for the conflicting intended auction order. Otherwise, the bidding port continues to bid for the conflicting intended auction order.

[0059] The step S500 comprises:

[0060] For each intended auction order, the additional cost of each bidding port for the intended auction order is calculated through the additional cost calculation model, and the additional cost is used as the bid price of the bidding port for the intended auction order;

[0061] Submit a bid through the bidding port participating in the bidding of the intended auction order;

[0062] Sort all submitted bids, assign the intended auction order to the bid port with the lowest bid, and complete the bidding for the intended auction order;

[0063] In this embodiment, the bid price is the additional cost, indicating that the auction port is willing to process the order at this price.

[0064] After all the bidding for intended auction orders is completed, the successfully bid intended auction orders will be treated as new orders for the auction port.

[0065] In this embodiment, multiple auction ports and bidding ports participate in the auction together. The auction port orders are auctioned one by one. If the auction port order is an intended auction order of multiple bidding ports, these bidding ports bid according to the berth allocation plan of the intended auction order.

[0066] The bidding port participating in the auction shall determine whether the intended auction order conflicts with its own first berth allocation plan. If so, the bidding may be abandoned. Otherwise, the additional cost of bidding for the intended auction order shall be calculated and the price shall be submitted as the bid.

[0067] All bids for the intended auction order are sorted, the bidder with the lowest additional cost is selected as the winning bidder, and the intended auction order is allocated to the winning auction port to ensure the economy and efficiency of order allocation and reduce overall operating costs.

[0068] After the bidding for all intended auction orders is completed, each bidding port will integrate the new orders and end the auction.

[0069] Step S600: The first berth allocation plan of the auction port is updated through the newly added order to obtain a third berth allocation plan, and the ship berthing is arranged based on the third berth allocation plan to complete the collaborative optimization of berths between ports.

[0070] The auction mechanism of the present invention makes berth allocation more flexible, can quickly respond to changes in resources and demands of different ports, and improve the overall operational efficiency of the ports.

[0071] Embodiment 2:

[0072] This embodiment provides a port collaborative optimization system based on auction, and the system includes:

[0073] A first generating module is used to generate a first berth allocation plan for each bidding port based on a demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time;

[0074] A classification module is used to classify the demand orders of each auction port to obtain multiple auction port orders;

[0075] Model building module, used to build a new cost calculation model;

[0076] The second generation module is used to generate a second berth allocation plan for each auction port based on the first berth allocation plan for each auction port, through multiple auction port orders and berth resources of each auction port, to obtain an intended auction order for each auction port;

[0077] The bidding module is used to bid on each intended auction order in turn based on multiple bidding ports through a new cost calculation model, and use the successfully bid intended auction order as a new order of the bidding port;

[0078] The third generation module is used to update the first berth allocation plan of the auction port through the new order to obtain a third berth allocation plan, arrange ship berthing based on the third berth allocation plan, and complete the coordinated optimization of berths between ports.

[0079] The classification module comprises:

[0080] The first acquisition unit is used to acquire the demand order of each auction port;

[0081] A first generating unit, configured to generate a berth allocation plan for each auction port through the demand order, wherein the berth allocation plan includes a berth location, port entry time, loading and unloading time, port departure time, and the number of quay cranes allocated to the ship;

[0082] A first arrangement unit, used for arranging ship berthing according to the berth allocation plan;

[0083] The classification unit is used to classify demand orders whose waiting time exceeds a preset threshold or generates a long delay as auction port orders.

[0084] The model building module includes:

[0085] The second acquisition unit is used to acquire the berthing position and ideal berth of the ship;

[0086] The first definition unit is used to define the kilometer loss per kilometer when the ship cannot dock at the ideal berth;

[0087] A first calculation unit, configured to calculate a first cost according to the berthing position, the ideal berth and the kilometer loss;

[0088] The third acquisition unit is used to acquire the actual departure time and estimated departure time of the ship;

[0089] The second definition unit is used to define the time loss per unit time when the ship cannot leave the port at the expected departure time;

[0090] A second calculation unit, configured to calculate a second cost by using the actual departure time, the estimated departure time, and the time loss;

[0091] A third calculation unit is used to obtain the number of quay cranes allocated to the ship and the use loss of each quay crane per unit time, and calculate a third cost according to the number of quay cranes and the use loss;

[0092] A construction unit is used to construct a new cost calculation model through the first cost, the second cost and the third cost.

[0093] The bidding module includes:

[0094] The judgment unit is used to judge in turn whether each intended auction order of each bidding port conflicts with the first berth allocation plan of the bidding port. If so, the bidding port gives up bidding for the conflicting intended auction order; otherwise, the bidding port continues bidding for the conflicting intended auction order.

[0095] The bidding module also includes:

[0096] A fourth calculation unit is used to calculate, for each intended auction order, the additional cost of each bidding port for the intended auction order through the additional cost calculation model, and use the additional cost as the bid of the bidding port for the intended auction order;

[0097] A submission unit, used to submit a bid through a bidding port participating in the bidding of the intended auction order;

[0098] A sorting unit is used to sort all submitted bids, assign the intended auction order to the bid port with the lowest bid, and complete the bidding of the intended auction order;

[0099] The allocation unit is used to treat the successfully bid intended auction orders as new orders of the auction port after the auction of all intended auction orders ends.

[0100] It should be noted that, regarding the system in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the method, and will not be elaborated here.

[0101] Embodiment 3:

[0102] Corresponding to the above method embodiment, this embodiment also provides an auction-based port collaborative optimization device. The auction-based port collaborative optimization device described below and the auction-based port collaborative optimization method described above can refer to each other.

[0103] Figure 2 FIG. 8 is a block diagram of a port collaborative optimization device 800 based on auction according to an exemplary embodiment. Figure 2 As shown, the auction-based port collaborative optimization device 800 may include: a processor 801 and a memory 802. The auction-based port collaborative optimization device 800 may also include one or more of a multimedia component 803, an I / O interface 804, and a communication component 805.

[0104] The processor 801 is used to control the overall operation of the auction-based port collaborative optimization device 800 to complete all or part of the steps in the auction-based port collaborative optimization method. The memory 802 is used to store various types of data to support the operation of the auction-based port collaborative optimization device 800, and these data may include, for example, instructions for any application or method operating on the auction-based port collaborative optimization device 800, and application-related data, such as contact data, sent and received messages, pictures, audio, video, etc. The memory 802 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, disk or optical disk. The multimedia component 803 may include a screen and an audio component. The screen may be, for example, a touch screen, and the audio component is used to output and / or input audio signals. For example, the audio component may include a microphone, which is used to receive external audio signals. The received audio signal may be further stored in the memory 802 or sent via the communication component 805. The audio component also includes at least one speaker for outputting audio signals. The I / O interface 804 provides an interface between the processor 801 and other interface modules, and the above-mentioned other interface modules can be keyboards, mice, buttons, etc. These buttons can be virtual buttons or physical buttons. The communication component 805 is used for wired or wireless communication between the auction-based port collaborative optimization device 800 and other devices. Wireless communication, such as Wi-Fi, Bluetooth, Near Field Communication (NFC), 2G, 3G or 4G, or a combination of one or more of them, so the corresponding communication component 805 can include: Wi-Fi module, Bluetooth module, NFC module.

[0105] In an exemplary embodiment, the auction-based port collaborative optimization device 800 can be implemented by one or more application-specific integrated circuits (ASIC), digital signal processors (DSP), digital signal processing devices (DSPD), programmable logic devices (PLD), field programmable gate arrays (FPGA), controllers, microcontrollers, microprocessors or other electronic components to execute the above-mentioned auction-based port collaborative optimization method.

[0106] In another exemplary embodiment, a computer-readable storage medium including program instructions is also provided, and when the program instructions are executed by a processor, the steps of the above-mentioned auction-based port collaborative optimization method are implemented. For example, the computer-readable storage medium can be the above-mentioned memory 802 including program instructions, and the above-mentioned program instructions can be executed by the processor 801 of the auction-based port collaborative optimization device 800 to complete the above-mentioned auction-based port collaborative optimization method.

[0107] Embodiment 4:

[0108] Corresponding to the above method embodiment, a readable storage medium is also provided in this embodiment. The readable storage medium described below and the auction-based port collaborative optimization method described above can refer to each other.

[0109] A readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the auction-based port collaborative optimization method of the above method embodiment.

[0110] The readable storage medium may specifically be a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, or other readable storage medium that can store program codes.

[0111] Embodiment 5:

[0112] This embodiment is an auction coordination process between certain ports, such as Figure 3 As shown, the port shorelines and port boundaries of different ports are shown, and all ports use the auction-based port collaborative optimization system, namely the auction system.

[0113] Figure 3 In the auction, ships are divided into service ships and waiting ships. Service ships are ships that have entered the loading and unloading quay crane for loading and unloading, and waiting ships are ships that are waiting to enter the port because the port cannot provide loading and unloading quay cranes. Among them, the demand orders of waiting ships can be auctioned as auction port orders.

[0114] The port in the middle and the port on the lower left have 5 and 1 ships waiting to enter respectively. These two ports will separate the demand orders of the 6 waiting ships and auction them as auction port orders. The ports with vacant berths will be used as bidding ports for port bidding.

[0115] Depend on Figure 3 It can be seen that the two ports located on the upper left and upper right have vacant berths, and will bid for the auction port orders respectively. The port formulates a corresponding berth allocation plan and bids according to the berth allocation plan. If the berth allocation plan conflicts with the original berth allocation plan, the port will choose to give up the bidding. Through their respective bidding, both parties get part of the order, and at the same time, there are ships that are not bid by both parties and remain in the original port waiting for loading and unloading.

[0116] Depend on Figure 3 The legend of failed and successful bidding can tell you the bidding results of each port, and you can see the auction destination of the waiting ships. The demand orders of 4 ships in the middle port were successfully bid by the upper left port and the upper right port respectively. The demand order of 1 ship remained in the original port waiting for loading and unloading, and the demand order of 1 ship in the lower left port was successfully bid by the upper left port.

[0117] Therefore, the present invention separates and auctions some orders with longer waiting times in the port, and the remaining ports flexibly adjust berth allocation plans according to their own conditions, thereby improving the overall berth allocation efficiency.

[0118] At the same time, through the auction mechanism, some orders with longer delays will be transferred to other ports for processing, thereby reducing the delay time of ships, optimizing the berthing arrangements of ships, and reducing the total berthing time of ships in ports.

[0119] In addition, the present invention ensures the fairness of the bids of all ports through the auction mechanism. While balancing the orders of each port, the port can also obtain additional income by receiving orders from other ports, thereby promoting fair allocation of resources and promoting coordinated development among ports.

[0120] In the actual operation of the present invention, the system will continuously monitor the arrival time of ships and changes in demand, and dynamically adjust the auction orders and berth allocation plans. The auction mechanism allows the berth allocation plan to be dynamically adjusted according to actual conditions, enhancing the flexibility of the system and improving the overall operational efficiency of the port. When a surrounding port encounters an emergency and cannot accept new orders, the system will re-auction and re-allocate to ensure that the ship can berth in time.

[0121] Therefore, the present invention introduces an auction mechanism to separate some orders with longer waiting times for auction, so that the surrounding ports can flexibly adjust the berth allocation plan, improve the overall berth allocation efficiency, reduce ship delay time, promote fair allocation of resources, and enhance the flexibility of the system, thereby achieving coordinated development and efficient operation among ports. Through a detailed system architecture and workflow, as well as the specific implementation of each module, the present invention provides an effective port berth allocation solution with important practical application value.

[0122] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

[0123] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A port collaborative optimization method based on auction, characterized in that: include: Generate a first berth allocation plan for each bidding port based on the demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time; Classify the demand orders of each auction port to obtain multiple auction port orders; Build a new cost calculation model; Based on the first berth allocation plan of each auction port, a second berth allocation plan of each auction port is generated through multiple auction port orders and the berth resources of each auction port, and the intended auction order of each auction port is obtained; Through the newly added cost calculation model, bid for each intended auction order in turn based on multiple auction ports, and use the successfully bid intended auction order as the new order of the auction port; The first berth allocation plan of the auction port is updated through the newly added order to obtain a third berth allocation plan, and the ship berthing is arranged based on the third berth allocation plan to complete the coordinated optimization of berths between ports.

2. The auction-based port collaborative optimization method according to claim 1 is characterized in that ,Classify the demand orders of each auction port and get multiple auction port orders, including: Get the demand orders for each auction port; Generate a berth allocation plan for each auction port through the demand order, the berth allocation plan including the ship's berth location, port entry time, loading and unloading time, port departure time and the number of quay cranes allocated to the ship; Arrange berthing of vessels through the berth allocation plan; Demand orders with a waiting time exceeding the preset threshold or incurring a long delay will be treated as auction port orders.

3. The auction-based port collaborative optimization method according to claim 1 is characterized in that , build a new cost calculation model, including: Obtain the ship's berthing position and ideal berth; Defines the kilometer loss for each kilometer that a ship cannot dock at an ideal berth; Calculating a first cost by using the berthing position, the ideal berth and the kilometer loss; Obtain the actual and estimated departure time of the ship; Define the time loss per unit time when the ship is unable to leave the port at the expected departure time; Calculate a second cost by using the actual departure time, the estimated departure time, and the time loss; Obtaining the number of quay cranes allocated to the ship and the use loss of each quay crane per unit time, and calculating the third cost based on the number of quay cranes and the use loss; A new cost calculation model is constructed by using the first cost, the second cost and the third cost.

4. The auction-based port collaborative optimization method according to claim 1 is characterized in that , through the newly added cost calculation model, before bidding on each intended auction order in turn based on multiple bidding ports, it also includes: It is determined in turn whether each intended auction order of each bidding port conflicts with the first berth allocation plan of the bidding port. If so, the bidding port gives up bidding for the conflicting intended auction order. Otherwise, the bidding port continues to bid for the conflicting intended auction order.

5. The auction-based port collaborative optimization method according to claim 1 is characterized in that , through the new cost calculation model, based on multiple auction ports, each intended auction order is auctioned in turn, and the successful intended auction order is used as the new order of the auction port, including: For each intended auction order, the additional cost of each bidding port for the intended auction order is calculated through the additional cost calculation model, and the additional cost is used as the bid price of the bidding port for the intended auction order; Submit a bid through the bidding port participating in the bidding of the intended auction order; Sort all submitted bids, assign the intended auction order to the bid port with the lowest bid, and complete the bidding for the intended auction order; After all the bidding for intended auction orders is completed, the successfully bid intended auction orders will be treated as new orders for the auction port.

6. A port collaborative optimization system based on auction, characterized in that: include: A first generating module is used to generate a first berth allocation plan for each bidding port based on a demand order of each bidding port, wherein the demand order includes the arrival time of the ship, the berthing demand and the ship size, and the berthing demand includes the loading and unloading volume and the departure time; A classification module is used to classify the demand orders of each auction port to obtain multiple auction port orders; Model building module, used to build a new cost calculation model; The second generation module is used to generate a second berth allocation plan for each auction port based on the first berth allocation plan for each auction port through multiple auction port orders and berth resources of each auction port, and obtain the intended auction order for each auction port; The bidding module is used to bid on each intended auction order in turn based on multiple bidding ports through a new cost calculation model, and use the successfully bid intended auction order as a new order of the bidding port; The third generation module is used to update the first berth allocation plan of the auction port through the new order to obtain a third berth allocation plan, arrange ship berthing based on the third berth allocation plan, and complete the coordinated optimization of berths between ports.

7. The auction-based port collaborative optimization system according to claim 6, characterized in that: The classification module comprises: The first acquisition unit is used to acquire the demand order of each auction port; A first generating unit, configured to generate a berth allocation plan for each auction port through the demand order, wherein the berth allocation plan includes a berth location, port entry time, loading and unloading time, port departure time, and the number of quay cranes allocated to the ship; A first arrangement unit, used for arranging ship berthing according to the berth allocation plan; The classification unit is used to classify demand orders whose waiting time exceeds a preset threshold or generates a long delay as auction port orders.

8. The auction-based port collaborative optimization system according to claim 6, characterized in that: The model building module includes: The second acquisition unit is used to acquire the berthing position and ideal berth of the ship; The first definition unit is used to define the kilometer loss per kilometer when the ship cannot dock at the ideal berth; A first calculation unit, configured to calculate a first cost according to the berthing position, the ideal berth and the kilometer loss; The third acquisition unit is used to acquire the actual departure time and estimated departure time of the ship; The second definition unit is used to define the time loss per unit time when the ship cannot leave the port at the expected departure time; A second calculation unit, configured to calculate a second cost by using the actual departure time, the estimated departure time, and the time loss; A third calculation unit is used to obtain the number of quay cranes allocated to the ship and the use loss of each quay crane per unit time, and calculate a third cost according to the number of quay cranes and the use loss; A construction unit is used to construct a new cost calculation model through the first cost, the second cost and the third cost.

9. The auction-based port collaborative optimization system according to claim 6, characterized in that: The bidding module includes: The judgment unit is used to judge in turn whether each intended auction order of each bidding port conflicts with the first berth allocation plan of the bidding port. If so, the bidding port gives up bidding for the conflicting intended auction order; otherwise, the bidding port continues bidding for the conflicting intended auction order.

10. The auction-based port collaborative optimization system according to claim 9, characterized in that: The bidding module also includes: A fourth calculation unit is used to calculate, for each intended auction order, the additional cost of each bidding port for the intended auction order through the additional cost calculation model, and use the additional cost as the bid of the bidding port for the intended auction order; A submission unit, used to submit a bid through a bidding port participating in the bidding of the intended auction order; A sorting unit is used to sort all submitted bids, assign the intended auction order to the bid port with the lowest bid, and complete the bidding of the intended auction order; The allocation unit is used to treat the successfully bid intended auction orders as new orders of the auction port after the auction of all intended auction orders ends.

Images