scholarly journals Optimization of reactor network design problem using Jumping Gene Adaptation of Differential Evolution

2015 ◽  
Vol 622 ◽  
pp. 012044 ◽  
Author(s):  
Ashish M Gujarathi ◽  
S Purohit ◽  
B Srikanth
2016 ◽  
Vol 15 (2) ◽  
pp. 89
Author(s):  
A.M. Gujarathia ◽  
G. Vakili-Nezhaad ◽  
M. Vatani

 A modified differential evolution algorithm (MDE) has been used for solving different process related design problems (namely calculation of the NRTL and Two-Suffix Margules activity coefficient models parameters in 20 ternary extraction systems including different ionic liquids and reactor network design problem). The obtained results, in terms of root mean square deviations (rmsd) for these models are satisfactory, with the overall values of 0.0023 and 0.0170 for 169 tie-lines for NRTL and Two-Suffix Margules models, respectively. The results showed that the MDE algorithm results in better solutions compared to the previous work based on genetic algorithm (GA) for correlating liquid-liquid equilibrium (LLE) data in these systems. MDE also outperformed DE algorithm when tested on reactor network design problem with respect to convergence and speed. 


2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Ahmed Tarajo Buba ◽  
Lai Soon Lee

This paper considers an urban transit network design problem (UTNDP) that deals with construction of an efficient set of transit routes and associated service frequencies on an existing road network. The UTNDP is an NP-hard problem, characterized by a huge search space, multiobjective nature, and multiple constraints in which the evaluation of candidate route sets can be both time consuming and challenging. This paper proposes a hybrid differential evolution with particle swarm optimization (DE-PSO) algorithm to solve the UTNDP, aiming to simultaneously optimize route configuration and service frequency with specific objectives in minimizing both the passengers’ and operators’ costs. Computational experiments are conducted based on the well-known benchmark data of Mandl’s Swiss network and a large dataset of the public transport system of Rivera City, Northern Uruguay. The computational results of the proposed hybrid algorithm improve over the benchmark obtained in most of the previous studies. From the perspective of multiobjective optimization, the proposed hybrid algorithm is able to produce a diverse set of nondominated solutions, given the passengers’ and operators’ costs are conflicting objectives.


Networks ◽  
2004 ◽  
Vol 43 (4) ◽  
pp. 256-265 ◽  
Author(s):  
Vardges Melkonian ◽  
�va Tardos

1979 ◽  
Vol 13 (1) ◽  
pp. 5-17 ◽  
Author(s):  
George B. Dantzig ◽  
Roy P. Harvey ◽  
Zachary F. Lansdowne ◽  
David W. Robinson ◽  
Steven F. Maier

Sign in / Sign up

Export Citation Format

Share Document