Article ID: | iaor20073018 |
Country: | United States |
Volume: | 40 |
Issue: | 1 |
Start Page Number: | 89 |
End Page Number: | 98 |
Publication Date: | Feb 2006 |
Journal: | Transportation Science |
Authors: | Daganzo Carlos F., Ouyang Yanfeng |
Keywords: | distribution, location |
This paper proposes an algorithm that automatically translates the ‘continuum approximation’ (CA) recipes for location problems into discrete designs. It applies to terminal systems, but can also be used for other logistics problems. The study also systematically compares the logistics costs predicted by the CA approach with the actual costs for discrete designs obtained with the automated procedure. The predictions are quite accurate. The paper also gives conditions under which the discrete solution has a small optimality gap.