Please use this identifier to cite or link to this item:
|Title:||A chance-constrained programming of fourth-party logistics routing problem with fuzzy duration time||Authors:||Cui, Y.
Fourth party logistics routing problem
Fuzzy duration time
K th shortest path algorithm
|Issue Date:||2009||Citation:||Cui, Y., Huang, M., Wang, X.W., Lee, L.H. (2009). A chance-constrained programming of fourth-party logistics routing problem with fuzzy duration time. IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management : 360-364. ScholarBank@NUS Repository. https://doi.org/10.1109/IEEM.2009.5373336||Abstract:||In the last ten years, Fourth Party Logistics (4PL) has been attracting more and more attention in many relative fields. In this paper, a 4PL Routing Problem (4PLPR) with fuzzy duration time is presented where the fuzzy numbers are used to describe the uncertainty of the duration time. After the description of 4PLRP, a chance-constrained programming for it is established according to the credibility theory. And a crisp equivalent is derived when fuzzy variables are characterized by triangular fuzzy numbers. Then genetic algorithm embedded K th shortest path algorithm with special initialization is designed. Finally, an extensive computational analysis is presented and the numerical results show that which route should be selected in order to get minimum cost in the due date. ©2009 IEEE.||Source Title:||IEEM 2009 - IEEE International Conference on Industrial Engineering and Engineering Management||URI:||http://scholarbank.nus.edu.sg/handle/10635/72229||ISBN:||9781424448708||DOI:||10.1109/IEEM.2009.5373336|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 23, 2020
WEB OF SCIENCETM
checked on Sep 16, 2020
checked on Sep 21, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.