Research on optimal procurement and transshipment scheme based on greedy algorithm and dynamic combinatorial programming

Qiao Xia; Jiaqiang Yao; Lin Qiao; Zihao Feng

doi:10.1117/12.2627110

2 March 2022 Research on optimal procurement and transshipment scheme based on greedy algorithm and dynamic combinatorial programming

Qiao Xia, Jiaqiang Yao, Lin Qiao, Zihao Feng

Author Affiliations +

Proceedings Volume 12158, International Conference on Computer Vision and Pattern Analysis (ICCPA 2021); 121580O (2022) https://doi.org/10.1117/12.2627110
Event: 2021 International Conference on Computer Vision and Pattern Analysis, 2021, Guangzhou, China

Abstract

Firstly, this paper constructs the supplier evaluation system from the three aspects of overall strength, enterprise reputation and enterprise stability, makes a quantitative analysis of the supplier enterprises, selects the entropy weight method to calculate the weight of each index, and then uses the TOPSIS method to give the supplier importance ranking. Then, the planning model is established. According to the condition that the enterprise inventory needs to meet the production conditions of two weeks at least, it is reasonable that the opening inventory is five weeks. Compared with the importance ranking of suppliers, the accuracy is 92%. Then, this paper divides the most economical into two influencing factors, namely, the storage cost and the minimum procurement cost. Then, taking this as the goal, this paper uses the greedy algorithm to solve the procurement scheme. Finally, by predicting the 24- week supply and the loss rate of the transshiper, the transshipment cost is obtained by using the greedy algorithm and the dynamic combinatorial programming algorithm, and the cost of the procurement scheme and the loss rate of the transshipment scheme are calculated.

Citation Download Citation

Qiao Xia, Jiaqiang Yao, Lin Qiao, and Zihao Feng "Research on optimal procurement and transshipment scheme based on greedy algorithm and dynamic combinatorial programming", Proc. SPIE 12158, International Conference on Computer Vision and Pattern Analysis (ICCPA 2021), 121580O (2 March 2022); https://doi.org/10.1117/12.2627110

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available