Transportation planning with rule-based release of trips for execution
A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subs...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | GOOSSENS ROGER J. A PETERKOFSKY ROY I SRIVASTAV ATUL KUMAR BUDARAJU HEMA PILLARISETTI VIJAY |
| description | A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subset of trips that are selected by the computer from among all trips in the entire plan. Thereafter, the computer simply repeats the just-described acts. Iteratively releasing portions of a plan allows the computer to be instructed to release early certain trips that are satisfactory. Trips that are sub-optimal are re-generated in a next version of the plan, based on changes in orders in the interim. The computer may also be instructed to release a trip even if sub-optimal, if its time-to-departure becomes less than an advance notice needed by a truckload service that is to execute the trip. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US8046161B2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US8046161B2</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US8046161B23</originalsourceid><addsrcrecordid>eNrjZHALKUrMKy7ILypJLMnMz1MoyEnMy8vMS1cozyzJUCgqzUnVTUosTk1RKErNSQUyFPLTFEqKMguKFdLyixRSK1KTS0H6eBhY0xJzilN5oTQ3g4Kba4izh25qQX58anFBYnJqXmpJfGiwhYGJmaGZoZORMRFKABeYM9U</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Transportation planning with rule-based release of trips for execution</title><source>esp@cenet</source><creator>GOOSSENS ROGER J. A ; PETERKOFSKY ROY I ; SRIVASTAV ATUL KUMAR ; BUDARAJU HEMA ; PILLARISETTI VIJAY</creator><creatorcontrib>GOOSSENS ROGER J. A ; PETERKOFSKY ROY I ; SRIVASTAV ATUL KUMAR ; BUDARAJU HEMA ; PILLARISETTI VIJAY</creatorcontrib><description>A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subset of trips that are selected by the computer from among all trips in the entire plan. Thereafter, the computer simply repeats the just-described acts. Iteratively releasing portions of a plan allows the computer to be instructed to release early certain trips that are satisfactory. Trips that are sub-optimal are re-generated in a next version of the plan, based on changes in orders in the interim. The computer may also be instructed to release a trip even if sub-optimal, if its time-to-departure becomes less than an advance notice needed by a truckload service that is to execute the trip.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2011</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20111025&DB=EPODOC&CC=US&NR=8046161B2$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20111025&DB=EPODOC&CC=US&NR=8046161B2$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>GOOSSENS ROGER J. A</creatorcontrib><creatorcontrib>PETERKOFSKY ROY I</creatorcontrib><creatorcontrib>SRIVASTAV ATUL KUMAR</creatorcontrib><creatorcontrib>BUDARAJU HEMA</creatorcontrib><creatorcontrib>PILLARISETTI VIJAY</creatorcontrib><title>Transportation planning with rule-based release of trips for execution</title><description>A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subset of trips that are selected by the computer from among all trips in the entire plan. Thereafter, the computer simply repeats the just-described acts. Iteratively releasing portions of a plan allows the computer to be instructed to release early certain trips that are satisfactory. Trips that are sub-optimal are re-generated in a next version of the plan, based on changes in orders in the interim. The computer may also be instructed to release a trip even if sub-optimal, if its time-to-departure becomes less than an advance notice needed by a truckload service that is to execute the trip.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2011</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHALKUrMKy7ILypJLMnMz1MoyEnMy8vMS1cozyzJUCgqzUnVTUosTk1RKErNSQUyFPLTFEqKMguKFdLyixRSK1KTS0H6eBhY0xJzilN5oTQ3g4Kba4izh25qQX58anFBYnJqXmpJfGiwhYGJmaGZoZORMRFKABeYM9U</recordid><startdate>20111025</startdate><enddate>20111025</enddate><creator>GOOSSENS ROGER J. A</creator><creator>PETERKOFSKY ROY I</creator><creator>SRIVASTAV ATUL KUMAR</creator><creator>BUDARAJU HEMA</creator><creator>PILLARISETTI VIJAY</creator><scope>EVB</scope></search><sort><creationdate>20111025</creationdate><title>Transportation planning with rule-based release of trips for execution</title><author>GOOSSENS ROGER J. A ; PETERKOFSKY ROY I ; SRIVASTAV ATUL KUMAR ; BUDARAJU HEMA ; PILLARISETTI VIJAY</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US8046161B23</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2011</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>GOOSSENS ROGER J. A</creatorcontrib><creatorcontrib>PETERKOFSKY ROY I</creatorcontrib><creatorcontrib>SRIVASTAV ATUL KUMAR</creatorcontrib><creatorcontrib>BUDARAJU HEMA</creatorcontrib><creatorcontrib>PILLARISETTI VIJAY</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>GOOSSENS ROGER J. A</au><au>PETERKOFSKY ROY I</au><au>SRIVASTAV ATUL KUMAR</au><au>BUDARAJU HEMA</au><au>PILLARISETTI VIJAY</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Transportation planning with rule-based release of trips for execution</title><date>2011-10-25</date><risdate>2011</risdate><abstract>A computer, for planning moves of freight automatically receives a plan containing a number of trips to be performed to move freight using vehicles, and partially releases only a portion of the plan for execution instead of releasing the entire plan. The plan portion that is released includes a subset of trips that are selected by the computer from among all trips in the entire plan. Thereafter, the computer simply repeats the just-described acts. Iteratively releasing portions of a plan allows the computer to be instructed to release early certain trips that are satisfactory. Trips that are sub-optimal are re-generated in a next version of the plan, based on changes in orders in the interim. The computer may also be instructed to release a trip even if sub-optimal, if its time-to-departure becomes less than an advance notice needed by a truckload service that is to execute the trip.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US8046161B2 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | Transportation planning with rule-based release of trips for execution |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-20T18%3A50%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=GOOSSENS%20ROGER%20J.%20A&rft.date=2011-10-25&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS8046161B2%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |