A. Babazadeh - Academia.edu (original) (raw)
Uploads
Papers by A. Babazadeh
Journal of Marine Science and Technology, 2010
The optimal usage of berths plays a key role in raising the efficiency of container terminals. Th... more The optimal usage of berths plays a key role in raising the efficiency of container terminals. The berth allocation problem in a container terminal is defined as the feasible allocation of berths to incoming ships such that the total time that elapses between the arrival of the ships to their exit from their berths is minimized. In the transportation literature, the latter problem is usually formulated as a mixed integer programming model. Optimization methods, like the branch and bound algorithm, are efficient ways to solve this model but become absolutely unusable when the size of the problem increases. An advanced search method such as GA may be suited to such a situation. In this paper, a genetic-based algorithm is proposed for the problem. Computational results for two test problems (a small and a large-sized problem) are also presented. The results from the small test are also compared with the results obtained from the branch and bound algorithm.
The 31st IEEE International Conference on Plasma Science, 2004. ICOPS 2004. IEEE Conference Record - Abstracts., 2004
Summary form only given. We have studied the relation between the spark-gap operation parameters ... more Summary form only given. We have studied the relation between the spark-gap operation parameters and the plasma pinch and neutron yield in our Filippov-type plasma focus, Dena, with 90 kJ energy storage bank (25 kV, 0.288 mF). It has been found that better pinches with regard to their neutron yield, generally are associated with a faster breakdown in the triggerable
Journal of Marine Science and Technology, 2010
The optimal usage of berths plays a key role in raising the efficiency of container terminals. Th... more The optimal usage of berths plays a key role in raising the efficiency of container terminals. The berth allocation problem in a container terminal is defined as the feasible allocation of berths to incoming ships such that the total time that elapses between the arrival of the ships to their exit from their berths is minimized. In the transportation literature, the latter problem is usually formulated as a mixed integer programming model. Optimization methods, like the branch and bound algorithm, are efficient ways to solve this model but become absolutely unusable when the size of the problem increases. An advanced search method such as GA may be suited to such a situation. In this paper, a genetic-based algorithm is proposed for the problem. Computational results for two test problems (a small and a large-sized problem) are also presented. The results from the small test are also compared with the results obtained from the branch and bound algorithm.
The 31st IEEE International Conference on Plasma Science, 2004. ICOPS 2004. IEEE Conference Record - Abstracts., 2004
Summary form only given. We have studied the relation between the spark-gap operation parameters ... more Summary form only given. We have studied the relation between the spark-gap operation parameters and the plasma pinch and neutron yield in our Filippov-type plasma focus, Dena, with 90 kJ energy storage bank (25 kV, 0.288 mF). It has been found that better pinches with regard to their neutron yield, generally are associated with a faster breakdown in the triggerable