{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/78683"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/78683","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations","abstract":"In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that can be random, periodic, or on-demand. Each type of work can be performed either at fixed facilities or via movable facilities. It is an important and difficult problem to make planning of the whole railroad system, including facilities locations, locomotives assignment, fuel inventory strategy, and movable facility routing trips. This paper formulates a large-scale linear mixed-integer mathematical model for the railroad system that integrates decisions about (i) locations, capacities, and types of facilities, (ii) assignments of locomotive work to facilities, (iii) fuel strategy of trains, and (iv) routes of movable facilities. We also propose a framework consisting of several solution algorithms, including network consolidation, network generation, reduce candidate location number, free move, and trip merge. The solution framework is designed to solve large-scale problem efficiently. Empirical case studies using field data show that the proposed model and algorithms are capable of providing near-optimum solutions effectively.","abstract_html":"In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that can be random, periodic, or on-demand. Each type of work can be performed either at fixed facilities or via movable facilities. It is an important and difficult problem to make planning of the whole railroad system, including facilities locations, locomotives assignment, fuel inventory strategy, and movable facility routing trips. This paper formulates a large-scale linear mixed-integer mathematical model for the railroad system that integrates decisions about (i) locations, capacities, and types of facilities, (ii) assignments of locomotive work to facilities, (iii) fuel strategy of trains, and (iv) routes of movable facilities. We also propose a framework consisting of several solution algorithms, including network consolidation, network generation, reduce candidate location number, free move, and trip merge. The solution framework is designed to solve large-scale problem efficiently. Empirical case studies using field data show that the proposed model and algorithms are capable of providing near-optimum solutions effectively.","abstract_has_math":false,"creators":["Chen, Xi"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"M.S.","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2015,"date_issued":"2015-07-22T22:33:59Z","date_published":"2015-07-22T22:33:59Z","updated_at":"2026-07-22T22:26:12Z","subjects":["MIP","Location","Inventory","Routing"],"languages":["en"],"rights":["Copyright 2015 Xi Chen"],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2142/78683","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Chen, Xi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-07-22T22:33:59Z","2017-07-23T09:15:31Z","2015-05","2015-04-28","2015-5"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["M.S."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["MIP","Location","Inventory","Routing"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 2015 Xi Chen"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/78683"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that can be random, periodic, or on-demand. Each type of work can be performed either at fixed facilities or via movable facilities. It is an important and difficult problem to make planning of the whole railroad system, including facilities locations, locomotives assignment, fuel inventory strategy, and movable facility routing trips. This paper formulates a large-scale linear mixed-integer mathematical model for the railroad system that integrates decisions about (i) locations, capacities, and types of facilities, (ii) assignments of locomotive work to facilities, (iii) fuel strategy of trains, and (iv) routes of movable facilities. We also propose a framework consisting of several solution algorithms, including network consolidation, network generation, reduce candidate location number, free move, and trip merge. The solution framework is designed to solve large-scale problem efficiently. Empirical case studies using field data show that the proposed model and algorithms are capable of providing near-optimum solutions effectively.","Submission published under a 24 month embargo labeled 'U of I only', the embargo will last until 2017-05-01","The student, Xi Chen, accepted the attached license on 2015-04-28 at 11:55.","The student, Xi Chen, submitted this Thesis for approval on 2015-04-28 at 12:05.","This Thesis was approved for publication on 2015-04-28 at 13:36.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8153 on 2015-07-22 at 14:18:56","Made available in DSpace on 2015-07-22T22:33:59Z (GMT). No. of bitstreams: 2 CHEN-THESIS-2015.pdf: 1811019 bytes, checksum: b24657c7ab1cc7845bd95951d91b31a1 (MD5) LICENSE.txt: 4204 bytes, checksum: 5bd4a093577ad6c631db5f58fed2a878 (MD5) Previous issue date: 2015-04-28","Embargo set by: Seth Robbins for item 79924 Lift date: 2017-07-22T22:34:16Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 79924 on 2017-07-23T09:15:31Z."]},{"key":"dc:format","label":"Dc Format","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations"]}]}],"canonical_facts":{"dc:creator":["Chen, Xi"],"dc:date":["2015-07-22T22:33:59Z","2017-07-23T09:15:31Z","2015-05","2015-04-28","2015-5"],"dc:description":["In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that can be random, periodic, or on-demand. Each type of work can be performed either at fixed facilities or via movable facilities. It is an important and difficult problem to make planning of the whole railroad system, including facilities locations, locomotives assignment, fuel inventory strategy, and movable facility routing trips. This paper formulates a large-scale linear mixed-integer mathematical model for the railroad system that integrates decisions about (i) locations, capacities, and types of facilities, (ii) assignments of locomotive work to facilities, (iii) fuel strategy of trains, and (iv) routes of movable facilities. We also propose a framework consisting of several solution algorithms, including network consolidation, network generation, reduce candidate location number, free move, and trip merge. The solution framework is designed to solve large-scale problem efficiently. Empirical case studies using field data show that the proposed model and algorithms are capable of providing near-optimum solutions effectively.","Submission published under a 24 month embargo labeled 'U of I only', the embargo will last until 2017-05-01","The student, Xi Chen, accepted the attached license on 2015-04-28 at 11:55.","The student, Xi Chen, submitted this Thesis for approval on 2015-04-28 at 12:05.","This Thesis was approved for publication on 2015-04-28 at 13:36.","DSpace SAF Submission Ingestion Package generated from Vireo submission #8153 on 2015-07-22 at 14:18:56","Made available in DSpace on 2015-07-22T22:33:59Z (GMT). No. of bitstreams: 2 CHEN-THESIS-2015.pdf: 1811019 bytes, checksum: b24657c7ab1cc7845bd95951d91b31a1 (MD5) LICENSE.txt: 4204 bytes, checksum: 5bd4a093577ad6c631db5f58fed2a878 (MD5) Previous issue date: 2015-04-28","Embargo set by: Seth Robbins for item 79924 Lift date: 2017-07-22T22:34:16Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system","U of I Only Restriction Lifted for Item 79924 on 2017-07-23T09:15:31Z."],"dc:format":["application/pdf"],"dc:identifier":["http://hdl.handle.net/2142/78683"],"dc:language":["en"],"dc:rights":["Copyright 2015 Xi Chen"],"dc:subject":["MIP","Location","Inventory","Routing"],"dc:title":["Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations"],"dc:type":["text"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["M.S."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:12Z"}