Show simple item record

Integer Programming-Based Heuristics for Vehicle Routing Problems

dc.contributor.advisorGolden, Bruceen_US
dc.contributor.authorGulczynski, Damon Johnen_US
dc.date.accessioned2010-10-07T05:49:11Z
dc.date.available2010-10-07T05:49:11Z
dc.date.issued2010en_US
dc.identifier.urihttp://hdl.handle.net/1903/10843
dc.description.abstractThe vehicle routing problem (VRP) has been an active field of study by operations researchers for over 50 years. Many practical applications have been presented in the literature, and many solution techniques have been developed. We discuss, develop, and computationally test integer programming-based heuristics for several variants of the standard VRP. We use integer programming to model the split delivery VRP with minimum delivery amounts, the multi-depot split delivery VRP, the period VRP, the standard VRP, and the multi-depot VRP. We apply our heuristics to benchmark problems from the literature and generate many new problems with high-quality, visually-estimated solutions. Our heuristics produce high-quality solutions in a reasonable amount of computer time. Overall, our new IP-based heuristics are very competitive with the best methods found in the VRP literature to date.en_US
dc.titleInteger Programming-Based Heuristics for Vehicle Routing Problemsen_US
dc.typeDissertationen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.contributor.departmentApplied Mathematics and Scientific Computationen_US
dc.subject.pqcontrolledApplied Mathematicsen_US
dc.subject.pquncontrolledHeuristicsen_US
dc.subject.pquncontrolledInteger Programmingen_US
dc.subject.pquncontrolledOperations Researchen_US
dc.subject.pquncontrolledVehicle Routingen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record