A Large-Scale Nonlinear Mixed-Binary Goal Programming Model to Assess Candidate Locations for Solar Energy Stations: An Improved Real-Binary Differential Evolution Algorithm with a Case Study

2016 ◽  
Vol 13 (11) ◽  
pp. 7909-7921 ◽  
Author(s):  
Said Ali Hassan ElQuliti ◽  
Ali Wagdy Mohamed
2014 ◽  
Vol 1046 ◽  
pp. 367-370
Author(s):  
Yu Zhou ◽  
Yong Bin Li ◽  
Zhong Zheng Shi ◽  
Zheng Xin Li ◽  
Lei Zhang

The multistage goal programming model is popular to model the defense projects portfolio optimization problem in recent years. However, as its high-dimensional variables and large-scale solution space, the addressed model is hard to be solved in an acceptable time. To deal with this challenge, we propose an improved differential evolution algorithm which combines three novel strategies i.e. the variables clustering based evolution, the whole randomized parameters, and the child-individual based selection. The simulation results show that this algorithm has the fastest convergence and the best global searching capability in 6 test instances with different scales of solution space, compared with classical differential evolution algorithm (CDE), genetic algorithm (GA) and particle swarm optimization (PSO) algorithm.


2015 ◽  
Vol 2015 ◽  
pp. 1-13 ◽  
Author(s):  
Said Ali El-Quliti ◽  
Abdul Hamid Mohamed Ragab ◽  
Reda Abdelaal ◽  
Ali Wagdy Mohamed ◽  
Abdulfattah Suliman Mashat ◽  
...  

This paper proposes a nonlinear Goal Programming Model (GPM) for solving the problem of admission capacity planning in academic universities. Many factors of university admission capacity planning have been taken into consideration among which are number of admitted students in the past years, total population in the country, number of graduates from secondary schools, desired ratios of specific specialties, faculty-to-students ratio, and the past number of graduates. The proposed model is general and has been tested at King Abdulaziz University (KAU) in the Kingdom of Saudi Arabia, where the work aims to achieve the key objectives of a five-year development plan in addition to a 25-year future plan (AAFAQ) for universities education in the Kingdom. Based on the results of this test, the proposed GPM with a modified differential evolution algorithm has approved an ability to solve general admission capacity planning problem in terms of high quality, rapid convergence speed, efficiency, and robustness.


2020 ◽  
Vol 24 (18) ◽  
pp. 14221-14234
Author(s):  
Amir Karbassi Yazdi ◽  
Mohamad Amin Kaviani ◽  
Thomas Hanne ◽  
Andres Ramos

2016 ◽  
Vol 2016 ◽  
pp. 1-14 ◽  
Author(s):  
Said Ali El-Qulity ◽  
Ali Wagdy Mohamed

This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.


Sign in / Sign up

Export Citation Format

Share Document