摘要
In order to address the problems with production planning for Model Q cars and Model X new energy cars of an automotive group, a mathematical model is proposed, which is intended for a constrained integer linear programming problem. An AI algorithm, i.e. PSO, is introduced to solve this problem, while such methods as penalty function are used to solve the constraint conditions and integer programming problem. Furthermore, in order to overcome the challenge that the standard PSO is very likely to meet a local extremum, an improved PSO is proposed, which, as shown in terms of search computing results, is more accurate and efficient than the standard PSO, thus aptly solving the integer linear programming problem.
延伸閱讀
- Abdullayev, A. K., & Aliyeva, B. M. (2018). About One Task of Mixed Integer Programming of Large Dimension and its Solving Algorithm. Scholedge International Journal of Multidisciplinary & Allied Studies, 5(7), 82-88. https://doi.org/10.19085/journal.sijmas050701
- Wen, C. F., Wu, Y. K., & Lur, Y. Y. (2009). A Recurrence Method for Simple Continuous Linear Programming Problems. 工業工程學刊, 26(2), 147-155. https://doi.org/10.29977/JCIIE.200903.0008
- Chu, C. K. (2000). Polynomial time algorithms for linear and integer programming [master's thesis, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200006269
- 曾光榮、何卓飛、劉宜欣（2009）。A Note on Optimization of a Nonlinear 0-1 Integer Program for Assigning Persons to Certain Projects。管理與系統，16(1)，123-130。https://www.airitilibrary.com/Article/Detail?DocID=10239863-200901-16-1-123-130-a
- Huang, Y. H. (2011). A Novel Logarithmic Method for Integer Programs and Its Applications [doctoral dissertation, National Chiao Tung University]. Airiti Library. https://doi.org/10.6842/NCTU.2011.00978