Application of the parallel adaptive genetic simulated annealing algorithm for the synthesis of heat exchanger networks
ABSTRACT A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed. The proposed hybrid approach constructs an efficient genetic simulated annealing algorithm for global search, whereas the iterative hi...
Saved in:
| Published in: | Asia-Pacific journal of chemical engineering Vol. 7; no. 5; pp. 660 - 669 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Chichester, UK
John Wiley & Sons, Ltd
01.09.2012
|
| Subjects: | |
| ISSN: | 1932-2135, 1932-2143 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | ABSTRACT
A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed. The proposed hybrid approach constructs an efficient genetic simulated annealing algorithm for global search, whereas the iterative hill climbing method as a local search technique is incorporated into genetic simulated annealing loop to speed up the convergence of the algorithm. To efficiently locate quality solutions to complex nonconvex MINLP problems, a self‐adaptive scheme is developed in the parallel adaptive genetic simulated annealing to maintain a better tradeoff between the global and local search, which can improve the convergence speed and computational efficiency compared with some other hybrid genetic algorithm methods. For the evaluations, we use some well‐known standard benchmark functions. The computational results demonstrate the effectiveness and robustness of the present approach. Further, the proposed algorithm is tailored to find optimum solution to heat exchanger network synthesis problem. The results presented prove that the proposed method is a very efficient global optimization tool for large dimensional, nonconvex MINLP problems. © 2012 Curtin University of Technology and John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed. The proposed hybrid approach constructs an efficient genetic simulated annealing algorithm for global search, whereas the iterative hill climbing method as a local search technique is incorporated into genetic simulated annealing loop to speed up the convergence of the algorithm. To efficiently locate quality solutions to complex nonconvex MINLP problems, a self‐adaptive scheme is developed in the parallel adaptive genetic simulated annealing to maintain a better tradeoff between the global and local search, which can improve the convergence speed and computational efficiency compared with some other hybrid genetic algorithm methods. For the evaluations, we use some well‐known standard benchmark functions. The computational results demonstrate the effectiveness and robustness of the present approach. Further, the proposed algorithm is tailored to find optimum solution to heat exchanger network synthesis problem. The results presented prove that the proposed method is a very efficient global optimization tool for large dimensional, nonconvex MINLP problems. © 2012 Curtin University of Technology and John Wiley & Sons, Ltd. ABSTRACT A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed. The proposed hybrid approach constructs an efficient genetic simulated annealing algorithm for global search, whereas the iterative hill climbing method as a local search technique is incorporated into genetic simulated annealing loop to speed up the convergence of the algorithm. To efficiently locate quality solutions to complex nonconvex MINLP problems, a self‐adaptive scheme is developed in the parallel adaptive genetic simulated annealing to maintain a better tradeoff between the global and local search, which can improve the convergence speed and computational efficiency compared with some other hybrid genetic algorithm methods. For the evaluations, we use some well‐known standard benchmark functions. The computational results demonstrate the effectiveness and robustness of the present approach. Further, the proposed algorithm is tailored to find optimum solution to heat exchanger network synthesis problem. The results presented prove that the proposed method is a very efficient global optimization tool for large dimensional, nonconvex MINLP problems. © 2012 Curtin University of Technology and John Wiley & Sons, Ltd. |
| Author | An, Aimin Xu, Qiaoling Zhao, Chao |
| Author_xml | – sequence: 1 givenname: Chao surname: Zhao fullname: Zhao, Chao organization: College of Chemistry and Chemical Engineering, Fuzhou University, Fuzhou 350108, China – sequence: 2 givenname: Qiaoling surname: Xu fullname: Xu, Qiaoling organization: College of Chemistry and Chemical Engineering, Fuzhou University, Fuzhou 350108, China – sequence: 3 givenname: Aimin surname: An fullname: An, Aimin organization: School of Electrical Engineering and Information Engineering, Lanzhou University of Technology, Lanzhou, Gansu 730050, China |
| BookMark | eNp1kElLBDEUhIMouII_IUcvM2brxePgMipuiKK38Dr9eiaaSTdJdJx_b4-KoOip6vBV8V5tklXfeiRkl7MhZ0zsQ_c05LkQK2SDH0gxEFzJ1W8vs3WyGeMTY5kSudog81HXOWsg2dbTtqFpirSDAM6ho1BDl-wr0gl6TNbQaGcvDhLWFLxHcNZPKLhJG2yazmjTho98XPheoo3LwilCovhmpuAnGGjfM2_Dc9wmaw24iDtfukXuT47vDk8HF9fjs8PRxcBI1l9cZawqpVGqrLO6AmUyCZnMC1EVoEqGJcsLY6qqygQ22LAKlWKciyI_4DmUtdwiw89eE9oYAzba2PTxbQpgneZML2fT_Wx6OVsf2PsV6IKdQVj8hQ4-0bl1uPiX06Ob85-8jQnfvnkIzzovZJHph6uxPjp5vBrfXd7qQr4DY0KQAw |
| CitedBy_id | crossref_primary_10_1016_j_energy_2018_08_129 crossref_primary_10_1515_revce_2017_0046 |
| Cites_doi | 10.1016/S0098-1354(98)00221-X 10.1016/j.jelechem.2003.11.060 10.1007/BF00934810 10.1016/j.compchemeng.2003.11.006 10.1016/j.parco.2005.03.006 10.1061/(ASCE)0733-9496(2005)131:1(14) 10.1016/S0098-1354(01)00681-0 10.1016/j.compchemeng.2007.10.005 10.1016/0098-1354(90)85010-8 10.1007/BF02592064 10.1016/S0098-1354(00)00601-3 10.1016/j.compchemeng.2004.07.002 10.1016/j.compchemeng.2003.10.004 10.1109/CEC.2004.1330872 10.1016/0098-1354(95)87027-X 10.1016/0305-0548(94)90024-8 10.1016/S0965-9978(02)00125-4 10.1016/S0098-1354(98)00254-3 |
| ContentType | Journal Article |
| Copyright | 2012 Curtin University of Technology and John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: 2012 Curtin University of Technology and John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION |
| DOI | 10.1002/apj.1622 |
| DatabaseName | Istex CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1932-2143 |
| EndPage | 669 |
| ExternalDocumentID | 10_1002_apj_1622 APJ1622 ark_67375_WNG_DFXNGTMR_7 |
| Genre | article |
| GroupedDBID | .3N .GA 05W 0R~ 1L6 1OC 23N 31~ 33P 3SF 4.4 50Y 50Z 52M 52O 52T 52U 52W 5GY 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCUV ABIJN ABJNI ABPVW ACAHQ ACBWZ ACCZN ACGFO ACGFS ACPOU ACRPL ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEFGJ AEIGN AEIMD AENEX AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AGHNM AGQPQ AGXDD AGYGG AHBTC AIDQK AIDYY AITYG AIURR AJXKR ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BMXJE BNHUX BROTX BRXPI BSCLL CS3 D-E D-F DCZOG DPXWK DRFUL DRSTM EBS EJD F00 F01 F04 F21 FEDTE G-S G.N GODZA H.T H.X HF~ HGLYW HVGLF HZ~ I-F JPC LATKE LAW LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM MY. N04 N05 NF~ O66 O9- OIG P2W P2X P4D Q.N QB0 R.K ROL RX1 SUPJJ TUS UB1 W8V W99 WBFHL WBKPD WIH WIK WOHZO WXSBR WYISQ XV2 ZZTAW ~IA ~WT AAYXX CITATION O8X |
| ID | FETCH-LOGICAL-c3032-b50b83c448d5dba4c53a53672b7a480e8067ccbbb52efef0be44011276916a8d3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 3 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000309459200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1932-2135 |
| IngestDate | Tue Nov 18 22:11:14 EST 2025 Sat Nov 29 08:09:22 EST 2025 Wed Aug 20 07:24:21 EDT 2025 Sun Sep 21 06:17:44 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3032-b50b83c448d5dba4c53a53672b7a480e8067ccbbb52efef0be44011276916a8d3 |
| Notes | ArticleID:APJ1622 istex:D5819858E805D857757BF5494541BFA557A7627E ark:/67375/WNG-DFXNGTMR-7 |
| PageCount | 10 |
| ParticipantIDs | crossref_citationtrail_10_1002_apj_1622 crossref_primary_10_1002_apj_1622 wiley_primary_10_1002_apj_1622_APJ1622 istex_primary_ark_67375_WNG_DFXNGTMR_7 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-09 September/October 2012 2012-09-00 |
| PublicationDateYYYYMMDD | 2012-09-01 |
| PublicationDate_xml | – month: 09 year: 2012 text: 2012-09 |
| PublicationDecade | 2010 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Asia-Pacific journal of chemical engineering |
| PublicationTitleAlternate | Asia-Pac. J. Chem. Eng |
| PublicationYear | 2012 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | R. Lewein, H. Wang, O. Shalev. Comput. Chem. Eng., 1998; 22, 1387-1405. K.M. Yerramsetty, C.V. Murty. Comput. Chem. Eng., 2008; 32, 1861-1878. G.F. Wei, P.J. Yao, X. Luo. Chinese J. Chem. Eng., 2004; 12(1), 66-77. R. Lewein, H. Wang, O. Shalev. AIChE. J., 1998; 22(10), 1503-1513. S. Katare, A. Bhan, J.M. Caruthers. Comput. Chem. Eng., 2004; 28, 2569-2581. H. Yu, H. Fang, P.J. Yao. Comput. Chem. Eng., 2000; 24, 2023-2035. I.E. Grossmann, L.T. Biegler. Comput. Chem. Eng., 2004; 28, 1193-1218. A.M. Geoffrion. J. Optimiz. Theory. App., 1971; 10, 237-260. K.F. Wang, Y. Qian, Y. Yuan. Comput. Chem. Eng., 1998; 22, 125-136. F. Eapinoza, B. Minsker, D.E. Goldberg. J. Water. Res. PL-ASCE., 2005; 131, 14-24. B. Linnhoff, J.R. Flower. Comput. Chem. Eng., 1978; 21(1), 633-654. E.S. Fraga, A. Zillinskas. Adv. Eng. Softw., 2008; 34, 73-86. G.P. Kasprzyk, M. Jaskula. J. Electroanal. Chem., 2004; 567, 39-66. B. Lin, D.C. Miller. Comput. Chem. Eng., 2004; 28, 1451-1464. I.E. Grossmann, M.A. Duran. Math. Program., 1986; 36, 307-323. Z. Michalewicz. Genetic Algorithm + Data Structure = Evolution Programmes, Third edition edn, Springer, Berlin, 1996. K.C. Furman, N.V. Sahinidis. Comput. Chem. Eng., 2001; 25, 1371-1390. B. Borchers, J.E. Mitchell. Comput. Oper. Res., 1994; 21, 359-367. T. Westerlund, F. Pettersson. Comput. Chem. Eng., 1995; 19, S131C-S136. Z.G. Wang, M. Rahman, Y.S. Wong. Parallel. Comput., 2005; 31, 839-857. R. Chelouah, P. Siarry. Eur. J. Oper. Res., 2003; 159, 636-654. T.F. Yee, I.E. Grossmann, Z. Kravanja. Comput. Chem. Eng., 1990; 4, 1165-1184. 2000;; 24 1986;; 36 2004;; 12 2003;; 159 1994;; 21 1978;; 21 1995;; 19 2008;; 34 1998;; 22 1996 1990;; 4 2008;; 32 2004;; 28 2004 1971;; 10 2005;; 31 2001;; 25 2005;; 131 2004;; 567 e_1_2_10_23_1 e_1_2_10_9_1 e_1_2_10_13_1 e_1_2_10_24_1 Westerlund T. (e_1_2_10_6_1) 1995; 19 e_1_2_10_10_1 e_1_2_10_11_1 e_1_2_10_20_1 Michalewicz Z. (e_1_2_10_12_1) 1996 Linnhoff B. (e_1_2_10_21_1) 1978; 21 Wei G.F. (e_1_2_10_19_1) 2004; 12 Lewein R. (e_1_2_10_22_1) 1998; 22 e_1_2_10_2_1 e_1_2_10_4_1 Chelouah R. (e_1_2_10_16_1) 2003; 159 e_1_2_10_18_1 e_1_2_10_3_1 e_1_2_10_5_1 e_1_2_10_17_1 e_1_2_10_8_1 e_1_2_10_14_1 e_1_2_10_7_1 e_1_2_10_15_1 |
| References_xml | – reference: F. Eapinoza, B. Minsker, D.E. Goldberg. J. Water. Res. PL-ASCE., 2005; 131, 14-24. – reference: R. Lewein, H. Wang, O. Shalev. Comput. Chem. Eng., 1998; 22, 1387-1405. – reference: G.P. Kasprzyk, M. Jaskula. J. Electroanal. Chem., 2004; 567, 39-66. – reference: H. Yu, H. Fang, P.J. Yao. Comput. Chem. Eng., 2000; 24, 2023-2035. – reference: Z.G. Wang, M. Rahman, Y.S. Wong. Parallel. Comput., 2005; 31, 839-857. – reference: R. Chelouah, P. Siarry. Eur. J. Oper. Res., 2003; 159, 636-654. – reference: A.M. Geoffrion. J. Optimiz. Theory. App., 1971; 10, 237-260. – reference: G.F. Wei, P.J. Yao, X. Luo. Chinese J. Chem. Eng., 2004; 12(1), 66-77. – reference: E.S. Fraga, A. Zillinskas. Adv. Eng. Softw., 2008; 34, 73-86. – reference: T. Westerlund, F. Pettersson. Comput. Chem. Eng., 1995; 19, S131C-S136. – reference: S. Katare, A. Bhan, J.M. Caruthers. Comput. Chem. Eng., 2004; 28, 2569-2581. – reference: I.E. Grossmann, M.A. Duran. Math. Program., 1986; 36, 307-323. – reference: K.F. Wang, Y. Qian, Y. Yuan. Comput. Chem. Eng., 1998; 22, 125-136. – reference: K.C. Furman, N.V. Sahinidis. Comput. Chem. Eng., 2001; 25, 1371-1390. – reference: K.M. Yerramsetty, C.V. Murty. Comput. Chem. Eng., 2008; 32, 1861-1878. – reference: R. Lewein, H. Wang, O. Shalev. AIChE. J., 1998; 22(10), 1503-1513. – reference: I.E. Grossmann, L.T. Biegler. Comput. Chem. Eng., 2004; 28, 1193-1218. – reference: B. Borchers, J.E. Mitchell. Comput. Oper. Res., 1994; 21, 359-367. – reference: Z. Michalewicz. Genetic Algorithm + Data Structure = Evolution Programmes, Third edition edn, Springer, Berlin, 1996. – reference: T.F. Yee, I.E. Grossmann, Z. Kravanja. Comput. Chem. Eng., 1990; 4, 1165-1184. – reference: B. Lin, D.C. Miller. Comput. Chem. Eng., 2004; 28, 1451-1464. – reference: B. Linnhoff, J.R. Flower. Comput. Chem. Eng., 1978; 21(1), 633-654. – volume: 31 start-page: 839 year: 2005; end-page: 857 publication-title: Parallel. Comput. – volume: 34 start-page: 73 year: 2008; end-page: 86 publication-title: Adv. Eng. Softw. – volume: 19 start-page: S131C year: 1995; end-page: S136 publication-title: Comput. Chem. Eng. – volume: 159 start-page: 636 year: 2003; end-page: 654 publication-title: Eur. J. Oper. Res. – volume: 4 start-page: 1165 year: 1990; end-page: 1184 publication-title: Comput. Chem. Eng. – volume: 24 start-page: 2023 year: 2000; end-page: 2035 publication-title: Comput. Chem. Eng. – volume: 28 start-page: 1451 year: 2004; end-page: 1464 publication-title: Comput. Chem. Eng. – volume: 28 start-page: 2569 year: 2004; end-page: 2581 publication-title: Comput. Chem. Eng. – volume: 12 start-page: 66 issue: 1 year: 2004; end-page: 77 publication-title: Chinese J. Chem. Eng. – volume: 36 start-page: 307 year: 1986; end-page: 323 publication-title: Math. Program. – volume: 131 start-page: 14 year: 2005; end-page: 24 publication-title: J. Water. Res. PL‐ASCE. – volume: 22 start-page: 1503 issue: 10 year: 1998; end-page: 1513 publication-title: AIChE. J. – volume: 21 start-page: 359 year: 1994; end-page: 367 publication-title: Comput. Oper. Res. – volume: 10 start-page: 237 year: 1971; end-page: 260 publication-title: J. Optimiz. Theory. App. – year: 1996 – volume: 22 start-page: 125 year: 1998; end-page: 136 publication-title: Comput. Chem. Eng. – volume: 28 start-page: 1193 year: 2004; end-page: 1218 publication-title: Comput. Chem. Eng. – volume: 21 start-page: 633 issue: 1 year: 1978; end-page: 654 publication-title: Comput. Chem. Eng. – volume: 22 start-page: 1387 year: 1998; end-page: 1405 publication-title: Comput. Chem. Eng. – volume: 567 start-page: 39 year: 2004; end-page: 66 publication-title: J. Electroanal. Chem. – volume: 25 start-page: 1371 year: 2001; end-page: 1390 publication-title: Comput. Chem. Eng. – volume: 32 start-page: 1861 year: 2008; end-page: 1878 publication-title: Comput. Chem. Eng. – start-page: 309 year: 2004 end-page: 315 – ident: e_1_2_10_13_1 doi: 10.1016/S0098-1354(98)00221-X – ident: e_1_2_10_24_1 doi: 10.1016/j.jelechem.2003.11.060 – ident: e_1_2_10_4_1 doi: 10.1007/BF00934810 – ident: e_1_2_10_2_1 doi: 10.1016/j.compchemeng.2003.11.006 – ident: e_1_2_10_7_1 doi: 10.1016/j.parco.2005.03.006 – ident: e_1_2_10_11_1 doi: 10.1061/(ASCE)0733-9496(2005)131:1(14) – volume: 159 start-page: 636 year: 2003 ident: e_1_2_10_16_1 publication-title: Eur. J. Oper. Res. – ident: e_1_2_10_18_1 doi: 10.1016/S0098-1354(01)00681-0 – ident: e_1_2_10_20_1 doi: 10.1016/j.compchemeng.2007.10.005 – ident: e_1_2_10_14_1 doi: 10.1016/0098-1354(90)85010-8 – volume-title: Genetic Algorithm + Data Structure = Evolution Programmes year: 1996 ident: e_1_2_10_12_1 – volume: 22 start-page: 1503 issue: 10 year: 1998 ident: e_1_2_10_22_1 publication-title: AIChE. J. – ident: e_1_2_10_5_1 doi: 10.1007/BF02592064 – ident: e_1_2_10_8_1 doi: 10.1016/S0098-1354(00)00601-3 – volume: 12 start-page: 66 issue: 1 year: 2004 ident: e_1_2_10_19_1 publication-title: Chinese J. Chem. Eng. – ident: e_1_2_10_10_1 doi: 10.1016/j.compchemeng.2004.07.002 – ident: e_1_2_10_17_1 doi: 10.1016/j.compchemeng.2003.10.004 – ident: e_1_2_10_23_1 doi: 10.1109/CEC.2004.1330872 – volume: 19 start-page: S131C year: 1995 ident: e_1_2_10_6_1 publication-title: Comput. Chem. Eng. doi: 10.1016/0098-1354(95)87027-X – volume: 21 start-page: 633 issue: 1 year: 1978 ident: e_1_2_10_21_1 publication-title: Comput. Chem. Eng. – ident: e_1_2_10_3_1 doi: 10.1016/0305-0548(94)90024-8 – ident: e_1_2_10_9_1 doi: 10.1016/S0965-9978(02)00125-4 – ident: e_1_2_10_15_1 doi: 10.1016/S0098-1354(98)00254-3 |
| SSID | ssj0054264 |
| Score | 1.8960594 |
| Snippet | ABSTRACT
A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is... A robust hybrid genetic algorithm that can be used to solve process synthesis problems with mixed integer nonlinear programming (MINLP) models is developed.... |
| SourceID | crossref wiley istex |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 660 |
| SubjectTerms | genetic simulated annealing heat exchanger network synthesis hybrid genetic algorithm iterative hill climbing algorithm mixed integer nonlinear programming (MINLP) |
| Title | Application of the parallel adaptive genetic simulated annealing algorithm for the synthesis of heat exchanger networks |
| URI | https://api.istex.fr/ark:/67375/WNG-DFXNGTMR-7/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fapj.1622 |
| Volume | 7 |
| WOSCitedRecordID | wos000309459200005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1932-2143 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0054264 issn: 1932-2135 databaseCode: DRFUL dateStart: 20060101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEF6k9aAH32J9sYLoKTTZZLPpsahVpJZSWu0t7CtajGlp6uvfO5ukrQUFwdNeZpewM_PNbHbmW4RObeUD7illkUAKy6O1yAqE71gR4x6oPPL9rIv_vslaraDfr7WLqkrTC5PzQ8x-uBnPyPDaODgXaXVOGspH4OY-AfgtEzBbr4TKl51GrznFYWpifX6nTCziuHRKPWuT6nTuQjAqm339WExSsyjTWP_P922gtSK3xPXcGDbRkk620Oo3xsFt9F6fX1jjYYQh_cOG_TuOdYy54iODfhiMyvQ24nTwYl730gpzgGNuOtcxjx-H48Hk6QVDupvNTz8TGNJBahY02I71R9FPjJO8yjzdQb3GVffixireXrAkBDViCWqLwJVweFNUCe5J6nLq-owIUGJg6wCinJRCCEp0pCNbaA9Oag5hPuSbPFDuLiolw0TvIexErtQkYhAJa55mDDJOgIFAOFTKmtSqgs6nSghlQUxu3seIw5xSmYSwlaHZygo6mUmOcjKOH2TOMj3OBPj42RSvMRo-tK7Dy0a_dd2964QMBDP1_bpSWG_fmnH_r4IHaAXSKZJXoB2i0mT8qo_QsnybDNLxcWGeX0Kc6mo |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bT9RAFD4huyTKA6BiBAXHxOhTQzvtdLrxaQMsqEtDyAL7NplbdUPpbrar4r_3TC8LJJqQ-DQvp5NmzpnvfHM53wC8902MuGeMRxOtvIj1Mi9RceBlXEbo8iyOqyr-yyFP02Q87p2twKe2FqbWh1huuLmZUeG1m-BuQ3r_TjVUznCexxTxtxthFLEOdA_PBxfDFoiZS_b1oTL1aBCyVnvWp_vttw-yUdcN7O1DllqlmcHGf_3gJqw37JL063B4Biu2eA5r9zQHX8Cv_t2RNZlmBAkgcfrfeW5zIo2cOfwjGFauupGUkxv3vpc1RCIgS1e7TmT-bTqfLL7fECS81ffl7wKbclK6Dh26E3vbVBSTor5nXm7BxeBodHDiNa8veBrTGvUU81USaly-GWaUjDQLJQtjThW6MfFtgnlOa6UUozazma9shGu1gPIYGadMTPgSOsW0sK-ABFmoLc045sJeZDlHzolAkKiAad3T1mzDx9YLQjfS5O6FjFzUospU4FAKN5Tb8G5pOavlOP5i86Fy5NJAzq_d9TXOxFV6LA4H4_R4dHouOBpW_vtnT6J_9sW1O481fAtPTkanQzH8nH59DU-RXNH6Ptob6CzmP-wurOqfi0k532ti9Q9HY-5a |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1dT9swFLUQRdN4GGNjgg2GkabtKSJx4jgVTxUlsFGiCsHWN8ufoyKkVdNt8O-5zkcBaZOQ9uSXGyfy9T33OPY9RuiTr2PAPa09kijpRbRrvUTGgWeZiMDlNo6rKv7vA5ZlyWjUHS6hg7YWptaHWPxwc5FR4bULcDPVdv9BNVRMIc5jAvjbgXfEEJWd_nl6OWiBmLpkX28qE48EIW21Z32y3z77JBt13MDePmWpVZpJ1_7rA1-jVw27xL16OqyjJVO8QauPNAffoj-9hy1rPLEYCCB2-t95bnIstJg6_MMwrVx1Iy7HN-5-L6OxAEAWrnYdi_znZDaeX91gILzV8-VdAU05Ll2HDt2xuW0qinFRnzMvN9BlenRxeOI1ty94CtIa8ST1ZRIqWL5pqqWIFA0FDWNGJLgx8U0CeU4pKSUlxhrrSxPBWi0gLAbGKRIdvkPLxaQwmwgHNlSGWAa5sBsZxoBzAhAkMqBKdZXRW-hL6wWuGmlyd0NGzmtRZcJhKLkbyi20t7Cc1nIcf7H5XDlyYSBm1-74GqP8R3bM--koO744O-cMDCv__bMn3ht-c-375xruohfDfsoHX7PTD-glcCtSH0fbRsvz2S-zg1bU7_m4nH1spuo97P7t1Q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Application+of+the+parallel+adaptive+genetic+simulated+annealing+algorithm+for+the+synthesis+of+heat+exchanger+networks&rft.jtitle=Asia-Pacific+journal+of+chemical+engineering&rft.au=Zhao%2C+Chao&rft.au=Xu%2C+Qiaoling&rft.au=An%2C+Aimin&rft.date=2012-09-01&rft.pub=John+Wiley+%26+Sons%2C+Ltd&rft.issn=1932-2135&rft.eissn=1932-2143&rft.volume=7&rft.issue=5&rft.spage=660&rft.epage=669&rft_id=info:doi/10.1002%2Fapj.1622&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_DFXNGTMR_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1932-2135&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1932-2135&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1932-2135&client=summon |