Jump to content

User:Hrashi: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Hrashi (talk | contribs)
categories not allowed on user pages
 
(45 intermediate revisions by 3 users not shown)
Line 1: Line 1:
{{user page}}
'''Dr. Hassan Rashidi''' obtained both his B.Sc. in Computer Engineering, 1986, as well as M.Sc. in Systems Engineering and Planning, 1989, from [http://www.iut.ac.ir Isfahan University of Technology] with the highest honours. From 1990 to 1991, he was a Lecturer and Director of Computer Centre, [http://www.shahed.ac.ir Shahed University], Tehran, Iran. He was a Lecturer in [http://www.imps.ac.ir Institute for Research and Planning], Tehran, Iran, from 1992 to 2002. He joined the Department of Computer Science, [http://www.essex.ac.uk University of Essex], UK, as a PhD student from October 2002. He works on the Autoport project. He submitted his thesis in September 2005 and obtained his PhD on 26 April 2006.
'''Dr. Hassan Rashidi''' obtained both his B.Sc. in Computer Engineering, 1986, as well as M.Sc. in Systems Engineering and Planning, 1989, from [http://www.iut.ac.ir Isfahan University of Technology] with the highest honours. From 1990 to 1991, he was a Lecturer and Director of Computer Centre, [http://www.shahed.ac.ir Shahed University], Tehran, Iran. He was a Lecturer in [http://www.imps.ac.ir Institute for Research and Planning], Tehran, Iran, from 1992 to 2002. He joined the Department of Computer Science, [http://www.essex.ac.uk University of Essex], UK, as a PhD student from October 2002. He worked on the Autoport project. He submitted his thesis in September 2005 and obtained his PhD on 26 April 2006.


He is also the founder of NSA+ [http://www.sciencedirect.com/science/article/pii/S0898122110009144 (the Extended Network Simplex Algorithm), DNSA (Dynamic Network Simplex) and DNSA (Dynamic Network Simplex Plus)]
He is also the founder of '''NSA+''' [http://www.sciencedirect.com/science/article/pii/S0898122110009144 (the Extended Network Simplex Algorithm)], '''DNSA''' (Dynamic Network Simplex Algorithm) and '''DNSA+''' (Dynamic Network Simplex Plus Algorithm)- The state-of-the-art algorithms to solve the minimum cost flow problem in both static and dynamic aspects.

His PhD research was in scheduling, with focus on port automation (Supervised by [[Edward Tsang | '''Professor Edward Tsang''']]). The Dynamic Scheduling System that he has built extends the [http://www.sciencedirect.com/science/article/pii/S0898122110009144 Network Simplex Method] and is capable of solving problems to optimality with ten million variables within 2 minutes [http://csp.bracil.net/people/HassanRashidi.html (See His Major Publication)]. Meanwhile, he is a member of Reactive Search Group over the World, the professional people to solving hard optimization problems, both in the discrete and continuous domain.


Now he is a [http://csp.bracil.net/people/HassanRashidi.html Visiting Academic], a member of the Constraint Satisfaction and Robotics Research Groups at University of Essex, UK, and Associate Professor at [http://www.atu.ac.ir Allameh Tabataba'i University], Iran.
Now he is a [http://csp.bracil.net/people/HassanRashidi.html Visiting Academic], a member of the Constraint Satisfaction and Robotics Research Groups at University of Essex, UK, and Associate Professor at [http://www.atu.ac.ir Allameh Tabataba'i University], Iran.

His current interest is in scheduling, with focus on port automation. The Dynamic Scheduling System that he has built extends the [http://www.sciencedirect.com/science/article/pii/S0898122110009144 Network Simplex Method] and is capable of solving problems to optimality with ten million variables within 2 minutes [http://csp.bracil.net/people/HassanRashidi.html (See His Major Publication)]. Meanwhile, he is a member of Reactive Search Group over the World, the professional people to solving hard optimization problems, both in the discrete and continuous domain.


== Affiliations ==
== Affiliations ==
* [http://mcs.atu.ac.ir/fa/contents/asatid/rayaneh/%DA%AF%D8%B1%D9%88%D9%87.%D8%B1%D8%A7%DB%8C%D8%A7%D9%86%D9%87.html Allameh Tabataba'i University, Department of Mathematics and Computer Science, Tehran, Iran]
* [http://mcs.atu.ac.ir/fa/contents/asatid/rayaneh/%DA%AF%D8%B1%D9%88%D9%87.%D8%B1%D8%A7%DB%8C%D8%A7%D9%86%D9%87.html Department of Mathematics and Computer Science, Allameh Tabataba'i University, Tehran, Iran]
* [http://qiau.ac.ir/rashidi.info Islamic Azad University, Department of Computer Engineering, Qazvin Branch, Iran]
* [http://qiau.ac.ir/rashidi.info Department of Computer Engineering, Islamic Azad University, Qazvin Branch, Iran]
* [http://csp.bracil.net/people/HassanRashidi.html Visiting Academic at University of Essex, School of Computer Science and Electronic System Engineering UK]
* [http://csp.bracil.net/people/HassanRashidi.html Visiting Academic in School of Computer Science and Electronic System Engineering, University of Essex,UK]

{{Uncategorized|date=April 2014}}

[[Category:Hassan Rashidi]]

Latest revision as of 22:06, 4 April 2014

Dr. Hassan Rashidi obtained both his B.Sc. in Computer Engineering, 1986, as well as M.Sc. in Systems Engineering and Planning, 1989, from Isfahan University of Technology with the highest honours. From 1990 to 1991, he was a Lecturer and Director of Computer Centre, Shahed University, Tehran, Iran. He was a Lecturer in Institute for Research and Planning, Tehran, Iran, from 1992 to 2002. He joined the Department of Computer Science, University of Essex, UK, as a PhD student from October 2002. He worked on the Autoport project. He submitted his thesis in September 2005 and obtained his PhD on 26 April 2006.

He is also the founder of NSA+ (the Extended Network Simplex Algorithm), DNSA (Dynamic Network Simplex Algorithm) and DNSA+ (Dynamic Network Simplex Plus Algorithm)- The state-of-the-art algorithms to solve the minimum cost flow problem in both static and dynamic aspects.

His PhD research was in scheduling, with focus on port automation (Supervised by Professor Edward Tsang). The Dynamic Scheduling System that he has built extends the Network Simplex Method and is capable of solving problems to optimality with ten million variables within 2 minutes (See His Major Publication). Meanwhile, he is a member of Reactive Search Group over the World, the professional people to solving hard optimization problems, both in the discrete and continuous domain.

Now he is a Visiting Academic, a member of the Constraint Satisfaction and Robotics Research Groups at University of Essex, UK, and Associate Professor at Allameh Tabataba'i University, Iran.

Affiliations

[edit]