Ahmad Sadegheih
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Ahmad Sadegheih has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Paul R. Drake
Management School, University of Liverpool, Liverpool, UK
2 shared publications D. Li
Operations Management and e-Business Group Division, University of Liverpool, Management School
1 shared publicationS. Sribenjachot
Operations Management and e-Business Group Division, University of Liverpool, Management School
1 shared publication
Latest Publications
- Open Access
- 15 January 2012
- Published by Stellenbosch University in South African Journal of Industrial Engineering
- Vol. 21 (2)
APPLYING MIXED INTEGER PROGRAMMING FOR GREEN SUPPLY CHAIN MANAGEMENT
APPLYING MIXED INTEGER PROGRAMMING FOR GREEN SUPPLY CHAIN MANAGEMENT
- 15 January 2012
- Published by Stellenbosch University in South African Journal of Industrial Engineering
- Vol. 21 (2)
Open AccessAPPLYING MIXED INTEGER PROGRAMMING FOR GREEN SUPPLY CHAIN MANAGEMENT
APPLYING MIXED INTEGER PROGRAMMING FOR GREEN SUPPLY CHAIN MANAGEMENT
- 9 November 2011
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 25 (10) , 927-950
A NEW EXPERIMENTAL STUDY OF GENETIC ALGORITHM AND SIMULATED ANNEALING WITH BOUNDED VARIABLES
Genetic algorithms (GA) can work in very large and complex spaces, which gives them the ability to solve many complex real-world problems. The bounded variables linear programming is formulated as genetic algorithms and simulated annealing (SA). This article demonstrates that genetic algorithms and simulated annealing are much easier to implement for solving network problems compared with constructing mathematical programming formulations, because it is a very simple matter to implement a new cost function and solution constraints when using a GA and SA. Finally, the presented results show that the genetic algorithm and simulated annealing provide a good scheduling methodology to bounded variables programming.
- 9 November 2011
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 25 (10) , 927-950
A NEW EXPERIMENTAL STUDY OF GENETIC ALGORITHM AND SIMULATED ANNEALING WITH BOUNDED VARIABLES
Genetic algorithms (GA) can work in very large and complex spaces, which gives them the ability to solve many complex real-world problems. The bounded variables linear programming is formulated as genetic algorithms and simulated annealing (SA). This article demonstrates that genetic algorithms and simulated annealing are much easier to implement for solving network problems compared with constructing mathematical programming formulations, because it is a very simple matter to implement a new cost function and solution constraints when using a GA and SA. Finally, the presented results show that the genetic algorithm and simulated annealing provide a good scheduling methodology to bounded variables programming.
- 18 October 2007
- Published by Wiley in European Transactions on Electrical Power
- Vol. 19 (2) , 240-257
New formulation and analysis of the system planning expansion model
In this paper, an electrical power transmission network planning expansion is formulated for mixed‐integer programming, a genetic algorithm and tabu search (TS). Compared with other optimisation methods, GA's are suitable for traversing large search spaces since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade‐off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterised by gathering knowledge during the search, and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub‐optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions, and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus‐bar system to 18 bus‐bars. Finally, an empirical analysis of the effects of parameter values on genetic algorithm performance is tested. Copyright © 2007 John Wiley & Sons, Ltd.
- 18 October 2007
- Published by Wiley in European Transactions on Electrical Power
- Vol. 19 (2) , 240-257
New formulation and analysis of the system planning expansion model
In this paper, an electrical power transmission network planning expansion is formulated for mixed‐integer programming, a genetic algorithm and tabu search (TS). Compared with other optimisation methods, GA's are suitable for traversing large search spaces since they can do this relatively rapidly and because the use of mutation diverts the method away from local minima, which will tend to become more common as the search space increases in size. GA's give an excellent trade‐off between solution quality and computing time and flexibility for taking into account specific constraints in real situations. TS has emerged as a new, highly efficient, search paradigm for finding quality solutions to combinatorial problems. It is characterised by gathering knowledge during the search, and subsequently profiting from this knowledge. The attractiveness of the technique comes from its ability to escape local optimality. The cost function of this problem consists of the capital investment cost in discrete form, the cost of transmission losses and the power generation costs. The DC load flow equations for the network are embedded in the constraints of the mathematical model to avoid sub‐optimal solutions that can arise if the enforcement of such constraints is done in an indirect way. The solution of the model gives the best line additions, and also provides information regarding the optimal generation at each generation point. This method of solution is demonstrated on the expansion of a 10 bus‐bar system to 18 bus‐bars. Finally, an empirical analysis of the effects of parameter values on genetic algorithm performance is tested. Copyright © 2007 John Wiley & Sons, Ltd.