Analysis on Catering Distribution Based on Ant Colony Algorithm
Lejian Zhang, Zongxiang Huang, Yide Ge
Available Online March 2017.
- https://doi.org/10.2991/ifmca-16.2017.127How to use a DOI?
- Catering distribution; Ant colony algorithm; MATLAB emulation; Improvement
- This paper conducts an analysis on feasibility of catering distribution based on ant colony algorithm and mainly sets initial parameters for relative programs, such as ant colony scale (number of ants) m, information element significance factor , heuristic function significance factor , information element volatilization factor , total information element releasing quantity Q, the maximum number of iterations, initial value of number of iterations. Based on the aforesaid, it establishes an emulation model based on customer satisfaction for the purpose of maximizing customer satisfaction and minimizing transportation cost and it applies MATLAB emulation to check and calculate distribution path. Result shows that adoption of ant colony algorithm will assist with reasonable distribution of transport capacity of restaurants and increase their profitability.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Lejian Zhang AU - Zongxiang Huang AU - Yide Ge PY - 2017/03 DA - 2017/03 TI - Analysis on Catering Distribution Based on Ant Colony Algorithm BT - Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016) PB - Atlantis Press SP - 815 EP - 818 SN - 2352-5401 UR - https://doi.org/10.2991/ifmca-16.2017.127 DO - https://doi.org/10.2991/ifmca-16.2017.127 ID - Zhang2017/03 ER -