Study on Multi-Object Optimization of Logistics Network Based on Genetic Algorithm

Use the concept of stochastic flow network to describe transportation optimization problems upon logistic system. Select transportation reliability, transportation cost and time as objectives, build model of network flow optimization in logistic network. Take MPs as unit to build model, so model¿s complexity is decreased. Use NSGA-II algorithm to solve built model and obtain the Pareto solutions of optimization problem.

[1]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[2]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[3]  Yi-Kuei Lin,et al.  Study on the system capacity for a multicommodity stochastic-flow network with node failure , 2002, Reliab. Eng. Syst. Saf..

[4]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[5]  Yi-Kuei Lin,et al.  An algorithm to evaluate the system reliability for multicommodity case under cost constraint , 2004 .

[6]  Yi-Kuei Lin,et al.  Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case , 2003, Comput. Oper. Res..

[7]  Meng Qian,et al.  Improving efficiency of solving d-MC problem in stochastic-flow network , 2007, Reliab. Eng. Syst. Saf..

[8]  ScienceDirect.  Reliability engineering & system safety , 1988 .

[9]  Wei-Chang Yeh.  A simple approach to search for all d-MCs of a limited-flow network , 2001, Reliab. Eng. Syst. Saf..

[10]  Yi-Kuei Lin.  Evaluate the performance of a stochastic-flow network with cost attribute in terms of minimal cuts , 2006, Reliab. Eng. Syst. Saf..

[11]  Yi-Kuei Lin,et al.  Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network , 2003, Comput. Oper. Res..

[12]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[13]  Weiwe-Chang Yeh.  A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes , 2004, Reliab. Eng. Syst. Saf..

[14]  Yi-Kuei Lin,et al.  On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint , 2007, Eur. J. Oper. Res..

[15]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[16]  Yi-Kuei Lin,et al.  Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs , 2002, Reliab. Eng. Syst. Saf..

[17]  K. Kobayashi,et al.  A new algorithm in enumerating all minimal paths in a sparse network , 1999 .

[18]  Yi-Kuei Lin,et al.  Two-commodity reliability evaluation for a stochastic-flow network with node failure , 2002, Comput. Oper. Res..

[19]  Wei-Chang Yeh.  A Simple Method to Verify All d-Minimal Path Candidates of a Limited-Flow Network and its Reliability , 2002 .