<?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:44:35Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/20769" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/20769</identifier><datestamp>2026-09-24T05:19:42Z</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">Bonakdarpour, Borzoo</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Krishnan, Akhil</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Computing and Software</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-11-03T14:51:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-11-03T14:51:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2017</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/20769</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/22846</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Distributed Approximation</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">The classic vehicle routing problem (VRP) is generally concerned with the &#xd;
optimal design of routes by a fleet of vehicles to service a set of customers by &#xd;
minimizing the overall cost, usually the travel distance for the whole set of &#xd;
routes. Although the problem has been extensively studied in the context of &#xd;
operations research and optimization, there is little research on solving the VRP, &#xd;
where distributed vehicles need to compute their respective routes in a &#xd;
decentralized fashion. Our first contribution is a synchronous distributed &#xd;
approximation algorithm that solves the VRP. Using the duality theorem of &#xd;
linear programming, we show that the approximation ratio of our algorithm is &#xd;
$O(n . (\rho)^{1/n} .log(n+m))$, where $\rho$ is the maximum cost of &#xd;
travel or service in the input VRP instance, $n$ is the size of the graph, and &#xd;
$m$ is the number of vehicles. We report results of simulations comparing our algorithm results with ILP solutions and a greedy algorithm.</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">Master of Science (MSc)</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="layabstract" lang="en_US">The Open Multi-Depot Vehicle Routing Problem(OMDVRP) problem is solved using an synchronous distributed algorithm and the approximation ratio is found and simulation results comparing the performance of ILP , greedy and the designed algorithm is done.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">VRP, NP-Complete, Distributed</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Distributed Vehicle Routing Approximation</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>