{"id":{"repo_id":"njit","oai_identifier":"oai:digitalcommons.njit.edu:theses-2154"},"canonical_url":"https://search.ndltd.org/etd/njit/oai:digitalcommons.njit.edu:theses-2154","repository":{"repo_id":"njit","name":"NJIT","base_url":"https://digitalcommons.njit.edu/do/oai/"},"display":{"title":"Optimizing rail-truck intermodal drayage operations","abstract":"This thesis presents a case study of the trucking (or drayage) portion of rail-truck intermodal freight transportation. The approach used was to examine in detail the current costs and potential for improvement at one New Jersey intermodal terminal. The analysis is conducted using a mathematical programming model to find an optimal scheduling plan for the drayage operation. To solve the model more efficiently, a modification is made to explore the special structure of the original problem which has a sparse constraint matrix. The model is solved first with an objective function that minimizes the total cost of the operation, and then with an objective function that minimizes the total tractor fleet size required to move the containers. The model results indicate a 19.2% and 52.7% reduction in overall costs respectively for the objectives of minimizing total cost and minimizing fleet size. This reduction is achieved by repositioning and reloading containers, after they have been unloaded at consignees.","abstract_html":"This thesis presents a case study of the trucking (or drayage) portion of rail-truck intermodal freight transportation. The approach used was to examine in detail the current costs and potential for improvement at one New Jersey intermodal terminal. The analysis is conducted using a mathematical programming model to find an optimal scheduling plan for the drayage operation. To solve the model more efficiently, a modification is made to explore the special structure of the original problem which has a sparse constraint matrix. The model is solved first with an objective function that minimizes the total cost of the operation, and then with an objective function that minimizes the total tractor fleet size required to move the containers. The model results indicate a 19.2% and 52.7% reduction in overall costs respectively for the objectives of minimizing total cost and minimizing fleet size. This reduction is achieved by repositioning and reloading containers, after they have been unloaded at consignees.","abstract_has_math":false,"creators":["Zhang, Wen"],"institution":null,"degree_name":"Master of Science in Transportation - (M.S.)","degree_level":null,"degree_discipline":"Executive Committee for the Interdisciplinary Program in Transportation","degree_department":null,"school":null,"contributors":["Lazar Spasovic","Athanassios K. Bladikas","Louis J. Pignataro"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:40:35Z","subjects":["Terminals (Transportation).","Containerization.","Freight-cars on truck trailers.","Freight and freightage.","Transportation Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.njit.edu/theses/1155","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.njit.edu/theses/1155","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.njit.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.njit.edu%3Atheses-2154","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Lazar Spasovic","Athanassios K. Bladikas","Louis J. Pignataro"]},{"key":"dc:creator","label":"Author","values":["Zhang, Wen"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["1995-10-31T08:00:00Z"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Executive Committee for the Interdisciplinary Program in Transportation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Transportation - (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Terminals (Transportation).","Containerization.","Freight-cars on truck trailers.","Freight and freightage.","Transportation Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.njit.edu/theses/1155"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis presents a case study of the trucking (or drayage) portion of rail-truck intermodal freight transportation. The approach used was to examine in detail the current costs and potential for improvement at one New Jersey intermodal terminal. The analysis is conducted using a mathematical programming model to find an optimal scheduling plan for the drayage operation. To solve the model more efficiently, a modification is made to explore the special structure of the original problem which has a sparse constraint matrix. The model is solved first with an objective function that minimizes the total cost of the operation, and then with an objective function that minimizes the total tractor fleet size required to move the containers. The model results indicate a 19.2% and 52.7% reduction in overall costs respectively for the objectives of minimizing total cost and minimizing fleet size. This reduction is achieved by repositioning and reloading containers, after they have been unloaded at consignees."]},{"key":"dc:title","label":"Title","values":["Optimizing rail-truck intermodal drayage operations"]}]}],"canonical_facts":{"dc:contributor":["Lazar Spasovic","Athanassios K. Bladikas","Louis J. Pignataro"],"dc:creator":["Zhang, Wen"],"dc:date.created":["1995-10-31T08:00:00Z"],"dc:description.abstract":["This thesis presents a case study of the trucking (or drayage) portion of rail-truck intermodal freight transportation. The approach used was to examine in detail the current costs and potential for improvement at one New Jersey intermodal terminal. The analysis is conducted using a mathematical programming model to find an optimal scheduling plan for the drayage operation. To solve the model more efficiently, a modification is made to explore the special structure of the original problem which has a sparse constraint matrix. The model is solved first with an objective function that minimizes the total cost of the operation, and then with an objective function that minimizes the total tractor fleet size required to move the containers. The model results indicate a 19.2% and 52.7% reduction in overall costs respectively for the objectives of minimizing total cost and minimizing fleet size. This reduction is achieved by repositioning and reloading containers, after they have been unloaded at consignees."],"dc:identifier":["https://digitalcommons.njit.edu/theses/1155"],"dc:subject":["Terminals (Transportation).","Containerization.","Freight-cars on truck trailers.","Freight and freightage.","Transportation Engineering"],"dc:title":["Optimizing rail-truck intermodal drayage operations"],"dc:type":["Thesis"],"thesis:degree_discipline":["Executive Committee for the Interdisciplinary Program in Transportation"],"thesis:degree_name":["Master of Science in Transportation - (M.S.)"]},"updated_at":"2026-11-19T08:40:35Z"}