A Genetic Algorithm for the Competitive Flow-Capturing Location-Allocation Problem
碩士 === 國立交通大學 === 運輸與物流管理學系 === 105 === Nowadays, more and more people go shopping on the way home or to the working place, rather than take a special trip for shopping. However, most of studies focus on maximizing the “covered” potential shoppers (making a dedicated trip), not maximizing the “captu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2017
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/pum53a |