CN103208031A - Running shortest path selection method for industrial railway logistics intelligent scheduling system - Google Patents
Running shortest path selection method for industrial railway logistics intelligent scheduling system Download PDFInfo
- Publication number
- CN103208031A CN103208031A CN201310087795XA CN201310087795A CN103208031A CN 103208031 A CN103208031 A CN 103208031A CN 201310087795X A CN201310087795X A CN 201310087795XA CN 201310087795 A CN201310087795 A CN 201310087795A CN 103208031 A CN103208031 A CN 103208031A
- Authority
- CN
- China
- Prior art keywords
- bottle
- machine
- shortest path
- neck section
- road
- 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
Links
- 238000010187 selection method Methods 0.000 title abstract 2
- 238000000034 method Methods 0.000 claims abstract description 58
- 238000004891 communication Methods 0.000 claims abstract description 10
- 230000003137 locomotive effect Effects 0.000 claims abstract description 7
- 230000011664 signaling Effects 0.000 claims description 59
- 238000012546 transfer Methods 0.000 claims description 22
- 238000012790 confirmation Methods 0.000 claims description 3
- 238000004064 recycling Methods 0.000 claims description 3
- 238000009826 distribution Methods 0.000 claims description 2
- 238000004140 cleaning Methods 0.000 claims 1
- 238000007726 management method Methods 0.000 abstract description 18
- 238000004519 manufacturing process Methods 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 3
- 238000005096 rolling process Methods 0.000 description 3
- 230000000877 morphologic effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Abstract
The invention relates to a running shortest path selection method for an industrial railway logistics intelligent scheduling system. The method is achieved by the mode of an industrial railway transportation driving shortest path selection algorithm in software mode. The industrial railway transportation driving shortest path selection algorithm is achieved in an intelligent scheduling computer. The total function is composed of an in-throat-section shortest path searching module, a cross-throat-section shortest path searching module and the like. The intelligent scheduling computer, a logistics management computer, a logistics management server, a logistics management database, an enterprise resource planning (ERP) interface database and other computers and servers are communicated through the Ethernet, the intelligent scheduling computer and a signal system computer adopts recommended standard (RS) 232 communication, and the intelligent scheduling computer and a railway locomotive safety control system are communicated through an industrial wireless network. The method can provide shortest running path searching service for vehicles in the industrial railway transportation process.
Description
Technical field
The present invention relates to multiple theory and technology such as computer technology, Networks and Communications, Intelligent Information Processing, be mainly used in the intelligent scheduling of industrial railway transportation logistics.
Background technology
Current, transportation by railroad is the important form of large enterprise's inside transport.The quality that railway traffic control production plan (being also referred to as vehicling operation plan, shunting operation plan) is formulated is directly connected to station equipment and whether obtains comprehensive effectively utilization, be related to and whether can finish the transportation production task efficiently comprehensively, the assurance normative operation is kept the safety in production, thereby has influence on production, the operation and management efficient of enterprise.
The establishment of schedule job plan will be considered many complicated factors, searching of its middle rolling car shortest path is the basis of schedule job planning, only can search the shortest path of railways train operation between two circuits accurately and efficiently and just might further work out out high-quality schedule job plan.
The aspects such as searching of between transport by road or rail yard path that focus mostly on of the research of shortest path searching at present still do not have the method for the precise and high efficiency that comes into operation aspect the transportation in the enterprise railway station.
Summary of the invention
The present invention is for solving industrial railway transportation logistics intelligent scheduling problem, a kind of enterprise railway transportation driving shortest path searching method is provided, present technique is transferred in road and basic route based on railway signal system length, theoretical in conjunction with figure, construct and be fit to transport in the enterprise railway station, accurately and efficiently the shortest driving path searching method.Guarantee the quality of schedule job plan intelligence establishment, improved establishment efficient.
Technical scheme of the present invention is as follows:
Industrial railway transportation logistics intelligent dispatching system, by the intelligent scheduling computing machine, the logistics management computing machine, the signal system computing machine, the logistics management server, the logistics management database, the ERP interface database, railway locomotive peace control system forms, be connected by connection between intelligent scheduling computing machine and the signal system computing machine and adopt the RS232 communication, the intelligent scheduling computing machine, the logistics management computing machine, the logistics management server, the logistics management database, be connected by the ethernet communication line between each computing machine such as ERP interface database and the server, the intelligent scheduling computing machine is connected by wireless communication mode with railway locomotive peace control system.
Industrial railway transportation logistics system vehicle location is followed the tracks of and is finished by the intelligent scheduling computing machine, mainly by shortest path searching module in the bottle-neck section, stride bottle-neck section shortest path searching module etc. and partly form.
Receive the path searching application of intelligent planning module in intelligent scheduling computing machine middle rolling car shortest path searching module, be foundation with the route data of railway signal system, a morphological data of standing, the existing car information of the emulation that the existing car information of bond flow management database and emulation module are derived in conjunction with plan is according to shortest path in the bottle-neck section with stride two kinds of situations of bottle-neck section shortest path searching of shortest path of driving a vehicle.The path that finds returns to intelligent planning module.
Generate the plan of transportation by railroad vehicling operation by the intelligent scheduling computing machine, its form and content comprise: production plan number, engine number, the plan number of colluding, strand Taoist monastic name, operating type, working truck number, operator to, pluck and collude direction etc.; Wherein operating type comprises 3 kinds: "+" is the trailer operation, and "-" for plucking the car operation, and " zero " is for by operation.
The executive mode of the transportation by railroad vehicling operation plan that is generated by the intelligent scheduling computing machine is as follows: the transportation by railroad vehicling operation plan that generates is sent to the signal system computing machine, by the signal system computing machine according to the automatic gather route of transportation by railroad vehicling operation plan that receives, open route, and collude affirmation clearly, and confirmation is fed back in the intelligent scheduling computing machine according to the travelling of vehicle, the automatic realization of arrival situation.
The driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system is:
1. at first judge to want the top of searching route and terminal (being initial endpoint signal machine and terminal signaling machine) whether to be positioned at same bottle-neck section, if be positioned at same bottle-neck section, then to adopt shortest path searching method in the bottle-neck section;
2. if want the top of searching route and terminal not to be positioned at same bottle-neck section, then adopt the shortest path searching method of striding bottle-neck section.Its lookup method is: at first search for from top to the bottle-neck section sequential list of terminal process; Again by beginning/terminal signaling machine bottle-neck section direct neighbor of living in or not two kinds of situations of direct neighbor carry out shortest path searching.
The search procedure of shortest path is in the bottle-neck section:
1. all terminal signaling machine directions of this bottle-neck section length identical with the terminal signaling machine direction that will search being transferred in the road travels through, transfer in the road in each bar length, the long relatively initial endpoint signal machine of transferring in the road traversal basic route wherein successively that draws near, terminal to each bar basic route is searched, find the basic route that comprises the terminal signaling machine, note this length and transfer in road and this basic route in the long position of transferring in the road, from then on the position begins, then travel through all the other basic routes in the road long transferring in, its top is judged, if the top that finds us to search, and the parking line between each basic route is idle, then searches successfully; Otherwise note and comprise the terminal signaling captain and transfer in the sequence number on road and basic route position wherein; Finish up to all long road traversals of transferring in, jump procedure 2..
2. all find to previous step comprises that the terminal signaling captain transfers in the road and basic route travels through, transfer in the road for each the bar length in the array, from comprising the basic route of terminal signaling machine, draw near, if the parking line between route is idle, with the top of each bar basic route as new terminal signaling machine (the initial endpoint signal machine of having searched is no longer repeated to search), 1. the length that travels through all one's respective areas as step is again transferred in the road, transfer in inside, road in each bar length, search for the terminal signaling machine of new assignment earlier, search for the initial endpoint signal machine again, find one to comprise the terminal signaling machine of new assignment simultaneously and the length of initial endpoint signal machine is transferred in the road, and top, the parking line free time between all basic routes between the terminal signaling machine, then search successfully.Do not find yet after the road traversal finishes if all length is transferred in, directly jump procedure 3..
3. travel through all one's respective areas and the equidirectional length of initial endpoint signal machine is transferred in the road, the long relatively top of transferring in the road from the close-by examples to those far off travels through basic route wherein successively, top to each bar basic route is searched, find the basic route that comprises the initial endpoint signal machine, note this length and transfer in road and basic route in the long position of transferring in the road, every long road of transferring in to record, from comprising the basic route of initial endpoint signal machine, from the close-by examples to those far off, if the parking line between route is idle, with the terminal of each bar basic route as new initial endpoint signal machine (the terminal signaling machine of having searched is no longer repeated to search), be the terminal signaling machine with former terminal signaling machine, again call this function and carry out recursive lookup, carry out the step of front again in recurrence inside, find the path then recurrence withdraw from, return by station track name and the basic route that passes through number.
For the shortest path searching of striding bottle-neck section, the process of searching from top the bottle-neck section sequential list of terminal process is: with the node of each bottle-neck section as " figure ", if exist its two ends teleseme of a parking line to adhere to two bottle-neck sections separately at least, then between these two bottle-neck sections, build a limit.Form in one " figure ".If when the top of wanting searching route and terminal are not positioned at same bottle-neck section, begin to search the residing bottle-neck section of terminal signaling machine in the mode that range travels through from the residing bottle-neck section of initial endpoint signal machine, generation from top to the bottle-neck section sequential list of terminal process.
During for beginning/terminal signaling machine bottle-neck section direct neighbor of living in, the search procedure of its shortest path is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section; Search again respectively by the path of circuit to the terminal signaling machine; To same path distance summation by the circuit two ends, get the shortest path of distance.
For beginning/terminal signaling machine bottle-neck section of living in not during direct neighbor, the search procedure of its shortest path is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section, get the shortest parking line in path; Search the terminal signaling machine again to each the unappropriated path by circuit that connects adjacent bottle-neck section, get the path the shortest pass through circuit.Recycling is aforementioned searches two by the shortest path between the circuit with quadrat method.Last again by the order of bottle-neck section with the shortest path that finds and be stitched together by circuit, form final shortest path.
Useful technique effect of the present invention is: the present invention transfers in road and basic route according to the actual features of field, enterprise railway station based on railway signal system length, constructs the shortest driving path searching method that is fit to transportation in the enterprise railway station.For the establishment of schedule job plan intelligence provides the foundation, guaranteed the quality of plan intelligence establishment, improved establishment efficient.The present invention protects can according to the current actual state of rail yard, find out the shortest path of railways train operation between two circuits accurately and efficiently according to the needs of schedule job plan intelligent arranging.
Description of drawings
Fig. 1 is overall construction drawing of the present invention.
Fig. 2 is functional module structure synoptic diagram of the present invention.
Embodiment
Shown in accompanying drawing 1.System is made up of intelligent scheduling computing machine (1), logistics management computing machine (2), signal system computing machine (dispatching concentration computing machine or interlocking computing machine) (3), logistics management server (4), logistics management database (5), ERP interface database (6), railway locomotive peace control system (7)
Be connected by connection between intelligent scheduling computing machine (1) and the signal system computing machine (3) and adopt the RS232 communication, intelligent scheduling computing machine (1), logistics management computing machine (2), logistics management server (4), logistics management database (5), ERP interface database (6) wait between each computing machine and the server and are connected by the ethernet communication line, and intelligent scheduling computing machine (1) is connected by wireless communication mode with railway locomotive peace control system (7).
Shown in accompanying drawing 2.Receive the path searching application of intelligent planning module in intelligent scheduling computing machine middle rolling car shortest path searching module, be foundation with the route data of railway signal system, a morphological data of standing, the existing car information of the emulation that the existing car information of bond flow management database and emulation module are derived in conjunction with plan is according to shortest path in the bottle-neck section with stride two kinds of situations of bottle-neck section shortest path searching of shortest path of driving a vehicle.The path that finds returns to intelligent planning module.
Generate the plan of transportation by railroad vehicling operation by the intelligent scheduling computing machine, its form and content comprise: production plan number, engine number, the plan number of colluding, strand Taoist monastic name, operating type, working truck number, operator to, pluck and collude direction etc.; Wherein operating type comprises 3 kinds: "+" is the trailer operation, and "-" for plucking the car operation, and " zero " is for by operation.
The executive mode of the transportation by railroad vehicling operation plan that is generated by the intelligent scheduling computing machine is as follows: the transportation by railroad vehicling operation plan that generates is sent to the signal system computing machine, by the signal system computing machine according to the automatic gather route of transportation by railroad vehicling operation plan that receives, open route, and collude affirmation clearly, and confirmation is fed back in the intelligent scheduling computing machine according to the travelling of vehicle, the automatic realization of arrival situation.
The driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system is:
1. at first judge to want the top of searching route and terminal (being initial endpoint signal machine and terminal signaling machine) whether to be positioned at same bottle-neck section, if be positioned at same bottle-neck section, then to adopt shortest path searching method in the bottle-neck section;
2. if want the top of searching route and terminal not to be positioned at same bottle-neck section, then adopt the shortest path searching method of striding bottle-neck section.Its lookup method is: at first search for from top to the bottle-neck section sequential list of terminal process; Again by beginning/terminal signaling machine bottle-neck section direct neighbor of living in or not two kinds of situations of direct neighbor carry out shortest path searching.
The search procedure of shortest path is in the bottle-neck section:
1. all terminal signaling machine directions of this bottle-neck section length identical with the terminal signaling machine direction that will search being transferred in the road travels through, transfer in the road in each bar length, the long relatively initial endpoint signal machine of transferring in the road traversal basic route wherein successively that draws near, terminal to each bar basic route is searched, find the basic route that comprises the terminal signaling machine, note this length and transfer in road and this basic route in the long position of transferring in the road, from then on the position begins, then travel through all the other basic routes in the road long transferring in, its top is judged, if the top that finds us to search, and the parking line between each basic route is idle, then searches successfully; Otherwise note and comprise the terminal signaling captain and transfer in the sequence number on road and basic route position wherein; Finish up to all long road traversals of transferring in, jump procedure 2..
2. all find to previous step comprises that the terminal signaling captain transfers in the road and basic route travels through, transfer in the road for each the bar length in the array, from comprising the basic route of terminal signaling machine, draw near, if the parking line between route is idle, with the top of each bar basic route as new terminal signaling machine (the initial endpoint signal machine of having searched is no longer repeated to search), 1. the length that travels through all one's respective areas as step is again transferred in the road, transfer in inside, road in each bar length, search for the terminal signaling machine of new assignment earlier, search for the initial endpoint signal machine again, find one to comprise the terminal signaling machine of new assignment simultaneously and the length of initial endpoint signal machine is transferred in the road, and top, the parking line free time between all basic routes between the terminal signaling machine, then search successfully.Do not find yet after the road traversal finishes if all length is transferred in, directly jump procedure 3..
3. travel through all one's respective areas and the equidirectional length of initial endpoint signal machine is transferred in the road, the long relatively top of transferring in the road from the close-by examples to those far off travels through basic route wherein successively, top to each bar basic route is searched, find the basic route that comprises the initial endpoint signal machine, note this length and transfer in road and basic route in the long position of transferring in the road, every long road of transferring in to record, from comprising the basic route of initial endpoint signal machine, from the close-by examples to those far off, if the parking line between route is idle, with the terminal of each bar basic route as new initial endpoint signal machine (the terminal signaling machine of having searched is no longer repeated to search), be the terminal signaling machine with former terminal signaling machine, again call this function and carry out recursive lookup, carry out the step of front again in recurrence inside, find the path then recurrence withdraw from, return by station track name and the basic route that passes through number.
For the shortest path searching of striding bottle-neck section, the process of searching from top the bottle-neck section sequential list of terminal process is: with the node of each bottle-neck section as " figure ", if exist its two ends teleseme of a parking line to adhere to two bottle-neck sections separately at least, then between these two bottle-neck sections, build a limit.Form in one " figure ".If when the top of wanting searching route and terminal are not positioned at same bottle-neck section, begin to search the residing bottle-neck section of terminal signaling machine in the mode that range travels through from the residing bottle-neck section of initial endpoint signal machine, generation from top to the bottle-neck section sequential list of terminal process.
During for beginning/terminal signaling machine bottle-neck section direct neighbor of living in, the search procedure of its shortest path is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section; Search again respectively by the path of circuit to the terminal signaling machine; To same path distance summation by the circuit two ends, get the shortest path of distance.
For beginning/terminal signaling machine bottle-neck section of living in not during direct neighbor, the search procedure of its shortest path is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section, get the shortest parking line in path; Search the terminal signaling machine again to each the unappropriated path by circuit that connects adjacent bottle-neck section, get the path the shortest pass through circuit.Recycling is aforementioned searches two by the shortest path between the circuit with quadrat method.Last again by the order of bottle-neck section with the shortest path that finds and be stitched together by circuit, form final shortest path.
Claims (7)
1. transportation by railroad physical-distribution intelligent dispatching system is characterized in that: industrial railway transportation logistics intelligent dispatching system is made up of intelligent scheduling computing machine, logistics management computing machine, signal system computing machine, logistics management server, logistics management database, ERP interface database, railway locomotive peace control system; Be connected by the RS232 connection between described intelligent scheduling computing machine and the signal system computing machine, be connected by the ethernet communication line between each computing machine such as intelligent scheduling computing machine, logistics management computing machine, logistics management server, logistics management database, ERP interface database and the server, the intelligent scheduling computing machine is connected by wireless communication mode with railway locomotive peace control system.
2. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 1, it is characterized in that: generate the plan of transportation by railroad vehicling operation by the intelligent scheduling computing machine, vehicling operation plan executive mode is as follows: the transportation by railroad vehicling operation plan that generates is sent to the signal system computing machine, by the signal system computing machine according to the automatic gather route of transportation by railroad vehicling operation plan that receives, open route, and travelling according to vehicle, the arrival situation realizes the ditch cleaning affirmation automatically, and confirmation is fed back to the intelligent scheduling computing machine.
3. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 1 is characterized in that: driving shortest path selection course is:
1. at first judge to want the top of searching route and terminal (being initial endpoint signal machine and terminal signaling machine) whether to be positioned at same bottle-neck section, if be positioned at same bottle-neck section, then to adopt shortest path searching method in the bottle-neck section;
2. if want the top of searching route and terminal not to be positioned at same bottle-neck section, then adopt the shortest path searching method of striding bottle-neck section, its lookup method is: at first search for from top to the bottle-neck section sequential list of terminal process; During again by beginning/terminal signaling machine bottle-neck section direct neighbor of living in or two kinds of situations of direct neighbor are not carried out shortest path searching.
4. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 3 is characterized in that: shortest path searching method in the bottle-neck section, and its search procedure is:
1. all terminal signaling machine directions of this bottle-neck section length identical with the terminal signaling machine direction that will search being transferred in the road travels through, transfer in the road in each bar length, the long relatively initial endpoint signal machine of transferring in the road traversal basic route wherein successively that draws near, terminal to each bar basic route is searched, find the basic route that comprises the terminal signaling machine, note this length and transfer in road and this basic route in the long position of transferring in the road, from then on the position begins, then travel through all the other basic routes in the road long transferring in, its top is judged, if the top that finds us to search, and the parking line between each basic route is idle, then searches successfully; Otherwise note and comprise the terminal signaling captain and transfer in the sequence number on road and basic route position wherein; Finish up to all long road traversals of transferring in, jump procedure 2.;
2. all find to previous step comprises that the terminal signaling captain transfers in the road and basic route travels through, transfer in the road for each the bar length in the array, from comprising the basic route of terminal signaling machine, draw near, if the parking line between route is idle, with the top of each bar basic route as new terminal signaling machine, 1. the length that travels through all one's respective areas as step is again transferred in the road, transfer in inside, road in each bar length, search for the terminal signaling machine of new assignment earlier, search for the initial endpoint signal machine again, find one to comprise the terminal signaling machine of new assignment simultaneously and the length of initial endpoint signal machine is transferred in the road, and top, the parking line free time between all basic routes between the terminal signaling machine, then search successfully, do not find yet after the road traversal finishes if all length is transferred in, directly jump procedure 3.;
3. travel through all one's respective areas and the equidirectional length of initial endpoint signal machine is transferred in the road, the long relatively top of transferring in the road from the close-by examples to those far off travels through basic route wherein successively, top to each bar basic route is searched, find the basic route that comprises the initial endpoint signal machine, note this length and transfer in road and basic route in the long position of transferring in the road, every long road of transferring in to record, from comprising the basic route of initial endpoint signal machine, from the close-by examples to those far off, if the parking line between route is idle, with the terminal of each bar basic route as new initial endpoint signal machine, be the terminal signaling machine with former terminal signaling machine, call this function again and carry out recursive lookup, carry out the step of front in recurrence inside again, find the path then recurrence withdraw from, return by station track name and the basic route that passes through number.
5. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 3, it is characterized in that: from top to the bottle-neck section sequential list lookup method of terminal process, its search procedure is: with the node of each bottle-neck section as " figure ", if exist its two ends teleseme of a parking line to adhere to two bottle-neck sections separately at least, then between these two bottle-neck sections, build a limit, form in one " figure ", if when wanting the top of searching route and terminal not to be positioned at same bottle-neck section, begin to search the residing bottle-neck section of terminal signaling machine in the mode of range traversal from the residing bottle-neck section of initial endpoint signal machine, generate from top to the bottle-neck section sequential list of terminal process.
6. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 3, it is characterized in that: shortest path searching method during beginning/terminal signaling machine bottle-neck section direct neighbor of living in, its search procedure is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section; Search again respectively by the path of circuit to the terminal signaling machine; To same path distance summation by the circuit two ends, get the shortest path of distance.
7. the driving shortest path system of selection of industrial railway transportation logistics intelligent dispatching system according to claim 3, it is characterized in that: beginning/terminal signaling machine bottle-neck section of living in is shortest path searching method during direct neighbor not, its search procedure is: search the initial endpoint signal machine to each the unappropriated path by circuit that connects adjacent bottle-neck section according to shortest path searching method in the bottle-neck section, get the shortest parking line in path; Search the terminal signaling machine again to each the unappropriated path by circuit that connects adjacent bottle-neck section, get the path the shortest pass through circuit, recycling is aforementioned searches two by the shortest path between the circuit with quadrat method, last again by the order of bottle-neck section with the shortest path that finds and be stitched together by circuit, form final shortest path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310087795.XA CN103208031B (en) | 2013-03-19 | 2013-03-19 | A kind of driving shortest path system of selection of industrial railway physical-distribution intelligent dispatching patcher |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310087795.XA CN103208031B (en) | 2013-03-19 | 2013-03-19 | A kind of driving shortest path system of selection of industrial railway physical-distribution intelligent dispatching patcher |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103208031A true CN103208031A (en) | 2013-07-17 |
| CN103208031B CN103208031B (en) | 2016-09-28 |
Family
ID=48755248
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310087795.XA Active CN103208031B (en) | 2013-03-19 | 2013-03-19 | A kind of driving shortest path system of selection of industrial railway physical-distribution intelligent dispatching patcher |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103208031B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105022839A (en) * | 2015-08-18 | 2015-11-04 | 株洲南车时代电气股份有限公司 | Running route retrieval method and device |
| CN107688921A (en) * | 2017-11-17 | 2018-02-13 | 沈阳铁路局科学技术研究所 | A kind of Features of Railway Logistics base Transportation Organization system |
-
2013
- 2013-03-19 CN CN201310087795.XA patent/CN103208031B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| 魏臻: "企业铁路智能运输调度系统关键技术研究", 《中国博士学位论文全文数据库 信息科技辑》 * |
| 魏臻等: "企业铁路智能运输调度平台的关键流程", 《中国铁道科学》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105022839A (en) * | 2015-08-18 | 2015-11-04 | 株洲南车时代电气股份有限公司 | Running route retrieval method and device |
| CN105022839B (en) * | 2015-08-18 | 2018-11-30 | 湖南中车时代通信信号有限公司 | A kind of search method and device running pathway |
| CN107688921A (en) * | 2017-11-17 | 2018-02-13 | 沈阳铁路局科学技术研究所 | A kind of Features of Railway Logistics base Transportation Organization system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103208031B (en) | 2016-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112634606A (en) | Truck formation transportation scheduling method, scheduling system, medium and data processing terminal | |
| CN205139982U (en) | Automatic change novel urban railway commodity circulation conveyor system | |
| Barankova et al. | Automated control system of a factory railway transport based on ZigBee | |
| CN107914740B (en) | Train self-organizing dispatching system and method based on real-time passenger flow | |
| Shah et al. | Optimization models for assessing the peak capacity utilization of intelligent transportation systems | |
| CN103177561A (en) | Method and system for generating bus real-time traffic status | |
| CN109823374A (en) | Route map of train method of adjustment and device based on CTC system | |
| Badia et al. | Feeder transit services in different development stages of automated buses: Comparing fixed routes versus door-to-door trips | |
| CN108682145A (en) | The grouping method of unmanned bus | |
| CN109677456A (en) | A kind of train route control method and system suitable for low-density railway | |
| CN106228828A (en) | A kind of parking maneuver system and method | |
| CN102915644A (en) | Wireless intelligent transportation control system and method | |
| CN112581747B (en) | Vehicle-road cooperative cargo vehicle fleet organization method, device and system | |
| WO2023065595A1 (en) | Collaborative simulation calculation method for urban rail transit network and station | |
| CN105489047A (en) | Urban public transit intelligent system | |
| CN109625028A (en) | A kind of train enters the station or outbound space-time paths planning method and device | |
| CN108303112A (en) | One city package delivery route planning system based on taxi group | |
| CN103208031B (en) | A kind of driving shortest path system of selection of industrial railway physical-distribution intelligent dispatching patcher | |
| CN204423424U (en) | With the intelligent distribution and management system of electronic bus stop board | |
| CN106740875A (en) | A kind of train operational know-how | |
| ITMI20100309A1 (en) | METHOD AND SYSTEM FOR THE MOBILITY OF PEOPLE IN AN URBAN AND EXTRA URBAN CONTEXT | |
| CN1555998A (en) | Marshalling station comprehensive integrated automation system | |
| CN104648411A (en) | Locomotive energy management system and method | |
| CN114565296A (en) | Intelligent running scheduling method and system for rail transit construction line | |
| Barankova et al. | Company railway transport control automation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Wei Zhen Inventor after: Li Qian Inventor after: Su Yi Inventor after: Cheng Lei Inventor after: Xu Jinsong Inventor after: Dong Wei Inventor after: Liu Shigang Inventor after: Zhuge Zhanbin Inventor after: Yang Jun Inventor after: Yang Wei Inventor after: Min Wei Inventor before: Wei Zhen Inventor before: Cheng Lei Inventor before: Zhuge Zhanbin Inventor before: Yang Jun Inventor before: Yang Wei Inventor before: Min Wei Inventor before: Li Qian Inventor before: Su Yi |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: WEI ZHEN CHENG LEI ZHUGE ZHANBIN YANG JUN YANG WEI MIN WEI LI QIAN SU YI TO: WEI ZHEN CHENG LEI XU JINSONG DONG WEI LIU SHIGANG ZHUGE ZHANBIN YANG JUN YANG WEI MIN WEI LI QIAN SU YI |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20190605 Address after: 230000 No. 6 Yunfei Road, Hefei High-tech Zone, Anhui Province Patentee after: ANHUI SAIPU ELECTRIC POWER TECHNOLOGY CO., LTD. Address before: 230088 No. 27 Tianzhi Road, Hefei High-tech Zone, Anhui Province Patentee before: Hefei GOCOM Information & Technology Co., Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200513 Address after: No. 1682, Xiyou Road, hi tech Zone, Hefei City, Anhui Province 230000 Patentee after: HEFEI GONGDA HIGH-TECH INFORMATION TECHNOLOGY Co.,Ltd. Address before: 230000 No. 6 Yunfei Road, Hefei High-tech Zone, Anhui Province Patentee before: ANHUI SAIPU ELECTRIC POWER TECHNOLOGY Co.,Ltd. |