其他| 1. | 零售市場雜誌社(1998)。九八年臺灣地區超市、大型店成長報名。 延伸查詢 |
| 2. | 零售市場雜誌社(1999)。八十七年度CVS成長報告。 延伸查詢 |
| 3. | 李宗儒、翁基華(199703)。配銷系統之車輛途程問題於農業運銷的應用－以規劃農會超市宅配送為例。 延伸查詢 |
| 4. | 潘順興、陳振明、陳稼興(1997)。遺傳演算法於配送點選擇之應用。 延伸查詢 |
| 5. | C. Malandraki(1989)。Time Dependent Vehicle Routing Problem: Formulation, Solution Algorithm and Computation Experiments。  |
| 6. | J. V. W. Russ and V. S. Nikolaos(1996)。An Exact Solution Approach for the Time Dependent Trave1ingSa1esman Problem。 |
| 7. | C. Malandraki and R.B. Dial(1996)。A Restricted Dynamic Programming Heuristic Algorithm for the Time Dependent Traveling Salesman Problem。 |
| 8. | C. Malandraki and M. S. Daskin(1992)。Time Dependent Vehicle Routing Problem: Formulation, Properties and Heuristic algorithms。 |
| 9. | B. H. Ahn and J.Y. Shin(1991)。Vehicle-routing with Time Windows and Time-varying Congestion。 |
| 10. | E. L. Lawler et al(1985)。The Traveling Salesman Problem-A Guide Tour of Combinatorial Optimization。 |
| 11. | E. D. Stuart and M. L. Averill(1977)。The Art and Theory of Dynamic Programming。 |
| 12. | N. Christofides, A. Mingozzi and P. Toth(1981)。State Space Relaxation for the Computation of Bounds to Routing Problems。 |
| 13. | A. Langevin, M. Dersorchers, J. Desorsiers, E. Gelinas and F. Soumis(1993)。A Two-Commodity Flow Formulation for the Traveling Salesman and the Makespan Problems with Time Windows。 |