Solving Continuous Replenishment Inventory Routing Problems with Route Duration Bounds
| dc.contributor.author | Herrmann, Jeffrey | |
| dc.contributor.author | Fomundam, Samuel | |
| dc.date.accessioned | 2010-01-08T15:15:09Z | |
| dc.date.available | 2010-01-08T15:15:09Z | |
| dc.date.issued | 2010-01 | |
| dc.description.abstract | In 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.uri | http://hdl.handle.net/1903/9784 | |
| dc.language.iso | en_US | en_US |
| dc.relation.isAvailableAt | Institute for Systems Research | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.relation.ispartofseries | TR_2010-1; | |
| dc.subject | emergency preparedness | en_US |
| dc.subject | homeland security | en_US |
| dc.subject | inventory routing | en_US |
| dc.subject | continuous replenishment | en_US |
| dc.title | Solving Continuous Replenishment Inventory Routing Problems with Route Duration Bounds | en_US |
| dc.type | Technical Report | en_US |