MAX-MIN螞蟻演算法於配送中心選址之研究

The Study of Distribution Center Location Selection Based on MAX-MIN Ant Algorithm

徐嘉吟(Chia-Yin Shih) ； 黃士滔(Shih-Tao Huang)

《品質學報》 17卷1期 (2010/02) Pp. 89-97

摘要

由於連鎖商店的蓬勃發展，使得顧客對於商品運送服務的要求更爲重視，也由於電子商務的興起，物流業者面臨了極大的衝擊與挑戰，爲有效提升經營績效與降低系統總成本，因此配送中心的選址是物流產業系統成功的關鍵，而配送中心選址與配送路徑的規劃對於顧客的滿意度以及經營的總成本均有相當大的影響。
本研究以配送中心選址爲例，將各個配送點的位置設爲已知，編寫成數學模式來求解，在求解的過程中使用MATLAB 7.0的軟體編寫模擬程式，使用相較於傳統的蟻群演算法有更高穩定性的MAX-MIN螞蟻演算法，並使用費洛蒙自動調整更新概念，根據配送總成本最低原則對各已知配送點與候選配送中心進行模擬，選擇出適合的配送中心，研究結果顯示此模式相較於傳統蟻群演算法更適用於較大規模與複雜的配送中心選址問題。

關鍵字

MAX-MIN螞蟻演算法 ； 最佳化 ； 配送中心

並列摘要

Since chain store is prosperously developed, customers have higher requirements for merchandise delivery service. With emerging of e-commerce, logistics providers face unprecedented challenges. To effectively increase operational performance and decrease total system cost, selection of distribution center location plays a key role of successful logistics industry system. However selection of distribution center location and delivery routes planning exert considerable influence on customer satisfaction and total operational cost.
This article takes selection of distribution center location as example to assume that destinations are given and solves the mathematical model with MATLAB 7.0. By utilizing MATLAB 7.0 to compile simulation formula and use a refined MAX-MIN ant algorithm which is more stable than traditional Ant Colony System (ACS) to select the appropriate location with the pheromone update concept and lowest delivery cost principle for optimization. The result shows that the refined MAX-MIN ant algorithm which is suitable for selective problems for larger and more complex distribution center location than traditional method.

並列關鍵字

MAX-MIN ant algorithm ； optimization ； distribution center DC

參考文獻

Bullnheimer, B.,Hartl, R. F.,Strauss, C.(1997).Applying the ant system to the vehicle routing problem.Proceedings of the 2nd Metaheuristic International Conference.(Proceedings of the 2nd Metaheuristic International Conference).

Caro, G. D.,Dorigo, M.(1998).Two ant colony algorithms for best-effort routing in datagram networks.Proceedings of the 10th International Conference on Parallel and Distributed Computing and Systems.(Proceedings of the 10th International Conference on Parallel and Distributed Computing and Systems).

Chu, S. C.,Roddick, J. F.,Pan, J. S.(2004).Ant Colony system with communication strategies.Information Sciences.167(1-4),63-76.

Dorigo, M.,Maniezzo, V.,Colorni, A.(1991).Department of Electronics.Italy:Politecnico di Milano.

Dorigo, M.,Maniezzo, V.,Colorni, A.(1996).Ant system: Optimization by a colony of cooperating agents.IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics.26(1),29-41.