Yanfeng Ouyang1, Carlos F. Daganzo1
1Institute of Transportation Studies and Department of Civil and Environmental Engineering, University of California, Berkeley, California 94720
Tóm tắt
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.
