CN114037195A - Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost - Google Patents
Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost Download PDFInfo
- Publication number
- CN114037195A CN114037195A CN202110380697.XA CN202110380697A CN114037195A CN 114037195 A CN114037195 A CN 114037195A CN 202110380697 A CN202110380697 A CN 202110380697A CN 114037195 A CN114037195 A CN 114037195A
- Authority
- CN
- China
- Prior art keywords
- warehousing
- vehicles
- warehouse
- scheme
- period
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Educational Administration (AREA)
- Game Theory and Decision Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a vehicle scheduling method for reducing cold chain crossing center operation cost. The method comprises the following specific steps: 1) constructing an initial warehousing scheme x; 2) deciding loading schemes of all outbound vehicles and packing and storing operations of all periods according to the warehousing scheme x to obtain a scheduling scheme S; if the warehouse-in and warehouse-out scheme (x, S) is feasible, performing a fourth step; 3) adjusting the current warehousing scheme x and re-executing the step 2; 4) and executing the generated feasible allocation scheme of the in-out garage vehicles. The invention can meet the requirements of classified storage and classified transportation of various products in the cold chain environment; the leaving/arriving time of the warehousing-in and warehousing vehicles is effectively decided according to contract time windows of the warehousing-out and warehousing vehicles and the product delivery date, and the product assembly combination of the warehousing-out vehicles is reasonably determined; the scheduling scheme is high in quality, and can help cold chain crossing the warehouse center to realize faster, efficient and economic transfer decision.
Description
Technical Field
The invention relates to the technical field of logistics vehicle scheduling, in particular to a vehicle scheduling method for reducing the operation cost of a cold chain crossing center.
Background
In the logistics management of the supply chain, the warehouse-crossing center is a crucial link for re-sorting and assembling materials and realizing efficient logistics transfer, and in the operation of the warehouse-crossing center, the reasonable scheduling of vehicles entering and leaving the warehouse plays a key role. With the increasing demand of people for fresh and medical products, the dispatching of vehicles entering/leaving the cold chain from the warehouse-crossing center and the optimization of sorting schemes from the warehouse-crossing center become very important.
The existing scheduling method lacks the particularity of product transportation and distribution under the cold chain environment, namely the requirements of different types of products on the storage and transportation environment temperature are different greatly; meanwhile, most of the current scheduling methods do not consider the reasonable distribution of the products loaded by the vehicles, and have limitation on the transferring effect, so that the economical efficiency of the transferring scheme is influenced.
Disclosure of Invention
Aiming at the technical defects, the invention aims to provide a vehicle scheduling method for reducing the operation cost of cold chain crossing the warehouse center, which can meet the requirements of classified storage and classified transportation of various types of products in a cold chain environment and reasonably determine the product assembly combination of vehicles leaving the warehouse; and effectively deciding the leaving/arriving time of the vehicle entering and exiting the garage according to the contract time window of the vehicle entering and exiting the garage and the product delivery date.
In order to solve the technical problems, the invention adopts the following technical scheme:
a vehicle scheduling method for reducing the operation cost of a cold chain crossing warehouse center is characterized by comprising the following specific steps:
1) sorting according to the default cost corresponding to the arrival of each warehousing vehicle in each period from low to high; under the constraint of the number of warehousing doors, sequentially distributing arrival periods to all warehousing vehicles until all warehousing vehicles are distributed to obtain an initial warehousing scheme x;
2) and (3) deciding the loading schemes of all the vehicles leaving the warehouse and the packing and storing operation of each period according to the warehousing scheme x to obtain a scheduling scheme S, namely performing the following operation on each period T e T according to the time sequence:
2.1 all the clients covering the product delivery time window t are sequentially distributed out of the warehouse vehicles according to the sequence of the product demand from high to low until no available bin gate is available or the clients are met; loading the delivery vehicles in sequence from high to low according to the transportation cost of the delivery vehicles, and preferentially loading the products with earlier delivery date until the vehicles are fully loaded or the current products to be transported of the corresponding clients are completely loaded;
2.2 when the warehouse-out door is still idle in the period t, selecting all the following types of customers; that is, the current product inventory is sufficient to satisfy all of the remaining requirements of the customer; sequentially allocating delivery vehicles to the customers according to the delivery date of the products required by the customers from morning to evening until all the customers are satisfied or no free delivery doors exist;
2.3 when the warehouse-out door still has a free warehouse-out door in the period t, selecting all the following types of customers; the current inventory can meet the condition that the loading rate of the delivery vehicles of the client is not lower than a threshold value gamma; sequentially distributing the delivery vehicles to the customers from high to low according to the loading rate until all the customers are met or no free delivery doors exist;
2.4 when the total delivery capacity of the warehouse exit door in all the subsequent periods can not meet the number of warehouse exit vehicles required for completing all the remaining demands, or the remaining products in the period exceed the inventory capacity constraint, the operation is as follows: if the warehouse-out door is still idle in the period t, products of corresponding customers are loaded according to the loading rate from high to low until the two situations are eliminated; in the period t, no idle warehouse-out door exists, the warehouse-in scheme x is not feasible, and then the step 3 is skipped;
2.5, arranging and packaging the t-th waiting packaged products according to the delivery date of the t-th waiting packaged products from morning to evening;
3) adjusting the current binning scheme x as follows: according to the period t of the step 2.4, finding out the warehousing car with the lowest period adjustment cost in all the warehousing cars arriving at the period, changing the arrival period of the car into another period with the lowest generation adjustment cost, updating the warehousing scheme x and re-executing the step 2;
4) and executing the generated feasible warehousing scheme x and scheduling scheme S for the warehousing-in and warehousing-out vehicles.
The invention has the beneficial effects that: the requirements of classified storage and classified transportation of various products in a cold chain environment can be met; the leaving/arriving time of the warehousing-in and warehousing vehicles is effectively decided according to contract time windows of the warehousing-out and warehousing vehicles and the product delivery date, and the product assembly combination of the warehousing-out vehicles is reasonably determined; the scheduling scheme is high in quality, and can help cold chain crossing the warehouse center to realize faster, efficient and economic transfer decision.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flowchart of a vehicle scheduling method for reducing the operation cost of a cold chain crossing center according to the present invention;
FIG. 2 is a flowchart of a vehicle scheduling method step 2 for reducing the operation cost of a cold chain crossing center according to the present invention;
Detailed Description
The technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the following embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1-2, a vehicle dispatching method for reducing the operation cost of cold chain crossing warehouse center includes the following specific steps:
1) constructing an initial warehousing scheme x, wherein the specific contents are as follows:
sorting the vehicles entering the warehouse from low to high according to default cost corresponding to arrival (warehousing vehicle arrival period) of each vehicle entering the warehouse; under the constraint of the number of warehousing doors, sequentially distributing arrival periods to all warehousing vehicles until all warehousing vehicles are distributed to obtain an initial warehousing scheme x;
2) and (3) deciding the loading schemes of all the vehicles leaving the warehouse and the packing and storing operation of each period according to the warehousing scheme x to obtain a scheduling scheme S, namely performing the following operation on each period T e T according to the time sequence, wherein the specific content is as follows:
all the customers covering the product delivery time window t are sequentially distributed with the delivery vehicles according to the sequence of the product demand from high to low until no available bin gate is available at present or the customers are satisfied; loading the delivery vehicles in sequence from high to low according to the transportation cost of the delivery vehicles, and preferentially loading the products with earlier delivery date until the vehicles are fully loaded or the current products to be transported of the corresponding clients are completely loaded;
when the warehouse-out door is still idle in the period t, all the following types of customers are selected; that is, the current product inventory is sufficient to satisfy all of the remaining requirements of the customer; sequentially allocating delivery vehicles to the customers according to the delivery date of the products required by the customers from morning to evening until all the customers are satisfied or no free delivery doors exist;
when the warehouse-out door is still idle in the period t, all the following types of customers are selected; the current inventory can meet the condition that the loading rate of the delivery vehicles of the client is not lower than a threshold value gamma; sequentially distributing the delivery vehicles to the customers from high to low according to the loading rate until all the customers are met or no free delivery doors exist;
when the total delivery capacity of the warehouse exit door in all subsequent periods cannot meet the number of warehouse exit vehicles required for completing all the remaining demands, or the remaining products in the period exceed the inventory capacity constraint, the operation is as follows: if the warehouse-out door is still idle in the period t, products of corresponding customers are loaded according to the loading rate from high to low until the two situations are eliminated; in the period t, no idle warehouse-out door exists, the warehouse-in scheme x is not feasible, and then the step 3 is skipped;
arranging and packaging the packaged products waiting for the t period from morning to evening according to the delivery date of the packaged products;
3) adjusting the current binning scheme x as follows: according to the time t, finding out the warehousing car with the lowest time-varying adjustment cost in all the warehousing cars arriving at the time, changing the arrival time of the car into another time with the lowest adjustment cost, updating the warehousing scheme x and re-executing the step 2;
4) and executing the generated loading and packing storage overall scheduling scheme (x, S) of the in-out garage vehicles.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (1)
1. A vehicle scheduling method for reducing the operation cost of a cold chain crossing warehouse center is characterized by comprising the following specific steps:
1) sorting according to the default cost corresponding to the arrival of each warehousing vehicle in each period from low to high; under the constraint of the number of warehousing doors, sequentially distributing arrival periods to all warehousing vehicles until all warehousing vehicles are distributed to obtain an initial warehousing scheme x;
2) and (3) deciding the loading schemes of all the vehicles leaving the warehouse and the packing and storing operation of each period according to the warehousing scheme x to obtain a scheduling scheme S, namely performing the following operation on each period T e T according to the time sequence:
2.1 all the clients covering the product delivery time window t are sequentially distributed out of the warehouse vehicles according to the sequence of the product demand from high to low until no available bin gate is available or the clients are met; loading the delivery vehicles in sequence from high to low according to the transportation cost of the delivery vehicles, and preferentially loading the products with earlier delivery date until the vehicles are fully loaded or the current products to be transported of the corresponding clients are completely loaded;
2.2 when the warehouse-out door is still idle in the period t, selecting all the following types of customers; that is, the current product inventory is sufficient to satisfy all of the remaining requirements of the customer; sequentially allocating delivery vehicles to the customers according to the delivery date of the products required by the customers from morning to evening until all the customers are satisfied or no free delivery doors exist;
2.3 when the warehouse-out door still has a free warehouse-out door in the period t, selecting all the following types of customers; the current inventory can meet the condition that the loading rate of the delivery vehicles of the client is not lower than a threshold value gamma; sequentially distributing the delivery vehicles to the customers from high to low according to the loading rate until all the customers are met or no free delivery doors exist;
2.4 when the total delivery capacity of the warehouse exit door in all the subsequent periods can not meet the number of warehouse exit vehicles required for completing all the remaining demands, or the remaining products in the period exceed the inventory capacity constraint, the operation is as follows: if the warehouse-out door is still idle in the period t, products of corresponding customers are loaded according to the loading rate from high to low until the two situations are eliminated; in the period t, no idle warehouse-out door exists, the warehouse-in scheme x is not feasible, and then the step 3 is skipped;
2.5, arranging and packaging the t-th waiting packaged products according to the delivery date of the t-th waiting packaged products from morning to evening;
3) adjusting the current binning scheme x as follows: according to the period t of the step 2.4, finding out the warehousing car with the lowest period adjustment cost in all the warehousing cars arriving at the period, changing the arrival period of the car into another period with the lowest generation adjustment cost, updating the warehousing scheme x and re-executing the step 2;
4) and executing the generated feasible warehousing scheme x and scheduling scheme S for the warehousing-in and warehousing-out vehicles.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110380697.XA CN114037195A (en) | 2021-04-09 | 2021-04-09 | Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110380697.XA CN114037195A (en) | 2021-04-09 | 2021-04-09 | Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114037195A true CN114037195A (en) | 2022-02-11 |
Family
ID=80139742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110380697.XA Pending CN114037195A (en) | 2021-04-09 | 2021-04-09 | Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114037195A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117113608A (en) * | 2023-10-23 | 2023-11-24 | 四川港投新通道物流产业投资集团有限公司 | Cold-chain logistics network node layout method and equipment |
-
2021
- 2021-04-09 CN CN202110380697.XA patent/CN114037195A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117113608A (en) * | 2023-10-23 | 2023-11-24 | 四川港投新通道物流产业投资集团有限公司 | Cold-chain logistics network node layout method and equipment |
| CN117113608B (en) * | 2023-10-23 | 2024-02-13 | 四川港投新通道物流产业投资集团有限公司 | Cold-chain logistics network node layout method and equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Larbi et al. | Scheduling cross docking operations under full, partial and no information on inbound arrivals | |
| WO2022188388A1 (en) | Smart city dynamic cold-chain logistics scheduling method based on ant colony optimization algorithm | |
| CN109345161B (en) | Value flow-oriented distribution order dispatching method | |
| CN107918849B (en) | Intelligent dispatching device and method for electric logistics trucks | |
| US8438118B2 (en) | Transportation management processes and systems | |
| CN110009272A (en) | More strategies parallel logistic resources dispatching method and relevant apparatus | |
| Vahdani | Assignment and scheduling trucks in cross-docking system with energy consumption consideration and trucks queuing | |
| CN110348612B (en) | Distribution center cargo quantity prediction method and device | |
| CN110738376A (en) | cloud logistics service resource optimization matching method | |
| CN108549978A (en) | A kind of method and system of the safe goods stock of allotment | |
| CN110674968A (en) | Vehicle path optimization method for dynamic change of customer demands in express delivery process | |
| CN114037195A (en) | Vehicle scheduling method for reducing cold chain cross-warehouse center operation cost | |
| CN115169651A (en) | Cold chain transportation path allocation method | |
| Walha et al. | A rail-road PI-hub allocation problems: model and heuristic | |
| CN114897307A (en) | Logistics centralized distribution network alliance optimization method based on cooperation | |
| CN113935528B (en) | Intelligent scheduling method, intelligent scheduling device, computer equipment and storage medium | |
| Zhang et al. | Split-demand multi-trip vehicle routing problem with simultaneous pickup and delivery in airport baggage transit | |
| CN112613701B (en) | Finished cigarette logistics scheduling method | |
| Motaghedi-Larijani et al. | Optimizing the number of outbound doors in the crossdock based on a new queuing system with the assumption of beta arrival time | |
| Lucci et al. | A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows | |
| Pisinger et al. | Advanced algorithms for improved baggage handling | |
| CN115034945A (en) | Method and device for integrated scheduling of batch production and vehicle delivery of assembly line workshop | |
| Kamoun et al. | Design of express mail services for metropolitan regions | |
| US9864962B1 (en) | Minimum suggested rate picking | |
| Rodriguez-Velasquez et al. | Modeling cross-dock networks with time constraints using simulation |
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 |