An algorithm for the supply chain networks with random demands

研究成果: 會議貢獻類型會議論文同行評審

摘要

The supply chain network equilibrium problem with random demands (SCNE-R) was recently formulated using the variational inequality (VI) approach and solved with the modified projection method (Dong et al., 2004a; 2004b). The significance of the problem stems from the fact that retailers may not know the demands for a product with certainty but may, nevertheless, possess some information such as the density function based on historical or forecasted data. By relaxing the assumption of fixed demands at the level of retailers, real situations can be better approximated. In this paper, the SCNE-R problem is revisited by formulating a "simpler" VI model and proposing a two loop algorithm. The first loop deals with a fixed demand traffic assignment problem. The second loop computes the product price and, hence, product demands based on a prespecified probability distribution function. A numerical example is provided for demonstration and a few remarks conclude the paper.

原文???core.languages.en_GB???
頁面4858-4870
頁數13
出版狀態已出版 - 2006
事件36th International Conference on Computers and Industrial Engineering, ICC and IE 2006 - Taipei, Taiwan
持續時間: 20 6月 200623 6月 2006

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???36th International Conference on Computers and Industrial Engineering, ICC and IE 2006
國家/地區Taiwan
城市Taipei
期間20/06/0623/06/06

指紋

深入研究「An algorithm for the supply chain networks with random demands」主題。共同形成了獨特的指紋。

引用此