| Summary: | 碩士 === 嶺東科技大學 === 資訊科技應用研究所 === 96 === Because of the development of Internet, the shopping in the network’s platform and quickly acquiring the purchased goods are an essential consumption behavior. Furthermore, based on large-scale economy, many multiple stores, which goods are uniformly management and distribution, are rapidly established. To possess quick and effective dispatching goods is not only satisfied with the demand for customers and improving the quality of the service, but also decreasing the capitalized cost. This work will address the optimal routes for all the multiple stores, i.e., search the least dispatching cost for the given objective spots. First, the objective points are divided into distinct clusters and isolated points by fuzzy C-Means clustering method. By a fitness function associated with distance, we use the GA for the optimal outer route of the clusters and isolated points, and for the optimal inner routes of all the individual cluster. Finally, combining the outer route with the all-inner routes forms the entire optimal route. The experiment examples will illustrate the validity and effectiveness.
|
|---|
