2026-09-23T07:00:51Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/88233 2023-07-11 col_2142_5131 col_2142_16359 com_2142_5130 com_2142_16358 com_2142_234

Lavanya, Marla Tumuluri, Praveen 2015-09-29T20:50:26Z 2015-09-29T20:50:26Z 2017-09-30T09:15:21Z 2015-08 2015-07-24 2015-8 The vehicle routing problem with shipment pick-up and delivery with time windows (VRPPDTW) is one of the core problems that is addressed by a package delivery company in its operations. Most often, this problem has been addressed from the point of view of cost-cutting, to achieve the lowest cost possible under a given/predicted demand and service time scenario. This thesis aims to study a real-world VRPPDTW problem with side-constraints and build solutions that are cost-effective as well as robust to stochasticity in demands and service times. Even without the additional side constraints, the VRPPDTW is NP-hard. In particular, we consider the solution of VRPPDTW with side-constraints adopted by a carrier. Because of the nature as well as the size of the problem and the network, we demonstrate that the problem is combinatorially explosive. We therefore develop a large-scale neighbourhood search heuristic combined with a break-and-join heuristic and a clustering heuristic. We use this heuristic to build a set of schedules with far lower operating costs than the existing solution and effectively decrease the costs by 15% by reducing the number of routes needed to serve the shipments. We then build a framework to evaluate the performance of the solutions under stochasticity, and present results related to under stochasticity in service times. Submission published under a 24 month embargo labeled 'U of I only', the embargo will last until 2017-08-01 The student, Praveen Tumuluri, accepted the attached license on 2015-07-24 at 14:56. The student, Praveen Tumuluri, submitted this Thesis for approval on 2015-07-24 at 15:05. This Thesis was approved for publication on 2015-07-24 at 15:42. DSpace SAF Submission Ingestion Package generated from Vireo submission #8638 on 2015-09-29 at 15:01:02 Made available in DSpace on 2015-09-29T20:50:26Z (GMT). No. of bitstreams: 2 TUMULURI-THESIS-2015.pdf: 1651416 bytes, checksum: 56112d387b93a01a72fc3dda4fc77318 (MD5) LICENSE.txt: 4213 bytes, checksum: 4311ce167f6ae1ebca44ba127ea55d91 (MD5) Previous issue date: 2015-07-24 Embargo set by: Seth Robbins for item 89513 Lift date: 2017-09-29T20:50:34Z Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system U of I Only Restriction Lifted for Item 89513 on 2017-09-30T09:15:21Z. application/pdf http://hdl.handle.net/2142/88233 en Copyright 2015 Praveen Tumuluri vehicle routing large-scale neighbourhood search A large-scale neighborhood search approach to vehicle routing pick-up and delivery problem with time windows under uncertainty text text Industrial & Enterprise Systems Engineering Industrial Engineering University of Illinois at Urbana-Champaign Thesis M.S.