The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as...The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.展开更多
A new system of generalized nonlinear variational-like inclusions involving A- maximal m-relaxed η-accretive （so-called, （A, η）-accretive in [36]） mappings in q-uniformly smooth Banach spaces is introduced, and ...A new system of generalized nonlinear variational-like inclusions involving A- maximal m-relaxed η-accretive （so-called, （A, η）-accretive in [36]） mappings in q-uniformly smooth Banach spaces is introduced, and then, by using the resolvent operator technique associated with A-maximal m-relaxed ~/-accretive mappings due to Lan et al., the exis- tence and uniqueness of a solution to the aforementioned system is established. Applying two nearly uniformly Lipschitzian mappings 81 and 82 and using the resolvent operator technique associated with A-maximal m-relaxed ~？-accretive mappings, we shall construct a new perturbed N-step iterative algorithm with mixed errors for finding an element of the set of the fixed points of the nearly uniformly Lipschitzian mapping Q = （S1, S2） which is the unique solution of the aforesaid system. We also prove the convergence and stability of the iterative sequence generated by the suggested perturbed iterative algorithm under some suitable conditions, The results presented in this paper extend and improve some known results in the literature.展开更多
基金Project(2011BAG01B01)supported by the Key Technologies Research Development Program,ChinaProject(RCS2012ZZ002)supported by State Key Laboratory of Rail Traffic Control&Safety,China
文摘The major objective of this work was to calculate evacuation capacity and solve the optimal routing problem in a given station topology from a network optimization perspective where station facilities were modelled as open finite queueing networks with a multi-objective set of performance measures. The optimal routing problem was determined so that the number of evacuation passengers was maximized while the service level was higher than a certain criterion. An analytical technique for modelling open finite queueing networks, called the iteration generalized expansion method(IGEM), was utilized to calculate the desired outputs. A differential evolution algorithm was presented for determining the optimal routes. As demonstrated, the design methodology which combines the optimization and analytical queueing network models provides a very effective procedure for simultaneously determining the service level and the maximum number of evacuation passengers in the best evacuation routes.
文摘A new system of generalized nonlinear variational-like inclusions involving A- maximal m-relaxed η-accretive （so-called, （A, η）-accretive in [36]） mappings in q-uniformly smooth Banach spaces is introduced, and then, by using the resolvent operator technique associated with A-maximal m-relaxed ~/-accretive mappings due to Lan et al., the exis- tence and uniqueness of a solution to the aforementioned system is established. Applying two nearly uniformly Lipschitzian mappings 81 and 82 and using the resolvent operator technique associated with A-maximal m-relaxed ~？-accretive mappings, we shall construct a new perturbed N-step iterative algorithm with mixed errors for finding an element of the set of the fixed points of the nearly uniformly Lipschitzian mapping Q = （S1, S2） which is the unique solution of the aforesaid system. We also prove the convergence and stability of the iterative sequence generated by the suggested perturbed iterative algorithm under some suitable conditions, The results presented in this paper extend and improve some known results in the literature.
