<?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-11-21T02:05:27Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/25846" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/25846</identifier><datestamp>2026-09-24T02:56:57Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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">Hassini, Elkafi</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Tamvada, Srinivas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computational Engineering and Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-10-02T13:37:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-10-02T13:37:45Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/25846</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/8598</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">We propose solution strategies for hard Mixed Integer Programming (MIP) problems,&#xd;
with a focus on distributed parallel MIP optimization. Although our proposals are&#xd;
inspired by the Less-than-truckload (LTL) freight routing problem, they are more&#xd;
generally applicable to hard MIPs from other domains. We start by developing an Integer&#xd;
Programming model for the Less-than-truckload (LTL) freight routing problem,&#xd;
and present a novel heuristic for solving the model in a reasonable amount of time&#xd;
on large LTL networks. Next, we identify some adaptations to MIP branching strategies&#xd;
that are useful for achieving improved scaling upon distribution when the LTL&#xd;
routing problem (or other hard MIPs) are solved using parallel MIP optimization.&#xd;
&#xd;
Recognizing that our model represents a pseudo-Boolean optimization problem&#xd;
(PBO), we leverage solution techniques used by PBO solvers to develop a CPLEX&#xd;
based look-ahead solver for LTL routing and other PBO problems. Our focus once&#xd;
again is on achieving improved scaling upon distribution. We also analyze a technique&#xd;
for implementing subtree parallelism during distributed MIP optimization. We&#xd;
believe that our proposals represent a significant step towards solving big-data driven&#xd;
optimization problems (such as the LTL routing problem) in a more efficient manner.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="layabstract" lang="en_US">Less-than-truckload (LTL) freight transportation is a vital part of Canada's economy,&#xd;
with revenues running into billions of dollars and a cascading impact on many&#xd;
other industries. LTL operators often have to deal with large volumes of shipments,&#xd;
unexpected changes in traffic conditions, and uncertainty in demand patterns. In an&#xd;
industry that already has low profit margins, it is therefore vitally important to make&#xd;
good routing decisions without expending a lot of time.&#xd;
&#xd;
The optimization of such LTL freight networks often results in complex big-data&#xd;
driven optimization problems. In addition to the challenge of finding optimal solutions&#xd;
for these problems, analysts often have to deal with the complexities of big-data driven&#xd;
inputs. In this thesis we develop several solution strategies for solving the LTL freight&#xd;
routing problem including an exact model, novel heuristics, and techniques for solving&#xd;
the problem efficiently on a cluster of computers.&#xd;
&#xd;
Although the techniques we develop are inspired by LTL routing, they are more&#xd;
generally applicable for solving big-data driven optimization problems from other&#xd;
domains. Experiments conducted over the years in consultation with industry experts&#xd;
indicate that our proposals can significantly improve solution quality and reduce&#xd;
time to solution. Furthermore, our proposals open up interesting avenues for future&#xd;
research.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Big-data driven optimization methods</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Less-than-truckload freight routing</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Big-Data Driven Optimization Methods with Applications to LTL Freight Routing</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>