CN112801346B - Method for planning whole-process transportation of railway goods - Google Patents
Method for planning whole-process transportation of railway goods Download PDFInfo
- Publication number
- CN112801346B CN112801346B CN202110034282.7A CN202110034282A CN112801346B CN 112801346 B CN112801346 B CN 112801346B CN 202110034282 A CN202110034282 A CN 202110034282A CN 112801346 B CN112801346 B CN 112801346B
- Authority
- CN
- China
- Prior art keywords
- epsilon
- train
- value
- time
- arc
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 73
- 230000008569 process Effects 0.000 claims description 31
- 238000010586 diagram Methods 0.000 claims description 9
- 238000005457 optimization Methods 0.000 claims description 4
- 230000007306 turnover Effects 0.000 claims description 4
- 230000000452 restraining effect Effects 0.000 claims description 3
- 230000008901 benefit Effects 0.000 claims description 2
- 230000006872 improvement Effects 0.000 abstract description 7
- 238000009826 distribution Methods 0.000 description 5
- 230000008520 organization Effects 0.000 description 3
- 238000007726 management method Methods 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008093 supporting effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- 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/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Mathematical Physics (AREA)
- Development Economics (AREA)
- Computational Mathematics (AREA)
- Mathematical Analysis (AREA)
- Mathematical Optimization (AREA)
- Game Theory and Decision Science (AREA)
- Pure & Applied Mathematics (AREA)
- Data Mining & Analysis (AREA)
- Educational Administration (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method for planning whole-process transportation of railway cargoes, which comprises the following steps: the method and the system fully utilize transportation resources, realize quality improvement and efficiency improvement of transportation organizations and improve the rate of arrival time and redemption of the goods while realizing freight tasks.
Description
Technical Field
The invention relates to the field of intelligent transportation, in particular to a method for planning a whole process transportation plan of railway goods.
Background
For the programming of railway freight transportation plans, the domestic practice level usually adopts a manual programming mode, and the programming of freight day shift plans is realized on the basis of the existing train grouping plans and train running diagrams according to freight demands in experience. However, the problem that the time limit of goods is not considered in the process of planning the train grouping, and the combination of the goods flow, the trains and the running lines is insufficient, etc. results in lower redemption rate of the goods to the time limit, and is difficult to adapt to the demand of the rapidly developed logistics market for the higher-level railway goods transportation. The existing railway freight transportation planning aspects mainly face the following problems: 1. lacking theoretical research, existing theoretical methods have difficulty supporting the whole process transport organization. The current organization mode is freight demand-train grouping planning-train operation diagram-on-line operation, wherein the train grouping planning process only considers the transportation process of stations, and is difficult to expand towards two ends, so that the current planning mode, theory and method are difficult to support the whole process transportation organization of railway cargos. 2. The support for the rate of redemption of the arrival time of the good is poor. Firstly, the train hour saving is emphasized in the train grouping planning conception of China, and the consideration of the arrival time of cargoes is insufficient; and secondly, when the running diagram is compiled, the running line of the goods train is paved as a full diagram, and certain dislocation exists between the goods train and the train grouping plan, so that the combination of the flow line is poor.
Disclosure of Invention
The embodiment of the specification provides a method for planning the whole process of transportation of railway cargoes.
The embodiment of the specification provides a whole process transportation planning method for railway cargos, which comprises the following steps: setting basic input, namely taking freight demands, basic road network, section capacity and site capacity as basic input, wherein the freight demands comprise freight demands OD and freight arrival time limit requirements; constructing a space-time service network, namely discretizing a planned period, and copying nodes in a physical road network according to the discretized time sequence; constructing a whole process transportation planning model of railway cargoes, namely constructing an optimization model based on an operation income maximization objective function based on the basic input and the space-time service network, taking the freight traffic volume of an operation line, a train running path and the operation line as decision variables, and restraining matching relation of the train and the operation line, line passing capability, train service capability, train bottom conservation, container flow conservation, cargo flow conservation and total transportation cost based on preset constraint conditions; generating a whole process transportation plan of railway cargos, specifically, determining a train operation line combination between freight requirements OD after the earliest permitted departure time of a train in an imported train operation diagram based on the earliest permitted departure time of the train output by a whole process transportation plan programming model of the railway cargos, and further determining a feasible train operation line combination based on the time limit requirement of the cargos.
The embodiment of the invention discloses a method for planning the whole cargo transportation plan, which considers the requirement of the arrival time limit and realizes the streamline combination. Compared with the current planning method, the method can better guide production operation and support the improvement of the rate of the time limit redemption of railway goods. The method of the embodiment of the invention comprehensively considers the relationship among the cargo flow, the box flow, the car flow and the train flow, fully utilizes transportation resources and realizes the quality improvement and efficiency improvement of transportation organizations.
Drawings
Fig. 1 is a flow chart of a method of planning a whole process transportation of railway freight-car according to some embodiments of the present description.
Fig. 2 is a detailed flow chart of a method of planning a whole process transportation of railway freight in accordance with some embodiments of the present description.
Detailed Description
In order to make the technical solutions in the present specification better understood by those skilled in the art, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only some embodiments of the present specification, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are intended to be within the scope of the present disclosure.
First, with reference to tables 1 and 2, variables and symbols of the model according to the embodiment of the present invention are defined as follows:
TABLE 1
TABLE 2
As shown in fig. 1 and 2, some embodiments of the present disclosure provide a method for planning a whole process transportation of railway freight, including: setting basic input, namely taking freight demands, basic road network, section capacity and site capacity as basic input, wherein the freight demands comprise freight demands OD and freight arrival time limit requirements; constructing a space-time service network, namely discretizing a planned period, and copying nodes in a physical road network according to the discretized time sequence; constructing a whole process transportation planning model of railway cargoes, namely constructing an optimization model based on an operation income maximization objective function based on the basic input and the space-time service network, taking the freight traffic volume of an operation line, a train running path and the operation line as decision variables, and restraining matching relation of the train and the operation line, line passing capability, train service capability, train bottom conservation, container flow conservation, cargo flow conservation and total transportation cost based on preset constraint conditions; generating a whole process transportation plan of railway cargos, specifically, determining a train operation line combination between freight requirements OD after the earliest permitted departure time of a train in an imported train operation diagram based on the earliest permitted departure time of the train output by a whole process transportation plan programming model of the railway cargos, and further determining a feasible train operation line combination based on the time limit requirement of the cargos. That is, based on the model for planning the whole-process transportation of the railway goods, the whole-process transportation plan of the goods can be calculated and obtained, including the box flow, the transfer connection relation of the car flow, the application track of the box car, the earliest departure time of the train and the like. By utilizing the earliest departure time of the train, the train operation line combination among specific OD after the time node can be searched in the train operation diagram, and the feasible train operation line combination is selected according to the basic requirement of the arrival time limit, so that the whole-process transportation plan of the railway goods combined by the streamline is finally formed.
In some embodiments of the present description, the operating benefit maximization objective function is, in particular,
wherein K is a commodity flow set, and K is E K; mu (mu) k The number of containers needed for the cargo flow K e K; p is p k Pricing the unit container of the commodity flow K epsilon K; e (E) V A set of successive arc segments possibly selected for the vehicle bottom; c al Selecting successive arc segments (a, l) E for the vehicle bottom V Is a cost of (2); for x al If the vehicle bottom traveling arc sections (a, l) are selected, the value is 1, otherwise, the value is 0; c is the use cost of a single vehicle bottom; w (w) ka Selecting an arc section a epsilon A for transporting the container of the unit cargo flow K epsilon K; for f ka If the cargo flow K epsilon K selects an arc section a epsilon A, the value is 1, otherwise, the value is 0; w (w) a The transportation cost of the arc section a epsilon A is selected for the unit container; q a For the number of containers on the operational line a e a.
In some embodiments of the present description, the constraint on matching relationship between the train and the running line, specifically,
wherein, for x a ，If the operation line a epsilon A is selected, the value is 1, otherwise, the value is 0; for delta a If the operation line a epsilon A R Is selected, the value is 1, otherwise, the value is 0; a is that R Running an arc set for all possible segments; a is that RHB A running line set for a section including a fixed turnover of the vehicle bottom; />This embodiment is mainly constrained from a feasibility and practicality perspective.
In some embodiments of the present description, the constraints on underbody conservation, container flow conservation, and cargo flow conservation, in particular,
wherein E is V A set of successive arc segments (a, l) E E, possibly selected for the vehicle bottom V The method comprises the steps of carrying out a first treatment on the surface of the s (E) is arc segment E E in the vehicle bottom connection network HB Virtual starting point of (a); d (E) is arc segment E E in the vehicle bottom connection network HB Is a virtual endpoint of (a); e (E) HB A directed section set for the fixed turnover of the vehicle bottom;for the set of operation lines arriving at station i e N before period T e T; />For a set of operation lines issued at site i e N before period T e T; n (N) T The method comprises the steps of collecting all space-time nodes; o (o) k The source point of the commodity flow K epsilon K; d, d k For the end point of the stream K e K +.>The present embodiment is mainly constrained from a network flow perspective.
In some embodiments of the present description, the line throughput capability, train service capability, and in particular,
wherein C is a For operating line a epsilon A R I.e. the number of standard containers that can be transported;the present embodiment is constrained mainly from the point of view of capacity utilization.
In some embodiments of the present description, the constraint on the total cost of transportation, in particular,
wherein lambda is k The time value of unit transport time of unit container cargo flow K epsilon K; τ a The time length of the space-time arc section a epsilon A; pi k The subsidy price of the unit container cargo flow K epsilon K; an upper bound representing pricing for unit container stream K e K. That is, from the perspective of transportation efficiency, the total cost of transportation is higher than a certain set value, and then the specific goods are not carried.
In summary, the embodiment of the invention provides a method for planning a whole process transportation plan of railway cargos, which aims at maximizing the income of transportation enterprises and produces a specific train operation plan through cargo flow distribution, box flow distribution and traffic flow distribution; and selecting proper operation lines from the basic diagram according to the basic requirements of the earliest train departure time and the goods arrival time limit of the train to form a final transportation plan. Specifically, the input is based on freight demands (including freight demand OD, freight arrival time limit demand), basic road network, section/interval capability, and site capability; discretizing the planning period, constructing a railway cargo whole-process transportation space-time service network based on a physical road network, and carrying out cargo loading, transferring operation, arrival and unloading, empty car/empty box operation and other elements in the constructed space-time service network; based on the constructed space-time service network, constructing an optimization model with the aim of maximizing the income of transportation enterprises or minimizing the total transportation cost; in the planning period, the balance of the cargo flows, the transit time of the cargo flows, the line transportation capacity, the number of cars/boxes and the train service capacity can be restrained.
In general, the invention realizes the automatic programming of the railway freight transportation plan, and the railway freight transportation plan in China is mainly manually programmed, and the theory and method for automatic or intelligent programming have insufficient support. The whole process transportation planning method of railway goods can realize automatic planning of transportation plans according to freight requirements and road network capacity supply, and can realize great reduction of planning intensity. The invention also realizes the whole-process management of the railway freight, the whole-process transportation planning method of the railway freight comprehensively considers the relations of the freight flow, the box flow, the car flow and the train flow, and matches and associates the plan with the basic operation line, firstly, the railway transportation plan can be extended to two ends, secondly, the whole process management and regulation can be assisted by daily production scheduling command, and further, the supporting effect is realized on the improvement of the transportation deadline rate of the railway freight. The method and the system for detecting and early warning the arrival time of the railway cargoes are supported, and the method and the system for detecting and early warning the arrival time of the cargoes are not available in China, and are mainly due to lack of control over the whole transportation process. Based on the plan generated by the whole process transportation planning method of railway goods, each link of goods loading and unloading, train running and transfer operation can be thinned, the distribution of the arrival time limit of the goods can be carried out on the basis, and then the detection and the early warning of the arrival time limit of the railway goods are realized by combining the track tracking of the goods and the vehicles on the basis of the arrival time limit distribution value.
While the process flows described above include a plurality of operations occurring in a particular order, it should be apparent that the processes may include more or fewer operations, which may be performed sequentially or in parallel (e.g., using a parallel processor or a multi-threaded environment). The present invention is described with reference to flowchart illustrations and/or block diagrams of methods according to embodiments of the invention.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method or apparatus comprising such elements.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. The foregoing is merely an example of the present specification and is not intended to limit the present specification. Various modifications and alterations to this specification will become apparent to those skilled in the art. Any modifications, equivalent substitutions, improvements, or the like, which are within the spirit and principles of the present description, are intended to be included within the scope of the claims of the present description.
Claims (1)
1. A method of planning a whole process transportation of railway freight, the method comprising:
setting basic input, namely taking freight demands, basic road network, section capacity and site capacity as basic input, wherein the freight demands comprise freight demands OD and freight arrival time limit requirements;
constructing a space-time service network, namely discretizing a planned period, and copying nodes in a physical road network according to the discretized time sequence;
constructing a whole process transportation planning model of railway cargoes, namely constructing an optimization model based on an operation income maximization objective function based on the basic input and the space-time service network, taking the freight traffic volume of an operation line, a train running path and the operation line as decision variables, and restraining matching relation of the train and the operation line, line passing capability, train service capability, train bottom conservation, container flow conservation, cargo flow conservation and total transportation cost based on preset constraint conditions;
generating a whole process transportation plan of railway cargos, specifically, determining a train operation line combination between freight requirements OD after the earliest permitted departure time of a train in an imported train operation diagram based on the earliest permitted departure time of the train output by a whole process transportation plan programming model of the railway cargos, and further determining a feasible train operation line combination based on the time limit requirement of the cargos;
wherein the operation benefit maximization objective function is, in particular,
wherein K is a commodity flow set, and K is E K; mu (mu) k The number of containers needed for the cargo flow K e K; p is p k Pricing the unit container of the commodity flow K epsilon K; e (E) V A set of successive arc segments possibly selected for the vehicle bottom; c al Selecting successive arc segments (a, l) E for the vehicle bottom V Is a cost of (2); for x al If the vehicle bottom traveling arc sections (a, l) are selected, the value is 1, otherwise, the value is 0; e (E) sta Virtual starting arc segment set for the vehicle bottom; c is the use cost of a single vehicle bottom; a is a set of all possible space-time arc segments; w (w) ka Selecting an arc section a epsilon A for transporting the container of the unit cargo flow K epsilon K; for f ka If the cargo flow K epsilon K selects an arc section a epsilon A, the value is 1, otherwise, the value is 0; a is that R Running an arc set for all possible segments; w (w) a The transportation cost of the arc section a epsilon A is selected for the unit container; q a For the number of containers on the operational line a e a;
the matching relation between the train and the running line is restrained, in particular,
wherein, for x a ，If the operation line a epsilon A is selected, the value is 1, otherwise, the value is 0; for delta a If the operation line a epsilon A R Is selected, the value is 1, otherwise, the value is 0; a is that R Running an arc set for all possible segments; a is that RF For all given run line sets; a is that RHB A running line set for a section including a fixed turnover of the vehicle bottom; />For x la If the vehicle bottom traveling arc section (l, a) is selected, the value is 1, otherwise, the value is 0;
the restraint of conservation of the vehicle bottom, conservation of container flow and conservation of cargo flow is specifically,
wherein E is V A set of successive arc segments (a, l) E E, possibly selected for the vehicle bottom V The method comprises the steps of carrying out a first treatment on the surface of the s (E) is arc segment E E in the vehicle bottom connection network HB Virtual starting point of (a); d (E) is arc segment E E in the vehicle bottom connection network HB Is a virtual endpoint of (a); e (E) HB A directed section set for the fixed turnover of the vehicle bottom; q a For the number of containers on the operational line a e a; t is a planning period; n is a set of all nodes in the physical network; mu (mu) k The number of containers needed for the cargo flow K e K;for the set of operation lines arriving at station i e N before period T e T; />For a set of operation lines issued at site i e N before period T e T; s (a) is the initial space-time node of arc segment a epsilon A; d (a) is the ending space-time node of arc segment a epsilon A; n (N) T The method comprises the steps of collecting all space-time nodes; o (o) k The source point of the commodity flow K epsilon K; d, d k For the end point of the stream K e K +.>The earliest allowable pick-up time for the commodity flow K epsilon K;
the line throughput capability, the train service capability, in particular,
wherein C is a For operating line a epsilon A R I.e. the number of standard containers that can be transported;
said constraint on the total cost of transportation, in particular,
wherein lambda is k The time value of unit transport time of unit container cargo flow K epsilon K; τ a The time length of the space-time arc section a epsilon A; pi k The subsidy price of the unit container cargo flow K epsilon K;an upper bound value representing pricing of unit container stream K e K; for f ka If the cargo flow K epsilon K selects an arc section a epsilon A, the value is 1, otherwise, the value is 0; u (U) k Pricing for unit container stream K e K.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110034282.7A CN112801346B (en) | 2021-01-12 | 2021-01-12 | Method for planning whole-process transportation of railway goods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110034282.7A CN112801346B (en) | 2021-01-12 | 2021-01-12 | Method for planning whole-process transportation of railway goods |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112801346A CN112801346A (en) | 2021-05-14 |
| CN112801346B true CN112801346B (en) | 2024-04-09 |
Family
ID=75809954
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110034282.7A Active CN112801346B (en) | 2021-01-12 | 2021-01-12 | Method for planning whole-process transportation of railway goods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112801346B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113962634A (en) * | 2021-10-28 | 2022-01-21 | 江苏中烟工业有限责任公司 | Intelligent scheduling method and device for finished cigarette transportation week plan and electronic equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140036337A (en) * | 2012-09-12 | 2014-03-25 | 현대로템 주식회사 | Failure information correction and analysis system for railway system |
| CN107871179A (en) * | 2017-09-26 | 2018-04-03 | 西南交通大学 | It is a kind of based on the goods train service chart preparation method for transporting to the time limit |
| CN109902866A (en) * | 2019-02-21 | 2019-06-18 | 北京交通大学 | The cooperative optimization method of railway fast freight class column starting scheme and rolling stock |
| CN110298507A (en) * | 2019-06-27 | 2019-10-01 | 北京交通大学 | High Speed Railway Train Diagram and EMU use Integrated Optimization |
| CN110766203A (en) * | 2019-09-26 | 2020-02-07 | 北京交通大学 | Railway collection and distribution service network optimization method based on comprehensive cost |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
-
2021
- 2021-01-12 CN CN202110034282.7A patent/CN112801346B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20140036337A (en) * | 2012-09-12 | 2014-03-25 | 현대로템 주식회사 | Failure information correction and analysis system for railway system |
| CN107871179A (en) * | 2017-09-26 | 2018-04-03 | 西南交通大学 | It is a kind of based on the goods train service chart preparation method for transporting to the time limit |
| CN109902866A (en) * | 2019-02-21 | 2019-06-18 | 北京交通大学 | The cooperative optimization method of railway fast freight class column starting scheme and rolling stock |
| CN110298507A (en) * | 2019-06-27 | 2019-10-01 | 北京交通大学 | High Speed Railway Train Diagram and EMU use Integrated Optimization |
| CN110766203A (en) * | 2019-09-26 | 2020-02-07 | 北京交通大学 | Railway collection and distribution service network optimization method based on comprehensive cost |
| CN111967828A (en) * | 2020-08-20 | 2020-11-20 | 北京交通大学 | Whole-process logistics-oriented road-rail combined transport product collaborative optimization method |
Non-Patent Citations (1)
| Title |
|---|
| 铁路网络列车运行调整的优化模型 及其分支定价算法;兰泽康等;交通运输***工程与信息;20180228;第18卷(第1期);第179-185页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112801346A (en) | 2021-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Urban rail service design for collaborative passenger and freight transport | |
| Ballis et al. | Comparative evaluation of existing and innovative rail–road freight transport terminals | |
| CN205139982U (en) | Automatic change novel urban railway commodity circulation conveyor system | |
| Kuo et al. | Freight train scheduling with elastic demand | |
| KR20120100601A (en) | Optimization system of smart logistics network | |
| Zhang et al. | Synchromodal transport planning with flexible services: Mathematical model and heuristic algorithm | |
| CN115081674B (en) | Local container transportation typesetting optimization method under novel truck queuing driving mode | |
| CN113298403A (en) | Transportation time window synchronization-based highway and molten iron combined transportation scheduling method | |
| CN112801346B (en) | Method for planning whole-process transportation of railway goods | |
| Mnif et al. | A multi-objective formulation for multimodal transportation network's planning problems | |
| He et al. | Parcel delivery by collaborative use of truck fleets and bus-transit vehicles | |
| Janić | Multicriteria evaluation of intermodal (rail/road) freight transport corridors | |
| Široký et al. | Comparison of operational and economic aspects of direct road transport and continental combined transport | |
| CN107392478A (en) | A kind of preparation method of railway fast freight traffic production scheme | |
| Parkhomenko et al. | Building a model for planning rapid delivery of containers by rail under the conditions of intermodal transportation based on robust optimization | |
| Wang et al. | Freight transport using additional railcars attached to intercity passenger trains with transshipment and railcar circulation: Tabu-search-based Lagrangian heuristic | |
| CN109886467B (en) | Urban ULS and road integrated cargo transportation network flow distribution system and method | |
| Frolova et al. | Organization and movement of exit routes from empty cars | |
| Allen et al. | Integrated transport policy in freight transport | |
| Zubkov et al. | The prospective model of organization of freight transportation on the North Caucasian railway range | |
| Saenger et al. | Capabilities of a Periodic Containerised Railfreight System in Germany | |
| Xiao et al. | Optimization of operation scheme for express freight railway | |
| Leue et al. | San Pedro Bay Portwide Rail Planning for Today and 2040 | |
| Rui-yong et al. | Comprehensive Optimization of Operation Planning and Pricing of Backhaul for Heavy-haul Railways Transportation | |
| Lu | Research on Point-to-Point Direct Transportation Organization Mode of Railway Bulk Goods |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |