Variants of the Adaptive Large Neighborhood Search for the Inventory Slack Routing Problem

Simple item page
dc.contributor.advisorHerrmann, Jeffrey
dc.contributor.authorYan, Zijie
dc.contributor.authorMontjoy, Adam
dc.date.accessioned2011-09-07T18:55:55Z
dc.date.available2011-09-07T18:55:55Z
dc.date.issued2011-09-07
dc.description.abstractThe inventory slack routing problem is a specialized vehicle routing problem that focuses on delivering waves of inventory to sites in a timely and even manner. It is difficult to find an optimal solution to this problem, thus heuristic and search techniques are necessary. This paper focuses on new variants of the Adaptive Large Neighborhood Search that incorporate new heuristics and linear programming to set delivery quantities. The search variants are tested on a set of instances to compare solution quality and computational effort.en_US
dc.identifier.urihttp://hdl.handle.net/1903/11849
dc.language.isoen_USen_US
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2011-10;
dc.subjectVehicle Routingen_US
dc.subjectAdaptive Searchen_US
dc.subjectMedication Distributionen_US
dc.subjectHomeland Securityen_US
dc.titleVariants of the Adaptive Large Neighborhood Search for the Inventory Slack Routing Problemen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_2011-10.pdf
Size:
707.51 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports