<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-19T03:41:02Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/100081" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/100081</identifier><datestamp>2026-06-06T01:03:21Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>com_1721.1_101402</setSpec><setSpec>col_1721.1_131023</setSpec><setSpec>col_1721.1_101610</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Bruce C. Arntzen.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Chopyak, Ann-Marie</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Lee, Haotian</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Engineering Systems Division.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Engineering Systems Division</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2015-12-03T20:52:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2015-12-03T20:52:14Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2015</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2015</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/100081</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">928939179</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis: M. Eng. in Logistics, Massachusetts Institute of Technology, Engineering Systems Division, 2015.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 41-42).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Optimization models are a commonly used tool to identify cost efficient network flows. Complexity increases when various products move across different paths and transportation modes within one network. To address the challenges posed by this complexity, this thesis develops a mixed integer linear programming model for a uniform rental company. The company's product families are routed through intermediary distribution centers, while others bypass these points and move directly to a regional distribution center. Various simulations were run with the objective of minimizing fixed costs, warehousing, inventory and transportation expenses. The function was constrained by flow balance, demand and capacity constraints. The optimal solution proposed a network that used less facilities than currently operated within the company, and some in new locations due to transportation cost savings. As volume increased, the network structure continued to shift further from the company's current structure. Demand increased the influence of variable rates, while transportation lane rates were a significant factor in every version of the model run.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Ann-Marie Chopyak and Haotian Lee.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng. in Logistics</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">43 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Engineering Systems Division.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Distribution network optimization in the uniform rental industry</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="72358e47-2428-4da4-801a-c3ad7b26659b">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Distribution network optimization in the uniform rental industry&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2015&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Chopyak, Ann-Marie&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
      	&lt;Author>
        	&lt;DisplayName>Lee, Haotian&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Engineering Systems Division.&lt;/Keyword>
   	&lt;Abstract>Optimization models are a commonly used tool to identify cost efficient network flows. Complexity increases when various products move across different paths and transportation modes within one network. To address the challenges posed by this complexity, this thesis develops a mixed integer linear programming model for a uniform rental company. The company&amp;apos;s product families are routed through intermediary distribution centers, while others bypass these points and move directly to a regional distribution center. Various simulations were run with the objective of minimizing fixed costs, warehousing, inventory and transportation expenses. The function was constrained by flow balance, demand and capacity constraints. The optimal solution proposed a network that used less facilities than currently operated within the company, and some in new locations due to transportation cost savings. As volume increased, the network structure continued to shift further from the company&amp;apos;s current structure. Demand increased the influence of variable rates, while transportation lane rates were a significant factor in every version of the model run.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>