Solving Continuous Replenishment Inventory Routing Problems with Route Duration Bounds

dc.contributor.authorHerrmann, Jeffrey
dc.contributor.authorFomundam, Samuel
dc.date.accessioned2010-01-08T15:15:09Z
dc.date.available2010-01-08T15:15:09Z
dc.date.issued2010-01
dc.description.abstractIn a public health emergency, resupplying points of dispensing (PODs) with the smallest number of vehicles is an important problem in mass dispensing operations. To solve this problem, this paper describes the Continuous Replenishment Inventory Routing Problem (CRIRP) and presents heuristics for finding feasible solutions when the duration of vehicle routes cannot exceed a given bound. This paper describes a special case of the CRIRP that is equivalent to the bin-packing problem. For the general problem, the paper presents an aggregation approach that combines low-demand sites that are close to one another. We discuss the results of computational tests used to assess the quality and computational effort of the heuristics and the aggregation approach.en_US
dc.identifier.urihttp://hdl.handle.net/1903/9784
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_2010-1;
dc.subjectemergency preparednessen_US
dc.subjecthomeland securityen_US
dc.subjectinventory routingen_US
dc.subjectcontinuous replenishmenten_US
dc.titleSolving Continuous Replenishment Inventory Routing Problems with Route Duration Boundsen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CRIRP.8.pdf
Size:
319.61 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description: