Leveler is widely used to improve the quality of defective mild steel plates.Its typical ranges of the leveling capacity are constrained by three criteria,namely the maximum stroke of rollers,allowable total leveling ...Leveler is widely used to improve the quality of defective mild steel plates.Its typical ranges of the leveling capacity are constrained by three criteria,namely the maximum stroke of rollers,allowable total leveling force and motor power.In this work,an optimization model with equality and inequality constraints was built for the maximum yield stress search of each thickness of plates.The corresponding search procedure with three loops was given.The approximate range by the simplification model could be used as the initial value for the actual range search of the leveling capacity.Therefore,the search speed could be accelerated compared with a global search.The consistency of the analytical results and field data demonstrates the reliability of the proposed model and procedure.The typical ranges of the leveling capacity are expressed by several boundary curves which are helpful to judge whether the incoming plate can be leveled quickly or not.Also,these curves can be used to find the maximum yield stress for a specific thickness or the maximum thickness for a yield stress for plates.展开更多
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.展开更多
Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-lev...Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.展开更多
文摘Leveler is widely used to improve the quality of defective mild steel plates.Its typical ranges of the leveling capacity are constrained by three criteria,namely the maximum stroke of rollers,allowable total leveling force and motor power.In this work,an optimization model with equality and inequality constraints was built for the maximum yield stress search of each thickness of plates.The corresponding search procedure with three loops was given.The approximate range by the simplification model could be used as the initial value for the actual range search of the leveling capacity.Therefore,the search speed could be accelerated compared with a global search.The consistency of the analytical results and field data demonstrates the reliability of the proposed model and procedure.The typical ranges of the leveling capacity are expressed by several boundary curves which are helpful to judge whether the incoming plate can be leveled quickly or not.Also,these curves can be used to find the maximum yield stress for a specific thickness or the maximum thickness for a yield stress for plates.
基金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.
基金the National Basic Research Program (973 Program) (2002CB312200)
文摘Motivated by the projects constrained by space capacity and resource transporting time, a project scheduling probIem with capacity constraint was modeled. A hybrid algorithm is proposed, which uses the ideas of bi-level scheduling and project decomposition technology, and the genetic algorithm and tabu search is combined. Topological reordering technology is used to improve the efficiency of evaluation. Simulation results show the proposed algorithm can obtain satisfied scheduling results in acceptable time.
