CN111401709A - Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing - Google Patents

Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing Download PDF

Info

Publication number
CN111401709A
CN111401709A CN202010157230.4A CN202010157230A CN111401709A CN 111401709 A CN111401709 A CN 111401709A CN 202010157230 A CN202010157230 A CN 202010157230A CN 111401709 A CN111401709 A CN 111401709A
Authority
CN
China
Prior art keywords
container
company
site
empty
transportation
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.)
Granted
Application number
CN202010157230.4A
Other languages
Chinese (zh)
Other versions
CN111401709B (en
Inventor
汤银英
朱星龙
彭其渊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Southwest Jiaotong University
China State Railway Group Co Ltd
Original Assignee
Southwest Jiaotong University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Southwest Jiaotong University filed Critical Southwest Jiaotong University
Priority to CN202010157230.4A priority Critical patent/CN111401709B/en
Publication of CN111401709A publication Critical patent/CN111401709A/en
Application granted granted Critical
Publication of CN111401709B publication Critical patent/CN111401709B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315—Needs-based resource requirements planning or analysis
    • 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/067—Enterprise or organisation modelling
    • 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
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0645—Rental transactions; Leasing transactions
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02T—CLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00—Road transport of goods or passengers
    • Y02T10/10—Internal combustion engine [ICE] based vehicles
    • Y02T10/40—Engine management systems

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Theoretical Computer Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Educational Administration (AREA)
  • Accounting & Taxation (AREA)
  • Game Theory and Decision Science (AREA)
  • Finance (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method for optimizing the dispatching and transportation of the empty containers of the European and middle banners based on container sharing. The invention can obviously improve the utilization rate of the containers, reduce the invalid stacking time of the containers abroad and reduce the empty container transferring and transporting cost of each class company.

Description

Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing
Technical Field
The invention belongs to the technical field of transportation optimization, and particularly relates to a container sharing-based method for optimizing the dispatching and transportation of empty containers in a Chinese-European banquet train.
Background
No. 19/3/2011, China first started the Central European Bank (official English name: CHINA Railway Express) to Duisburg, Germany at Chongqing, and the "Central European Bank" brand was officially activated by our country's railways at 8/6/2016. Through the rapid development for more than 7 years, the middle and European class not only realizes important breakthrough in the aspects of operation scale, coverage range, freight category and the like, but also forms a relatively clear operation mode and a relatively stable operation pattern. However, some problems have arisen in the course of rapid development. Due to the influence of policies and subsidies, each place has a lot of Chinese European class, such as: shi-xi company of Yi Xin Euro, Yu Euro, Rong Euro, etc., and present the phenomena of respective political and disordered competition. In addition, the whole central european shift or each shift company has different unbalanced numbers of columns and rows, and the central european shift is not enough for the return cargo source. The problems of disordered competition among various places of the Zhongouban, untimely calling of empty boxes or no transportation at all, storage at abroad and the like are caused by the various reasons, and the operation cost of the Zhongouban is increased in a phase-changing manner. Therefore, how to reasonably and effectively organize empty box allocation and transportation and empty box leasing and improve the use efficiency of the container plays a vital role in reducing the transportation cost of the whole Zhongouban line.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides an air container allocation and transportation optimization method for a Chinese and European banquet train based on container sharing.
In order to achieve the purpose of the invention, the invention adopts the technical scheme that:
a method for optimizing the air container allocation and transportation of Chinese and European banners based on container sharing comprises the following steps:
s1, constructing a transportation network according to information of local banquet companies of the Zhongou banquet;
s2, generating transportation demand data according to transportation plans of local banquet companies of the Zhongou banquet;
s3, constructing a dynamic empty container transferring optimization model of each class company based on container sharing according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2;
s4, solving a dynamic empty-box lease optimization model of each banquet company based on container sharing;
and S5, optimizing the air box dispatching of the middle European Banner according to the solving result obtained in the step S4.
Further, the step S3 is to construct a dynamic empty container dispatching optimization model of each banquet company based on container sharing according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2, specifically:
according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2, a dynamic empty-container lease optimization model of each class company based on container sharing is constructed by taking the minimum total cost of empty container acquisition as an optimization target in a decision period and taking the transfer cost, loading and unloading cost, storage cost and lease cost in empty container acquisition as model influence factors.
Further, the construction of the dynamic empty-container lease optimization model of each banquet company based on container sharing specifically comprises the following sub-steps:
s31, dividing the whole decision period into a plurality of adjacent periods according to a unit cycle, taking the container quantity of the previous period as the container quantity of the beginning of the current period, and allocating the container quantity;
s32, constructing a dynamic empty box lease optimization model of each class company based on container sharing by taking the minimum total cost of the empty boxes in the decision period as an optimization target.
Further, the dynamic empty-box lease optimization model of each banquet company based on container sharing is specifically represented as follows:
Figure BDA0002404507490000031
Figure BDA0002404507490000032
Figure BDA0002404507490000033
Figure BDA0002404507490000034
Figure BDA0002404507490000035
Figure BDA0002404507490000036
wherein, O represents the total cost of empty box acquisition, I represents the set of all sites, and I represents1Representing a set of domestic sites, I2Represents the set of foreign sites, K represents the set of all bang companies, T represents the decision period,
Figure BDA0002404507490000037
indicating the amount of containers that company dispatched its own empty containers from site i to site j during time t,
Figure BDA0002404507490000038
indicating that company borrows the container amount of company g at site i during time t k,
Figure BDA0002404507490000039
indicating that during time t k company borrows g company's empty containers from site i to site j,
Figure BDA00024045074900000310
representing the volume of container leases by company k at site i for the rental of the rented medium-distant company returned at site j during time t,
Figure BDA00024045074900000311
indicating that during time t k at site i the container rental volume of the corporate Federation in the rental that was still returned at that point through the round trip,
Figure BDA0002404507490000041
representing the container demand, Q, from site i to site j for company k during time tijRepresenting the run time of site i to site j,
Figure BDA0002404507490000042
indicates the amount of container holding, C, at station i by company k at time tijRepresenting the cost of a single container shipment from site i to site j,
Figure BDA0002404507490000043
representing stations iThe cost of loading the container is increased by the cost of the container,
Figure BDA0002404507490000044
indicating the cost of unloading the containers at station i,
Figure BDA0002404507490000045
indicating the cost of stockpiling containers at site i, C L1Indicating the Single-case cost of Federation Co in rental, C L2Indicating the cost of renting a single box for a medium or remote company, h1Indicating the age of the iron container company in the lease, h2Indicating the time of use of the remote company at the rental.
The invention has the following beneficial effects: the invention integrates the container resources of the banquet companies of the central and European banquet, constructs a dynamic empty-container transferring optimization model of each banquet company based on the container sharing, and performs empty-container transferring optimization according to the solving result, thereby remarkably improving the utilization rate of the containers, reducing the invalid stockpiling time of the containers abroad and reducing the empty-container transferring cost of each banquet company.
Drawings
FIG. 1 is a flow chart of the method for optimizing the dispatching and transportation of the empty containers in the European Bank of China and Europe based on container sharing according to the present invention;
fig. 2 is a schematic diagram of a central european bang train transportation network in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
As shown in fig. 1, an embodiment of the present invention provides a method for optimizing air container allocation and transportation in central and european banners based on container sharing, including the following steps:
s1, constructing a transportation network according to information of local banquet companies of the Zhongou banquet;
in this embodiment, in the present invention, office workers in central and european campuses are selected, and a transportation network is constructed according to information of the office workers in the central and european campuses, as shown in fig. 2.
S2, generating transportation demand data according to transportation plans of local banquet companies of the Zhongou banquet;
in this embodiment, the present invention generates transportation demand data according to transportation plans of local banbury columns in central european banbury, as shown in table 1.
TABLE 1 transportation requirements Table
Figure BDA0002404507490000051
S3, constructing a dynamic empty container transferring optimization model of each class company based on container sharing according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2;
in the present embodiment, the present invention constructs a dynamic empty-box lease optimization model for each class company based on container sharing, with the minimum total cost for empty-box acquisition as an optimization target during a decision period, and with the freight transfer fee, loading and unloading fee, storage fee, and lease fee in empty-box acquisition as model influencing factors, according to the transportation network constructed in step S1 and the transportation demand data generated in step S2. The relevant parameters are shown in tables 2 and 3.
TABLE 2 table of relevant parameters
Figure BDA0002404507490000052
Figure BDA0002404507490000061
TABLE 3 freight (Yuan/TEU)
Figure BDA0002404507490000062
Where inf represents infinity, i.e., no empty boxes can be directly dispatched between the two sites.
The method for constructing the dynamic empty-container lease optimization model of each banquet company based on container sharing specifically comprises the following sub-steps:
s31, dividing the whole decision period into a plurality of adjacent periods according to a unit cycle, taking the container quantity of the previous period as the container quantity of the beginning of the current period, and allocating the container quantity;
s32, constructing a dynamic empty box lease optimization model of each class company based on container sharing by taking minimum total cost obtained by empty boxes in a decision period as an optimization target, wherein the optimization model is specifically represented as follows:
Figure BDA0002404507490000063
Figure BDA0002404507490000071
Figure BDA0002404507490000072
Figure BDA0002404507490000073
Figure BDA0002404507490000074
Figure BDA0002404507490000075
wherein, O represents the total cost of empty box acquisition, I represents the set of all sites, and I represents1Representing a set of domestic sites, I2Represents the set of foreign sites, K represents the set of all bang companies, T represents the decision period,
Figure BDA0002404507490000076
indicating the amount of containers that company dispatched its own empty containers from site i to site j during time t,
Figure BDA0002404507490000077
indicating borrowing of company g at site i by company k during time tThe amount of the container is measured,
Figure BDA0002404507490000078
indicating that during time t k company borrows g company's empty containers from site i to site j,
Figure BDA0002404507490000079
representing the volume of container leases by company k at site i for the rental of the rented medium-distant company returned at site j during time t,
Figure BDA00024045074900000710
indicating that during time t k at site i the container rental volume of the corporate Federation in the rental that was still returned at that point through the round trip,
Figure BDA00024045074900000711
representing the container demand, Q, from site i to site j for company k during time tijRepresenting the run time of site i to site j,
Figure BDA00024045074900000712
indicates the amount of container holding, C, at station i by company k at time tijRepresenting the cost of a single container shipment from site i to site j,
Figure BDA00024045074900000713
indicating the cost of loading the containers at station i,
Figure BDA00024045074900000714
indicating the cost of unloading the containers at station i,
Figure BDA00024045074900000715
indicating the cost of stockpiling containers at site i, C L1Indicating the Single-case cost of Federation Co in rental, C L2Indicating the cost of renting a single box for a medium or remote company, h1Indicating the age of the iron container company in the lease, h2Indicating the time of use of the remote company at the rental.
S4, solving a dynamic empty-box lease optimization model of each banquet company based on container sharing;
in this embodiment, the dynamic empty box renting optimization model of each banquet company based on container sharing is solved by using the business solving software L ingo, and the total empty box acquisition cost is 57574660 yuan.
The specific solving process is as follows:
s41, programming model objects, constraint conditions, basic data and the like by using L ingo language;
s42, aiming at the dynamic empty box transferring optimization model of each banquet company based on container sharing, the program written in the step S41 is operated after a branch-and-bound method built in L ingo software is adopted
And S5, optimizing the air box dispatching of the middle European Banner according to the solving result obtained in the step S4.
The present invention compares the total cost before implementing the container sharing strategy and changes the parameters for sensitivity analysis, and the comparison results are shown in table 3.
TABLE 3 comparison of results table
Figure BDA0002404507490000081
As can be seen from table 3, the total cost of acquiring empty containers under the policy of sharing containers is always lower than that under the condition of not sharing containers, and sensitivity analysis shows that the cost saving caused by the policy of sharing containers is positively correlated with the ratio of the return trip of central european shift. It can be seen that the cooperation of the various banbury companies can overcome the disadvantages of container resource limitations, expand the range of available container resources, reduce operating costs and circumvent risks.
It will be appreciated by those of ordinary skill in the art that the embodiments described herein are intended to assist the reader in understanding the principles of the invention and are to be construed as being without limitation to such specifically recited embodiments and examples. Those skilled in the art can make various other specific changes and combinations based on the teachings of the present invention without departing from the spirit of the invention, and these changes and combinations are within the scope of the invention.

Claims (4)

1. A method for optimizing the dispatching and transportation of the empty containers in the Chinese and European Banner based on container sharing is characterized by comprising the following steps:
s1, constructing a transportation network according to information of local banquet companies of the Zhongou banquet;
s2, generating transportation demand data according to transportation plans of local banquet companies of the Zhongou banquet;
s3, constructing a dynamic empty container transferring optimization model of each class company based on container sharing according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2;
s4, solving a dynamic empty-box lease optimization model of each banquet company based on container sharing;
and S5, optimizing the air box dispatching of the middle European Banner according to the solving result obtained in the step S4.
2. The method for optimizing the air-container dispatch of the european banquet based on container sharing of claim 1, wherein the step S3 is implemented according to the transportation network implemented in the step S1 and the transportation requirement data generated in the step S2, and the dynamic air-container dispatch optimization model of each banquet company based on container sharing is specifically implemented as follows:
according to the transportation network constructed in the step S1 and the transportation demand data generated in the step S2, a dynamic empty-container lease optimization model of each class company based on container sharing is constructed by taking the minimum total cost of empty container acquisition as an optimization target in a decision period and taking the transfer cost, loading and unloading cost, storage cost and lease cost in empty container acquisition as model influence factors.
3. The method for optimizing the air-box transfer and transportation in central and european banners based on container sharing of claim 2, wherein the step of constructing the optimization model for dynamic air-box transfer and transportation of each banquet company based on container sharing specifically comprises the following sub-steps:
s31, dividing the whole decision period into a plurality of adjacent periods according to a unit cycle, taking the container quantity of the previous period as the container quantity of the beginning of the current period, and allocating the container quantity;
s32, constructing a dynamic empty box lease optimization model of each class company based on container sharing by taking the minimum total cost of the empty boxes in the decision period as an optimization target.
4. The container sharing-based mid-european banquet air dispatch optimization method of claim 3, wherein the dynamic empty dispatch optimization model for each banquet company based on container sharing is specifically expressed as:
Figure FDA0002404507480000021
Figure FDA0002404507480000022
Figure FDA0002404507480000023
Figure FDA0002404507480000024
Figure FDA0002404507480000025
Figure FDA0002404507480000026
wherein, O represents the total cost of empty box acquisition, I represents the set of all sites, and I represents1Representing a set of domestic sites, I2Represents the set of foreign sites, K represents the set of all bang companies, T represents the decision period,
Figure FDA0002404507480000027
is shown at tThe company phase k dispatches its own empty containers from site i to site j,
Figure FDA0002404507480000028
indicating that company borrows the container amount of company g at site i during time t k,
Figure FDA0002404507480000031
indicating that during time t k company borrows g company's empty containers from site i to site j,
Figure FDA0002404507480000032
representing the volume of container leases by company k at site i for the rental of the rented medium-distant company returned at site j during time t,
Figure FDA0002404507480000034
indicating that during time t k at site i the container rental volume of the corporate Federation in the rental that was still returned at that point through the round trip,
Figure FDA0002404507480000033
representing the container demand, Q, from site i to site j for company k during time tijRepresenting the run time of site i to site j,
Figure FDA0002404507480000035
indicates the amount of container holding, C, at station i by company k at time tijRepresenting the cost of a single container shipment from site i to site j,
Figure FDA0002404507480000037
indicating the cost of loading the containers at station i,
Figure FDA0002404507480000036
indicating the cost of unloading the containers at station i,
Figure FDA0002404507480000038
indicating the cost of stockpiling containers at site i, C L1Indicating the Single-case cost of Federation Co in rental, C L2Indicating the cost of renting a single box for a medium or remote company, h1Indicating the age of the iron container company in the lease, h2Indicating the time of use of the remote company at the rental.
CN202010157230.4A 2020-03-09 2020-03-09 Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing Active CN111401709B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010157230.4A CN111401709B (en) 2020-03-09 2020-03-09 Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010157230.4A CN111401709B (en) 2020-03-09 2020-03-09 Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing

Publications (2)

Publication Number Publication Date
CN111401709A true CN111401709A (en) 2020-07-10
CN111401709B CN111401709B (en) 2023-04-07

Family

ID=71436145

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010157230.4A Active CN111401709B (en) 2020-03-09 2020-03-09 Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing

Country Status (1)

Country Link
CN (1) CN111401709B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140101059A1 (en) * 2012-10-05 2014-04-10 Chien-Hua Hsiao Leasing method for lessees to exchange their shipping containers
CN105303338A (en) * 2014-06-04 2016-02-03 新立迅软件服务（青岛）有限公司 Internet of things technology-based container logistics tracking global network exchange service platform
CN107529653A (en) * 2017-08-14 2018-01-02 盛锦龙 A kind of shared stream packing case operation system
CN109242379A (en) * 2018-08-13 2019-01-18 中铁武汉勘察设计研究院有限公司 Molten iron through transport railway port station container is unloaded and entrucking transportation system and method
US20190205815A1 (en) * 2017-12-29 2019-07-04 Sap Se Smart empty container repositioning re-planning system under inaccurate demand forecast
CN110135779A (en) * 2019-04-28 2019-08-16 武汉理工大学 A kind of container sharing method based on platform
CN110991952A (en) * 2019-11-22 2020-04-10 汉口北进出口服务有限公司 Cross-border logistics mode selection method and device
US20200126036A1 (en) * 2018-10-22 2020-04-23 Jin Yo Chou Method and device for providing shipping container transport services

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140101059A1 (en) * 2012-10-05 2014-04-10 Chien-Hua Hsiao Leasing method for lessees to exchange their shipping containers
CN105303338A (en) * 2014-06-04 2016-02-03 新立迅软件服务（青岛）有限公司 Internet of things technology-based container logistics tracking global network exchange service platform
CN107529653A (en) * 2017-08-14 2018-01-02 盛锦龙 A kind of shared stream packing case operation system
US20190205815A1 (en) * 2017-12-29 2019-07-04 Sap Se Smart empty container repositioning re-planning system under inaccurate demand forecast
CN109242379A (en) * 2018-08-13 2019-01-18 中铁武汉勘察设计研究院有限公司 Molten iron through transport railway port station container is unloaded and entrucking transportation system and method
US20200126036A1 (en) * 2018-10-22 2020-04-23 Jin Yo Chou Method and device for providing shipping container transport services
CN110135779A (en) * 2019-04-28 2019-08-16 武汉理工大学 A kind of container sharing method based on platform
CN110991952A (en) * 2019-11-22 2020-04-10 汉口北进出口服务有限公司 Cross-border logistics mode selection method and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
刘彦荣: "基于货主满意度的中欧班列空箱运输优化研究", 《中国优秀博硕士学位论文全文数据库(硕士)经济与管理科学辑》 *
苏志豪: "基于共享经济理念的空箱调运优化研究", 《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅱ辑》 *
韩曙光: "基于多种合作模式的内陆空集装箱调运优化", 《 浙江理工大学学报(社会科学版)》 *

Also Published As

Publication number Publication date
CN111401709B (en) 2023-04-07

Similar Documents

Publication Publication Date Title
Wang et al. Locating dry ports on a network: A case study on Tianjin Port
CN103034933B (en) A kind of commodity distribution control method based on multistage storage
CN111080116B (en) Cooperative scheduling method for sharing bicycle and public bicycle
CN104463540A (en) Community type logistics transportation management system
Du et al. A study on the government subsidies for CR Express based on dynamic games of incomplete information
CN111401709B (en) Method for optimizing air container allocation and transportation of Zhongou banquet based on container sharing
Chen et al. SWOT-PEST Analysis of China's Dry Port
CN116029481A (en) Freight management method, device, equipment and storage medium
CN105883425A (en) Energy conservation, emission reduction and haze reduction system based on environmental logistics
Yan Improvement of the Economic Management System Based on the Publicity of Railway Transportation Products.
Liu et al. The influence of China-Europe Railway Express on the production system of enterprises: A case study of TCL Poland Plant
Zhou et al. Location Model of Pallet Service Centers Based on the Pallet Pool Mode
Rodrigue et al. Inland Ports/Dry Ports
Zhang et al. Storage pricing model of container yards under fluctuating demand
Xiao et al. Development of multimodal transport in China
Tan et al. Yard space allocation for container transshipment ports with mother and feeder vessels
Zhao et al. Green logistics and social sustainable development
Barxudarov et al. Prospects for the Development of International Transport Corridors in Modern Geo-Economic Conditions
Liu et al. Energy Internet Platform Business Development Theory and Maturity Analysis From the Perspective of Empowerment
Cheng et al. STUDY ON LOGISTICS COST OF YUCHUN LOGISTICS CO., LTD
Shi et al. Research on Debon Logistics Transportation Management
Zhu et al. The Study on Development of Green Logistics Enterprise Service Route in Beijing
Li et al. Planning of the Functions in the Integrated Logistics Area
Qiu On the analysis of building a public information platform based on e-Commerce for coal logistics
Li Development of China’s port logistics

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20220727

Address after: 610031 north section of two ring road, Sichuan, Chengdu

Applicant after: SOUTHWEST JIAOTONG University

Applicant after: China National Railway Group Co.,Ltd.

Address before: 610031 north section of two ring road, Sichuan, Chengdu

Applicant before: SOUTHWEST JIAOTONG University

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant