CINXE.COM
Multi objective optimization Research Papers - Academia.edu
<!DOCTYPE html> <html lang="en" xmlns:fb="http://www.facebook.com/2008/fbml" class="wf-loading"> <head prefix="og: https://ogp.me/ns# fb: https://ogp.me/ns/fb# academia: https://ogp.me/ns/fb/academia#"> <meta charset="utf-8"> <meta name=viewport content="width=device-width, initial-scale=1"> <meta rel="search" type="application/opensearchdescription+xml" href="/open_search.xml" title="Academia.edu"> <title>Multi objective optimization Research Papers - Academia.edu</title> <!-- _ _ _ | | (_) | | __ _ ___ __ _ __| | ___ _ __ ___ _ __ _ ___ __| |_ _ / _` |/ __/ _` |/ _` |/ _ \ '_ ` _ \| |/ _` | / _ \/ _` | | | | | (_| | (_| (_| | (_| | __/ | | | | | | (_| || __/ (_| | |_| | \__,_|\___\__,_|\__,_|\___|_| |_| |_|_|\__,_(_)___|\__,_|\__,_| We're hiring! See https://www.academia.edu/hiring --> <link href="//a.academia-assets.com/images/favicons/favicon-production.ico" rel="shortcut icon" type="image/vnd.microsoft.icon"> <link rel="apple-touch-icon" sizes="57x57" href="//a.academia-assets.com/images/favicons/apple-touch-icon-57x57.png"> <link rel="apple-touch-icon" sizes="60x60" href="//a.academia-assets.com/images/favicons/apple-touch-icon-60x60.png"> <link rel="apple-touch-icon" sizes="72x72" href="//a.academia-assets.com/images/favicons/apple-touch-icon-72x72.png"> <link rel="apple-touch-icon" sizes="76x76" href="//a.academia-assets.com/images/favicons/apple-touch-icon-76x76.png"> <link rel="apple-touch-icon" sizes="114x114" href="//a.academia-assets.com/images/favicons/apple-touch-icon-114x114.png"> <link rel="apple-touch-icon" sizes="120x120" href="//a.academia-assets.com/images/favicons/apple-touch-icon-120x120.png"> <link rel="apple-touch-icon" sizes="144x144" href="//a.academia-assets.com/images/favicons/apple-touch-icon-144x144.png"> <link rel="apple-touch-icon" sizes="152x152" href="//a.academia-assets.com/images/favicons/apple-touch-icon-152x152.png"> <link rel="apple-touch-icon" sizes="180x180" href="//a.academia-assets.com/images/favicons/apple-touch-icon-180x180.png"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-32x32.png" sizes="32x32"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-194x194.png" sizes="194x194"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-96x96.png" sizes="96x96"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/android-chrome-192x192.png" sizes="192x192"> <link rel="icon" type="image/png" href="//a.academia-assets.com/images/favicons/favicon-16x16.png" sizes="16x16"> <link rel="manifest" href="//a.academia-assets.com/images/favicons/manifest.json"> <meta name="msapplication-TileColor" content="#2b5797"> <meta name="msapplication-TileImage" content="//a.academia-assets.com/images/favicons/mstile-144x144.png"> <meta name="theme-color" content="#ffffff"> <script> window.performance && window.performance.measure && window.performance.measure("Time To First Byte", "requestStart", "responseStart"); </script> <script> (function() { if (!window.URLSearchParams || !window.history || !window.history.replaceState) { return; } var searchParams = new URLSearchParams(window.location.search); var paramsToDelete = [ 'fs', 'sm', 'swp', 'iid', 'nbs', 'rcc', // related content category 'rcpos', // related content carousel position 'rcpg', // related carousel page 'rchid', // related content hit id 'f_ri', // research interest id, for SEO tracking 'f_fri', // featured research interest, for SEO tracking (param key without value) 'f_rid', // from research interest directory for SEO tracking 'f_loswp', // from research interest pills on LOSWP sidebar for SEO tracking 'rhid', // referrring hit id ]; if (paramsToDelete.every((key) => searchParams.get(key) === null)) { return; } paramsToDelete.forEach((key) => { searchParams.delete(key); }); var cleanUrl = new URL(window.location.href); cleanUrl.search = searchParams.toString(); history.replaceState({}, document.title, cleanUrl); })(); </script> <script async src="https://www.googletagmanager.com/gtag/js?id=G-5VKX33P2DS"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-5VKX33P2DS', { cookie_domain: 'academia.edu', send_page_view: false, }); gtag('event', 'page_view', { 'controller': "by_tag", 'action': "show_one", 'controller_action': 'by_tag#show_one', 'logged_in': 'false', 'edge': 'unknown', // Send nil if there is no A/B test bucket, in case some records get logged // with missing data - that way we can distinguish between the two cases. // ab_test_bucket should be of the form <ab_test_name>:<bucket> 'ab_test_bucket': null, }) </script> <script type="text/javascript"> window.sendUserTiming = function(timingName) { if (!(window.performance && window.performance.measure)) return; var entries = window.performance.getEntriesByName(timingName, "measure"); if (entries.length !== 1) return; var timingValue = Math.round(entries[0].duration); gtag('event', 'timing_complete', { name: timingName, value: timingValue, event_category: 'User-centric', }); }; window.sendUserTiming("Time To First Byte"); </script> <meta name="csrf-param" content="authenticity_token" /> <meta name="csrf-token" content="A5flaJ79cK2zzBjASinuTEQhrrowTz4TsBW8POoFO9n5ZhJ5NHSvcbVJInXE9/RTL75t8cIS93zEU6E5LG1Mpg==" /> <link href="/Documents/in/Multi_objective_optimization?after=50%2C3780649" rel="next" /><link crossorigin="" href="https://fonts.gstatic.com/" rel="preconnect" /><link href="https://fonts.googleapis.com/css2?family=DM+Sans:ital,opsz,wght@0,9..40,100..1000;1,9..40,100..1000&family=Gupter:wght@400;500;700&family=IBM+Plex+Mono:wght@300;400&family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@20,400,0,0&display=swap" rel="stylesheet" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/common-10fa40af19d25203774df2d4a03b9b5771b45109c2304968038e88a81d1215c5.css" /> <meta name="description" content="View Multi objective optimization Research Papers on Academia.edu for free." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'by_tag'; var $action_name = "show_one"; var $rails_env = 'production'; var $app_rev = 'fdfcd03ea2af2a60c31d1f7e544fe08547bcb5a1'; var $domain = 'academia.edu'; var $app_host = "academia.edu"; var $asset_host = "academia-assets.com"; var $start_time = new Date().getTime(); var $recaptcha_key = "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB"; var $recaptcha_invisible_key = "6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj"; var $disableClientRecordHit = false; </script> <script> window.Aedu = { hit_data: null }; window.Aedu.SiteStats = {"premium_universities_count":15272,"monthly_visitors":"113 million","monthly_visitor_count":113784677,"monthly_visitor_count_in_millions":113,"user_count":277469103,"paper_count":55203019,"paper_count_in_millions":55,"page_count":432000000,"page_count_in_millions":432,"pdf_count":16500000,"pdf_count_in_millions":16}; window.Aedu.serverRenderTime = new Date(1732726530000); window.Aedu.timeDifference = new Date().getTime() - 1732726530000; window.Aedu.isUsingCssV1 = false; window.Aedu.enableLocalization = true; window.Aedu.activateFullstory = false; window.Aedu.serviceAvailability = { status: {"attention_db":"on","bibliography_db":"on","contacts_db":"on","email_db":"on","indexability_db":"on","mentions_db":"on","news_db":"on","notifications_db":"on","offsite_mentions_db":"on","redshift":"on","redshift_exports_db":"on","related_works_db":"on","ring_db":"on","user_tests_db":"on"}, serviceEnabled: function(service) { return this.status[service] === "on"; }, readEnabled: function(service) { return this.serviceEnabled(service) || this.status[service] === "read_only"; }, }; window.Aedu.viewApmTrace = function() { // Check if x-apm-trace-id meta tag is set, and open the trace in APM // in a new window if it is. var apmTraceId = document.head.querySelector('meta[name="x-apm-trace-id"]'); if (apmTraceId) { var traceId = apmTraceId.content; // Use trace ID to construct URL, an example URL looks like: // https://app.datadoghq.com/apm/traces?query=trace_id%31298410148923562634 var apmUrl = 'https://app.datadoghq.com/apm/traces?query=trace_id%3A' + traceId; window.open(apmUrl, '_blank'); } }; </script> <!--[if lt IE 9]> <script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.2/html5shiv.min.js"></script> <![endif]--> <link href="https://fonts.googleapis.com/css?family=Roboto:100,100i,300,300i,400,400i,500,500i,700,700i,900,900i" rel="stylesheet"> <link href="//maxcdn.bootstrapcdn.com/font-awesome/4.3.0/css/font-awesome.min.css" rel="stylesheet"> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/libraries-a9675dcb01ec4ef6aa807ba772c7a5a00c1820d3ff661c1038a20f80d06bb4e4.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/academia-296162c7af6fd81dcdd76f1a94f1fad04fb5f647401337d136fe8b68742170b1.css" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system_legacy-056a9113b9a0f5343d013b29ee1929d5a18be35fdcdceb616600b4db8bd20054.css" /> <script src="//a.academia-assets.com/assets/webpack_bundles/runtime-bundle-005434038af4252ca37c527588411a3d6a0eabb5f727fac83f8bbe7fd88d93bb.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/webpack_libraries_and_infrequently_changed.wjs-bundle-e90a2f43a733a0e9134689da7890520eebc345b9e07879038fcc7f7e3f7d4909.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-c273e21c7040e68b9a3ae640eca94c398a7eb6929ac8f5ce955b96685fca85e9.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/sentry.wjs-bundle-5fe03fddca915c8ba0f7edbe64c194308e8ce5abaed7bffe1255ff37549c4808.js"></script> <script> jade = window.jade || {}; jade.helpers = window.$h; jade._ = window._; </script> <!-- Google Tag Manager --> <script id="tag-manager-head-root">(function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start': new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0], j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src= 'https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer_old','GTM-5G9JF7Z');</script> <!-- End Google Tag Manager --> <script> window.gptadslots = []; window.googletag = window.googletag || {}; window.googletag.cmd = window.googletag.cmd || []; </script> <script type="text/javascript"> // TODO(jacob): This should be defined, may be rare load order problem. // Checking if null is just a quick fix, will default to en if unset. // Better fix is to run this immedietely after I18n is set. if (window.I18n != null) { I18n.defaultLocale = "en"; I18n.locale = "en"; I18n.fallbacks = true; } </script> <link rel="canonical" href="https://www.academia.edu/Documents/in/Multi_objective_optimization" /> </head> <!--[if gte IE 9 ]> <body class='ie ie9 c-by_tag a-show_one logged_out u-bgColorWhite'> <![endif]--> <!--[if !(IE) ]><!--> <body class='c-by_tag a-show_one logged_out u-bgColorWhite'> <!--<![endif]--> <div id="fb-root"></div><script>window.fbAsyncInit = function() { FB.init({ appId: "2369844204", version: "v8.0", status: true, cookie: true, xfbml: true }); // Additional initialization code. if (window.InitFacebook) { // facebook.ts already loaded, set it up. window.InitFacebook(); } else { // Set a flag for facebook.ts to find when it loads. window.academiaAuthReadyFacebook = true; } };</script><script>window.fbAsyncLoad = function() { // Protection against double calling of this function if (window.FB) { return; } (function(d, s, id){ var js, fjs = d.getElementsByTagName(s)[0]; if (d.getElementById(id)) {return;} js = d.createElement(s); js.id = id; js.src = "//connect.facebook.net/en_US/sdk.js"; fjs.parentNode.insertBefore(js, fjs); }(document, 'script', 'facebook-jssdk')); } if (!window.defer_facebook) { // Autoload if not deferred window.fbAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.fbAsyncLoad(); }, 5000); }</script> <div id="google-root"></div><script>window.loadGoogle = function() { if (window.InitGoogle) { // google.ts already loaded, set it up. window.InitGoogle("331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"); } else { // Set a flag for google.ts to use when it loads. window.GoogleClientID = "331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b"; } };</script><script>window.googleAsyncLoad = function() { // Protection against double calling of this function (function(d) { var js; var id = 'google-jssdk'; var ref = d.getElementsByTagName('script')[0]; if (d.getElementById(id)) { return; } js = d.createElement('script'); js.id = id; js.async = true; js.onload = loadGoogle; js.src = "https://accounts.google.com/gsi/client" ref.parentNode.insertBefore(js, ref); }(document)); } if (!window.defer_google) { // Autoload if not deferred window.googleAsyncLoad(); } else { // Defer loading by 5 seconds setTimeout(function() { window.googleAsyncLoad(); }, 5000); }</script> <div id="tag-manager-body-root"> <!-- Google Tag Manager (noscript) --> <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript> <!-- End Google Tag Manager (noscript) --> <!-- Event listeners for analytics --> <script> window.addEventListener('load', function() { if (document.querySelector('input[name="commit"]')) { document.querySelector('input[name="commit"]').addEventListener('click', function() { gtag('event', 'click', { event_category: 'button', event_label: 'Log In' }) }) } }); </script> </div> <script>var _comscore = _comscore || []; _comscore.push({ c1: "2", c2: "26766707" }); (function() { var s = document.createElement("script"), el = document.getElementsByTagName("script")[0]; s.async = true; s.src = (document.location.protocol == "https:" ? "https://sb" : "http://b") + ".scorecardresearch.com/beacon.js"; el.parentNode.insertBefore(s, el); })();</script><img src="https://sb.scorecardresearch.com/p?c1=2&c2=26766707&cv=2.0&cj=1" style="position: absolute; visibility: hidden" /> <div id='react-modal'></div> <div class='DesignSystem'> <a class='u-showOnFocus' href='#site'> Skip to main content </a> </div> <div id="upgrade_ie_banner" style="display: none;"><p>Academia.edu no longer supports Internet Explorer.</p><p>To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to <a href="https://www.academia.edu/upgrade-browser">upgrade your browser</a>.</p></div><script>// Show this banner for all versions of IE if (!!window.MSInputMethodContext || /(MSIE)/.test(navigator.userAgent)) { document.getElementById('upgrade_ie_banner').style.display = 'block'; }</script> <div class="DesignSystem bootstrap ShrinkableNav no-sm no-md"><div class="navbar navbar-default main-header"><div class="container-wrapper" id="main-header-container"><div class="container"><div class="navbar-header"><div class="nav-left-wrapper u-mt0x"><div class="nav-logo"><a data-main-header-link-target="logo_home" href="https://www.academia.edu/"><img class="visible-xs-inline-block" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015-A.svg" width="24" height="24" /><img width="145.2" height="18" class="hidden-xs" style="height: 24px;" alt="Academia.edu" src="//a.academia-assets.com/images/academia-logo-redesign-2015.svg" /></a></div><div class="nav-search"><div class="SiteSearch-wrapper select2-no-default-pills"><form class="js-SiteSearch-form DesignSystem" action="https://www.academia.edu/search" accept-charset="UTF-8" method="get"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><i class="SiteSearch-icon fa fa-search u-fw700 u-positionAbsolute u-tcGrayDark"></i><input class="js-SiteSearch-form-input SiteSearch-form-input form-control" data-main-header-click-target="search_input" name="q" placeholder="Search" type="text" value="" /></form></div></div></div><div class="nav-right-wrapper pull-right"><ul class="NavLinks js-main-nav list-unstyled"><li class="NavLinks-link"><a class="js-header-login-url Button Button--inverseGray Button--sm u-mb4x" id="nav_log_in" rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="NavLinks-link u-p0x"><a class="Button Button--inverseGray Button--sm u-mb4x" rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li></ul><button class="hidden-lg hidden-md hidden-sm u-ml4x navbar-toggle collapsed" data-target=".js-mobile-header-links" data-toggle="collapse" type="button"><span class="icon-bar"></span><span class="icon-bar"></span><span class="icon-bar"></span></button></div></div><div class="collapse navbar-collapse js-mobile-header-links"><ul class="nav navbar-nav"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/login">Log In</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/signup">Sign Up</a></li><li class="u-borderColorGrayLight u-borderBottom1 js-mobile-nav-expand-trigger"><a href="#">more <span class="caret"></span></a></li><li><ul class="js-mobile-nav-expand-section nav navbar-nav u-m0x collapse"><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/about">About</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/press">Press</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://medium.com/@academia">Blog</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="false" href="https://www.academia.edu/documents">Papers</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://www.academia.edu/hiring"><i class="fa fa-briefcase"></i> We're Hiring!</a></li><li class="u-borderColorGrayLight u-borderBottom1"><a rel="nofollow" href="https://support.academia.edu/"><i class="fa fa-question-circle"></i> Help Center</a></li><li class="js-mobile-nav-collapse-trigger u-borderColorGrayLight u-borderBottom1 dropup" style="display:none"><a href="#">less <span class="caret"></span></a></li></ul></li></ul></div></div></div><script>(function(){ var $moreLink = $(".js-mobile-nav-expand-trigger"); var $lessLink = $(".js-mobile-nav-collapse-trigger"); var $section = $('.js-mobile-nav-expand-section'); $moreLink.click(function(ev){ ev.preventDefault(); $moreLink.hide(); $lessLink.show(); $section.collapse('show'); }); $lessLink.click(function(ev){ ev.preventDefault(); $moreLink.show(); $lessLink.hide(); $section.collapse('hide'); }); })() if ($a.is_logged_in() || false) { new Aedu.NavigationController({ el: '.js-main-nav', showHighlightedNotification: false }); } else { $(".js-header-login-url").attr("href", $a.loginUrlWithRedirect()); } Aedu.autocompleteSearch = new AutocompleteSearch({el: '.js-SiteSearch-form'});</script></div></div> <div id='site' class='fixed'> <div id="content" class="clearfix"> <script>document.addEventListener('DOMContentLoaded', function(){ var $dismissible = $(".dismissible_banner"); $dismissible.click(function(ev) { $dismissible.hide(); }); });</script> <div class="DesignSystem" style="margin-top:-40px"><div class="PageHeader"><div class="container"><div class="row"><style type="text/css">.sor-abstract { display: -webkit-box; overflow: hidden; text-overflow: ellipsis; -webkit-line-clamp: 3; -webkit-box-orient: vertical; }</style><div class="col-xs-12 clearfix"><div class="u-floatLeft"><h1 class="PageHeader-title u-m0x u-fs30">Multi objective optimization</h1><div class="u-tcGrayDark">1,358 Followers</div><div class="u-tcGrayDark u-mt2x">Recent papers in <b>Multi objective optimization</b></div></div></div></div></div></div><div class="TabbedNavigation"><div class="container"><div class="row"><div class="col-xs-12 clearfix"><ul class="nav u-m0x u-p0x list-inline u-displayFlex"><li class="active"><a href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Top Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Multi_objective_optimization/MostCited">Most Cited Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Multi_objective_optimization/MostDownloaded">Most Downloaded Papers</a></li><li><a href="https://www.academia.edu/Documents/in/Multi_objective_optimization/MostRecent">Newest Papers</a></li><li><a class="" href="https://www.academia.edu/People/Multi_objective_optimization">People</a></li></ul></div><style type="text/css">ul.nav{flex-direction:row}@media(max-width: 567px){ul.nav{flex-direction:column}.TabbedNavigation li{max-width:100%}.TabbedNavigation li.active{background-color:var(--background-grey, #dddde2)}.TabbedNavigation li.active:before,.TabbedNavigation li.active:after{display:none}}</style></div></div></div><div class="container"><div class="row"><div class="col-xs-12"><div class="u-displayFlex"><div class="u-flexGrow1"><div class="works"><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70400188" data-work_id="70400188" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/70400188/Multi_Objective_Optimization_of_classification_rules_using_Cultural_Algorithms">Multi Objective Optimization of classification rules using Cultural Algorithms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70400188" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3e3d546a2ffa1fd8f28658a0aac65cbc" rel="nofollow" data-download="{"attachment_id":80169276,"asset_id":70400188,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80169276/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="147007506" href="https://srmuniv.academia.edu/SujathaSrinivasan">Sujatha Srinivasan</a><script data-card-contents-for-user="147007506" type="text/json">{"id":147007506,"first_name":"Sujatha","last_name":"Srinivasan","domain_name":"srmuniv","page_name":"SujathaSrinivasan","display_name":"Sujatha Srinivasan","profile_url":"https://srmuniv.academia.edu/SujathaSrinivasan?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_70400188 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70400188"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70400188, container: ".js-paper-rank-work_70400188", }); });</script></li><li class="js-percentile-work_70400188 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70400188; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70400188"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70400188 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70400188"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70400188; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70400188]").text(description); $(".js-view-count-work_70400188").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70400188").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70400188"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2009" href="https://www.academia.edu/Documents/in/Data_Mining">Data Mining</a>, <script data-card-contents-for-ri="2009" type="text/json">{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="28235" href="https://www.academia.edu/Documents/in/Multidisciplinary">Multidisciplinary</a>, <script data-card-contents-for-ri="28235" type="text/json">{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="106145" href="https://www.academia.edu/Documents/in/Classification">Classification</a><script data-card-contents-for-ri="106145" type="text/json">{"id":106145,"name":"Classification","url":"https://www.academia.edu/Documents/in/Classification?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70400188]'), work: {"id":70400188,"title":"Multi Objective Optimization of classification rules using Cultural Algorithms","created_at":"2022-02-04T02:57:31.235-08:00","url":"https://www.academia.edu/70400188/Multi_Objective_Optimization_of_classification_rules_using_Cultural_Algorithms?f_ri=143163","dom_id":"work_70400188","summary":null,"downloadable_attachments":[{"id":80169276,"asset_id":70400188,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":147007506,"first_name":"Sujatha","last_name":"Srinivasan","domain_name":"srmuniv","page_name":"SujathaSrinivasan","display_name":"Sujatha Srinivasan","profile_url":"https://srmuniv.academia.edu/SujathaSrinivasan?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=143163","nofollow":false},{"id":28235,"name":"Multidisciplinary","url":"https://www.academia.edu/Documents/in/Multidisciplinary?f_ri=143163","nofollow":false},{"id":106145,"name":"Classification","url":"https://www.academia.edu/Documents/in/Classification?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":2427692,"name":"Cultural Algorithm","url":"https://www.academia.edu/Documents/in/Cultural_Algorithm?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28737548" data-work_id="28737548" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28737548/Solving_and_analyzing_Sudokus_with_cultural_algorithms">Solving and analyzing Sudokus with cultural algorithms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28737548" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="dfbe79c0532406610e9529d549b9d5e5" rel="nofollow" data-download="{"attachment_id":49149266,"asset_id":28737548,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49149266/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="54074565" href="https://uwasa.academia.edu/TimoMantere">Timo Mantere</a><script data-card-contents-for-user="54074565" type="text/json">{"id":54074565,"first_name":"Timo","last_name":"Mantere","domain_name":"uwasa","page_name":"TimoMantere","display_name":"Timo Mantere","profile_url":"https://uwasa.academia.edu/TimoMantere?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_28737548 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28737548"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28737548, container: ".js-paper-rank-work_28737548", }); });</script></li><li class="js-percentile-work_28737548 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28737548; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28737548"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28737548 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28737548"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28737548; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28737548]").text(description); $(".js-view-count-work_28737548").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28737548").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28737548"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">12</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="1701" href="https://www.academia.edu/Documents/in/Evolutionary_algorithms">Evolutionary algorithms</a>, <script data-card-contents-for-ri="1701" type="text/json">{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3523" href="https://www.academia.edu/Documents/in/Evolutionary_Computation">Evolutionary Computation</a>, <script data-card-contents-for-ri="3523" type="text/json">{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28737548]'), work: {"id":28737548,"title":"Solving and analyzing Sudokus with cultural algorithms","created_at":"2016-09-27T02:16:41.002-07:00","url":"https://www.academia.edu/28737548/Solving_and_analyzing_Sudokus_with_cultural_algorithms?f_ri=143163","dom_id":"work_28737548","summary":null,"downloadable_attachments":[{"id":49149266,"asset_id":28737548,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":54074565,"first_name":"Timo","last_name":"Mantere","domain_name":"uwasa","page_name":"TimoMantere","display_name":"Timo Mantere","profile_url":"https://uwasa.academia.edu/TimoMantere?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms?f_ri=143163","nofollow":false},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":61864,"name":"Cultural Differences","url":"https://www.academia.edu/Documents/in/Cultural_Differences?f_ri=143163"},{"id":66379,"name":"Automation","url":"https://www.academia.edu/Documents/in/Automation?f_ri=143163"},{"id":105093,"name":"Combinatorial Problems","url":"https://www.academia.edu/Documents/in/Combinatorial_Problems?f_ri=143163"},{"id":122623,"name":"Wikipedia","url":"https://www.academia.edu/Documents/in/Wikipedia?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163"},{"id":372699,"name":"Information Analysis","url":"https://www.academia.edu/Documents/in/Information_Analysis?f_ri=143163"},{"id":819765,"name":"Constraint Satisfaction","url":"https://www.academia.edu/Documents/in/Constraint_Satisfaction?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_16517307" data-work_id="16517307" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/16517307/An_evolutionary_algorithm_based_approach_to_robust_analog_circuit_design_using_constrained_multi_objective_optimization">An evolutionary algorithm-based approach to robust analog circuit design using constrained multi-objective optimization</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/16517307" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="080522f4add508a50f45dcb190aef055" rel="nofollow" data-download="{"attachment_id":42450634,"asset_id":16517307,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/42450634/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="35764061" href="https://cambridge.academia.edu/GiuseppeNicosia">Giuseppe Nicosia</a><script data-card-contents-for-user="35764061" type="text/json">{"id":35764061,"first_name":"Giuseppe","last_name":"Nicosia","domain_name":"cambridge","page_name":"GiuseppeNicosia","display_name":"Giuseppe Nicosia","profile_url":"https://cambridge.academia.edu/GiuseppeNicosia?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_16517307 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="16517307"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 16517307, container: ".js-paper-rank-work_16517307", }); });</script></li><li class="js-percentile-work_16517307 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 16517307; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_16517307"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_16517307 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="16517307"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 16517307; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=16517307]").text(description); $(".js-view-count-work_16517307").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_16517307").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="16517307"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">18</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="979" href="https://www.academia.edu/Documents/in/Analog_Circuits">Analog Circuits</a>, <script data-card-contents-for-ri="979" type="text/json">{"id":979,"name":"Analog Circuits","url":"https://www.academia.edu/Documents/in/Analog_Circuits?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5187" href="https://www.academia.edu/Documents/in/Statistical_Analysis">Statistical Analysis</a>, <script data-card-contents-for-ri="5187" type="text/json">{"id":5187,"name":"Statistical Analysis","url":"https://www.academia.edu/Documents/in/Statistical_Analysis?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="46254" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a><script data-card-contents-for-ri="46254" type="text/json">{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=16517307]'), work: {"id":16517307,"title":"An evolutionary algorithm-based approach to robust analog circuit design using constrained multi-objective optimization","created_at":"2015-10-06T11:54:50.169-07:00","url":"https://www.academia.edu/16517307/An_evolutionary_algorithm_based_approach_to_robust_analog_circuit_design_using_constrained_multi_objective_optimization?f_ri=143163","dom_id":"work_16517307","summary":null,"downloadable_attachments":[{"id":42450634,"asset_id":16517307,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":35764061,"first_name":"Giuseppe","last_name":"Nicosia","domain_name":"cambridge","page_name":"GiuseppeNicosia","display_name":"Giuseppe Nicosia","profile_url":"https://cambridge.academia.edu/GiuseppeNicosia?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":979,"name":"Analog Circuits","url":"https://www.academia.edu/Documents/in/Analog_Circuits?f_ri=143163","nofollow":false},{"id":5187,"name":"Statistical Analysis","url":"https://www.academia.edu/Documents/in/Statistical_Analysis?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":150652,"name":"Knowledge Based Systems","url":"https://www.academia.edu/Documents/in/Knowledge_Based_Systems?f_ri=143163"},{"id":197501,"name":"Low noise amplifier","url":"https://www.academia.edu/Documents/in/Low_noise_amplifier?f_ri=143163"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163"},{"id":305820,"name":"Circuit Design","url":"https://www.academia.edu/Documents/in/Circuit_Design?f_ri=143163"},{"id":535951,"name":"Design for Manufacture","url":"https://www.academia.edu/Documents/in/Design_for_Manufacture?f_ri=143163"},{"id":555139,"name":"Evolutionary optimization","url":"https://www.academia.edu/Documents/in/Evolutionary_optimization?f_ri=143163"},{"id":570997,"name":"Pareto front","url":"https://www.academia.edu/Documents/in/Pareto_front?f_ri=143163"},{"id":648356,"name":"Integrated Circuit","url":"https://www.academia.edu/Documents/in/Integrated_Circuit?f_ri=143163"},{"id":681868,"name":"Analog Integrated Circuits","url":"https://www.academia.edu/Documents/in/Analog_Integrated_Circuits?f_ri=143163"},{"id":1146982,"name":"Ultra Wideband","url":"https://www.academia.edu/Documents/in/Ultra_Wideband?f_ri=143163"},{"id":1548911,"name":"Test Bed","url":"https://www.academia.edu/Documents/in/Test_Bed?f_ri=143163"},{"id":1689234,"name":"Constrained Optimization","url":"https://www.academia.edu/Documents/in/Constrained_Optimization?f_ri=143163"},{"id":1935769,"name":"Design Model","url":"https://www.academia.edu/Documents/in/Design_Model?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_79705730" data-work_id="79705730" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/79705730/Planned_Scheduling_for_Economic_Power_Sharing_in_a_CHP_Based_Micro_Grid">Planned Scheduling for Economic Power Sharing in a CHP-Based Micro-Grid</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/79705730" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6c1bcd3611496dec4996104076fee11c" rel="nofollow" data-download="{"attachment_id":86329751,"asset_id":79705730,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/86329751/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="48621982" href="https://independent.academia.edu/DrAniruddhaBhattacharya">DrAniruddha Bhattacharya</a><script data-card-contents-for-user="48621982" type="text/json">{"id":48621982,"first_name":"DrAniruddha","last_name":"Bhattacharya","domain_name":"independent","page_name":"DrAniruddhaBhattacharya","display_name":"DrAniruddha Bhattacharya","profile_url":"https://independent.academia.edu/DrAniruddhaBhattacharya?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_79705730 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="79705730"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 79705730, container: ".js-paper-rank-work_79705730", }); });</script></li><li class="js-percentile-work_79705730 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 79705730; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_79705730"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_79705730 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="79705730"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 79705730; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=79705730]").text(description); $(".js-view-count-work_79705730").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_79705730").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="79705730"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">13</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1424" href="https://www.academia.edu/Documents/in/Power_Systems">Power Systems</a>, <script data-card-contents-for-ri="1424" type="text/json">{"id":1424,"name":"Power Systems","url":"https://www.academia.edu/Documents/in/Power_Systems?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="12346" href="https://www.academia.edu/Documents/in/Differential_Evolution">Differential Evolution</a>, <script data-card-contents-for-ri="12346" type="text/json">{"id":12346,"name":"Differential Evolution","url":"https://www.academia.edu/Documents/in/Differential_Evolution?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=79705730]'), work: {"id":79705730,"title":"Planned Scheduling for Economic Power Sharing in a CHP-Based Micro-Grid","created_at":"2022-05-22T23:40:45.092-07:00","url":"https://www.academia.edu/79705730/Planned_Scheduling_for_Economic_Power_Sharing_in_a_CHP_Based_Micro_Grid?f_ri=143163","dom_id":"work_79705730","summary":null,"downloadable_attachments":[{"id":86329751,"asset_id":79705730,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":48621982,"first_name":"DrAniruddha","last_name":"Bhattacharya","domain_name":"independent","page_name":"DrAniruddhaBhattacharya","display_name":"DrAniruddha Bhattacharya","profile_url":"https://independent.academia.edu/DrAniruddhaBhattacharya?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":1424,"name":"Power Systems","url":"https://www.academia.edu/Documents/in/Power_Systems?f_ri=143163","nofollow":false},{"id":12346,"name":"Differential Evolution","url":"https://www.academia.edu/Documents/in/Differential_Evolution?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":279849,"name":"Density Estimation","url":"https://www.academia.edu/Documents/in/Density_Estimation?f_ri=143163"},{"id":584683,"name":"Waste minimisation","url":"https://www.academia.edu/Documents/in/Waste_minimisation?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=143163"},{"id":1272117,"name":"Combined Heat and Power","url":"https://www.academia.edu/Documents/in/Combined_Heat_and_Power?f_ri=143163"},{"id":1330964,"name":"Particle Swarm Optimizer","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimizer?f_ri=143163"},{"id":2124420,"name":"Optimal location","url":"https://www.academia.edu/Documents/in/Optimal_location?f_ri=143163"},{"id":3311597,"name":"Heat Balance","url":"https://www.academia.edu/Documents/in/Heat_Balance?f_ri=143163"},{"id":4085481,"name":"inequality constraint","url":"https://www.academia.edu/Documents/in/inequality_constraint?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_71273197" data-work_id="71273197" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/71273197/Control_of_a_Reverse_Osmosis_plant_by_using_a_robust_PID_design_based_on_multi_objective_optimization">Control of a Reverse Osmosis plant by using a robust PID design based on multi-objective optimization</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/71273197" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5a2e13a24c8ef1bf0b3cb3a80a229ed8" rel="nofollow" data-download="{"attachment_id":80689000,"asset_id":71273197,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80689000/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="529893" href="https://independent.academia.edu/AdrianGambier">Adrian Gambier</a><script data-card-contents-for-user="529893" type="text/json">{"id":529893,"first_name":"Adrian","last_name":"Gambier","domain_name":"independent","page_name":"AdrianGambier","display_name":"Adrian Gambier","profile_url":"https://independent.academia.edu/AdrianGambier?f_ri=143163","photo":"https://0.academia-photos.com/529893/188247/19676806/s65_elrenegau.gambier.jpg"}</script></span></span></li><li class="js-paper-rank-work_71273197 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="71273197"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 71273197, container: ".js-paper-rank-work_71273197", }); });</script></li><li class="js-percentile-work_71273197 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 71273197; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_71273197"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_71273197 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="71273197"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 71273197; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=71273197]").text(description); $(".js-view-count-work_71273197").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_71273197").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="71273197"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="15344" href="https://www.academia.edu/Documents/in/Robust_control">Robust control</a>, <script data-card-contents-for-ri="15344" type="text/json">{"id":15344,"name":"Robust control","url":"https://www.academia.edu/Documents/in/Robust_control?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="249165" href="https://www.academia.edu/Documents/in/Pid_Controller">Pid Controller</a>, <script data-card-contents-for-ri="249165" type="text/json">{"id":249165,"name":"Pid Controller","url":"https://www.academia.edu/Documents/in/Pid_Controller?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="276273" href="https://www.academia.edu/Documents/in/Reverse_osmosis">Reverse osmosis</a><script data-card-contents-for-ri="276273" type="text/json">{"id":276273,"name":"Reverse osmosis","url":"https://www.academia.edu/Documents/in/Reverse_osmosis?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=71273197]'), work: {"id":71273197,"title":"Control of a Reverse Osmosis plant by using a robust PID design based on multi-objective optimization","created_at":"2022-02-12T19:32:34.181-08:00","url":"https://www.academia.edu/71273197/Control_of_a_Reverse_Osmosis_plant_by_using_a_robust_PID_design_based_on_multi_objective_optimization?f_ri=143163","dom_id":"work_71273197","summary":null,"downloadable_attachments":[{"id":80689000,"asset_id":71273197,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":529893,"first_name":"Adrian","last_name":"Gambier","domain_name":"independent","page_name":"AdrianGambier","display_name":"Adrian Gambier","profile_url":"https://independent.academia.edu/AdrianGambier?f_ri=143163","photo":"https://0.academia-photos.com/529893/188247/19676806/s65_elrenegau.gambier.jpg"}],"research_interests":[{"id":15344,"name":"Robust control","url":"https://www.academia.edu/Documents/in/Robust_control?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":249165,"name":"Pid Controller","url":"https://www.academia.edu/Documents/in/Pid_Controller?f_ri=143163","nofollow":false},{"id":276273,"name":"Reverse osmosis","url":"https://www.academia.edu/Documents/in/Reverse_osmosis?f_ri=143163","nofollow":false},{"id":477865,"name":"Operant Conditioning","url":"https://www.academia.edu/Documents/in/Operant_Conditioning?f_ri=143163"},{"id":898062,"name":"Flow Rate","url":"https://www.academia.edu/Documents/in/Flow_Rate?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_68069817" data-work_id="68069817" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/68069817/Optimizing_Brain_Networks_Topologies_Using_Multi_objective_Evolutionary_Computation">Optimizing Brain Networks Topologies Using Multi-objective Evolutionary Computation</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">The analysis of brain network topological features has served to better understand these networks and reveal particular characteristics of their functional behavior. The distribution of brain network motifs is particularly useful for... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_68069817" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">The analysis of brain network topological features has served to better understand these networks and reveal particular characteristics of their functional behavior. The distribution of brain network motifs is particularly useful for detecting and describing differences between brain networks and random and computationally optimized artificial networks. In this paper we use a multi-objective evolutionary optimization approach to generate optimized artificial</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/68069817" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="6d1b235c4bbcf09d5efdc550ced1bf94" rel="nofollow" data-download="{"attachment_id":78679212,"asset_id":68069817,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78679212/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33605072" href="https://independent.academia.edu/ConchaBielza">Concha Bielza</a><script data-card-contents-for-user="33605072" type="text/json">{"id":33605072,"first_name":"Concha","last_name":"Bielza","domain_name":"independent","page_name":"ConchaBielza","display_name":"Concha Bielza","profile_url":"https://independent.academia.edu/ConchaBielza?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_68069817 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="68069817"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 68069817, container: ".js-paper-rank-work_68069817", }); });</script></li><li class="js-percentile-work_68069817 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 68069817; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_68069817"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_68069817 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="68069817"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 68069817; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=68069817]").text(description); $(".js-view-count-work_68069817").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_68069817").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="68069817"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">16</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="428" href="https://www.academia.edu/Documents/in/Algorithms">Algorithms</a>, <script data-card-contents-for-ri="428" type="text/json">{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4492" href="https://www.academia.edu/Documents/in/Neuroinformatics">Neuroinformatics</a>, <script data-card-contents-for-ri="4492" type="text/json">{"id":4492,"name":"Neuroinformatics","url":"https://www.academia.edu/Documents/in/Neuroinformatics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="49646" href="https://www.academia.edu/Documents/in/Protein_Structure_and_Function">Protein Structure and Function</a>, <script data-card-contents-for-ri="49646" type="text/json">{"id":49646,"name":"Protein Structure and Function","url":"https://www.academia.edu/Documents/in/Protein_Structure_and_Function?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=68069817]'), work: {"id":68069817,"title":"Optimizing Brain Networks Topologies Using Multi-objective Evolutionary Computation","created_at":"2022-01-14T01:19:40.039-08:00","url":"https://www.academia.edu/68069817/Optimizing_Brain_Networks_Topologies_Using_Multi_objective_Evolutionary_Computation?f_ri=143163","dom_id":"work_68069817","summary":"The analysis of brain network topological features has served to better understand these networks and reveal particular characteristics of their functional behavior. The distribution of brain network motifs is particularly useful for detecting and describing differences between brain networks and random and computationally optimized artificial networks. In this paper we use a multi-objective evolutionary optimization approach to generate optimized artificial","downloadable_attachments":[{"id":78679212,"asset_id":68069817,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33605072,"first_name":"Concha","last_name":"Bielza","domain_name":"independent","page_name":"ConchaBielza","display_name":"Concha Bielza","profile_url":"https://independent.academia.edu/ConchaBielza?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms?f_ri=143163","nofollow":false},{"id":4492,"name":"Neuroinformatics","url":"https://www.academia.edu/Documents/in/Neuroinformatics?f_ri=143163","nofollow":false},{"id":49646,"name":"Protein Structure and Function","url":"https://www.academia.edu/Documents/in/Protein_Structure_and_Function?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":252813,"name":"Evolutionary Computing","url":"https://www.academia.edu/Documents/in/Evolutionary_Computing?f_ri=143163"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163"},{"id":320532,"name":"Clustering Coefficient","url":"https://www.academia.edu/Documents/in/Clustering_Coefficient?f_ri=143163"},{"id":320533,"name":"Average Path Length","url":"https://www.academia.edu/Documents/in/Average_Path_Length?f_ri=143163"},{"id":320536,"name":"Random Networks","url":"https://www.academia.edu/Documents/in/Random_Networks?f_ri=143163"},{"id":401305,"name":"Betweenness Centrality","url":"https://www.academia.edu/Documents/in/Betweenness_Centrality?f_ri=143163"},{"id":539410,"name":"Network Topology","url":"https://www.academia.edu/Documents/in/Network_Topology?f_ri=143163"},{"id":555139,"name":"Evolutionary optimization","url":"https://www.academia.edu/Documents/in/Evolutionary_optimization?f_ri=143163"},{"id":1239755,"name":"Neurosciences","url":"https://www.academia.edu/Documents/in/Neurosciences?f_ri=143163"},{"id":1681026,"name":"Biochemistry and cell biology","url":"https://www.academia.edu/Documents/in/Biochemistry_and_cell_biology?f_ri=143163"},{"id":2533240,"name":"optimal algorithm","url":"https://www.academia.edu/Documents/in/optimal_algorithm?f_ri=143163"},{"id":2895323,"name":"Topological Complexity","url":"https://www.academia.edu/Documents/in/Topological_Complexity?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_57565920" data-work_id="57565920" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/57565920/An_adaptive_multi_population_genetic_algorithm_to_solve_the_multi_objective_group_scheduling_problem_in_hybrid_flexible_flowshop_with_sequence_dependent_setup_times">An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/57565920" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3a0ec8e65e4b245eb6b2ffa7a8184dfc" rel="nofollow" data-download="{"attachment_id":72405912,"asset_id":57565920,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/72405912/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="50019258" href="https://independent.academia.edu/MostafaZandieh">Mostafa Zandieh</a><script data-card-contents-for-user="50019258" type="text/json">{"id":50019258,"first_name":"Mostafa","last_name":"Zandieh","domain_name":"independent","page_name":"MostafaZandieh","display_name":"Mostafa Zandieh","profile_url":"https://independent.academia.edu/MostafaZandieh?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_57565920 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="57565920"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 57565920, container: ".js-paper-rank-work_57565920", }); });</script></li><li class="js-percentile-work_57565920 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 57565920; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_57565920"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_57565920 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="57565920"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 57565920; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=57565920]").text(description); $(".js-view-count-work_57565920").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_57565920").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="57565920"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">8</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="4480" href="https://www.academia.edu/Documents/in/Population_Genetics">Population Genetics</a>, <script data-card-contents-for-ri="4480" type="text/json">{"id":4480,"name":"Population Genetics","url":"https://www.academia.edu/Documents/in/Population_Genetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="46604" href="https://www.academia.edu/Documents/in/Intelligent_Manufacturing">Intelligent Manufacturing</a>, <script data-card-contents-for-ri="46604" type="text/json">{"id":46604,"name":"Intelligent Manufacturing","url":"https://www.academia.edu/Documents/in/Intelligent_Manufacturing?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="96825" href="https://www.academia.edu/Documents/in/Manufacturing_Engineering">Manufacturing Engineering</a><script data-card-contents-for-ri="96825" type="text/json">{"id":96825,"name":"Manufacturing Engineering","url":"https://www.academia.edu/Documents/in/Manufacturing_Engineering?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=57565920]'), work: {"id":57565920,"title":"An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times","created_at":"2021-10-13T09:23:21.243-07:00","url":"https://www.academia.edu/57565920/An_adaptive_multi_population_genetic_algorithm_to_solve_the_multi_objective_group_scheduling_problem_in_hybrid_flexible_flowshop_with_sequence_dependent_setup_times?f_ri=143163","dom_id":"work_57565920","summary":null,"downloadable_attachments":[{"id":72405912,"asset_id":57565920,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":50019258,"first_name":"Mostafa","last_name":"Zandieh","domain_name":"independent","page_name":"MostafaZandieh","display_name":"Mostafa Zandieh","profile_url":"https://independent.academia.edu/MostafaZandieh?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":4480,"name":"Population Genetics","url":"https://www.academia.edu/Documents/in/Population_Genetics?f_ri=143163","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":46604,"name":"Intelligent Manufacturing","url":"https://www.academia.edu/Documents/in/Intelligent_Manufacturing?f_ri=143163","nofollow":false},{"id":96825,"name":"Manufacturing Engineering","url":"https://www.academia.edu/Documents/in/Manufacturing_Engineering?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":357520,"name":"Non-dominated Sorting Genetic Algorithm-II (NSGA-II)","url":"https://www.academia.edu/Documents/in/Non-dominated_Sorting_Genetic_Algorithm-II_NSGA-II_?f_ri=143163"},{"id":1450944,"name":"Multi objective genetic algorithm optimisation","url":"https://www.academia.edu/Documents/in/Multi_objective_genetic_algorithm_optimisation?f_ri=143163"},{"id":1688405,"name":"Setup Time","url":"https://www.academia.edu/Documents/in/Setup_Time?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_71646558" data-work_id="71646558" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/71646558/Multi_objective_optimization_of_planetary_gear_train">Multi objective optimization of planetary gear train</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/71646558" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="690a9f28fe1cc84279fa298408165b5e" rel="nofollow" data-download="{"attachment_id":80901994,"asset_id":71646558,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80901994/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="190256747" href="https://independent.academia.edu/vipintripathi21">vipin tripathi</a><script data-card-contents-for-user="190256747" type="text/json">{"id":190256747,"first_name":"vipin","last_name":"tripathi","domain_name":"independent","page_name":"vipintripathi21","display_name":"vipin tripathi","profile_url":"https://independent.academia.edu/vipintripathi21?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_71646558 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="71646558"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 71646558, container: ".js-paper-rank-work_71646558", }); });</script></li><li class="js-percentile-work_71646558 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 71646558; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_71646558"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_71646558 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="71646558"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 71646558; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=71646558]").text(description); $(".js-view-count-work_71646558").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_71646558").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="71646558"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="395968" href="https://www.academia.edu/Documents/in/Minimal_surface_Structures">Minimal surface Structures</a>, <script data-card-contents-for-ri="395968" type="text/json">{"id":395968,"name":"Minimal surface Structures","url":"https://www.academia.edu/Documents/in/Minimal_surface_Structures?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="679783" href="https://www.academia.edu/Documents/in/Boolean_Satisfiability">Boolean Satisfiability</a><script data-card-contents-for-ri="679783" type="text/json">{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=71646558]'), work: {"id":71646558,"title":"Multi objective optimization of planetary gear train","created_at":"2022-02-15T18:14:59.836-08:00","url":"https://www.academia.edu/71646558/Multi_objective_optimization_of_planetary_gear_train?f_ri=143163","dom_id":"work_71646558","summary":null,"downloadable_attachments":[{"id":80901994,"asset_id":71646558,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":190256747,"first_name":"vipin","last_name":"tripathi","domain_name":"independent","page_name":"vipintripathi21","display_name":"vipin tripathi","profile_url":"https://independent.academia.edu/vipintripathi21?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":395968,"name":"Minimal surface Structures","url":"https://www.academia.edu/Documents/in/Minimal_surface_Structures?f_ri=143163","nofollow":false},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163","nofollow":false},{"id":862722,"name":"Fatigue Life","url":"https://www.academia.edu/Documents/in/Fatigue_Life?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_480777" data-work_id="480777" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/480777/E_s2_optimal_and_minimax_optimal_cyclic_supersaturated_designs_via_multi_objective_simulated_annealing">E (s2)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/480777" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="507cb92c5a70bcdeafb350b3dd5571b6" rel="nofollow" data-download="{"attachment_id":51391783,"asset_id":480777,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/51391783/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="368027" href="https://ntua.academia.edu/DimitrisSimos">Dimitris Simos</a><script data-card-contents-for-user="368027" type="text/json">{"id":368027,"first_name":"Dimitris","last_name":"Simos","domain_name":"ntua","page_name":"DimitrisSimos","display_name":"Dimitris Simos","profile_url":"https://ntua.academia.edu/DimitrisSimos?f_ri=143163","photo":"https://0.academia-photos.com/368027/113038/132804/s65_dimitris.simos.jpg"}</script></span></span></li><li class="js-paper-rank-work_480777 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="480777"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 480777, container: ".js-paper-rank-work_480777", }); });</script></li><li class="js-percentile-work_480777 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 480777; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_480777"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_480777 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="480777"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 480777; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=480777]").text(description); $(".js-view-count-work_480777").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_480777").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="480777"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">13</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="892" href="https://www.academia.edu/Documents/in/Statistics">Statistics</a>, <script data-card-contents-for-ri="892" type="text/json">{"id":892,"name":"Statistics","url":"https://www.academia.edu/Documents/in/Statistics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1410" href="https://www.academia.edu/Documents/in/Information_Theory">Information Theory</a>, <script data-card-contents-for-ri="1410" type="text/json">{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6421" href="https://www.academia.edu/Documents/in/Simulated_Annealing">Simulated Annealing</a>, <script data-card-contents-for-ri="6421" type="text/json">{"id":6421,"name":"Simulated Annealing","url":"https://www.academia.edu/Documents/in/Simulated_Annealing?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="21747" href="https://www.academia.edu/Documents/in/Experimental_Design">Experimental Design</a><script data-card-contents-for-ri="21747" type="text/json">{"id":21747,"name":"Experimental Design","url":"https://www.academia.edu/Documents/in/Experimental_Design?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=480777]'), work: {"id":480777,"title":"E (s2)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing","created_at":"2011-03-18T10:56:32.789-07:00","url":"https://www.academia.edu/480777/E_s2_optimal_and_minimax_optimal_cyclic_supersaturated_designs_via_multi_objective_simulated_annealing?f_ri=143163","dom_id":"work_480777","summary":null,"downloadable_attachments":[{"id":51391783,"asset_id":480777,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":368027,"first_name":"Dimitris","last_name":"Simos","domain_name":"ntua","page_name":"DimitrisSimos","display_name":"Dimitris Simos","profile_url":"https://ntua.academia.edu/DimitrisSimos?f_ri=143163","photo":"https://0.academia-photos.com/368027/113038/132804/s65_dimitris.simos.jpg"}],"research_interests":[{"id":892,"name":"Statistics","url":"https://www.academia.edu/Documents/in/Statistics?f_ri=143163","nofollow":false},{"id":1410,"name":"Information Theory","url":"https://www.academia.edu/Documents/in/Information_Theory?f_ri=143163","nofollow":false},{"id":6421,"name":"Simulated Annealing","url":"https://www.academia.edu/Documents/in/Simulated_Annealing?f_ri=143163","nofollow":false},{"id":21747,"name":"Experimental Design","url":"https://www.academia.edu/Documents/in/Experimental_Design?f_ri=143163","nofollow":false},{"id":25660,"name":"Decision Theory","url":"https://www.academia.edu/Documents/in/Decision_Theory?f_ri=143163"},{"id":61386,"name":"Metaheuristics","url":"https://www.academia.edu/Documents/in/Metaheuristics?f_ri=143163"},{"id":107374,"name":"Factorial Design","url":"https://www.academia.edu/Documents/in/Factorial_Design?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":571143,"name":"Lower Bound","url":"https://www.academia.edu/Documents/in/Lower_Bound?f_ri=143163"},{"id":673665,"name":"Statistical Theory","url":"https://www.academia.edu/Documents/in/Statistical_Theory?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":1256385,"name":"Information Value","url":"https://www.academia.edu/Documents/in/Information_Value?f_ri=143163"},{"id":2038834,"name":"Factorial designs","url":"https://www.academia.edu/Documents/in/Factorial_designs?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19855540 coauthored" data-work_id="19855540" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19855540/Analysis_and_optimization_of_C3_photosynthetic_carbon_metabolism">Analysis and optimization of C3 photosynthetic carbon metabolism</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19855540" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c45fc4bf915bece95ced78dd19c7d901" rel="nofollow" data-download="{"attachment_id":40881807,"asset_id":19855540,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40881807/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40650185" href="https://independent.academia.edu/AlessioPapini">Alessio Papini</a><script data-card-contents-for-user="40650185" type="text/json">{"id":40650185,"first_name":"Alessio","last_name":"Papini","domain_name":"independent","page_name":"AlessioPapini","display_name":"Alessio Papini","profile_url":"https://independent.academia.edu/AlessioPapini?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-19855540">+1</span><div class="hidden js-additional-users-19855540"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://cambridge.academia.edu/GiuseppeNicosia">Giuseppe Nicosia</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-19855540'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-19855540').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_19855540 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19855540"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19855540, container: ".js-paper-rank-work_19855540", }); });</script></li><li class="js-percentile-work_19855540 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19855540; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19855540"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19855540 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19855540"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19855540; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19855540]").text(description); $(".js-view-count-work_19855540").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19855540").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19855540"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">9</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="20099" href="https://www.academia.edu/Documents/in/Sensitivity_Analysis">Sensitivity Analysis</a>, <script data-card-contents-for-ri="20099" type="text/json">{"id":20099,"name":"Sensitivity Analysis","url":"https://www.academia.edu/Documents/in/Sensitivity_Analysis?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="151091" href="https://www.academia.edu/Documents/in/Nitrogen">Nitrogen</a>, <script data-card-contents-for-ri="151091" type="text/json">{"id":151091,"name":"Nitrogen","url":"https://www.academia.edu/Documents/in/Nitrogen?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="231661" href="https://www.academia.edu/Documents/in/Enzyme">Enzyme</a><script data-card-contents-for-ri="231661" type="text/json">{"id":231661,"name":"Enzyme","url":"https://www.academia.edu/Documents/in/Enzyme?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19855540]'), work: {"id":19855540,"title":"Analysis and optimization of C3 photosynthetic carbon metabolism","created_at":"2015-12-27T12:37:06.205-08:00","url":"https://www.academia.edu/19855540/Analysis_and_optimization_of_C3_photosynthetic_carbon_metabolism?f_ri=143163","dom_id":"work_19855540","summary":null,"downloadable_attachments":[{"id":40881807,"asset_id":19855540,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":40650185,"first_name":"Alessio","last_name":"Papini","domain_name":"independent","page_name":"AlessioPapini","display_name":"Alessio Papini","profile_url":"https://independent.academia.edu/AlessioPapini?f_ri=143163","photo":"/images/s65_no_pic.png"},{"id":35764061,"first_name":"Giuseppe","last_name":"Nicosia","domain_name":"cambridge","page_name":"GiuseppeNicosia","display_name":"Giuseppe Nicosia","profile_url":"https://cambridge.academia.edu/GiuseppeNicosia?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":20099,"name":"Sensitivity Analysis","url":"https://www.academia.edu/Documents/in/Sensitivity_Analysis?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":151091,"name":"Nitrogen","url":"https://www.academia.edu/Documents/in/Nitrogen?f_ri=143163","nofollow":false},{"id":231661,"name":"Enzyme","url":"https://www.academia.edu/Documents/in/Enzyme?f_ri=143163","nofollow":false},{"id":453116,"name":"Line Search Derivative Free Optimization","url":"https://www.academia.edu/Documents/in/Line_Search_Derivative_Free_Optimization?f_ri=143163"},{"id":490116,"name":"Carbon Metabolism","url":"https://www.academia.edu/Documents/in/Carbon_Metabolism?f_ri=143163"},{"id":884520,"name":"Photosynthetic Rate","url":"https://www.academia.edu/Documents/in/Photosynthetic_Rate?f_ri=143163"},{"id":962638,"name":"High Sensitivity","url":"https://www.academia.edu/Documents/in/High_Sensitivity?f_ri=143163"},{"id":1912509,"name":"Production Rate","url":"https://www.academia.edu/Documents/in/Production_Rate?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_1118777" data-work_id="1118777" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/1118777/Optimal_Distributed_Generation_placement_in_a_restructured_environment_via_a_multi_objective_optimization_approach">Optimal Distributed Generation placement in a restructured environment via a multi-objective optimization approach</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/1118777" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="70477d24a82054b7fa948c843748e101" rel="nofollow" data-download="{"attachment_id":12694077,"asset_id":1118777,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/12694077/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="986789" href="https://tamu.academia.edu/PaymanDehghanian">Payman Dehghanian</a><script data-card-contents-for-user="986789" type="text/json">{"id":986789,"first_name":"Payman","last_name":"Dehghanian","domain_name":"tamu","page_name":"PaymanDehghanian","display_name":"Payman Dehghanian","profile_url":"https://tamu.academia.edu/PaymanDehghanian?f_ri=143163","photo":"https://0.academia-photos.com/986789/1155930/1447623/s65_payman.dehghanian.jpg"}</script></span></span></li><li class="js-paper-rank-work_1118777 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="1118777"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 1118777, container: ".js-paper-rank-work_1118777", }); });</script></li><li class="js-percentile-work_1118777 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 1118777; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_1118777"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_1118777 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="1118777"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 1118777; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=1118777]").text(description); $(".js-view-count-work_1118777").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_1118777").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="1118777"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">9</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5748" href="https://www.academia.edu/Documents/in/Power_System">Power System</a>, <script data-card-contents-for-ri="5748" type="text/json">{"id":5748,"name":"Power System","url":"https://www.academia.edu/Documents/in/Power_System?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="22686" href="https://www.academia.edu/Documents/in/Distributed_System">Distributed System</a>, <script data-card-contents-for-ri="22686" type="text/json">{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="123410" href="https://www.academia.edu/Documents/in/Generation_Expansion_Planning">Generation Expansion Planning</a>, <script data-card-contents-for-ri="123410" type="text/json">{"id":123410,"name":"Generation Expansion Planning","url":"https://www.academia.edu/Documents/in/Generation_Expansion_Planning?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=1118777]'), work: {"id":1118777,"title":"Optimal Distributed Generation placement in a restructured environment via a multi-objective optimization approach","created_at":"2011-11-27T03:50:04.301-08:00","url":"https://www.academia.edu/1118777/Optimal_Distributed_Generation_placement_in_a_restructured_environment_via_a_multi_objective_optimization_approach?f_ri=143163","dom_id":"work_1118777","summary":null,"downloadable_attachments":[{"id":12694077,"asset_id":1118777,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":986789,"first_name":"Payman","last_name":"Dehghanian","domain_name":"tamu","page_name":"PaymanDehghanian","display_name":"Payman Dehghanian","profile_url":"https://tamu.academia.edu/PaymanDehghanian?f_ri=143163","photo":"https://0.academia-photos.com/986789/1155930/1447623/s65_payman.dehghanian.jpg"}],"research_interests":[{"id":5748,"name":"Power System","url":"https://www.academia.edu/Documents/in/Power_System?f_ri=143163","nofollow":false},{"id":22686,"name":"Distributed System","url":"https://www.academia.edu/Documents/in/Distributed_System?f_ri=143163","nofollow":false},{"id":123410,"name":"Generation Expansion Planning","url":"https://www.academia.edu/Documents/in/Generation_Expansion_Planning?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":647249,"name":"Electric Power","url":"https://www.academia.edu/Documents/in/Electric_Power?f_ri=143163"},{"id":749302,"name":"Indexation","url":"https://www.academia.edu/Documents/in/Indexation?f_ri=143163"},{"id":860428,"name":"Distributed Generators","url":"https://www.academia.edu/Documents/in/Distributed_Generators?f_ri=143163"},{"id":886971,"name":"Electricity Generation","url":"https://www.academia.edu/Documents/in/Electricity_Generation?f_ri=143163"},{"id":1646121,"name":"Operation and Maintenance","url":"https://www.academia.edu/Documents/in/Operation_and_Maintenance?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70317627 coauthored" data-work_id="70317627" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/70317627/Improved_normal_boundary_intersection_algorithm_A_method_for_energy_optimization_strategy_in_smart_buildings">Improved normal-boundary intersection algorithm: A method for energy optimization strategy in smart buildings</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">With the widespread use of distributed energy sources, the advantages of smart buildings over traditional buildings are becoming increasingly obvious. Subsequently, its energy optimal scheduling and multi-objective optimization have... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_70317627" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">With the widespread use of distributed energy sources, the advantages of smart buildings over traditional buildings are becoming increasingly obvious. Subsequently, its energy optimal scheduling and multi-objective optimization have become more and more complex and need to be solved urgently. This paper presents a novel method to optimize energy utilization in smart buildings. Firstly, multiple transfer-retention ratio (TRR) parameters are added to the evaluation of distributed renewable energy. Secondly, the normal-boundary intersection (NBI) algorithm is improved by the adaptive weight sum, the adjust uniform axes method, and Mahalanobis distance to form the improved normal-boundary intersection (INBI) algorithm. The multi-objective optimization problem in smart buildings is solved by the parameter TRR and INBI algorithm to improve the regulation efficiency. In response to the needs of decision-makers with evaluation indicators, the average deviation is reduced by 60% compared with the previous case. Numerical examples show that the proposed method is superior to the existing technologies in terms of three optimization objectives. The objectives include 8.2% reduction in equipment costs, 7.6% reduction in power supply costs, and 1.6% improvement in occupants' comfort.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70317627" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="71593ef2263aed5237db48c305da18c3" rel="nofollow" data-download="{"attachment_id":80120466,"asset_id":70317627,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/80120466/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="89972269" href="https://anl.academia.edu/YangLi">Yang Li</a><script data-card-contents-for-user="89972269" type="text/json">{"id":89972269,"first_name":"Yang","last_name":"Li","domain_name":"anl","page_name":"YangLi","display_name":"Yang Li","profile_url":"https://anl.academia.edu/YangLi?f_ri=143163","photo":"https://0.academia-photos.com/89972269/20398629/20070445/s65_yang.li.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-70317627">+1</span><div class="hidden js-additional-users-70317627"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/MartinOnyekaOkoye">Martin Onyeka Okoye</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-70317627'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-70317627').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_70317627 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70317627"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70317627, container: ".js-paper-rank-work_70317627", }); });</script></li><li class="js-percentile-work_70317627 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70317627; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70317627"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70317627 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70317627"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70317627; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70317627]").text(description); $(".js-view-count-work_70317627").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70317627").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70317627"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2738" href="https://www.academia.edu/Documents/in/Renewable_Energy">Renewable Energy</a>, <script data-card-contents-for-ri="2738" type="text/json">{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3853" href="https://www.academia.edu/Documents/in/Optimization_Mathematics_">Optimization (Mathematics)</a>, <script data-card-contents-for-ri="3853" type="text/json">{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9048" href="https://www.academia.edu/Documents/in/Scheduling">Scheduling</a>, <script data-card-contents-for-ri="9048" type="text/json">{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70317627]'), work: {"id":70317627,"title":"Improved normal-boundary intersection algorithm: A method for energy optimization strategy in smart buildings","created_at":"2022-02-03T04:49:46.436-08:00","url":"https://www.academia.edu/70317627/Improved_normal_boundary_intersection_algorithm_A_method_for_energy_optimization_strategy_in_smart_buildings?f_ri=143163","dom_id":"work_70317627","summary":"With the widespread use of distributed energy sources, the advantages of smart buildings over traditional buildings are becoming increasingly obvious. Subsequently, its energy optimal scheduling and multi-objective optimization have become more and more complex and need to be solved urgently. This paper presents a novel method to optimize energy utilization in smart buildings. Firstly, multiple transfer-retention ratio (TRR) parameters are added to the evaluation of distributed renewable energy. Secondly, the normal-boundary intersection (NBI) algorithm is improved by the adaptive weight sum, the adjust uniform axes method, and Mahalanobis distance to form the improved normal-boundary intersection (INBI) algorithm. The multi-objective optimization problem in smart buildings is solved by the parameter TRR and INBI algorithm to improve the regulation efficiency. In response to the needs of decision-makers with evaluation indicators, the average deviation is reduced by 60% compared with the previous case. Numerical examples show that the proposed method is superior to the existing technologies in terms of three optimization objectives. The objectives include 8.2% reduction in equipment costs, 7.6% reduction in power supply costs, and 1.6% improvement in occupants' comfort.","downloadable_attachments":[{"id":80120466,"asset_id":70317627,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":89972269,"first_name":"Yang","last_name":"Li","domain_name":"anl","page_name":"YangLi","display_name":"Yang Li","profile_url":"https://anl.academia.edu/YangLi?f_ri=143163","photo":"https://0.academia-photos.com/89972269/20398629/20070445/s65_yang.li.jpg"},{"id":214490430,"first_name":"Martin Onyeka","last_name":"Okoye","domain_name":"independent","page_name":"MartinOnyekaOkoye","display_name":"Martin Onyeka Okoye","profile_url":"https://independent.academia.edu/MartinOnyekaOkoye?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_?f_ri=143163","nofollow":false},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":1089548,"name":"Normal Boundary Intersection","url":"https://www.academia.edu/Documents/in/Normal_Boundary_Intersection?f_ri=143163"},{"id":1147464,"name":"Smart Buildings","url":"https://www.academia.edu/Documents/in/Smart_Buildings?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11149149" data-work_id="11149149" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11149149/A_multi_objective_approach_for_the_prediction_of_loan_defaults">A multi-objective approach for the prediction of loan defaults</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made, and conventional optimization routines/models are... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_11149149" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made, and conventional optimization routines/models are incapable of handling the problems. This study applies the Fuzzy Simplex Generic Algorithm (a multi-objective optimization algorithm) in generating decision rules for predicting loan default in a typical credit institution. Empirical results show that the best indicators of default status are observed when repayment capacity and owners equity are low and the working capital is either low or high. Also, the two worst rule indicators are low repayment capacity, high owners’ equity and medium working capital or medium repayment capacity, low owners’ equity and high working capital.► We examine the difficulty of optimizing multiple goals in credit default forecast. ► This is problematic when competing decisions are being simultaneously optimized. ► Fuzzy Simplex Generic Algorithm is used to generate rules to predict loan defaults. ► The best indicator is low repayment capacity, owners’ equity, and working capital.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11149149" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b582c3d3f9e0da48598fa6c2343634ba" rel="nofollow" data-download="{"attachment_id":46858692,"asset_id":11149149,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46858692/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="26916147" href="https://independent.academia.edu/sanjoydas15">sanjoy das</a><script data-card-contents-for-user="26916147" type="text/json">{"id":26916147,"first_name":"sanjoy","last_name":"das","domain_name":"independent","page_name":"sanjoydas15","display_name":"sanjoy das","profile_url":"https://independent.academia.edu/sanjoydas15?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_11149149 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11149149"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11149149, container: ".js-paper-rank-work_11149149", }); });</script></li><li class="js-percentile-work_11149149 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11149149; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11149149"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11149149 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11149149"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11149149; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11149149]").text(description); $(".js-view-count-work_11149149").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11149149").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11149149"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">9</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="7968" href="https://www.academia.edu/Documents/in/Prediction">Prediction</a>, <script data-card-contents-for-ri="7968" type="text/json">{"id":7968,"name":"Prediction","url":"https://www.academia.edu/Documents/in/Prediction?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="26066" href="https://www.academia.edu/Documents/in/Neural_Network">Neural Network</a>, <script data-card-contents-for-ri="26066" type="text/json">{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="27010" href="https://www.academia.edu/Documents/in/Fuzzy_Inference">Fuzzy Inference</a>, <script data-card-contents-for-ri="27010" type="text/json">{"id":27010,"name":"Fuzzy Inference","url":"https://www.academia.edu/Documents/in/Fuzzy_Inference?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11149149]'), work: {"id":11149149,"title":"A multi-objective approach for the prediction of loan defaults","created_at":"2015-02-27T11:13:13.548-08:00","url":"https://www.academia.edu/11149149/A_multi_objective_approach_for_the_prediction_of_loan_defaults?f_ri=143163","dom_id":"work_11149149","summary":"Credit institutions are seldom faced with problems dealing with single objectives. Often, decisions involving optimizing two or more competing goals simultaneously need to be made, and conventional optimization routines/models are incapable of handling the problems. This study applies the Fuzzy Simplex Generic Algorithm (a multi-objective optimization algorithm) in generating decision rules for predicting loan default in a typical credit institution. Empirical results show that the best indicators of default status are observed when repayment capacity and owners equity are low and the working capital is either low or high. Also, the two worst rule indicators are low repayment capacity, high owners’ equity and medium working capital or medium repayment capacity, low owners’ equity and high working capital.► We examine the difficulty of optimizing multiple goals in credit default forecast. ► This is problematic when competing decisions are being simultaneously optimized. ► Fuzzy Simplex Generic Algorithm is used to generate rules to predict loan defaults. ► The best indicator is low repayment capacity, owners’ equity, and working capital.","downloadable_attachments":[{"id":46858692,"asset_id":11149149,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":26916147,"first_name":"sanjoy","last_name":"das","domain_name":"independent","page_name":"sanjoydas15","display_name":"sanjoy das","profile_url":"https://independent.academia.edu/sanjoydas15?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":7968,"name":"Prediction","url":"https://www.academia.edu/Documents/in/Prediction?f_ri=143163","nofollow":false},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=143163","nofollow":false},{"id":27010,"name":"Fuzzy Inference","url":"https://www.academia.edu/Documents/in/Fuzzy_Inference?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":32433,"name":"Logistic Regression","url":"https://www.academia.edu/Documents/in/Logistic_Regression?f_ri=143163"},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":446579,"name":"Loan Default","url":"https://www.academia.edu/Documents/in/Loan_Default?f_ri=143163"},{"id":555139,"name":"Evolutionary optimization","url":"https://www.academia.edu/Documents/in/Evolutionary_optimization?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_62725662" data-work_id="62725662" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/62725662/Preference_Based_Multi_objective_Software_Modelling">Preference-Based Multi-objective Software Modelling</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">In this paper, we propose the use of preference-based evolutionary multi-objective optimization techniques (P-EMO) to address various software modelling challenges. P-EMO allows the incorporation of decision maker (i.e., designer)... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_62725662" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">In this paper, we propose the use of preference-based evolutionary multi-objective optimization techniques (P-EMO) to address various software modelling challenges. P-EMO allows the incorporation of decision maker (i.e., designer) preferences (e.g., quality, correctness, etc.) in multi-objective optimization techniques by restricting the Pareto front to a region of interest easing the decision making task. We discuss the different challenges and potential benefits of P-EMO in software modelling. We report experiments on the use of P-EMO on a well-known modeling problem where very promising results are obtained.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/62725662" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="95b007dc080babb9a4ded9fdc608fdae" rel="nofollow" data-download="{"attachment_id":75397175,"asset_id":62725662,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/75397175/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="41000372" href="https://rit.academia.edu/MohamedWiemMkaouer">Mohamed Wiem Mkaouer</a><script data-card-contents-for-user="41000372" type="text/json">{"id":41000372,"first_name":"Mohamed Wiem","last_name":"Mkaouer","domain_name":"rit","page_name":"MohamedWiemMkaouer","display_name":"Mohamed Wiem Mkaouer","profile_url":"https://rit.academia.edu/MohamedWiemMkaouer?f_ri=143163","photo":"https://0.academia-photos.com/41000372/23662621/22698059/s65_mohamed_wiem.mkaouer.jpg"}</script></span></span></li><li class="js-paper-rank-work_62725662 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="62725662"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 62725662, container: ".js-paper-rank-work_62725662", }); });</script></li><li class="js-percentile-work_62725662 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 62725662; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_62725662"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_62725662 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="62725662"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 62725662; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=62725662]").text(description); $(".js-view-count-work_62725662").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_62725662").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="62725662"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">12</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="449" href="https://www.academia.edu/Documents/in/Software_Engineering">Software Engineering</a>, <script data-card-contents-for-ri="449" type="text/json">{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2950" href="https://www.academia.edu/Documents/in/Computational_Modeling">Computational Modeling</a>, <script data-card-contents-for-ri="2950" type="text/json">{"id":2950,"name":"Computational Modeling","url":"https://www.academia.edu/Documents/in/Computational_Modeling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3523" href="https://www.academia.edu/Documents/in/Evolutionary_Computation">Evolutionary Computation</a>, <script data-card-contents-for-ri="3523" type="text/json">{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="13445" href="https://www.academia.edu/Documents/in/Multiobjective_Optimization">Multiobjective Optimization</a><script data-card-contents-for-ri="13445" type="text/json">{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=62725662]'), work: {"id":62725662,"title":"Preference-Based Multi-objective Software Modelling","created_at":"2021-11-29T15:47:24.731-08:00","url":"https://www.academia.edu/62725662/Preference_Based_Multi_objective_Software_Modelling?f_ri=143163","dom_id":"work_62725662","summary":"In this paper, we propose the use of preference-based evolutionary multi-objective optimization techniques (P-EMO) to address various software modelling challenges. P-EMO allows the incorporation of decision maker (i.e., designer) preferences (e.g., quality, correctness, etc.) in multi-objective optimization techniques by restricting the Pareto front to a region of interest easing the decision making task. We discuss the different challenges and potential benefits of P-EMO in software modelling. We report experiments on the use of P-EMO on a well-known modeling problem where very promising results are obtained.","downloadable_attachments":[{"id":75397175,"asset_id":62725662,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":41000372,"first_name":"Mohamed Wiem","last_name":"Mkaouer","domain_name":"rit","page_name":"MohamedWiemMkaouer","display_name":"Mohamed Wiem Mkaouer","profile_url":"https://rit.academia.edu/MohamedWiemMkaouer?f_ri=143163","photo":"https://0.academia-photos.com/41000372/23662621/22698059/s65_mohamed_wiem.mkaouer.jpg"}],"research_interests":[{"id":449,"name":"Software Engineering","url":"https://www.academia.edu/Documents/in/Software_Engineering?f_ri=143163","nofollow":false},{"id":2950,"name":"Computational Modeling","url":"https://www.academia.edu/Documents/in/Computational_Modeling?f_ri=143163","nofollow":false},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization?f_ri=143163","nofollow":false},{"id":39821,"name":"Search Based Software Engineering","url":"https://www.academia.edu/Documents/in/Search_Based_Software_Engineering?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":78326,"name":"Software modelling and simulation","url":"https://www.academia.edu/Documents/in/Software_modelling_and_simulation?f_ri=143163"},{"id":96446,"name":"Measurement","url":"https://www.academia.edu/Documents/in/Measurement?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":147488,"name":"Consumer Preferences","url":"https://www.academia.edu/Documents/in/Consumer_Preferences?f_ri=143163"},{"id":570997,"name":"Pareto front","url":"https://www.academia.edu/Documents/in/Pareto_front?f_ri=143163"},{"id":575013,"name":"NSGA II","url":"https://www.academia.edu/Documents/in/NSGA_II?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11692337" data-work_id="11692337" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11692337/Optimum_analysis_of_pavement_maintenance_using_multi_objective_genetic_algorithms">Optimum analysis of pavement maintenance using multi-objective genetic algorithms</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11692337" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5595f0a1dc840175a4bcdecb0c1a2cd6" rel="nofollow" data-download="{"attachment_id":46572385,"asset_id":11692337,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46572385/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="28629715" href="https://icmap.academia.edu/MohammadAmmar">Mohammad Ammar</a><script data-card-contents-for-user="28629715" type="text/json">{"id":28629715,"first_name":"Mohammad","last_name":"Ammar","domain_name":"icmap","page_name":"MohammadAmmar","display_name":"Mohammad Ammar","profile_url":"https://icmap.academia.edu/MohammadAmmar?f_ri=143163","photo":"https://0.academia-photos.com/28629715/8107937/9076306/s65_mohammad.ammar.jpg_oh_13a10dbdf020b181567b5f3a84a1bab0_oe_55b203ab___gda___1437776205_136415beb601c0a21932bf3fd71fe973"}</script></span></span></li><li class="js-paper-rank-work_11692337 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11692337"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11692337, container: ".js-paper-rank-work_11692337", }); });</script></li><li class="js-percentile-work_11692337 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11692337; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11692337"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11692337 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11692337"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11692337; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11692337]").text(description); $(".js-view-count-work_11692337").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11692337").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11692337"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">3</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="595993" href="https://www.academia.edu/Documents/in/Markov_chain">Markov chain</a><script data-card-contents-for-ri="595993" type="text/json">{"id":595993,"name":"Markov chain","url":"https://www.academia.edu/Documents/in/Markov_chain?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11692337]'), work: {"id":11692337,"title":"Optimum analysis of pavement maintenance using multi-objective genetic algorithms","created_at":"2015-03-27T23:38:08.244-07:00","url":"https://www.academia.edu/11692337/Optimum_analysis_of_pavement_maintenance_using_multi_objective_genetic_algorithms?f_ri=143163","dom_id":"work_11692337","summary":null,"downloadable_attachments":[{"id":46572385,"asset_id":11692337,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":28629715,"first_name":"Mohammad","last_name":"Ammar","domain_name":"icmap","page_name":"MohammadAmmar","display_name":"Mohammad Ammar","profile_url":"https://icmap.academia.edu/MohammadAmmar?f_ri=143163","photo":"https://0.academia-photos.com/28629715/8107937/9076306/s65_mohammad.ammar.jpg_oh_13a10dbdf020b181567b5f3a84a1bab0_oe_55b203ab___gda___1437776205_136415beb601c0a21932bf3fd71fe973"}],"research_interests":[{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":595993,"name":"Markov chain","url":"https://www.academia.edu/Documents/in/Markov_chain?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_70115584" data-work_id="70115584" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/70115584/Alternative_clustering_by_utilizing_multi_objective_genetic_algorithm_with_linked_list_based_chromosome_encoding">Alternative clustering by utilizing multi-objective genetic algorithm with linked-list based chromosome encoding</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/70115584" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="73406928" href="https://umich.academia.edu/emrekorkmaz">emre korkmaz</a><script data-card-contents-for-user="73406928" type="text/json">{"id":73406928,"first_name":"emre","last_name":"korkmaz","domain_name":"umich","page_name":"emrekorkmaz","display_name":"emre korkmaz","profile_url":"https://umich.academia.edu/emrekorkmaz?f_ri=143163","photo":"https://0.academia-photos.com/73406928/19769381/61909011/s65_emre.korkmaz.jpeg"}</script></span></span></li><li class="js-paper-rank-work_70115584 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="70115584"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 70115584, container: ".js-paper-rank-work_70115584", }); });</script></li><li class="js-percentile-work_70115584 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 70115584; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_70115584"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_70115584 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="70115584"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 70115584; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=70115584]").text(description); $(".js-view-count-work_70115584").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_70115584").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="70115584"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">14</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="156" href="https://www.academia.edu/Documents/in/Genetics">Genetics</a>, <script data-card-contents-for-ri="156" type="text/json">{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="300" href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a>, <script data-card-contents-for-ri="300" type="text/json">{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="422" href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a>, <script data-card-contents-for-ri="422" type="text/json">{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a><script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=70115584]'), work: {"id":70115584,"title":"Alternative clustering by utilizing multi-objective genetic algorithm with linked-list based chromosome encoding","created_at":"2022-01-31T00:35:56.207-08:00","url":"https://www.academia.edu/70115584/Alternative_clustering_by_utilizing_multi_objective_genetic_algorithm_with_linked_list_based_chromosome_encoding?f_ri=143163","dom_id":"work_70115584","summary":null,"downloadable_attachments":[],"ordered_authors":[{"id":73406928,"first_name":"emre","last_name":"korkmaz","domain_name":"umich","page_name":"emrekorkmaz","display_name":"emre korkmaz","profile_url":"https://umich.academia.edu/emrekorkmaz?f_ri=143163","photo":"https://0.academia-photos.com/73406928/19769381/61909011/s65_emre.korkmaz.jpeg"}],"research_interests":[{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false},{"id":300,"name":"Mathematics","url":"https://www.academia.edu/Documents/in/Mathematics?f_ri=143163","nofollow":false},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science?f_ri=143163","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=143163","nofollow":false},{"id":2009,"name":"Data Mining","url":"https://www.academia.edu/Documents/in/Data_Mining?f_ri=143163"},{"id":5109,"name":"Pattern Recognition","url":"https://www.academia.edu/Documents/in/Pattern_Recognition?f_ri=143163"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163"},{"id":106145,"name":"Classification","url":"https://www.academia.edu/Documents/in/Classification?f_ri=143163"},{"id":131237,"name":"Cluster Analysis","url":"https://www.academia.edu/Documents/in/Cluster_Analysis?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":627850,"name":"K Means","url":"https://www.academia.edu/Documents/in/K_Means?f_ri=143163"},{"id":862243,"name":"Multiple Objectives","url":"https://www.academia.edu/Documents/in/Multiple_Objectives?f_ri=143163"},{"id":1222008,"name":"Machine Learning Data Mining","url":"https://www.academia.edu/Documents/in/Machine_Learning_Data_Mining?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_15393347 coauthored" data-work_id="15393347" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/15393347/Optimization_of_test_interval_for_ageing_equipment_A_multi_objective_genetic_algorithm_approach">Optimization of test interval for ageing equipment: A multi-objective genetic algorithm approach</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/15393347" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="0e31b15950076e289b2b9bf007025236" rel="nofollow" data-download="{"attachment_id":43230115,"asset_id":15393347,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/43230115/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34539863" href="https://independent.academia.edu/Marko%C4%8Cepin">Marko Čepin</a><script data-card-contents-for-user="34539863" type="text/json">{"id":34539863,"first_name":"Marko","last_name":"Čepin","domain_name":"independent","page_name":"MarkoČepin","display_name":"Marko Čepin","profile_url":"https://independent.academia.edu/Marko%C4%8Cepin?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-15393347">+1</span><div class="hidden js-additional-users-15393347"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/Du%C5%A1koKan%C4%8Dev">Duško Kančev</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-15393347'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-15393347').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_15393347 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="15393347"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 15393347, container: ".js-paper-rank-work_15393347", }); });</script></li><li class="js-percentile-work_15393347 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 15393347; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_15393347"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_15393347 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="15393347"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 15393347; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=15393347]").text(description); $(".js-view-count-work_15393347").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_15393347").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="15393347"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">11</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4392" href="https://www.academia.edu/Documents/in/Monte_Carlo_Simulation">Monte Carlo Simulation</a>, <script data-card-contents-for-ri="4392" type="text/json">{"id":4392,"name":"Monte Carlo Simulation","url":"https://www.academia.edu/Documents/in/Monte_Carlo_Simulation?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="96047" href="https://www.academia.edu/Documents/in/Case_Study">Case Study</a><script data-card-contents-for-ri="96047" type="text/json">{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=15393347]'), work: {"id":15393347,"title":"Optimization of test interval for ageing equipment: A multi-objective genetic algorithm approach","created_at":"2015-09-04T07:24:15.099-07:00","url":"https://www.academia.edu/15393347/Optimization_of_test_interval_for_ageing_equipment_A_multi_objective_genetic_algorithm_approach?f_ri=143163","dom_id":"work_15393347","summary":null,"downloadable_attachments":[{"id":43230115,"asset_id":15393347,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":34539863,"first_name":"Marko","last_name":"Čepin","domain_name":"independent","page_name":"MarkoČepin","display_name":"Marko Čepin","profile_url":"https://independent.academia.edu/Marko%C4%8Cepin?f_ri=143163","photo":"/images/s65_no_pic.png"},{"id":34592420,"first_name":"Duško","last_name":"Kančev","domain_name":"independent","page_name":"DuškoKančev","display_name":"Duško Kančev","profile_url":"https://independent.academia.edu/Du%C5%A1koKan%C4%8Dev?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false},{"id":4392,"name":"Monte Carlo Simulation","url":"https://www.academia.edu/Documents/in/Monte_Carlo_Simulation?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":288876,"name":"Decision making process","url":"https://www.academia.edu/Documents/in/Decision_making_process?f_ri=143163"},{"id":491317,"name":"Age effect","url":"https://www.academia.edu/Documents/in/Age_effect?f_ri=143163"},{"id":505466,"name":"Uncertainty propagation","url":"https://www.academia.edu/Documents/in/Uncertainty_propagation?f_ri=143163"},{"id":1214122,"name":"Nuclear Power Plant","url":"https://www.academia.edu/Documents/in/Nuclear_Power_Plant?f_ri=143163"},{"id":1773476,"name":"Data Uncertainty","url":"https://www.academia.edu/Documents/in/Data_Uncertainty?f_ri=143163"},{"id":2243112,"name":"Parameter Uncertainty","url":"https://www.academia.edu/Documents/in/Parameter_Uncertainty?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_18349650" data-work_id="18349650" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/18349650/Comparing_algorithms_representations_and_operators_for_the_multi_objective_knapsack_problem">Comparing algorithms, representations and operators for the multi-objective knapsack problem</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/18349650" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="37ee896a6bd0b14d2bb3eac0a8d36e51" rel="nofollow" data-download="{"attachment_id":40008059,"asset_id":18349650,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/40008059/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="38336574" href="https://independent.academia.edu/MumfordChristine">Christine Mumford</a><script data-card-contents-for-user="38336574" type="text/json">{"id":38336574,"first_name":"Christine","last_name":"Mumford","domain_name":"independent","page_name":"MumfordChristine","display_name":"Christine Mumford","profile_url":"https://independent.academia.edu/MumfordChristine?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_18349650 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="18349650"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 18349650, container: ".js-paper-rank-work_18349650", }); });</script></li><li class="js-percentile-work_18349650 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 18349650; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_18349650"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_18349650 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="18349650"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 18349650; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=18349650]").text(description); $(".js-view-count-work_18349650").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_18349650").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="18349650"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">4</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="156" href="https://www.academia.edu/Documents/in/Genetics">Genetics</a>, <script data-card-contents-for-ri="156" type="text/json">{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="107381" href="https://www.academia.edu/Documents/in/Local_Search">Local Search</a>, <script data-card-contents-for-ri="107381" type="text/json">{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="265625" href="https://www.academia.edu/Documents/in/Evolutionary_Algorithm">Evolutionary Algorithm</a><script data-card-contents-for-ri="265625" type="text/json">{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=18349650]'), work: {"id":18349650,"title":"Comparing algorithms, representations and operators for the multi-objective knapsack problem","created_at":"2015-11-14T14:24:55.485-08:00","url":"https://www.academia.edu/18349650/Comparing_algorithms_representations_and_operators_for_the_multi_objective_knapsack_problem?f_ri=143163","dom_id":"work_18349650","summary":null,"downloadable_attachments":[{"id":40008059,"asset_id":18349650,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":38336574,"first_name":"Christine","last_name":"Mumford","domain_name":"independent","page_name":"MumfordChristine","display_name":"Christine Mumford","profile_url":"https://independent.academia.edu/MumfordChristine?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false},{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_54443024" data-work_id="54443024" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/54443024/Efficient_generation_of_pareto_optimal_topologies_for_compliance_optimization">Efficient generation of pareto-optimal topologies for compliance optimization</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/54443024" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1a5b0163af242c80361cbba48d229d36" rel="nofollow" data-download="{"attachment_id":70803287,"asset_id":54443024,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/70803287/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="137717653" href="https://independent.academia.edu/KrishnanSuresh4">Krishnan Suresh</a><script data-card-contents-for-user="137717653" type="text/json">{"id":137717653,"first_name":"Krishnan","last_name":"Suresh","domain_name":"independent","page_name":"KrishnanSuresh4","display_name":"Krishnan Suresh","profile_url":"https://independent.academia.edu/KrishnanSuresh4?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_54443024 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="54443024"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 54443024, container: ".js-paper-rank-work_54443024", }); });</script></li><li class="js-percentile-work_54443024 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 54443024; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_54443024"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_54443024 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="54443024"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 54443024; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=54443024]").text(description); $(".js-view-count-work_54443024").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_54443024").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="54443024"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">3</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20097" href="https://www.academia.edu/Documents/in/Topology_Optimization">Topology Optimization</a>, <script data-card-contents-for-ri="20097" type="text/json">{"id":20097,"name":"Topology Optimization","url":"https://www.academia.edu/Documents/in/Topology_Optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=54443024]'), work: {"id":54443024,"title":"Efficient generation of pareto-optimal topologies for compliance optimization","created_at":"2021-09-30T14:41:12.094-07:00","url":"https://www.academia.edu/54443024/Efficient_generation_of_pareto_optimal_topologies_for_compliance_optimization?f_ri=143163","dom_id":"work_54443024","summary":null,"downloadable_attachments":[{"id":70803287,"asset_id":54443024,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":137717653,"first_name":"Krishnan","last_name":"Suresh","domain_name":"independent","page_name":"KrishnanSuresh4","display_name":"Krishnan Suresh","profile_url":"https://independent.academia.edu/KrishnanSuresh4?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":20097,"name":"Topology Optimization","url":"https://www.academia.edu/Documents/in/Topology_Optimization?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_27573598" data-work_id="27573598" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/27573598/A_Mathematical_Optimization_Model_for_Locating_Telecenters">A Mathematical Optimization Model for Locating Telecenters</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/27573598" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a15b2a46cf345a828c3f8c70665ca122" rel="nofollow" data-download="{"attachment_id":47829159,"asset_id":27573598,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/47829159/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="51746769" href="https://independent.academia.edu/AmirMamdoohi">Amir Mamdoohi</a><script data-card-contents-for-user="51746769" type="text/json">{"id":51746769,"first_name":"Amir","last_name":"Mamdoohi","domain_name":"independent","page_name":"AmirMamdoohi","display_name":"Amir Mamdoohi","profile_url":"https://independent.academia.edu/AmirMamdoohi?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_27573598 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="27573598"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 27573598, container: ".js-paper-rank-work_27573598", }); });</script></li><li class="js-percentile-work_27573598 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 27573598; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_27573598"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_27573598 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="27573598"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 27573598; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=27573598]").text(description); $(".js-view-count-work_27573598").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_27573598").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="27573598"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">3</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="524072" href="https://www.academia.edu/Documents/in/Location">Location</a><script data-card-contents-for-ri="524072" type="text/json">{"id":524072,"name":"Location","url":"https://www.academia.edu/Documents/in/Location?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=27573598]'), work: {"id":27573598,"title":"A Mathematical Optimization Model for Locating Telecenters","created_at":"2016-08-05T20:16:56.787-07:00","url":"https://www.academia.edu/27573598/A_Mathematical_Optimization_Model_for_Locating_Telecenters?f_ri=143163","dom_id":"work_27573598","summary":null,"downloadable_attachments":[{"id":47829159,"asset_id":27573598,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":51746769,"first_name":"Amir","last_name":"Mamdoohi","domain_name":"independent","page_name":"AmirMamdoohi","display_name":"Amir Mamdoohi","profile_url":"https://independent.academia.edu/AmirMamdoohi?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":524072,"name":"Location","url":"https://www.academia.edu/Documents/in/Location?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7984011" data-work_id="7984011" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7984011/Berth_scheduling_by_customer_service_differentiation_A_multi_objective_approach">Berth scheduling by customer service differentiation: A multi-objective approach</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7984011" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="87bd179a169b3059c02b9bc942e1fbb7" rel="nofollow" data-download="{"attachment_id":48265159,"asset_id":7984011,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48265159/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="15246258" href="https://rutgers.academia.edu/SotiriosTheofanis">Sotirios Theofanis</a><script data-card-contents-for-user="15246258" type="text/json">{"id":15246258,"first_name":"Sotirios","last_name":"Theofanis","domain_name":"rutgers","page_name":"SotiriosTheofanis","display_name":"Sotirios Theofanis","profile_url":"https://rutgers.academia.edu/SotiriosTheofanis?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_7984011 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7984011"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7984011, container: ".js-paper-rank-work_7984011", }); });</script></li><li class="js-percentile-work_7984011 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7984011; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7984011"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7984011 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7984011"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7984011; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7984011]").text(description); $(".js-view-count-work_7984011").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7984011").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7984011"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="305" href="https://www.academia.edu/Documents/in/Applied_Mathematics">Applied Mathematics</a>, <script data-card-contents-for-ri="305" type="text/json">{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="12815" href="https://www.academia.edu/Documents/in/Customer_Satisfaction">Customer Satisfaction</a>, <script data-card-contents-for-ri="12815" type="text/json">{"id":12815,"name":"Customer Satisfaction","url":"https://www.academia.edu/Documents/in/Customer_Satisfaction?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7984011]'), work: {"id":7984011,"title":"Berth scheduling by customer service differentiation: A multi-objective approach","created_at":"2014-08-15T07:03:04.667-07:00","url":"https://www.academia.edu/7984011/Berth_scheduling_by_customer_service_differentiation_A_multi_objective_approach?f_ri=143163","dom_id":"work_7984011","summary":null,"downloadable_attachments":[{"id":48265159,"asset_id":7984011,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":15246258,"first_name":"Sotirios","last_name":"Theofanis","domain_name":"rutgers","page_name":"SotiriosTheofanis","display_name":"Sotirios Theofanis","profile_url":"https://rutgers.academia.edu/SotiriosTheofanis?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics?f_ri=143163","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":12815,"name":"Customer Satisfaction","url":"https://www.academia.edu/Documents/in/Customer_Satisfaction?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":103658,"name":"Customer Service","url":"https://www.academia.edu/Documents/in/Customer_Service?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":556845,"name":"Numerical Analysis and Computational Mathematics","url":"https://www.academia.edu/Documents/in/Numerical_Analysis_and_Computational_Mathematics?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_54531786" data-work_id="54531786" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/54531786/A_Life_Cycle_Assessment_LCA_study_on_the_various_recycle_routes_of_pet_bottles">A Life-Cycle Assessment (LCA) study on the various recycle routes of pet bottles</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/54531786" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="be6f401d28fadca2bf6432fde94f898b" rel="nofollow" data-download="{"attachment_id":70852510,"asset_id":54531786,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/70852510/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="182877032" href="https://independent.academia.edu/KwangSeekMoon">Kwang-Seek Moon</a><script data-card-contents-for-user="182877032" type="text/json">{"id":182877032,"first_name":"Kwang-Seek","last_name":"Moon","domain_name":"independent","page_name":"KwangSeekMoon","display_name":"Kwang-Seek Moon","profile_url":"https://independent.academia.edu/KwangSeekMoon?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_54531786 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="54531786"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 54531786, container: ".js-paper-rank-work_54531786", }); });</script></li><li class="js-percentile-work_54531786 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 54531786; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_54531786"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_54531786 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="54531786"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 54531786; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=54531786]").text(description); $(".js-view-count-work_54531786").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_54531786").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="54531786"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">11</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5448" href="https://www.academia.edu/Documents/in/Nonlinear_Programming">Nonlinear Programming</a>, <script data-card-contents-for-ri="5448" type="text/json">{"id":5448,"name":"Nonlinear Programming","url":"https://www.academia.edu/Documents/in/Nonlinear_Programming?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="10529" href="https://www.academia.edu/Documents/in/Life_Cycle_Assessment">Life Cycle Assessment</a><script data-card-contents-for-ri="10529" type="text/json">{"id":10529,"name":"Life Cycle Assessment","url":"https://www.academia.edu/Documents/in/Life_Cycle_Assessment?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=54531786]'), work: {"id":54531786,"title":"A Life-Cycle Assessment (LCA) study on the various recycle routes of pet bottles","created_at":"2021-10-01T02:35:48.926-07:00","url":"https://www.academia.edu/54531786/A_Life_Cycle_Assessment_LCA_study_on_the_various_recycle_routes_of_pet_bottles?f_ri=143163","dom_id":"work_54531786","summary":null,"downloadable_attachments":[{"id":70852510,"asset_id":54531786,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":182877032,"first_name":"Kwang-Seek","last_name":"Moon","domain_name":"independent","page_name":"KwangSeekMoon","display_name":"Kwang-Seek Moon","profile_url":"https://independent.academia.edu/KwangSeekMoon?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false},{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false},{"id":5448,"name":"Nonlinear Programming","url":"https://www.academia.edu/Documents/in/Nonlinear_Programming?f_ri=143163","nofollow":false},{"id":10529,"name":"Life Cycle Assessment","url":"https://www.academia.edu/Documents/in/Life_Cycle_Assessment?f_ri=143163","nofollow":false},{"id":14085,"name":"Waste Management","url":"https://www.academia.edu/Documents/in/Waste_Management?f_ri=143163"},{"id":20099,"name":"Sensitivity Analysis","url":"https://www.academia.edu/Documents/in/Sensitivity_Analysis?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":182962,"name":"Life Cycle","url":"https://www.academia.edu/Documents/in/Life_Cycle?f_ri=143163"},{"id":291387,"name":"Mathematical Model","url":"https://www.academia.edu/Documents/in/Mathematical_Model?f_ri=143163"},{"id":888111,"name":"Polyethylene terephthalate","url":"https://www.academia.edu/Documents/in/Polyethylene_terephthalate?f_ri=143163"},{"id":1180667,"name":"Optimality Condition","url":"https://www.academia.edu/Documents/in/Optimality_Condition?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_28198850" data-work_id="28198850" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/28198850/Multi_objective_evolutionary_biclustering_of_gene_expression_data">Multi-objective evolutionary biclustering of gene expression data</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/28198850" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="d2773fae48a1ddc4674c4ad72a5c12d8" rel="nofollow" data-download="{"attachment_id":48510393,"asset_id":28198850,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48510393/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="24209894" href="https://independent.academia.edu/HBanka">Haider Banka</a><script data-card-contents-for-user="24209894" type="text/json">{"id":24209894,"first_name":"Haider","last_name":"Banka","domain_name":"independent","page_name":"HBanka","display_name":"Haider Banka","profile_url":"https://independent.academia.edu/HBanka?f_ri=143163","photo":"https://0.academia-photos.com/24209894/7349701/8264335/s65_haider.banka.jpg_oh_e82c0633bb1f5d0e95d10afcf9cc7459_oe_555621d1___gda___1431938749_6c6092a6993b6a97b447050c090f7af8"}</script></span></span></li><li class="js-paper-rank-work_28198850 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="28198850"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 28198850, container: ".js-paper-rank-work_28198850", }); });</script></li><li class="js-percentile-work_28198850 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 28198850; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_28198850"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_28198850 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="28198850"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 28198850; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=28198850]").text(description); $(".js-view-count-work_28198850").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_28198850").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="28198850"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">13</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="464" href="https://www.academia.edu/Documents/in/Information_Retrieval">Information Retrieval</a>, <script data-card-contents-for-ri="464" type="text/json">{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5109" href="https://www.academia.edu/Documents/in/Pattern_Recognition">Pattern Recognition</a>, <script data-card-contents-for-ri="5109" type="text/json">{"id":5109,"name":"Pattern Recognition","url":"https://www.academia.edu/Documents/in/Pattern_Recognition?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a><script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=28198850]'), work: {"id":28198850,"title":"Multi-objective evolutionary biclustering of gene expression data","created_at":"2016-09-02T03:19:48.470-07:00","url":"https://www.academia.edu/28198850/Multi_objective_evolutionary_biclustering_of_gene_expression_data?f_ri=143163","dom_id":"work_28198850","summary":null,"downloadable_attachments":[{"id":48510393,"asset_id":28198850,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":24209894,"first_name":"Haider","last_name":"Banka","domain_name":"independent","page_name":"HBanka","display_name":"Haider Banka","profile_url":"https://independent.academia.edu/HBanka?f_ri=143163","photo":"https://0.academia-photos.com/24209894/7349701/8264335/s65_haider.banka.jpg_oh_e82c0633bb1f5d0e95d10afcf9cc7459_oe_555621d1___gda___1431938749_6c6092a6993b6a97b447050c090f7af8"}],"research_interests":[{"id":464,"name":"Information Retrieval","url":"https://www.academia.edu/Documents/in/Information_Retrieval?f_ri=143163","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":5109,"name":"Pattern Recognition","url":"https://www.academia.edu/Documents/in/Pattern_Recognition?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":64642,"name":"Knowledge Discovery","url":"https://www.academia.edu/Documents/in/Knowledge_Discovery?f_ri=143163"},{"id":82988,"name":"Microarray","url":"https://www.academia.edu/Documents/in/Microarray?f_ri=143163"},{"id":84990,"name":"Clustering","url":"https://www.academia.edu/Documents/in/Clustering?f_ri=143163"},{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":173553,"name":"Knowledge discovery and data mining","url":"https://www.academia.edu/Documents/in/Knowledge_discovery_and_data_mining-1?f_ri=143163"},{"id":557801,"name":"High Dimensionality","url":"https://www.academia.edu/Documents/in/High_Dimensionality?f_ri=143163"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=143163"},{"id":2262619,"name":"Gene Expression Data","url":"https://www.academia.edu/Documents/in/Gene_Expression_Data?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4710910" data-work_id="4710910" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4710910/Strategic_planning_with_risk_control_of_hydrogen_supply_chains_for_vehicle_use_under_uncertainty_in_operating_costs_A_case_study_of_Spain">Strategic planning with risk control of hydrogen supply chains for vehicle use under uncertainty in operating costs: A case study of Spain</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4710910" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="118d29c5a75b9d0469c0d8ca245ac8c6" rel="nofollow" data-download="{"attachment_id":49674610,"asset_id":4710910,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49674610/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="6014630" href="https://ucl.academia.edu/NagoreSabio">Nagore Sabio</a><script data-card-contents-for-user="6014630" type="text/json">{"id":6014630,"first_name":"Nagore","last_name":"Sabio","domain_name":"ucl","page_name":"NagoreSabio","display_name":"Nagore Sabio","profile_url":"https://ucl.academia.edu/NagoreSabio?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_4710910 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4710910"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4710910, container: ".js-paper-rank-work_4710910", }); });</script></li><li class="js-percentile-work_4710910 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4710910; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4710910"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4710910 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4710910"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4710910; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4710910]").text(description); $(".js-view-count-work_4710910").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4710910").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4710910"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">19</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6177" href="https://www.academia.edu/Documents/in/Modeling">Modeling</a>, <script data-card-contents-for-ri="6177" type="text/json">{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="7739" href="https://www.academia.edu/Documents/in/Strategic_Planning">Strategic Planning</a>, <script data-card-contents-for-ri="7739" type="text/json">{"id":7739,"name":"Strategic Planning","url":"https://www.academia.edu/Documents/in/Strategic_Planning?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9043" href="https://www.academia.edu/Documents/in/Performance">Performance</a><script data-card-contents-for-ri="9043" type="text/json">{"id":9043,"name":"Performance","url":"https://www.academia.edu/Documents/in/Performance?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4710910]'), work: {"id":4710910,"title":"Strategic planning with risk control of hydrogen supply chains for vehicle use under uncertainty in operating costs: A case study of Spain","created_at":"2013-10-08T01:06:17.254-07:00","url":"https://www.academia.edu/4710910/Strategic_planning_with_risk_control_of_hydrogen_supply_chains_for_vehicle_use_under_uncertainty_in_operating_costs_A_case_study_of_Spain?f_ri=143163","dom_id":"work_4710910","summary":null,"downloadable_attachments":[{"id":49674610,"asset_id":4710910,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":6014630,"first_name":"Nagore","last_name":"Sabio","domain_name":"ucl","page_name":"NagoreSabio","display_name":"Nagore Sabio","profile_url":"https://ucl.academia.edu/NagoreSabio?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false},{"id":7739,"name":"Strategic Planning","url":"https://www.academia.edu/Documents/in/Strategic_Planning?f_ri=143163","nofollow":false},{"id":9043,"name":"Performance","url":"https://www.academia.edu/Documents/in/Performance?f_ri=143163","nofollow":false},{"id":12061,"name":"Risk Management","url":"https://www.academia.edu/Documents/in/Risk_Management?f_ri=143163"},{"id":24699,"name":"Supply Chain","url":"https://www.academia.edu/Documents/in/Supply_Chain?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":61603,"name":"Uncertainty","url":"https://www.academia.edu/Documents/in/Uncertainty?f_ri=143163"},{"id":80691,"name":"Raw materials","url":"https://www.academia.edu/Documents/in/Raw_materials?f_ri=143163"},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163"},{"id":104345,"name":"Hydrogen Energy","url":"https://www.academia.edu/Documents/in/Hydrogen_Energy?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":192604,"name":"Decision support tool","url":"https://www.academia.edu/Documents/in/Decision_support_tool?f_ri=143163"},{"id":202390,"name":"Product Distribution","url":"https://www.academia.edu/Documents/in/Product_Distribution?f_ri=143163"},{"id":260118,"name":"CHEMICAL SCIENCES","url":"https://www.academia.edu/Documents/in/CHEMICAL_SCIENCES?f_ri=143163"},{"id":479603,"name":"Economic performance","url":"https://www.academia.edu/Documents/in/Economic_performance?f_ri=143163"},{"id":552138,"name":"Adomian decomposition method","url":"https://www.academia.edu/Documents/in/Adomian_decomposition_method?f_ri=143163"},{"id":789521,"name":"Optimal Design","url":"https://www.academia.edu/Documents/in/Optimal_Design?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_63869419" data-work_id="63869419" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/63869419/Optimization_of_driver_and_chassis_of_FWD_racing_car_for_faster_cornering">Optimization of driver and chassis of FWD racing car for faster cornering</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Paper presents an innovative method for finding the best setup of: race driver actions, vehicle motion trajectory, and vehicle chassis parameters for a closed-loop maneuver. Formulated &amp;quot; miMa &amp;quot; simulation model of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_63869419" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Paper presents an innovative method for finding the best setup of: race driver actions, vehicle motion trajectory, and vehicle chassis parameters for a closed-loop maneuver. Formulated &amp;quot; miMa &amp;quot; simulation model of driver-vehicle-road system with 26 generalized coordinates and more than 400 parameters is implemented for optimization with genetic algorithms. Numerical example considers Ford Focus ST170 (FWD) prepared for a track racing, which is negotiating a selected track part with RH corner. The combined optimization includes 28 decision variables. Two criteria, i.e. section time and exit velocity, are defined as optimization goals. Different strategies for improving performance of FWD car are found by using optimization.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/63869419" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="31409332" href="https://pk.academia.edu/MichalManiowski">Michal Maniowski</a><script data-card-contents-for-user="31409332" type="text/json">{"id":31409332,"first_name":"Michal","last_name":"Maniowski","domain_name":"pk","page_name":"MichalManiowski","display_name":"Michal Maniowski","profile_url":"https://pk.academia.edu/MichalManiowski?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_63869419 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="63869419"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 63869419, container: ".js-paper-rank-work_63869419", }); });</script></li><li class="js-percentile-work_63869419 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 63869419; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_63869419"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_63869419 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="63869419"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 63869419; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=63869419]").text(description); $(".js-view-count-work_63869419").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_63869419").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="63869419"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">8</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5026" href="https://www.academia.edu/Documents/in/Genetic_Algorithms">Genetic Algorithms</a>, <script data-card-contents-for-ri="5026" type="text/json">{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8050" href="https://www.academia.edu/Documents/in/Vehicle_Dynamics">Vehicle Dynamics</a>, <script data-card-contents-for-ri="8050" type="text/json">{"id":8050,"name":"Vehicle Dynamics","url":"https://www.academia.edu/Documents/in/Vehicle_Dynamics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="58419" href="https://www.academia.edu/Documents/in/Driver_Modelling">Driver Modelling</a>, <script data-card-contents-for-ri="58419" type="text/json">{"id":58419,"name":"Driver Modelling","url":"https://www.academia.edu/Documents/in/Driver_Modelling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="99869" href="https://www.academia.edu/Documents/in/Motorsports">Motorsports</a><script data-card-contents-for-ri="99869" type="text/json">{"id":99869,"name":"Motorsports","url":"https://www.academia.edu/Documents/in/Motorsports?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=63869419]'), work: {"id":63869419,"title":"Optimization of driver and chassis of FWD racing car for faster cornering","created_at":"2021-12-11T14:57:59.242-08:00","url":"https://www.academia.edu/63869419/Optimization_of_driver_and_chassis_of_FWD_racing_car_for_faster_cornering?f_ri=143163","dom_id":"work_63869419","summary":"Paper presents an innovative method for finding the best setup of: race driver actions, vehicle motion trajectory, and vehicle chassis parameters for a closed-loop maneuver. Formulated \u0026amp;quot; miMa \u0026amp;quot; simulation model of driver-vehicle-road system with 26 generalized coordinates and more than 400 parameters is implemented for optimization with genetic algorithms. Numerical example considers Ford Focus ST170 (FWD) prepared for a track racing, which is negotiating a selected track part with RH corner. The combined optimization includes 28 decision variables. Two criteria, i.e. section time and exit velocity, are defined as optimization goals. Different strategies for improving performance of FWD car are found by using optimization.","downloadable_attachments":[],"ordered_authors":[{"id":31409332,"first_name":"Michal","last_name":"Maniowski","domain_name":"pk","page_name":"MichalManiowski","display_name":"Michal Maniowski","profile_url":"https://pk.academia.edu/MichalManiowski?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163","nofollow":false},{"id":8050,"name":"Vehicle Dynamics","url":"https://www.academia.edu/Documents/in/Vehicle_Dynamics?f_ri=143163","nofollow":false},{"id":58419,"name":"Driver Modelling","url":"https://www.academia.edu/Documents/in/Driver_Modelling?f_ri=143163","nofollow":false},{"id":99869,"name":"Motorsports","url":"https://www.academia.edu/Documents/in/Motorsports?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":357602,"name":"Optimization of Automobile Chassis","url":"https://www.academia.edu/Documents/in/Optimization_of_Automobile_Chassis?f_ri=143163"},{"id":418601,"name":"Multibody Vehicle Dynamics","url":"https://www.academia.edu/Documents/in/Multibody_Vehicle_Dynamics?f_ri=143163"},{"id":536507,"name":"Racing chassis desing","url":"https://www.academia.edu/Documents/in/Racing_chassis_desing?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_50057318" data-work_id="50057318" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/50057318/Simulation_based_optimization_of_thermal_systems">Simulation-based optimization of thermal systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/50057318" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="7452e5b89deeaebf529b2a9a80a62eec" rel="nofollow" data-download="{"attachment_id":68182899,"asset_id":50057318,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68182899/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32396097" href="https://cbs.academia.edu/RivaHolmes">Riva Holmes</a><script data-card-contents-for-user="32396097" type="text/json">{"id":32396097,"first_name":"Riva","last_name":"Holmes","domain_name":"cbs","page_name":"RivaHolmes","display_name":"Riva Holmes","profile_url":"https://cbs.academia.edu/RivaHolmes?f_ri=143163","photo":"https://0.academia-photos.com/32396097/60809841/161334003/s65_yogesh.jaluria.jpg"}</script></span></span></li><li class="js-paper-rank-work_50057318 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="50057318"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 50057318, container: ".js-paper-rank-work_50057318", }); });</script></li><li class="js-percentile-work_50057318 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 50057318; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_50057318"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_50057318 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="50057318"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 50057318; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=50057318]").text(description); $(".js-view-count-work_50057318").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_50057318").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="50057318"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">19</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6177" href="https://www.academia.edu/Documents/in/Modeling">Modeling</a>, <script data-card-contents-for-ri="6177" type="text/json">{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8067" href="https://www.academia.edu/Documents/in/Heat_Transfer">Heat Transfer</a>, <script data-card-contents-for-ri="8067" type="text/json">{"id":8067,"name":"Heat Transfer","url":"https://www.academia.edu/Documents/in/Heat_Transfer?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9043" href="https://www.academia.edu/Documents/in/Performance">Performance</a><script data-card-contents-for-ri="9043" type="text/json">{"id":9043,"name":"Performance","url":"https://www.academia.edu/Documents/in/Performance?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=50057318]'), work: {"id":50057318,"title":"Simulation-based optimization of thermal systems","created_at":"2021-07-18T15:37:19.974-07:00","url":"https://www.academia.edu/50057318/Simulation_based_optimization_of_thermal_systems?f_ri=143163","dom_id":"work_50057318","summary":null,"downloadable_attachments":[{"id":68182899,"asset_id":50057318,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":32396097,"first_name":"Riva","last_name":"Holmes","domain_name":"cbs","page_name":"RivaHolmes","display_name":"Riva Holmes","profile_url":"https://cbs.academia.edu/RivaHolmes?f_ri=143163","photo":"https://0.academia-photos.com/32396097/60809841/161334003/s65_yogesh.jaluria.jpg"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false},{"id":8067,"name":"Heat Transfer","url":"https://www.academia.edu/Documents/in/Heat_Transfer?f_ri=143163","nofollow":false},{"id":9043,"name":"Performance","url":"https://www.academia.edu/Documents/in/Performance?f_ri=143163","nofollow":false},{"id":34756,"name":"System Design","url":"https://www.academia.edu/Documents/in/System_Design?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":48636,"name":"Simulation","url":"https://www.academia.edu/Documents/in/Simulation?f_ri=143163"},{"id":60658,"name":"Numerical Simulation","url":"https://www.academia.edu/Documents/in/Numerical_Simulation?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":160102,"name":"Systems","url":"https://www.academia.edu/Documents/in/Systems?f_ri=143163"},{"id":168777,"name":"Cooling System","url":"https://www.academia.edu/Documents/in/Cooling_System?f_ri=143163"},{"id":174347,"name":"Thermal","url":"https://www.academia.edu/Documents/in/Thermal?f_ri=143163"},{"id":477865,"name":"Operant Conditioning","url":"https://www.academia.edu/Documents/in/Operant_Conditioning?f_ri=143163"},{"id":539878,"name":"Chemical Reaction","url":"https://www.academia.edu/Documents/in/Chemical_Reaction?f_ri=143163"},{"id":554780,"name":"Interdisciplinary Engineering","url":"https://www.academia.edu/Documents/in/Interdisciplinary_Engineering?f_ri=143163"},{"id":641466,"name":"Applied Thermal Engineering","url":"https://www.academia.edu/Documents/in/Applied_Thermal_Engineering?f_ri=143163"},{"id":838973,"name":"System performance","url":"https://www.academia.edu/Documents/in/System_performance?f_ri=143163"},{"id":867022,"name":"Boundary Condition","url":"https://www.academia.edu/Documents/in/Boundary_Condition?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_44255817" data-work_id="44255817" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/44255817/Multi_objective_optimization_for_building_retrofit_strategies_A_model_and_an_application">Multi-objective optimization for building retrofit strategies: A model and an application</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/44255817" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="c47196a09ce4a439635246f8ac0398c8" rel="nofollow" data-download="{"attachment_id":64629871,"asset_id":44255817,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/64629871/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="173628539" href="https://mit.academia.edu/LeonGlicksman">Leon Glicksman</a><script data-card-contents-for-user="173628539" type="text/json">{"id":173628539,"first_name":"Leon","last_name":"Glicksman","domain_name":"mit","page_name":"LeonGlicksman","display_name":"Leon Glicksman","profile_url":"https://mit.academia.edu/LeonGlicksman?f_ri=143163","photo":"https://0.academia-photos.com/173628539/48175932/36662186/s65_leon.glicksman.jpg"}</script></span></span></li><li class="js-paper-rank-work_44255817 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="44255817"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 44255817, container: ".js-paper-rank-work_44255817", }); });</script></li><li class="js-percentile-work_44255817 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 44255817; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_44255817"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_44255817 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="44255817"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 44255817; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=44255817]").text(description); $(".js-view-count-work_44255817").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_44255817").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="44255817"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">11</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8810" href="https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings">Energy Efficiency Buildings</a>, <script data-card-contents-for-ri="8810" type="text/json">{"id":8810,"name":"Energy Efficiency Buildings","url":"https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="96047" href="https://www.academia.edu/Documents/in/Case_Study">Case Study</a>, <script data-card-contents-for-ri="96047" type="text/json">{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="127348" href="https://www.academia.edu/Documents/in/Energy_Saving">Energy Saving</a><script data-card-contents-for-ri="127348" type="text/json">{"id":127348,"name":"Energy Saving","url":"https://www.academia.edu/Documents/in/Energy_Saving?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=44255817]'), work: {"id":44255817,"title":"Multi-objective optimization for building retrofit strategies: A model and an application","created_at":"2020-10-08T11:11:01.549-07:00","url":"https://www.academia.edu/44255817/Multi_objective_optimization_for_building_retrofit_strategies_A_model_and_an_application?f_ri=143163","dom_id":"work_44255817","summary":null,"downloadable_attachments":[{"id":64629871,"asset_id":44255817,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":173628539,"first_name":"Leon","last_name":"Glicksman","domain_name":"mit","page_name":"LeonGlicksman","display_name":"Leon Glicksman","profile_url":"https://mit.academia.edu/LeonGlicksman?f_ri=143163","photo":"https://0.academia-photos.com/173628539/48175932/36662186/s65_leon.glicksman.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":8810,"name":"Energy Efficiency Buildings","url":"https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings?f_ri=143163","nofollow":false},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163","nofollow":false},{"id":127348,"name":"Energy Saving","url":"https://www.academia.edu/Documents/in/Energy_Saving?f_ri=143163","nofollow":false},{"id":137970,"name":"Indoor environmental quality","url":"https://www.academia.edu/Documents/in/Indoor_environmental_quality?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":165565,"name":"Cost effectiveness","url":"https://www.academia.edu/Documents/in/Cost_effectiveness?f_ri=143163"},{"id":243629,"name":"Lancet","url":"https://www.academia.edu/Documents/in/Lancet?f_ri=143163"},{"id":295924,"name":"Energy Use","url":"https://www.academia.edu/Documents/in/Energy_Use?f_ri=143163"},{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_50812875" data-work_id="50812875" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/50812875/Multi_objective_Optimization_For_The_Dynamic_Multi_Pickup_and_Delivery_Problem_with_Time_Windows">Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/50812875" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a4201467d6d164f1c728f25a073d2751" rel="nofollow" data-download="{"attachment_id":68678668,"asset_id":50812875,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68678668/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="180587763" href="https://independent.academia.edu/RyanKAMMARTIRyanKAMMARTI">Ryan KAMMARTI Ryan KAMMARTI</a><script data-card-contents-for-user="180587763" type="text/json">{"id":180587763,"first_name":"Ryan KAMMARTI","last_name":"Ryan KAMMARTI","domain_name":"independent","page_name":"RyanKAMMARTIRyanKAMMARTI","display_name":"Ryan KAMMARTI Ryan KAMMARTI","profile_url":"https://independent.academia.edu/RyanKAMMARTIRyanKAMMARTI?f_ri=143163","photo":"https://0.academia-photos.com/180587763/50023405/38017755/s65_ryan_kammarti.ryan_kammarti.png"}</script></span></span></li><li class="js-paper-rank-work_50812875 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="50812875"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 50812875, container: ".js-paper-rank-work_50812875", }); });</script></li><li class="js-percentile-work_50812875 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 50812875; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_50812875"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_50812875 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="50812875"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 50812875; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=50812875]").text(description); $(".js-view-count-work_50812875").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_50812875").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="50812875"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">5</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="53994" href="https://www.academia.edu/Documents/in/Data_Structure">Data Structure</a>, <script data-card-contents-for-ri="53994" type="text/json">{"id":53994,"name":"Data Structure","url":"https://www.academia.edu/Documents/in/Data_Structure?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="245965" href="https://www.academia.edu/Documents/in/Vehicle_Routing_Problem">Vehicle Routing Problem</a>, <script data-card-contents-for-ri="245965" type="text/json">{"id":245965,"name":"Vehicle Routing Problem","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_Problem?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="571143" href="https://www.academia.edu/Documents/in/Lower_Bound">Lower Bound</a><script data-card-contents-for-ri="571143" type="text/json">{"id":571143,"name":"Lower Bound","url":"https://www.academia.edu/Documents/in/Lower_Bound?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=50812875]'), work: {"id":50812875,"title":"Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows","created_at":"2021-08-09T23:53:15.015-07:00","url":"https://www.academia.edu/50812875/Multi_objective_Optimization_For_The_Dynamic_Multi_Pickup_and_Delivery_Problem_with_Time_Windows?f_ri=143163","dom_id":"work_50812875","summary":null,"downloadable_attachments":[{"id":68678668,"asset_id":50812875,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":180587763,"first_name":"Ryan KAMMARTI","last_name":"Ryan KAMMARTI","domain_name":"independent","page_name":"RyanKAMMARTIRyanKAMMARTI","display_name":"Ryan KAMMARTI Ryan KAMMARTI","profile_url":"https://independent.academia.edu/RyanKAMMARTIRyanKAMMARTI?f_ri=143163","photo":"https://0.academia-photos.com/180587763/50023405/38017755/s65_ryan_kammarti.ryan_kammarti.png"}],"research_interests":[{"id":53994,"name":"Data Structure","url":"https://www.academia.edu/Documents/in/Data_Structure?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":245965,"name":"Vehicle Routing Problem","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_Problem?f_ri=143163","nofollow":false},{"id":571143,"name":"Lower Bound","url":"https://www.academia.edu/Documents/in/Lower_Bound?f_ri=143163","nofollow":false},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6700160 coauthored" data-work_id="6700160" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6700160/Towards_a_multi_objective_optimization_approach_for_improving_energy_efficiency_in_buildings">Towards a multi-objective optimization approach for improving energy efficiency in buildings</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6700160" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="2ae152f878117881a4c31465807a31e4" rel="nofollow" data-download="{"attachment_id":48748975,"asset_id":6700160,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48748975/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="10942891" href="https://eap.academia.edu/ChristinaDiakaki">Christina Diakaki</a><script data-card-contents-for-user="10942891" type="text/json">{"id":10942891,"first_name":"Christina","last_name":"Diakaki","domain_name":"eap","page_name":"ChristinaDiakaki","display_name":"Christina Diakaki","profile_url":"https://eap.academia.edu/ChristinaDiakaki?f_ri=143163","photo":"https://0.academia-photos.com/10942891/3257207/52294565/s65_christina.diakaki.jpg"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-6700160">+1</span><div class="hidden js-additional-users-6700160"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://tuc.academia.edu/EvangelosGrigoroudis">Evangelos Grigoroudis</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-6700160'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-6700160').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_6700160 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6700160"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6700160, container: ".js-paper-rank-work_6700160", }); });</script></li><li class="js-percentile-work_6700160 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6700160; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6700160"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6700160 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6700160"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6700160; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6700160]").text(description); $(".js-view-count-work_6700160").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6700160").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6700160"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">8</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8810" href="https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings">Energy Efficiency Buildings</a>, <script data-card-contents-for-ri="8810" type="text/json">{"id":8810,"name":"Energy Efficiency Buildings","url":"https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="459384" href="https://www.academia.edu/Documents/in/Energy_efficient">Energy efficient</a><script data-card-contents-for-ri="459384" type="text/json">{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6700160]'), work: {"id":6700160,"title":"Towards a multi-objective optimization approach for improving energy efficiency in buildings","created_at":"2014-04-08T16:07:38.183-07:00","url":"https://www.academia.edu/6700160/Towards_a_multi_objective_optimization_approach_for_improving_energy_efficiency_in_buildings?f_ri=143163","dom_id":"work_6700160","summary":null,"downloadable_attachments":[{"id":48748975,"asset_id":6700160,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":10942891,"first_name":"Christina","last_name":"Diakaki","domain_name":"eap","page_name":"ChristinaDiakaki","display_name":"Christina Diakaki","profile_url":"https://eap.academia.edu/ChristinaDiakaki?f_ri=143163","photo":"https://0.academia-photos.com/10942891/3257207/52294565/s65_christina.diakaki.jpg"},{"id":34686667,"first_name":"Evangelos","last_name":"Grigoroudis","domain_name":"tuc","page_name":"EvangelosGrigoroudis","display_name":"Evangelos Grigoroudis","profile_url":"https://tuc.academia.edu/EvangelosGrigoroudis?f_ri=143163","photo":"https://0.academia-photos.com/34686667/111321944/100576462/s65_evangelos.grigoroudis.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":8810,"name":"Energy Efficiency Buildings","url":"https://www.academia.edu/Documents/in/Energy_Efficiency_Buildings?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":459384,"name":"Energy efficient","url":"https://www.academia.edu/Documents/in/Energy_efficient?f_ri=143163","nofollow":false},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":821516,"name":"Decision Maker","url":"https://www.academia.edu/Documents/in/Decision_Maker?f_ri=143163"},{"id":835647,"name":"Social Factor","url":"https://www.academia.edu/Documents/in/Social_Factor?f_ri=143163"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11396060" data-work_id="11396060" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11396060/Intuitionistic_fuzzy_optimization_technique_for_solving_multi_objective_reliability_optimization_problems_in_interval_environment">Intuitionistic fuzzy optimization technique for solving multi-objective reliability optimization problems in interval environment</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11396060" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e2d2d1d285744c1e40f543365b831148" rel="nofollow" data-download="{"attachment_id":46732168,"asset_id":11396060,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46732168/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="27716486" href="https://independent.academia.edu/HarishGarg2">Harish Garg</a><script data-card-contents-for-user="27716486" type="text/json">{"id":27716486,"first_name":"Harish","last_name":"Garg","domain_name":"independent","page_name":"HarishGarg2","display_name":"Harish Garg","profile_url":"https://independent.academia.edu/HarishGarg2?f_ri=143163","photo":"https://0.academia-photos.com/27716486/7878250/8826627/s65_harish.garg.jpg"}</script></span></span></li><li class="js-paper-rank-work_11396060 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11396060"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11396060, container: ".js-paper-rank-work_11396060", }); });</script></li><li class="js-percentile-work_11396060 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11396060; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11396060"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11396060 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11396060"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11396060; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11396060]").text(description); $(".js-view-count-work_11396060").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11396060").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11396060"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="5394" href="https://www.academia.edu/Documents/in/Fuzzy_set_theory">Fuzzy set theory</a>, <script data-card-contents-for-ri="5394" type="text/json">{"id":5394,"name":"Fuzzy set theory","url":"https://www.academia.edu/Documents/in/Fuzzy_set_theory?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="74772" href="https://www.academia.edu/Documents/in/Pso">Pso</a>, <script data-card-contents-for-ri="74772" type="text/json">{"id":74772,"name":"Pso","url":"https://www.academia.edu/Documents/in/Pso?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="128806" href="https://www.academia.edu/Documents/in/Reliability_Optimization">Reliability Optimization</a><script data-card-contents-for-ri="128806" type="text/json">{"id":128806,"name":"Reliability Optimization","url":"https://www.academia.edu/Documents/in/Reliability_Optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11396060]'), work: {"id":11396060,"title":"Intuitionistic fuzzy optimization technique for solving multi-objective reliability optimization problems in interval environment","created_at":"2015-03-12T12:03:25.926-07:00","url":"https://www.academia.edu/11396060/Intuitionistic_fuzzy_optimization_technique_for_solving_multi_objective_reliability_optimization_problems_in_interval_environment?f_ri=143163","dom_id":"work_11396060","summary":null,"downloadable_attachments":[{"id":46732168,"asset_id":11396060,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":27716486,"first_name":"Harish","last_name":"Garg","domain_name":"independent","page_name":"HarishGarg2","display_name":"Harish Garg","profile_url":"https://independent.academia.edu/HarishGarg2?f_ri=143163","photo":"https://0.academia-photos.com/27716486/7878250/8826627/s65_harish.garg.jpg"}],"research_interests":[{"id":5394,"name":"Fuzzy set theory","url":"https://www.academia.edu/Documents/in/Fuzzy_set_theory?f_ri=143163","nofollow":false},{"id":74772,"name":"Pso","url":"https://www.academia.edu/Documents/in/Pso?f_ri=143163","nofollow":false},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false},{"id":128806,"name":"Reliability Optimization","url":"https://www.academia.edu/Documents/in/Reliability_Optimization?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":271007,"name":"Fuzzy optimization","url":"https://www.academia.edu/Documents/in/Fuzzy_optimization?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_49895392" data-work_id="49895392" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/49895392/On_the_multi_utility_representation_of_preference_relations">On the multi-utility representation of preference relations</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/49895392" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="b9f26a4cd04457873795d3b2652c5989" rel="nofollow" data-download="{"attachment_id":68083105,"asset_id":49895392,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/68083105/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="196561967" href="https://independent.academia.edu/EfeOk1">Efe Ok</a><script data-card-contents-for-user="196561967" type="text/json">{"id":196561967,"first_name":"Efe","last_name":"Ok","domain_name":"independent","page_name":"EfeOk1","display_name":"Efe Ok","profile_url":"https://independent.academia.edu/EfeOk1?f_ri=143163","photo":"https://0.academia-photos.com/196561967/58804631/47040851/s65_efe.ok.png"}</script></span></span></li><li class="js-paper-rank-work_49895392 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="49895392"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 49895392, container: ".js-paper-rank-work_49895392", }); });</script></li><li class="js-percentile-work_49895392 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 49895392; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_49895392"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_49895392 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="49895392"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 49895392; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=49895392]").text(description); $(".js-view-count-work_49895392").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_49895392").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="49895392"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="724" href="https://www.academia.edu/Documents/in/Economics">Economics</a>, <script data-card-contents-for-ri="724" type="text/json">{"id":724,"name":"Economics","url":"https://www.academia.edu/Documents/in/Economics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="749" href="https://www.academia.edu/Documents/in/Mathematical_Economics">Mathematical Economics</a>, <script data-card-contents-for-ri="749" type="text/json">{"id":749,"name":"Mathematical Economics","url":"https://www.academia.edu/Documents/in/Mathematical_Economics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="25660" href="https://www.academia.edu/Documents/in/Decision_Theory">Decision Theory</a>, <script data-card-contents-for-ri="25660" type="text/json">{"id":25660,"name":"Decision Theory","url":"https://www.academia.edu/Documents/in/Decision_Theory?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=49895392]'), work: {"id":49895392,"title":"On the multi-utility representation of preference relations","created_at":"2021-07-14T04:07:39.049-07:00","url":"https://www.academia.edu/49895392/On_the_multi_utility_representation_of_preference_relations?f_ri=143163","dom_id":"work_49895392","summary":null,"downloadable_attachments":[{"id":68083105,"asset_id":49895392,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":196561967,"first_name":"Efe","last_name":"Ok","domain_name":"independent","page_name":"EfeOk1","display_name":"Efe Ok","profile_url":"https://independent.academia.edu/EfeOk1?f_ri=143163","photo":"https://0.academia-photos.com/196561967/58804631/47040851/s65_efe.ok.png"}],"research_interests":[{"id":724,"name":"Economics","url":"https://www.academia.edu/Documents/in/Economics?f_ri=143163","nofollow":false},{"id":749,"name":"Mathematical Economics","url":"https://www.academia.edu/Documents/in/Mathematical_Economics?f_ri=143163","nofollow":false},{"id":25660,"name":"Decision Theory","url":"https://www.academia.edu/Documents/in/Decision_Theory?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":919171,"name":"Incomplete Preferences","url":"https://www.academia.edu/Documents/in/Incomplete_Preferences?f_ri=143163"},{"id":1208187,"name":"Representation Theorem","url":"https://www.academia.edu/Documents/in/Representation_Theorem?f_ri=143163"},{"id":2766107,"name":"UTILITY FUNCTION","url":"https://www.academia.edu/Documents/in/UTILITY_FUNCTION?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3805321" data-work_id="3805321" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3805321/A_multi_objective_genetic_local_search_algorithm_and_its_application_to_flowshop_scheduling">A multi-objective genetic local search algorithm and its application to flowshop scheduling</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3805321" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="711a9e0e1f2c534b36aae5d21b5e1679" rel="nofollow" data-download="{"attachment_id":50130426,"asset_id":3805321,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50130426/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4679606" href="https://kansai-u.academia.edu/TadahikoMurata">Tadahiko Murata</a><script data-card-contents-for-user="4679606" type="text/json">{"id":4679606,"first_name":"Tadahiko","last_name":"Murata","domain_name":"kansai-u","page_name":"TadahikoMurata","display_name":"Tadahiko Murata","profile_url":"https://kansai-u.academia.edu/TadahikoMurata?f_ri=143163","photo":"https://0.academia-photos.com/4679606/1968507/2326112/s65_tadahiko.murata.jpg"}</script></span></span></li><li class="js-paper-rank-work_3805321 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3805321"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3805321, container: ".js-paper-rank-work_3805321", }); });</script></li><li class="js-percentile-work_3805321 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3805321; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3805321"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3805321 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3805321"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3805321; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3805321]").text(description); $(".js-view-count-work_3805321").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3805321").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3805321"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">35</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="156" href="https://www.academia.edu/Documents/in/Genetics">Genetics</a>, <script data-card-contents-for-ri="156" type="text/json">{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="3523" href="https://www.academia.edu/Documents/in/Evolutionary_Computation">Evolutionary Computation</a>, <script data-card-contents-for-ri="3523" type="text/json">{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4312" href="https://www.academia.edu/Documents/in/Genetic_Drift">Genetic Drift</a><script data-card-contents-for-ri="4312" type="text/json">{"id":4312,"name":"Genetic Drift","url":"https://www.academia.edu/Documents/in/Genetic_Drift?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3805321]'), work: {"id":3805321,"title":"A multi-objective genetic local search algorithm and its application to flowshop scheduling","created_at":"2013-06-27T14:41:47.641-07:00","url":"https://www.academia.edu/3805321/A_multi_objective_genetic_local_search_algorithm_and_its_application_to_flowshop_scheduling?f_ri=143163","dom_id":"work_3805321","summary":null,"downloadable_attachments":[{"id":50130426,"asset_id":3805321,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4679606,"first_name":"Tadahiko","last_name":"Murata","domain_name":"kansai-u","page_name":"TadahikoMurata","display_name":"Tadahiko Murata","profile_url":"https://kansai-u.academia.edu/TadahikoMurata?f_ri=143163","photo":"https://0.academia-photos.com/4679606/1968507/2326112/s65_tadahiko.murata.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation?f_ri=143163","nofollow":false},{"id":4312,"name":"Genetic Drift","url":"https://www.academia.edu/Documents/in/Genetic_Drift?f_ri=143163","nofollow":false},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms?f_ri=143163"},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163"},{"id":6421,"name":"Simulated Annealing","url":"https://www.academia.edu/Documents/in/Simulated_Annealing?f_ri=143163"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling?f_ri=143163"},{"id":14305,"name":"Industrial Engineering","url":"https://www.academia.edu/Documents/in/Industrial_Engineering?f_ri=143163"},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=143163"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163"},{"id":43028,"name":"Genetic Diversity","url":"https://www.academia.edu/Documents/in/Genetic_Diversity?f_ri=143163"},{"id":43774,"name":"Learning","url":"https://www.academia.edu/Documents/in/Learning?f_ri=143163"},{"id":69542,"name":"Computer Simulation","url":"https://www.academia.edu/Documents/in/Computer_Simulation?f_ri=143163"},{"id":74778,"name":"Crossover","url":"https://www.academia.edu/Documents/in/Crossover?f_ri=143163"},{"id":76802,"name":"Reservoir Operation","url":"https://www.academia.edu/Documents/in/Reservoir_Operation?f_ri=143163"},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163"},{"id":107381,"name":"Local Search","url":"https://www.academia.edu/Documents/in/Local_Search?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163"},{"id":297691,"name":"High performance","url":"https://www.academia.edu/Documents/in/High_performance?f_ri=143163"},{"id":323690,"name":"Hybrid Algorithm","url":"https://www.academia.edu/Documents/in/Hybrid_Algorithm?f_ri=143163"},{"id":400356,"name":"Job shop scheduling","url":"https://www.academia.edu/Documents/in/Job_shop_scheduling?f_ri=143163"},{"id":501386,"name":"Fitness Function","url":"https://www.academia.edu/Documents/in/Fitness_Function?f_ri=143163"},{"id":557803,"name":"Self Organized Map","url":"https://www.academia.edu/Documents/in/Self_Organized_Map?f_ri=143163"},{"id":571144,"name":"Variable Neighborhood Search","url":"https://www.academia.edu/Documents/in/Variable_Neighborhood_Search?f_ri=143163"},{"id":581652,"name":"Data Processing","url":"https://www.academia.edu/Documents/in/Data_Processing?f_ri=143163"},{"id":588227,"name":"PROBABILITY DENSITY","url":"https://www.academia.edu/Documents/in/PROBABILITY_DENSITY?f_ri=143163"},{"id":779481,"name":"Self Organizing Maps","url":"https://www.academia.edu/Documents/in/Self_Organizing_Maps?f_ri=143163"},{"id":862243,"name":"Multiple Objectives","url":"https://www.academia.edu/Documents/in/Multiple_Objectives?f_ri=143163"},{"id":1216932,"name":"Rule Based","url":"https://www.academia.edu/Documents/in/Rule_Based?f_ri=143163"},{"id":1275985,"name":"Scheduling Algorithm","url":"https://www.academia.edu/Documents/in/Scheduling_Algorithm?f_ri=143163"},{"id":1326374,"name":"Random Search","url":"https://www.academia.edu/Documents/in/Random_Search?f_ri=143163"},{"id":1735828,"name":"Weighted sum","url":"https://www.academia.edu/Documents/in/Weighted_sum?f_ri=143163"},{"id":2100835,"name":"Weight Vector","url":"https://www.academia.edu/Documents/in/Weight_Vector?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_17921199" data-work_id="17921199" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/17921199/Workload_assignment_with_training_hiring_and_firing">Workload assignment with training, hiring and firing</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/17921199" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="f9a6d15198c0c8a762d78f99cc480831" rel="nofollow" data-download="{"attachment_id":39780643,"asset_id":17921199,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/39780643/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="26007708" href="https://uc-cl.academia.edu/VladimirMarianov">Vladimir Marianov</a><script data-card-contents-for-user="26007708" type="text/json">{"id":26007708,"first_name":"Vladimir","last_name":"Marianov","domain_name":"uc-cl","page_name":"VladimirMarianov","display_name":"Vladimir Marianov","profile_url":"https://uc-cl.academia.edu/VladimirMarianov?f_ri=143163","photo":"https://0.academia-photos.com/26007708/8385566/9375868/s65_vladimir.marianov.jpg"}</script></span></span></li><li class="js-paper-rank-work_17921199 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="17921199"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 17921199, container: ".js-paper-rank-work_17921199", }); });</script></li><li class="js-percentile-work_17921199 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 17921199; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_17921199"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_17921199 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="17921199"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 17921199; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=17921199]").text(description); $(".js-view-count-work_17921199").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_17921199").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="17921199"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">6</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8688" href="https://www.academia.edu/Documents/in/Job_Satisfaction">Job Satisfaction</a>, <script data-card-contents-for-ri="8688" type="text/json">{"id":8688,"name":"Job Satisfaction","url":"https://www.academia.edu/Documents/in/Job_Satisfaction?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="55523" href="https://www.academia.edu/Documents/in/Engineering_Optimization">Engineering Optimization</a>, <script data-card-contents-for-ri="55523" type="text/json">{"id":55523,"name":"Engineering Optimization","url":"https://www.academia.edu/Documents/in/Engineering_Optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="80414" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a><script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=17921199]'), work: {"id":17921199,"title":"Workload assignment with training, hiring and firing","created_at":"2015-11-07T12:25:46.218-08:00","url":"https://www.academia.edu/17921199/Workload_assignment_with_training_hiring_and_firing?f_ri=143163","dom_id":"work_17921199","summary":null,"downloadable_attachments":[{"id":39780643,"asset_id":17921199,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":26007708,"first_name":"Vladimir","last_name":"Marianov","domain_name":"uc-cl","page_name":"VladimirMarianov","display_name":"Vladimir Marianov","profile_url":"https://uc-cl.academia.edu/VladimirMarianov?f_ri=143163","photo":"https://0.academia-photos.com/26007708/8385566/9375868/s65_vladimir.marianov.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":8688,"name":"Job Satisfaction","url":"https://www.academia.edu/Documents/in/Job_Satisfaction?f_ri=143163","nofollow":false},{"id":55523,"name":"Engineering Optimization","url":"https://www.academia.edu/Documents/in/Engineering_Optimization?f_ri=143163","nofollow":false},{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":983454,"name":"Multi Dimensional","url":"https://www.academia.edu/Documents/in/Multi_Dimensional?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5145979 coauthored" data-work_id="5145979" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5145979/RSM_and_ANN_modeling_for_electrocoagulation_of_copper_from_simulated_wastewater_Multi_objective_optimization_using_genetic_algorithm_approach">RSM and ANN modeling for electrocoagulation of copper from simulated wastewater: Multi objective optimization using genetic algorithm approach</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5145979" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="678d1604e0d601ba585d25f8aaba10e3" rel="nofollow" data-download="{"attachment_id":49431257,"asset_id":5145979,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49431257/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="6945347" href="https://gndu.academia.edu/AshwaniThukral">Ashwani Thukral</a><script data-card-contents-for-user="6945347" type="text/json">{"id":6945347,"first_name":"Ashwani","last_name":"Thukral","domain_name":"gndu","page_name":"AshwaniThukral","display_name":"Ashwani Thukral","profile_url":"https://gndu.academia.edu/AshwaniThukral?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-5145979">+2</span><div class="hidden js-additional-users-5145979"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://thapar.academia.edu/AkepatiSReddy">Akepati S. Reddy</a></span></div><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/DhritiKapoor">Dhriti Kapoor</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-5145979'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-5145979').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_5145979 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5145979"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5145979, container: ".js-paper-rank-work_5145979", }); });</script></li><li class="js-percentile-work_5145979 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5145979; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5145979"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5145979 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5145979"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5145979; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5145979]").text(description); $(".js-view-count-work_5145979").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5145979").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5145979"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">22</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="988" href="https://www.academia.edu/Documents/in/Design">Design</a>, <script data-card-contents-for-ri="988" type="text/json">{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="6177" href="https://www.academia.edu/Documents/in/Modeling">Modeling</a>, <script data-card-contents-for-ri="6177" type="text/json">{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="9508" href="https://www.academia.edu/Documents/in/Response_Surface_Methodology">Response Surface Methodology</a><script data-card-contents-for-ri="9508" type="text/json">{"id":9508,"name":"Response Surface Methodology","url":"https://www.academia.edu/Documents/in/Response_Surface_Methodology?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5145979]'), work: {"id":5145979,"title":"RSM and ANN modeling for electrocoagulation of copper from simulated wastewater: Multi objective optimization using genetic algorithm approach","created_at":"2013-11-18T19:17:28.852-08:00","url":"https://www.academia.edu/5145979/RSM_and_ANN_modeling_for_electrocoagulation_of_copper_from_simulated_wastewater_Multi_objective_optimization_using_genetic_algorithm_approach?f_ri=143163","dom_id":"work_5145979","summary":null,"downloadable_attachments":[{"id":49431257,"asset_id":5145979,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":6945347,"first_name":"Ashwani","last_name":"Thukral","domain_name":"gndu","page_name":"AshwaniThukral","display_name":"Ashwani Thukral","profile_url":"https://gndu.academia.edu/AshwaniThukral?f_ri=143163","photo":"/images/s65_no_pic.png"},{"id":1115147,"first_name":"Akepati S.","last_name":"Reddy","domain_name":"thapar","page_name":"AkepatiSReddy","display_name":"Akepati S. Reddy","profile_url":"https://thapar.academia.edu/AkepatiSReddy?f_ri=143163","photo":"/images/s65_no_pic.png"},{"id":51601010,"first_name":"Dhriti","last_name":"Kapoor","domain_name":"independent","page_name":"DhritiKapoor","display_name":"Dhriti Kapoor","profile_url":"https://independent.academia.edu/DhritiKapoor?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":988,"name":"Design","url":"https://www.academia.edu/Documents/in/Design?f_ri=143163","nofollow":false},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163","nofollow":false},{"id":9508,"name":"Response Surface Methodology","url":"https://www.academia.edu/Documents/in/Response_Surface_Methodology?f_ri=143163","nofollow":false},{"id":11397,"name":"Energy Consumption","url":"https://www.academia.edu/Documents/in/Energy_Consumption?f_ri=143163"},{"id":26066,"name":"Neural Network","url":"https://www.academia.edu/Documents/in/Neural_Network?f_ri=143163"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":53158,"name":"Desalination","url":"https://www.academia.edu/Documents/in/Desalination?f_ri=143163"},{"id":57518,"name":"Conception","url":"https://www.academia.edu/Documents/in/Conception?f_ri=143163"},{"id":80692,"name":"Copper","url":"https://www.academia.edu/Documents/in/Copper?f_ri=143163"},{"id":84278,"name":"Ph","url":"https://www.academia.edu/Documents/in/Ph?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":169323,"name":"Composite Material","url":"https://www.academia.edu/Documents/in/Composite_Material?f_ri=143163"},{"id":260118,"name":"CHEMICAL SCIENCES","url":"https://www.academia.edu/Documents/in/CHEMICAL_SCIENCES?f_ri=143163"},{"id":414914,"name":"Waste Water","url":"https://www.academia.edu/Documents/in/Waste_Water?f_ri=143163"},{"id":477865,"name":"Operant Conditioning","url":"https://www.academia.edu/Documents/in/Operant_Conditioning?f_ri=143163"},{"id":570997,"name":"Pareto front","url":"https://www.academia.edu/Documents/in/Pareto_front?f_ri=143163"},{"id":846015,"name":"Electrodes","url":"https://www.academia.edu/Documents/in/Electrodes?f_ri=143163"},{"id":909150,"name":"Electrode","url":"https://www.academia.edu/Documents/in/Electrode?f_ri=143163"},{"id":990268,"name":"Model Building","url":"https://www.academia.edu/Documents/in/Model_Building?f_ri=143163"},{"id":1211304,"name":"Artificial Neural Network","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Network?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_5344588" data-work_id="5344588" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/5344588/Energy_and_cost_optimization_of_a_plate_and_fin_heat_exchanger_using_genetic_algorithm">Energy and cost optimization of a plate and fin heat exchanger using genetic algorithm</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/5344588" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="36c61f898ed1eea4f06719449c9c4ecc" rel="nofollow" data-download="{"attachment_id":49332817,"asset_id":5344588,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/49332817/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="7403518" href="https://polimi.academia.edu/behzadnajafi">Behzad Najafi</a><script data-card-contents-for-user="7403518" type="text/json">{"id":7403518,"first_name":"Behzad","last_name":"Najafi","domain_name":"polimi","page_name":"behzadnajafi","display_name":"Behzad Najafi","profile_url":"https://polimi.academia.edu/behzadnajafi?f_ri=143163","photo":"https://0.academia-photos.com/7403518/2717923/3165101/s65_behzad.najafi.jpg"}</script></span></span></li><li class="js-paper-rank-work_5344588 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="5344588"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 5344588, container: ".js-paper-rank-work_5344588", }); });</script></li><li class="js-percentile-work_5344588 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 5344588; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_5344588"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_5344588 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="5344588"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 5344588; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=5344588]").text(description); $(".js-view-count-work_5344588").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_5344588").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="5344588"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">19</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="8067" href="https://www.academia.edu/Documents/in/Heat_Transfer">Heat Transfer</a>, <script data-card-contents-for-ri="8067" type="text/json">{"id":8067,"name":"Heat Transfer","url":"https://www.academia.edu/Documents/in/Heat_Transfer?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="19517" href="https://www.academia.edu/Documents/in/Heat_Exchanger">Heat Exchanger</a>, <script data-card-contents-for-ri="19517" type="text/json">{"id":19517,"name":"Heat Exchanger","url":"https://www.academia.edu/Documents/in/Heat_Exchanger?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="20099" href="https://www.academia.edu/Documents/in/Sensitivity_Analysis">Sensitivity Analysis</a><script data-card-contents-for-ri="20099" type="text/json">{"id":20099,"name":"Sensitivity Analysis","url":"https://www.academia.edu/Documents/in/Sensitivity_Analysis?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=5344588]'), work: {"id":5344588,"title":"Energy and cost optimization of a plate and fin heat exchanger using genetic algorithm","created_at":"2013-12-06T19:17:44.855-08:00","url":"https://www.academia.edu/5344588/Energy_and_cost_optimization_of_a_plate_and_fin_heat_exchanger_using_genetic_algorithm?f_ri=143163","dom_id":"work_5344588","summary":null,"downloadable_attachments":[{"id":49332817,"asset_id":5344588,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":7403518,"first_name":"Behzad","last_name":"Najafi","domain_name":"polimi","page_name":"behzadnajafi","display_name":"Behzad Najafi","profile_url":"https://polimi.academia.edu/behzadnajafi?f_ri=143163","photo":"https://0.academia-photos.com/7403518/2717923/3165101/s65_behzad.najafi.jpg"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false},{"id":8067,"name":"Heat Transfer","url":"https://www.academia.edu/Documents/in/Heat_Transfer?f_ri=143163","nofollow":false},{"id":19517,"name":"Heat Exchanger","url":"https://www.academia.edu/Documents/in/Heat_Exchanger?f_ri=143163","nofollow":false},{"id":20099,"name":"Sensitivity Analysis","url":"https://www.academia.edu/Documents/in/Sensitivity_Analysis?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":78434,"name":"Investment","url":"https://www.academia.edu/Documents/in/Investment?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":292710,"name":"Inversion","url":"https://www.academia.edu/Documents/in/Inversion?f_ri=143163"},{"id":374713,"name":"Cost Analysis","url":"https://www.academia.edu/Documents/in/Cost_Analysis?f_ri=143163"},{"id":462594,"name":"Fin","url":"https://www.academia.edu/Documents/in/Fin?f_ri=143163"},{"id":554780,"name":"Interdisciplinary Engineering","url":"https://www.academia.edu/Documents/in/Interdisciplinary_Engineering?f_ri=143163"},{"id":641466,"name":"Applied Thermal Engineering","url":"https://www.academia.edu/Documents/in/Applied_Thermal_Engineering?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":789521,"name":"Optimal Design","url":"https://www.academia.edu/Documents/in/Optimal_Design?f_ri=143163"},{"id":1117829,"name":"PROJECT","url":"https://www.academia.edu/Documents/in/PROJECT?f_ri=143163"},{"id":1879185,"name":"Cost Optimization","url":"https://www.academia.edu/Documents/in/Cost_Optimization?f_ri=143163"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_24187620" data-work_id="24187620" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/24187620/Multi_objective_optimization_using_MS_Excel_with_an_application_to_design_of_a_falling_film_evaporator_system">Multi-objective optimization using MS Excel with an application to design of a falling-film evaporator system</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/24187620" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="a8a8eecd6f65802bfc8906902134a6ec" rel="nofollow" data-download="{"attachment_id":44522471,"asset_id":24187620,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/44522471/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40861615" href="https://independent.academia.edu/GadeRangaiah">G.P. Rangaiah</a><script data-card-contents-for-user="40861615" type="text/json">{"id":40861615,"first_name":"G.P.","last_name":"Rangaiah","domain_name":"independent","page_name":"GadeRangaiah","display_name":"G.P. Rangaiah","profile_url":"https://independent.academia.edu/GadeRangaiah?f_ri=143163","photo":"https://0.academia-photos.com/40861615/13586808/17888553/s65_g.p..rangaiah.jpg"}</script></span></span></li><li class="js-paper-rank-work_24187620 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="24187620"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 24187620, container: ".js-paper-rank-work_24187620", }); });</script></li><li class="js-percentile-work_24187620 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 24187620; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_24187620"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_24187620 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="24187620"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 24187620; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=24187620]").text(description); $(".js-view-count-work_24187620").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_24187620").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="24187620"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">5</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="14907" href="https://www.academia.edu/Documents/in/Industrial_Biotechnology">Industrial Biotechnology</a>, <script data-card-contents-for-ri="14907" type="text/json">{"id":14907,"name":"Industrial Biotechnology","url":"https://www.academia.edu/Documents/in/Industrial_Biotechnology?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="46254" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a>, <script data-card-contents-for-ri="46254" type="text/json">{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=24187620]'), work: {"id":24187620,"title":"Multi-objective optimization using MS Excel with an application to design of a falling-film evaporator system","created_at":"2016-04-07T17:59:32.061-07:00","url":"https://www.academia.edu/24187620/Multi_objective_optimization_using_MS_Excel_with_an_application_to_design_of_a_falling_film_evaporator_system?f_ri=143163","dom_id":"work_24187620","summary":null,"downloadable_attachments":[{"id":44522471,"asset_id":24187620,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":40861615,"first_name":"G.P.","last_name":"Rangaiah","domain_name":"independent","page_name":"GadeRangaiah","display_name":"G.P. Rangaiah","profile_url":"https://independent.academia.edu/GadeRangaiah?f_ri=143163","photo":"https://0.academia-photos.com/40861615/13586808/17888553/s65_g.p..rangaiah.jpg"}],"research_interests":[{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false},{"id":14907,"name":"Industrial Biotechnology","url":"https://www.academia.edu/Documents/in/Industrial_Biotechnology?f_ri=143163","nofollow":false},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":573653,"name":"Food Sciences","url":"https://www.academia.edu/Documents/in/Food_Sciences?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7484260" data-work_id="7484260" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7484260/Maintenance_optimization_models_and_criteria">Maintenance optimization models and criteria</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Due to widespread automation and the high capital tied up in production equipment, the importance of maintenance is ever increasing. This makes maintenance an investment opportunity to be optimized, not a cost to be minimized. Academics... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_7484260" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Due to widespread automation and the high capital tied up in production equipment, the importance of maintenance is ever increasing. This makes maintenance an investment opportunity to be optimized, not a cost to be minimized. Academics have recognized this and many maintenance optimization models have been published over the years. Most of these models focus on one optimization criterion or objective, making multi-objective optimization models an underexplored area of maintenance optimization. Moreover, there is a big gap between academic models and application in practice. It is very difficult for industrial companies to adapt these models to their specific business context. This article reviews the literature on maintenance optimization models, with special focus on the optimization criteria and objectives used. To overcome flaws in present optimization models, a generic classification framework of maintenance optimization models is presented. All factors that have an influence on the optimization model will be made explicit and their links will be established. The framework is a starting point to develop business specific optimization models and enables decision making in e-maintenance. Moreover, it ensures a fit between the business model of a company and the maintenance optimization model right from the beginning. Future research will be on the development of a maintenance optimization model taking into account the most relevant optimization influence factors and criteria for a situation at hand.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7484260" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="73b01eca166033c8b2c02a4fcd8b0b8f" rel="nofollow" data-download="{"attachment_id":48454653,"asset_id":7484260,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/48454653/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="13351619" href="https://independent.academia.edu/Muchiri">Peter Muchiri</a><script data-card-contents-for-user="13351619" type="text/json">{"id":13351619,"first_name":"Peter","last_name":"Muchiri","domain_name":"independent","page_name":"Muchiri","display_name":"Peter Muchiri","profile_url":"https://independent.academia.edu/Muchiri?f_ri=143163","photo":"https://0.academia-photos.com/13351619/3742717/4384180/s65_peter.muchiri.jpg"}</script></span></span></li><li class="js-paper-rank-work_7484260 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7484260"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7484260, container: ".js-paper-rank-work_7484260", }); });</script></li><li class="js-percentile-work_7484260 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7484260; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7484260"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7484260 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7484260"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7484260; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7484260]").text(description); $(".js-view-count-work_7484260").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7484260").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7484260"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">5</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1681" href="https://www.academia.edu/Documents/in/Decision_Making">Decision Making</a>, <script data-card-contents-for-ri="1681" type="text/json">{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="128433" href="https://www.academia.edu/Documents/in/Business_Model">Business Model</a>, <script data-card-contents-for-ri="128433" type="text/json">{"id":128433,"name":"Business Model","url":"https://www.academia.edu/Documents/in/Business_Model?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="149081" href="https://www.academia.edu/Documents/in/Decision_Support">Decision Support</a><script data-card-contents-for-ri="149081" type="text/json">{"id":149081,"name":"Decision Support","url":"https://www.academia.edu/Documents/in/Decision_Support?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7484260]'), work: {"id":7484260,"title":"Maintenance optimization models and criteria","created_at":"2014-06-27T18:15:22.592-07:00","url":"https://www.academia.edu/7484260/Maintenance_optimization_models_and_criteria?f_ri=143163","dom_id":"work_7484260","summary":"Due to widespread automation and the high capital tied up in production equipment, the importance of maintenance is ever increasing. This makes maintenance an investment opportunity to be optimized, not a cost to be minimized. Academics have recognized this and many maintenance optimization models have been published over the years. Most of these models focus on one optimization criterion or objective, making multi-objective optimization models an underexplored area of maintenance optimization. Moreover, there is a big gap between academic models and application in practice. It is very difficult for industrial companies to adapt these models to their specific business context. This article reviews the literature on maintenance optimization models, with special focus on the optimization criteria and objectives used. To overcome flaws in present optimization models, a generic classification framework of maintenance optimization models is presented. All factors that have an influence on the optimization model will be made explicit and their links will be established. The framework is a starting point to develop business specific optimization models and enables decision making in e-maintenance. Moreover, it ensures a fit between the business model of a company and the maintenance optimization model right from the beginning. Future research will be on the development of a maintenance optimization model taking into account the most relevant optimization influence factors and criteria for a situation at hand.","downloadable_attachments":[{"id":48454653,"asset_id":7484260,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":13351619,"first_name":"Peter","last_name":"Muchiri","domain_name":"independent","page_name":"Muchiri","display_name":"Peter Muchiri","profile_url":"https://independent.academia.edu/Muchiri?f_ri=143163","photo":"https://0.academia-photos.com/13351619/3742717/4384180/s65_peter.muchiri.jpg"}],"research_interests":[{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=143163","nofollow":false},{"id":128433,"name":"Business Model","url":"https://www.academia.edu/Documents/in/Business_Model?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":149081,"name":"Decision Support","url":"https://www.academia.edu/Documents/in/Decision_Support?f_ri=143163","nofollow":false},{"id":160102,"name":"Systems","url":"https://www.academia.edu/Documents/in/Systems?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_8433665" data-work_id="8433665" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/8433665/Wing_and_Airfoil_Optimized_Design_of_Transport_Aircraft">Wing and Airfoil Optimized Design of Transport Aircraft</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/8433665" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="cc0e8fc2d2c0ccce0bed1cbec3a38446" rel="nofollow" data-download="{"attachment_id":34823679,"asset_id":8433665,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34823679/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="17118726" href="https://independent.academia.edu/MachadoJuliano">Juliano Machado</a><script data-card-contents-for-user="17118726" type="text/json">{"id":17118726,"first_name":"Juliano","last_name":"Machado","domain_name":"independent","page_name":"MachadoJuliano","display_name":"Juliano Machado","profile_url":"https://independent.academia.edu/MachadoJuliano?f_ri=143163","photo":"https://0.academia-photos.com/17118726/4710279/5434117/s65_juliano.machado.jpg_oh_1933577d5dc96bbd77a7e697ac179cfa_oe_54d022d6___gda___1418296385_8bf3dac6ca1f111b64bbe5f03c0ecf2d"}</script></span></span></li><li class="js-paper-rank-work_8433665 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="8433665"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 8433665, container: ".js-paper-rank-work_8433665", }); });</script></li><li class="js-percentile-work_8433665 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 8433665; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_8433665"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_8433665 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="8433665"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 8433665; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=8433665]").text(description); $(".js-view-count-work_8433665").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_8433665").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="8433665"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="16478" href="https://www.academia.edu/Documents/in/Aircraft_Design">Aircraft Design</a>, <script data-card-contents-for-ri="16478" type="text/json">{"id":16478,"name":"Aircraft Design","url":"https://www.academia.edu/Documents/in/Aircraft_Design?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="35399" href="https://www.academia.edu/Documents/in/Control_system">Control system</a>, <script data-card-contents-for-ri="35399" type="text/json">{"id":35399,"name":"Control system","url":"https://www.academia.edu/Documents/in/Control_system?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="265625" href="https://www.academia.edu/Documents/in/Evolutionary_Algorithm">Evolutionary Algorithm</a><script data-card-contents-for-ri="265625" type="text/json">{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=8433665]'), work: {"id":8433665,"title":"Wing and Airfoil Optimized Design of Transport Aircraft","created_at":"2014-09-22T00:37:31.309-07:00","url":"https://www.academia.edu/8433665/Wing_and_Airfoil_Optimized_Design_of_Transport_Aircraft?f_ri=143163","dom_id":"work_8433665","summary":null,"downloadable_attachments":[{"id":34823679,"asset_id":8433665,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":17118726,"first_name":"Juliano","last_name":"Machado","domain_name":"independent","page_name":"MachadoJuliano","display_name":"Juliano Machado","profile_url":"https://independent.academia.edu/MachadoJuliano?f_ri=143163","photo":"https://0.academia-photos.com/17118726/4710279/5434117/s65_juliano.machado.jpg_oh_1933577d5dc96bbd77a7e697ac179cfa_oe_54d022d6___gda___1418296385_8bf3dac6ca1f111b64bbe5f03c0ecf2d"}],"research_interests":[{"id":16478,"name":"Aircraft Design","url":"https://www.academia.edu/Documents/in/Aircraft_Design?f_ri=143163","nofollow":false},{"id":35399,"name":"Control system","url":"https://www.academia.edu/Documents/in/Control_system?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false},{"id":733224,"name":"Empirical Method","url":"https://www.academia.edu/Documents/in/Empirical_Method?f_ri=143163"},{"id":789521,"name":"Optimal Design","url":"https://www.academia.edu/Documents/in/Optimal_Design?f_ri=143163"},{"id":917989,"name":"Brazilian Congress","url":"https://www.academia.edu/Documents/in/Brazilian_Congress?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_25022668" data-work_id="25022668" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/25022668/A_Hierarchical_Distributed_Control_for_Power_and_Performances_Optimization_of_Embedded_Systems">A Hierarchical Distributed Control for Power and Performances Optimization of Embedded Systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/25022668" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e0e732a0216bafe28e5374a8215094b6" rel="nofollow" data-download="{"attachment_id":45346539,"asset_id":25022668,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/45346539/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="32695942" href="https://st.academia.edu/DSiorpaes">David Siorpaes</a><script data-card-contents-for-user="32695942" type="text/json">{"id":32695942,"first_name":"David","last_name":"Siorpaes","domain_name":"st","page_name":"DSiorpaes","display_name":"David Siorpaes","profile_url":"https://st.academia.edu/DSiorpaes?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_25022668 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="25022668"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 25022668, container: ".js-paper-rank-work_25022668", }); });</script></li><li class="js-percentile-work_25022668 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 25022668; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_25022668"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_25022668 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="25022668"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 25022668; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=25022668]").text(description); $(".js-view-count-work_25022668").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_25022668").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="25022668"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">11</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="11397" href="https://www.academia.edu/Documents/in/Energy_Consumption">Energy Consumption</a>, <script data-card-contents-for-ri="11397" type="text/json">{"id":11397,"name":"Energy Consumption","url":"https://www.academia.edu/Documents/in/Energy_Consumption?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="11401" href="https://www.academia.edu/Documents/in/Power_Management">Power Management</a>, <script data-card-contents-for-ri="11401" type="text/json">{"id":11401,"name":"Power Management","url":"https://www.academia.edu/Documents/in/Power_Management?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="73750" href="https://www.academia.edu/Documents/in/Distributed_Control">Distributed Control</a>, <script data-card-contents-for-ri="73750" type="text/json">{"id":73750,"name":"Distributed Control","url":"https://www.academia.edu/Documents/in/Distributed_Control?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=25022668]'), work: {"id":25022668,"title":"A Hierarchical Distributed Control for Power and Performances Optimization of Embedded Systems","created_at":"2016-05-04T06:32:56.055-07:00","url":"https://www.academia.edu/25022668/A_Hierarchical_Distributed_Control_for_Power_and_Performances_Optimization_of_Embedded_Systems?f_ri=143163","dom_id":"work_25022668","summary":null,"downloadable_attachments":[{"id":45346539,"asset_id":25022668,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":32695942,"first_name":"David","last_name":"Siorpaes","domain_name":"st","page_name":"DSiorpaes","display_name":"David Siorpaes","profile_url":"https://st.academia.edu/DSiorpaes?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":11397,"name":"Energy Consumption","url":"https://www.academia.edu/Documents/in/Energy_Consumption?f_ri=143163","nofollow":false},{"id":11401,"name":"Power Management","url":"https://www.academia.edu/Documents/in/Power_Management?f_ri=143163","nofollow":false},{"id":73750,"name":"Distributed Control","url":"https://www.academia.edu/Documents/in/Distributed_Control?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":406370,"name":"Formal Model","url":"https://www.academia.edu/Documents/in/Formal_Model?f_ri=143163"},{"id":545402,"name":"Cross layer","url":"https://www.academia.edu/Documents/in/Cross_layer?f_ri=143163"},{"id":582043,"name":"Development Process","url":"https://www.academia.edu/Documents/in/Development_Process?f_ri=143163"},{"id":726991,"name":"Power Saving","url":"https://www.academia.edu/Documents/in/Power_Saving?f_ri=143163"},{"id":1148030,"name":"Embedded System","url":"https://www.academia.edu/Documents/in/Embedded_System?f_ri=143163"},{"id":1307010,"name":"Performance Optimization","url":"https://www.academia.edu/Documents/in/Performance_Optimization?f_ri=143163"},{"id":1764143,"name":"Device Driver","url":"https://www.academia.edu/Documents/in/Device_Driver?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_6722440" data-work_id="6722440" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/6722440/A_multi_objective_design_methodology_for_hybrid_renewable_energy_systems">A multi-objective design methodology for hybrid renewable energy systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_6722440" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand, reliability, stability and battery constraints. The minimum emissions objective (MEO) is now an important target to achieve subject to the above mentioned constraints. Each of the above problems may be solved using linear programming, but minimizing the two preceding objectives at the same time forms a multi-objective problem which is solved by the epsiv-constraint and the goal attainment methods. The epsiv-constraint method minimizes the total cost while the emissions are less than a certain value epsiv determined by the linear programming when minimizing emissions only or by the designer. The goal attainment method tries to balance all the objectives and make them as close as possible to the initial goals determined by MCO and MEO. A case study is presented to illustrate the applicability and the usefulness of the proposed method.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/6722440" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="11019787" href="https://aub-lb.academia.edu/SamiKaraki">Sami Karaki</a><script data-card-contents-for-user="11019787" type="text/json">{"id":11019787,"first_name":"Sami","last_name":"Karaki","domain_name":"aub-lb","page_name":"SamiKaraki","display_name":"Sami Karaki","profile_url":"https://aub-lb.academia.edu/SamiKaraki?f_ri=143163","photo":"https://0.academia-photos.com/11019787/164816922/154639992/s65_sami.karaki.jpeg"}</script></span></span></li><li class="js-paper-rank-work_6722440 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="6722440"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 6722440, container: ".js-paper-rank-work_6722440", }); });</script></li><li class="js-percentile-work_6722440 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 6722440; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_6722440"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_6722440 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="6722440"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 6722440; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=6722440]").text(description); $(".js-view-count-work_6722440").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_6722440").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="6722440"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">16</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2738" href="https://www.academia.edu/Documents/in/Renewable_Energy">Renewable Energy</a>, <script data-card-contents-for-ri="2738" type="text/json">{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4222" href="https://www.academia.edu/Documents/in/Hybrid_Systems">Hybrid Systems</a>, <script data-card-contents-for-ri="4222" type="text/json">{"id":4222,"name":"Hybrid Systems","url":"https://www.academia.edu/Documents/in/Hybrid_Systems?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5447" href="https://www.academia.edu/Documents/in/Linear_Programming">Linear Programming</a>, <script data-card-contents-for-ri="5447" type="text/json">{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="18186" href="https://www.academia.edu/Documents/in/Renewable_energy_resources">Renewable energy resources</a><script data-card-contents-for-ri="18186" type="text/json">{"id":18186,"name":"Renewable energy resources","url":"https://www.academia.edu/Documents/in/Renewable_energy_resources?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=6722440]'), work: {"id":6722440,"title":"A multi-objective design methodology for hybrid renewable energy systems","created_at":"2014-04-10T20:47:02.946-07:00","url":"https://www.academia.edu/6722440/A_multi_objective_design_methodology_for_hybrid_renewable_energy_systems?f_ri=143163","dom_id":"work_6722440","summary":"This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand, reliability, stability and battery constraints. The minimum emissions objective (MEO) is now an important target to achieve subject to the above mentioned constraints. Each of the above problems may be solved using linear programming, but minimizing the two preceding objectives at the same time forms a multi-objective problem which is solved by the epsiv-constraint and the goal attainment methods. The epsiv-constraint method minimizes the total cost while the emissions are less than a certain value epsiv determined by the linear programming when minimizing emissions only or by the designer. The goal attainment method tries to balance all the objectives and make them as close as possible to the initial goals determined by MCO and MEO. A case study is presented to illustrate the applicability and the usefulness of the proposed method.","downloadable_attachments":[],"ordered_authors":[{"id":11019787,"first_name":"Sami","last_name":"Karaki","domain_name":"aub-lb","page_name":"SamiKaraki","display_name":"Sami Karaki","profile_url":"https://aub-lb.academia.edu/SamiKaraki?f_ri=143163","photo":"https://0.academia-photos.com/11019787/164816922/154639992/s65_sami.karaki.jpeg"}],"research_interests":[{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false},{"id":4222,"name":"Hybrid Systems","url":"https://www.academia.edu/Documents/in/Hybrid_Systems?f_ri=143163","nofollow":false},{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=143163","nofollow":false},{"id":18186,"name":"Renewable energy resources","url":"https://www.academia.edu/Documents/in/Renewable_energy_resources?f_ri=143163","nofollow":false},{"id":25600,"name":"Stability","url":"https://www.academia.edu/Documents/in/Stability?f_ri=143163"},{"id":53223,"name":"renewable Energy sources","url":"https://www.academia.edu/Documents/in/renewable_Energy_sources?f_ri=143163"},{"id":76333,"name":"Energy demand","url":"https://www.academia.edu/Documents/in/Energy_demand?f_ri=143163"},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163"},{"id":122602,"name":"Renewable Energy System","url":"https://www.academia.edu/Documents/in/Renewable_Energy_System?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":159687,"name":"Design Methodology","url":"https://www.academia.edu/Documents/in/Design_Methodology?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":838661,"name":"Photovoltaic systems","url":"https://www.academia.edu/Documents/in/Photovoltaic_systems?f_ri=143163"},{"id":1003508,"name":"Cost Function","url":"https://www.academia.edu/Documents/in/Cost_Function?f_ri=143163"},{"id":1451580,"name":"LINEAR PROGRAM","url":"https://www.academia.edu/Documents/in/LINEAR_PROGRAM?f_ri=143163"},{"id":2004933,"name":"Hybrid System","url":"https://www.academia.edu/Documents/in/Hybrid_System?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_69190361" data-work_id="69190361" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/69190361/Various_criteria_in_optimization_of_a_geothermal_air_conditioning_system_with_a_horizontal_ground_heat_exchanger">Various criteria in optimization of a geothermal air conditioning system with a horizontal ground heat exchanger</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">... Various criteria in optimization of a geothermal air conditioning system with a horizontal ground heat exchanger Hoseyn Sayyaadi Ć,y and Emad Hadaddi Amlashi Faculty of Mechanical EngineeringEnergy Division, KN Toosi University of... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_69190361" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">... Various criteria in optimization of a geothermal air conditioning system with a horizontal ground heat exchanger Hoseyn Sayyaadi Ć,y and Emad Hadaddi Amlashi Faculty of Mechanical EngineeringEnergy Division, KN Toosi University of Technology, Tehran, Iran SUMMARY ...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/69190361" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="137397900" href="https://independent.academia.edu/EmadHadadiAmlashi">Emad Hadadi Amlashi</a><script data-card-contents-for-user="137397900" type="text/json">{"id":137397900,"first_name":"Emad","last_name":"Hadadi Amlashi","domain_name":"independent","page_name":"EmadHadadiAmlashi","display_name":"Emad Hadadi Amlashi","profile_url":"https://independent.academia.edu/EmadHadadiAmlashi?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_69190361 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="69190361"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 69190361, container: ".js-paper-rank-work_69190361", }); });</script></li><li class="js-percentile-work_69190361 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 69190361; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_69190361"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_69190361 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="69190361"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 69190361; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=69190361]").text(description); $(".js-view-count-work_69190361").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_69190361").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="69190361"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">16</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="72" href="https://www.academia.edu/Documents/in/Chemical_Engineering">Chemical Engineering</a>, <script data-card-contents-for-ri="72" type="text/json">{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="465" href="https://www.academia.edu/Documents/in/Artificial_Intelligence">Artificial Intelligence</a>, <script data-card-contents-for-ri="465" type="text/json">{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="522" href="https://www.academia.edu/Documents/in/Thermodynamics">Thermodynamics</a><script data-card-contents-for-ri="522" type="text/json">{"id":522,"name":"Thermodynamics","url":"https://www.academia.edu/Documents/in/Thermodynamics?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=69190361]'), work: {"id":69190361,"title":"Various criteria in optimization of a geothermal air conditioning system with a horizontal ground heat exchanger","created_at":"2022-01-22T11:49:59.127-08:00","url":"https://www.academia.edu/69190361/Various_criteria_in_optimization_of_a_geothermal_air_conditioning_system_with_a_horizontal_ground_heat_exchanger?f_ri=143163","dom_id":"work_69190361","summary":"... Various criteria in optimization of a geothermal air conditioning system with a horizontal ground heat exchanger Hoseyn Sayyaadi Ć,y and Emad Hadaddi Amlashi Faculty of Mechanical EngineeringEnergy Division, KN Toosi University of Technology, Tehran, Iran SUMMARY ...","downloadable_attachments":[],"ordered_authors":[{"id":137397900,"first_name":"Emad","last_name":"Hadadi Amlashi","domain_name":"independent","page_name":"EmadHadadiAmlashi","display_name":"Emad Hadadi Amlashi","profile_url":"https://independent.academia.edu/EmadHadadiAmlashi?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false},{"id":72,"name":"Chemical Engineering","url":"https://www.academia.edu/Documents/in/Chemical_Engineering?f_ri=143163","nofollow":false},{"id":465,"name":"Artificial Intelligence","url":"https://www.academia.edu/Documents/in/Artificial_Intelligence?f_ri=143163","nofollow":false},{"id":522,"name":"Thermodynamics","url":"https://www.academia.edu/Documents/in/Thermodynamics?f_ri=143163","nofollow":false},{"id":5412,"name":"Energy","url":"https://www.academia.edu/Documents/in/Energy?f_ri=143163"},{"id":6177,"name":"Modeling","url":"https://www.academia.edu/Documents/in/Modeling?f_ri=143163"},{"id":19517,"name":"Heat Exchanger","url":"https://www.academia.edu/Documents/in/Heat_Exchanger?f_ri=143163"},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm?f_ri=143163"},{"id":43981,"name":"Optimization","url":"https://www.academia.edu/Documents/in/Optimization?f_ri=143163"},{"id":56060,"name":"Thermoeconomics","url":"https://www.academia.edu/Documents/in/Thermoeconomics?f_ri=143163"},{"id":103356,"name":"Exergy","url":"https://www.academia.edu/Documents/in/Exergy?f_ri=143163"},{"id":116306,"name":"Air Conditioning","url":"https://www.academia.edu/Documents/in/Air_Conditioning?f_ri=143163"},{"id":134767,"name":"Exergy Analysis","url":"https://www.academia.edu/Documents/in/Exergy_Analysis?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163"},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_68441075" data-work_id="68441075" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/68441075/Robust_Design_and_Parametric_Performance_Study_of_an_Automotive_Fan_Blade_by_Coupling_Multi_Objective_Genetic_Optimization_and_Flow_Parameterization">Robust Design and Parametric Performance Study of an Automotive Fan Blade by Coupling Multi-Objective Genetic Optimization and Flow Parameterization</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">Optimal design techniques are not routinely used in the industry when dealing with complex physical phenomena, due to high computing costs. The parameterization method described in this paper is based on the differentiation and high-order... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_68441075" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">Optimal design techniques are not routinely used in the industry when dealing with complex physical phenomena, due to high computing costs. The parameterization method described in this paper is based on the differentiation and high-order Taylor-series expansion of the discretized Reynolds-Averaged Navier-Stokes equations. A flow database containing the derivatives of the physical variables with respect to the design variables is produced by the Turb’Opty c © parameterization tool and thoroughly explored by a multi-objective Genetic Algorithm coupled to the extrapolation tool Turb’Post c . The optimization case of an automotive engine cooling fan blade is fully described. Five geometric parameters have been chosen to characterize the fan blade. Three objective functions have been taken into account: the minimization of the loss coefficient, the maximization of the static pressure rise and the minimization of the torque. Two geometric constraints have been imposed to the extrapolated...</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/68441075" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="85b273e40a03e15ecc37c88ea1d94ab5" rel="nofollow" data-download="{"attachment_id":78914400,"asset_id":68441075,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/78914400/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="179427" href="https://usherbrooke.academia.edu/StephaneMoreau">Stephane Moreau</a><script data-card-contents-for-user="179427" type="text/json">{"id":179427,"first_name":"Stephane","last_name":"Moreau","domain_name":"usherbrooke","page_name":"StephaneMoreau","display_name":"Stephane Moreau","profile_url":"https://usherbrooke.academia.edu/StephaneMoreau?f_ri=143163","photo":"https://0.academia-photos.com/179427/3767666/4410929/s65_stephane.moreau.jpg"}</script></span></span></li><li class="js-paper-rank-work_68441075 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="68441075"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 68441075, container: ".js-paper-rank-work_68441075", }); });</script></li><li class="js-percentile-work_68441075 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 68441075; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_68441075"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_68441075 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="68441075"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 68441075; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=68441075]").text(description); $(".js-view-count-work_68441075").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_68441075").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="68441075"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">13</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="156" href="https://www.academia.edu/Documents/in/Genetics">Genetics</a>, <script data-card-contents-for-ri="156" type="text/json">{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2298" href="https://www.academia.edu/Documents/in/Computational_Fluid_Dynamics">Computational Fluid Dynamics</a>, <script data-card-contents-for-ri="2298" type="text/json">{"id":2298,"name":"Computational Fluid Dynamics","url":"https://www.academia.edu/Documents/in/Computational_Fluid_Dynamics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="48652" href="https://www.academia.edu/Documents/in/Shape_Optimization">Shape Optimization</a><script data-card-contents-for-ri="48652" type="text/json">{"id":48652,"name":"Shape Optimization","url":"https://www.academia.edu/Documents/in/Shape_Optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=68441075]'), work: {"id":68441075,"title":"Robust Design and Parametric Performance Study of an Automotive Fan Blade by Coupling Multi-Objective Genetic Optimization and Flow Parameterization","created_at":"2022-01-16T13:48:20.674-08:00","url":"https://www.academia.edu/68441075/Robust_Design_and_Parametric_Performance_Study_of_an_Automotive_Fan_Blade_by_Coupling_Multi_Objective_Genetic_Optimization_and_Flow_Parameterization?f_ri=143163","dom_id":"work_68441075","summary":"Optimal design techniques are not routinely used in the industry when dealing with complex physical phenomena, due to high computing costs. The parameterization method described in this paper is based on the differentiation and high-order Taylor-series expansion of the discretized Reynolds-Averaged Navier-Stokes equations. A flow database containing the derivatives of the physical variables with respect to the design variables is produced by the Turb’Opty c © parameterization tool and thoroughly explored by a multi-objective Genetic Algorithm coupled to the extrapolation tool Turb’Post c . The optimization case of an automotive engine cooling fan blade is fully described. Five geometric parameters have been chosen to characterize the fan blade. Three objective functions have been taken into account: the minimization of the loss coefficient, the maximization of the static pressure rise and the minimization of the torque. Two geometric constraints have been imposed to the extrapolated...","downloadable_attachments":[{"id":78914400,"asset_id":68441075,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":179427,"first_name":"Stephane","last_name":"Moreau","domain_name":"usherbrooke","page_name":"StephaneMoreau","display_name":"Stephane Moreau","profile_url":"https://usherbrooke.academia.edu/StephaneMoreau?f_ri=143163","photo":"https://0.academia-photos.com/179427/3767666/4410929/s65_stephane.moreau.jpg"}],"research_interests":[{"id":156,"name":"Genetics","url":"https://www.academia.edu/Documents/in/Genetics?f_ri=143163","nofollow":false},{"id":2298,"name":"Computational Fluid Dynamics","url":"https://www.academia.edu/Documents/in/Computational_Fluid_Dynamics?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":48652,"name":"Shape Optimization","url":"https://www.academia.edu/Documents/in/Shape_Optimization?f_ri=143163","nofollow":false},{"id":91603,"name":"Computation Fluid Dynamics","url":"https://www.academia.edu/Documents/in/Computation_Fluid_Dynamics?f_ri=143163"},{"id":118070,"name":"Turbomachinery","url":"https://www.academia.edu/Documents/in/Turbomachinery?f_ri=143163"},{"id":129770,"name":"Key words","url":"https://www.academia.edu/Documents/in/Key_words?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":214482,"name":"Robust Design","url":"https://www.academia.edu/Documents/in/Robust_Design?f_ri=143163"},{"id":789521,"name":"Optimal Design","url":"https://www.academia.edu/Documents/in/Optimal_Design?f_ri=143163"},{"id":891680,"name":"Fan Blade Design","url":"https://www.academia.edu/Documents/in/Fan_Blade_Design?f_ri=143163"},{"id":1450944,"name":"Multi objective genetic algorithm optimisation","url":"https://www.academia.edu/Documents/in/Multi_objective_genetic_algorithm_optimisation?f_ri=143163"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_4563826" data-work_id="4563826" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/4563826/A_multi_objective_design_methodology_for_hybrid_renewable_energy_systems">A multi-objective design methodology for hybrid renewable energy systems</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand,... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_4563826" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand, reliability, stability and battery constraints. The minimum emissions objective (MEO) is now an important target to achieve subject to the above mentioned constraints. Each of the above problems may be solved using linear programming, but minimizing the two preceding objectives at the same time forms a multi-objective problem which is solved by the epsiv-constraint and the goal attainment methods. The epsiv-constraint method minimizes the total cost while the emissions are less than a certain value epsiv determined by the linear programming when minimizing emissions only or by the designer. The goal attainment method tries to balance all the objectives and make them as close as possible to the initial goals determined by MCO and MEO. A case study is presented to illustrate the applicability and the usefulness of the proposed method.</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/4563826" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1b7c9cdeccd2b5c5ea462b17362c145f" rel="nofollow" data-download="{"attachment_id":31939802,"asset_id":4563826,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/31939802/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="5710278" href="https://independent.academia.edu/ahmadrifai10">ahmad rifai</a><script data-card-contents-for-user="5710278" type="text/json">{"id":5710278,"first_name":"ahmad","last_name":"rifai","domain_name":"independent","page_name":"ahmadrifai10","display_name":"ahmad rifai","profile_url":"https://independent.academia.edu/ahmadrifai10?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_4563826 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="4563826"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 4563826, container: ".js-paper-rank-work_4563826", }); });</script></li><li class="js-percentile-work_4563826 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 4563826; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_4563826"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_4563826 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="4563826"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 4563826; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=4563826]").text(description); $(".js-view-count-work_4563826").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_4563826").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="4563826"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">16</a> </div><span class="InlineList-item-text u-textTruncate u-pl10x"><a class="InlineList-item-text" data-has-card-for-ri="2738" href="https://www.academia.edu/Documents/in/Renewable_Energy">Renewable Energy</a>, <script data-card-contents-for-ri="2738" type="text/json">{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4222" href="https://www.academia.edu/Documents/in/Hybrid_Systems">Hybrid Systems</a>, <script data-card-contents-for-ri="4222" type="text/json">{"id":4222,"name":"Hybrid Systems","url":"https://www.academia.edu/Documents/in/Hybrid_Systems?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="5447" href="https://www.academia.edu/Documents/in/Linear_Programming">Linear Programming</a>, <script data-card-contents-for-ri="5447" type="text/json">{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="18186" href="https://www.academia.edu/Documents/in/Renewable_energy_resources">Renewable energy resources</a><script data-card-contents-for-ri="18186" type="text/json">{"id":18186,"name":"Renewable energy resources","url":"https://www.academia.edu/Documents/in/Renewable_energy_resources?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=4563826]'), work: {"id":4563826,"title":"A multi-objective design methodology for hybrid renewable energy systems","created_at":"2013-09-23T10:38:30.133-07:00","url":"https://www.academia.edu/4563826/A_multi_objective_design_methodology_for_hybrid_renewable_energy_systems?f_ri=143163","dom_id":"work_4563826","summary":"This paper describes a methodology to design a hybrid renewable energy system over a certain planning horizon. Traditionally a system plan was developed to achieve a minimum cost objective (MCO) while satisfying the energy demand, reliability, stability and battery constraints. The minimum emissions objective (MEO) is now an important target to achieve subject to the above mentioned constraints. Each of the above problems may be solved using linear programming, but minimizing the two preceding objectives at the same time forms a multi-objective problem which is solved by the epsiv-constraint and the goal attainment methods. The epsiv-constraint method minimizes the total cost while the emissions are less than a certain value epsiv determined by the linear programming when minimizing emissions only or by the designer. The goal attainment method tries to balance all the objectives and make them as close as possible to the initial goals determined by MCO and MEO. A case study is presented to illustrate the applicability and the usefulness of the proposed method.","downloadable_attachments":[{"id":31939802,"asset_id":4563826,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":5710278,"first_name":"ahmad","last_name":"rifai","domain_name":"independent","page_name":"ahmadrifai10","display_name":"ahmad rifai","profile_url":"https://independent.academia.edu/ahmadrifai10?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false},{"id":4222,"name":"Hybrid Systems","url":"https://www.academia.edu/Documents/in/Hybrid_Systems?f_ri=143163","nofollow":false},{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming?f_ri=143163","nofollow":false},{"id":18186,"name":"Renewable energy resources","url":"https://www.academia.edu/Documents/in/Renewable_energy_resources?f_ri=143163","nofollow":false},{"id":25600,"name":"Stability","url":"https://www.academia.edu/Documents/in/Stability?f_ri=143163"},{"id":53223,"name":"renewable Energy sources","url":"https://www.academia.edu/Documents/in/renewable_Energy_sources?f_ri=143163"},{"id":76333,"name":"Energy demand","url":"https://www.academia.edu/Documents/in/Energy_demand?f_ri=143163"},{"id":96047,"name":"Case Study","url":"https://www.academia.edu/Documents/in/Case_Study?f_ri=143163"},{"id":122602,"name":"Renewable Energy System","url":"https://www.academia.edu/Documents/in/Renewable_Energy_System?f_ri=143163"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":159687,"name":"Design Methodology","url":"https://www.academia.edu/Documents/in/Design_Methodology?f_ri=143163"},{"id":679783,"name":"Boolean Satisfiability","url":"https://www.academia.edu/Documents/in/Boolean_Satisfiability?f_ri=143163"},{"id":838661,"name":"Photovoltaic systems","url":"https://www.academia.edu/Documents/in/Photovoltaic_systems?f_ri=143163"},{"id":1003508,"name":"Cost Function","url":"https://www.academia.edu/Documents/in/Cost_Function?f_ri=143163"},{"id":1451580,"name":"LINEAR PROGRAM","url":"https://www.academia.edu/Documents/in/LINEAR_PROGRAM?f_ri=143163"},{"id":2004933,"name":"Hybrid System","url":"https://www.academia.edu/Documents/in/Hybrid_System?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_11666060" data-work_id="11666060" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/11666060/A_Review_and_Evaluation_of_Multiobjective_Algorithms_for_the_Flowshop_Scheduling_Problem">A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/11666060" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="5902482d4a9955afd72a6f20a32b5303" rel="nofollow" data-download="{"attachment_id":46583158,"asset_id":11666060,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/46583158/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="28531327" href="https://polimi.academia.edu/MicheleCiavotta">Michele Ciavotta</a><script data-card-contents-for-user="28531327" type="text/json">{"id":28531327,"first_name":"Michele","last_name":"Ciavotta","domain_name":"polimi","page_name":"MicheleCiavotta","display_name":"Michele Ciavotta","profile_url":"https://polimi.academia.edu/MicheleCiavotta?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_11666060 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="11666060"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 11666060, container: ".js-paper-rank-work_11666060", }); });</script></li><li class="js-percentile-work_11666060 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 11666060; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_11666060"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_11666060 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="11666060"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 11666060; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=11666060]").text(description); $(".js-view-count-work_11666060").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_11666060").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="11666060"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="80414" href="https://www.academia.edu/Documents/in/Mathematical_Sciences">Mathematical Sciences</a>, <script data-card-contents-for-ri="80414" type="text/json">{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="112574" href="https://www.academia.edu/Documents/in/Goal_programming">Goal programming</a>, <script data-card-contents-for-ri="112574" type="text/json">{"id":112574,"name":"Goal programming","url":"https://www.academia.edu/Documents/in/Goal_programming?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="289017" href="https://www.academia.edu/Documents/in/Comparative_method">Comparative method</a><script data-card-contents-for-ri="289017" type="text/json">{"id":289017,"name":"Comparative method","url":"https://www.academia.edu/Documents/in/Comparative_method?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=11666060]'), work: {"id":11666060,"title":"A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem","created_at":"2015-03-26T03:05:50.480-07:00","url":"https://www.academia.edu/11666060/A_Review_and_Evaluation_of_Multiobjective_Algorithms_for_the_Flowshop_Scheduling_Problem?f_ri=143163","dom_id":"work_11666060","summary":null,"downloadable_attachments":[{"id":46583158,"asset_id":11666060,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":28531327,"first_name":"Michele","last_name":"Ciavotta","domain_name":"polimi","page_name":"MicheleCiavotta","display_name":"Michele Ciavotta","profile_url":"https://polimi.academia.edu/MicheleCiavotta?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":80414,"name":"Mathematical Sciences","url":"https://www.academia.edu/Documents/in/Mathematical_Sciences?f_ri=143163","nofollow":false},{"id":112574,"name":"Goal programming","url":"https://www.academia.edu/Documents/in/Goal_programming?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":289017,"name":"Comparative method","url":"https://www.academia.edu/Documents/in/Comparative_method?f_ri=143163","nofollow":false},{"id":413301,"name":"Perforation","url":"https://www.academia.edu/Documents/in/Perforation?f_ri=143163"},{"id":774112,"name":"Non parametric statistics","url":"https://www.academia.edu/Documents/in/Non_parametric_statistics?f_ri=143163"},{"id":2065599,"name":"Quality Measures","url":"https://www.academia.edu/Documents/in/Quality_Measures?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_15632579 coauthored" data-work_id="15632579" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/15632579/Wing_and_Airfoil_Optimized_Design_of_Transport_Aircraft">Wing and Airfoil Optimized Design of Transport Aircraft</a></div></div><div class="u-pb4x u-mt3x"><div class="summary u-fs14 u-fw300 u-lineHeight1_5 u-tcGrayDarkest"><div class="summarized">An efficient methodology for multi-disciplinary design and optimization of transport was elaborated and developed. The methodology was implemented in a commercial known optimization framework. Semi-empirical methods were employed for wing... <a class="more_link u-tcGrayDark u-linkUnstyled" data-container=".work_15632579" data-show=".complete" data-hide=".summarized" data-more-link-behavior="true" href="#">more</a></div><div class="complete hidden">An efficient methodology for multi-disciplinary design and optimization of transport was elaborated and developed. The methodology was implemented in a commercial known optimization framework. Semi-empirical methods were employed for wing weight estimation; a multi-block full-potential code was used for drag calculation; Vortex Lattice method was implemented for spanwise lift distribution in order to compute de aircraft maximum-lift coefficient via critical</div></div></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/15632579" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="1ffc374c25b8b0c03404a6fe93975658" rel="nofollow" data-download="{"attachment_id":38747847,"asset_id":15632579,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/38747847/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="34810116" href="https://ita-br.academia.edu/PPaglione">Pedro Paglione</a><script data-card-contents-for-user="34810116" type="text/json">{"id":34810116,"first_name":"Pedro","last_name":"Paglione","domain_name":"ita-br","page_name":"PPaglione","display_name":"Pedro Paglione","profile_url":"https://ita-br.academia.edu/PPaglione?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span><span class="u-displayInlineBlock InlineList-item-text"> and <span class="u-textDecorationUnderline u-clickable InlineList-item-text js-work-more-authors-15632579">+1</span><div class="hidden js-additional-users-15632579"><div><span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a href="https://independent.academia.edu/BentoMattos">Bento Mattos</a></span></div></div></span><script>(function(){ var popoverSettings = { el: $('.js-work-more-authors-15632579'), placement: 'bottom', hide_delay: 200, html: true, content: function(){ return $('.js-additional-users-15632579').html(); } } new HoverPopover(popoverSettings); })();</script></li><li class="js-paper-rank-work_15632579 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="15632579"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 15632579, container: ".js-paper-rank-work_15632579", }); });</script></li><li class="js-percentile-work_15632579 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 15632579; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_15632579"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_15632579 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="15632579"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 15632579; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=15632579]").text(description); $(".js-view-count-work_15632579").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_15632579").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="15632579"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="16478" href="https://www.academia.edu/Documents/in/Aircraft_Design">Aircraft Design</a>, <script data-card-contents-for-ri="16478" type="text/json">{"id":16478,"name":"Aircraft Design","url":"https://www.academia.edu/Documents/in/Aircraft_Design?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="35399" href="https://www.academia.edu/Documents/in/Control_system">Control system</a>, <script data-card-contents-for-ri="35399" type="text/json">{"id":35399,"name":"Control system","url":"https://www.academia.edu/Documents/in/Control_system?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="265625" href="https://www.academia.edu/Documents/in/Evolutionary_Algorithm">Evolutionary Algorithm</a><script data-card-contents-for-ri="265625" type="text/json">{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=15632579]'), work: {"id":15632579,"title":"Wing and Airfoil Optimized Design of Transport Aircraft","created_at":"2015-09-12T12:52:24.435-07:00","url":"https://www.academia.edu/15632579/Wing_and_Airfoil_Optimized_Design_of_Transport_Aircraft?f_ri=143163","dom_id":"work_15632579","summary":"An efficient methodology for multi-disciplinary design and optimization of transport was elaborated and developed. The methodology was implemented in a commercial known optimization framework. Semi-empirical methods were employed for wing weight estimation; a multi-block full-potential code was used for drag calculation; Vortex Lattice method was implemented for spanwise lift distribution in order to compute de aircraft maximum-lift coefficient via critical","downloadable_attachments":[{"id":38747847,"asset_id":15632579,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":34810116,"first_name":"Pedro","last_name":"Paglione","domain_name":"ita-br","page_name":"PPaglione","display_name":"Pedro Paglione","profile_url":"https://ita-br.academia.edu/PPaglione?f_ri=143163","photo":"/images/s65_no_pic.png"},{"id":34909301,"first_name":"Bento","last_name":"Mattos","domain_name":"independent","page_name":"BentoMattos","display_name":"Bento Mattos","profile_url":"https://independent.academia.edu/BentoMattos?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":16478,"name":"Aircraft Design","url":"https://www.academia.edu/Documents/in/Aircraft_Design?f_ri=143163","nofollow":false},{"id":35399,"name":"Control system","url":"https://www.academia.edu/Documents/in/Control_system?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm?f_ri=143163","nofollow":false},{"id":733224,"name":"Empirical Method","url":"https://www.academia.edu/Documents/in/Empirical_Method?f_ri=143163"},{"id":789521,"name":"Optimal Design","url":"https://www.academia.edu/Documents/in/Optimal_Design?f_ri=143163"},{"id":917989,"name":"Brazilian Congress","url":"https://www.academia.edu/Documents/in/Brazilian_Congress?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_7439790" data-work_id="7439790" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/7439790/Simulation_and_multi_objective_optimization_of_an_integrated_process_for_hydrogen_production_from_refinery_off_gas">Simulation and multi-objective optimization of an integrated process for hydrogen production from refinery off-gas</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/7439790" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="93aa7cdb2eda5621b25423724a33bdda" rel="nofollow" data-download="{"attachment_id":34022216,"asset_id":7439790,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/34022216/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="8238345" href="https://gsut.academia.edu/WangDongliang">Wang Dongliang</a><script data-card-contents-for-user="8238345" type="text/json">{"id":8238345,"first_name":"Wang","last_name":"Dongliang","domain_name":"gsut","page_name":"WangDongliang","display_name":"Wang Dongliang","profile_url":"https://gsut.academia.edu/WangDongliang?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_7439790 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="7439790"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 7439790, container: ".js-paper-rank-work_7439790", }); });</script></li><li class="js-percentile-work_7439790 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 7439790; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_7439790"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_7439790 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="7439790"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 7439790; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=7439790]").text(description); $(".js-view-count-work_7439790").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_7439790").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="7439790"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">3</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="146245" href="https://www.academia.edu/Documents/in/Hydrogen_Production">Hydrogen Production</a>, <script data-card-contents-for-ri="146245" type="text/json">{"id":146245,"name":"Hydrogen Production","url":"https://www.academia.edu/Documents/in/Hydrogen_Production?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="650486" href="https://www.academia.edu/Documents/in/ASPEN_PLUS">ASPEN PLUS</a><script data-card-contents-for-ri="650486" type="text/json">{"id":650486,"name":"ASPEN PLUS","url":"https://www.academia.edu/Documents/in/ASPEN_PLUS?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=7439790]'), work: {"id":7439790,"title":"Simulation and multi-objective optimization of an integrated process for hydrogen production from refinery off-gas","created_at":"2014-06-23T20:01:15.275-07:00","url":"https://www.academia.edu/7439790/Simulation_and_multi_objective_optimization_of_an_integrated_process_for_hydrogen_production_from_refinery_off_gas?f_ri=143163","dom_id":"work_7439790","summary":null,"downloadable_attachments":[{"id":34022216,"asset_id":7439790,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":8238345,"first_name":"Wang","last_name":"Dongliang","domain_name":"gsut","page_name":"WangDongliang","display_name":"Wang Dongliang","profile_url":"https://gsut.academia.edu/WangDongliang?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":146245,"name":"Hydrogen Production","url":"https://www.academia.edu/Documents/in/Hydrogen_Production?f_ri=143163","nofollow":false},{"id":650486,"name":"ASPEN PLUS","url":"https://www.academia.edu/Documents/in/ASPEN_PLUS?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_19978036" data-work_id="19978036" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/19978036/Modeling_Simulation_and_Multi_objective_Optimization_of_an_Industrial_Hydrocracking_Unit">Modeling, Simulation, and Multi-objective Optimization of an Industrial Hydrocracking Unit</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/19978036" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="89613d068400d613ef0a87ace517e19f" rel="nofollow" data-download="{"attachment_id":41220370,"asset_id":19978036,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/41220370/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="40861615" href="https://independent.academia.edu/GadeRangaiah">G.P. Rangaiah</a><script data-card-contents-for-user="40861615" type="text/json">{"id":40861615,"first_name":"G.P.","last_name":"Rangaiah","domain_name":"independent","page_name":"GadeRangaiah","display_name":"G.P. Rangaiah","profile_url":"https://independent.academia.edu/GadeRangaiah?f_ri=143163","photo":"https://0.academia-photos.com/40861615/13586808/17888553/s65_g.p..rangaiah.jpg"}</script></span></span></li><li class="js-paper-rank-work_19978036 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="19978036"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 19978036, container: ".js-paper-rank-work_19978036", }); });</script></li><li class="js-percentile-work_19978036 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 19978036; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_19978036"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_19978036 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="19978036"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 19978036; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=19978036]").text(description); $(".js-view-count-work_19978036").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_19978036").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="19978036"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">9</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="48" href="https://www.academia.edu/Documents/in/Engineering">Engineering</a>, <script data-card-contents-for-ri="48" type="text/json">{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="4987" href="https://www.academia.edu/Documents/in/Kinetics">Kinetics</a>, <script data-card-contents-for-ri="4987" type="text/json">{"id":4987,"name":"Kinetics","url":"https://www.academia.edu/Documents/in/Kinetics?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="202390" href="https://www.academia.edu/Documents/in/Product_Distribution">Product Distribution</a><script data-card-contents-for-ri="202390" type="text/json">{"id":202390,"name":"Product Distribution","url":"https://www.academia.edu/Documents/in/Product_Distribution?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=19978036]'), work: {"id":19978036,"title":"Modeling, Simulation, and Multi-objective Optimization of an Industrial Hydrocracking Unit","created_at":"2016-01-03T04:09:31.615-08:00","url":"https://www.academia.edu/19978036/Modeling_Simulation_and_Multi_objective_Optimization_of_an_Industrial_Hydrocracking_Unit?f_ri=143163","dom_id":"work_19978036","summary":null,"downloadable_attachments":[{"id":41220370,"asset_id":19978036,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":40861615,"first_name":"G.P.","last_name":"Rangaiah","domain_name":"independent","page_name":"GadeRangaiah","display_name":"G.P. Rangaiah","profile_url":"https://independent.academia.edu/GadeRangaiah?f_ri=143163","photo":"https://0.academia-photos.com/40861615/13586808/17888553/s65_g.p..rangaiah.jpg"}],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering?f_ri=143163","nofollow":false},{"id":4987,"name":"Kinetics","url":"https://www.academia.edu/Documents/in/Kinetics?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":202390,"name":"Product Distribution","url":"https://www.academia.edu/Documents/in/Product_Distribution?f_ri=143163","nofollow":false},{"id":260118,"name":"CHEMICAL SCIENCES","url":"https://www.academia.edu/Documents/in/CHEMICAL_SCIENCES?f_ri=143163"},{"id":835697,"name":"Lumping Kinetic Model","url":"https://www.academia.edu/Documents/in/Lumping_Kinetic_Model?f_ri=143163"},{"id":1117546,"name":"Industrial Chemistry/Chemical Engineering","url":"https://www.academia.edu/Documents/in/Industrial_Chemistry_Chemical_Engineering?f_ri=143163"},{"id":1208732,"name":"Simulation Model","url":"https://www.academia.edu/Documents/in/Simulation_Model?f_ri=143163"},{"id":1993320,"name":"Optimal Solution","url":"https://www.academia.edu/Documents/in/Optimal_Solution?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_30346839" data-work_id="30346839" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/30346839/An_efficient_sizing_method_with_suitable_energy_management_strategy_for_hybrid_renewable_energy_systems">An efficient sizing method with suitable energy management strategy for hybrid renewable energy systems</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/30346839" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="ea6fe32b58d0b31ba0c0ee46234ae616" rel="nofollow" data-download="{"attachment_id":50799640,"asset_id":30346839,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50799640/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="57845882" href="https://usbuniversity.academia.edu/MasoudBarakati">Masoud Barakati</a><script data-card-contents-for-user="57845882" type="text/json">{"id":57845882,"first_name":"Masoud","last_name":"Barakati","domain_name":"usbuniversity","page_name":"MasoudBarakati","display_name":"Masoud Barakati","profile_url":"https://usbuniversity.academia.edu/MasoudBarakati?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_30346839 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="30346839"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 30346839, container: ".js-paper-rank-work_30346839", }); });</script></li><li class="js-percentile-work_30346839 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 30346839; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_30346839"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_30346839 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="30346839"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 30346839; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=30346839]").text(description); $(".js-view-count-work_30346839").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_30346839").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="30346839"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">4</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="2738" href="https://www.academia.edu/Documents/in/Renewable_Energy">Renewable Energy</a>, <script data-card-contents-for-ri="2738" type="text/json">{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a>, <script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="398361" href="https://www.academia.edu/Documents/in/Large_Scale_Optimization">Large Scale Optimization</a>, <script data-card-contents-for-ri="398361" type="text/json">{"id":398361,"name":"Large Scale Optimization","url":"https://www.academia.edu/Documents/in/Large_Scale_Optimization?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="1237788" href="https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering">Electrical And Electronic Engineering</a><script data-card-contents-for-ri="1237788" type="text/json">{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=30346839]'), work: {"id":30346839,"title":"An efficient sizing method with suitable energy management strategy for hybrid renewable energy systems","created_at":"2016-12-09T03:07:55.300-08:00","url":"https://www.academia.edu/30346839/An_efficient_sizing_method_with_suitable_energy_management_strategy_for_hybrid_renewable_energy_systems?f_ri=143163","dom_id":"work_30346839","summary":null,"downloadable_attachments":[{"id":50799640,"asset_id":30346839,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":57845882,"first_name":"Masoud","last_name":"Barakati","domain_name":"usbuniversity","page_name":"MasoudBarakati","display_name":"Masoud Barakati","profile_url":"https://usbuniversity.academia.edu/MasoudBarakati?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":2738,"name":"Renewable Energy","url":"https://www.academia.edu/Documents/in/Renewable_Energy?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":398361,"name":"Large Scale Optimization","url":"https://www.academia.edu/Documents/in/Large_Scale_Optimization?f_ri=143163","nofollow":false},{"id":1237788,"name":"Electrical And Electronic Engineering","url":"https://www.academia.edu/Documents/in/Electrical_And_Electronic_Engineering?f_ri=143163","nofollow":false}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_14625624" data-work_id="14625624" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/14625624/Fixed_membrane_wings_for_micro_air_vehicles_Experimental_characterization_numerical_modeling_and_tailoring">Fixed membrane wings for micro air vehicles: Experimental characterization, numerical modeling, and tailoring</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/14625624" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="e592810a6c098a95006959c90bb509b5" rel="nofollow" data-download="{"attachment_id":44021525,"asset_id":14625624,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/44021525/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="33572000" href="https://oregonstate.academia.edu/RobertoAlbertani">Roberto Albertani</a><script data-card-contents-for-user="33572000" type="text/json">{"id":33572000,"first_name":"Roberto","last_name":"Albertani","domain_name":"oregonstate","page_name":"RobertoAlbertani","display_name":"Roberto Albertani","profile_url":"https://oregonstate.academia.edu/RobertoAlbertani?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_14625624 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="14625624"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 14625624, container: ".js-paper-rank-work_14625624", }); });</script></li><li class="js-percentile-work_14625624 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 14625624; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_14625624"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_14625624 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="14625624"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 14625624; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=14625624]").text(description); $(".js-view-count-work_14625624").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_14625624").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="14625624"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">9</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="60" href="https://www.academia.edu/Documents/in/Mechanical_Engineering">Mechanical Engineering</a>, <script data-card-contents-for-ri="60" type="text/json">{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="88" href="https://www.academia.edu/Documents/in/Aerospace_Engineering">Aerospace Engineering</a>, <script data-card-contents-for-ri="88" type="text/json">{"id":88,"name":"Aerospace Engineering","url":"https://www.academia.edu/Documents/in/Aerospace_Engineering?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="59707" href="https://www.academia.edu/Documents/in/Drag_Reduction">Drag Reduction</a>, <script data-card-contents-for-ri="59707" type="text/json">{"id":59707,"name":"Drag Reduction","url":"https://www.academia.edu/Documents/in/Drag_Reduction?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="143163" href="https://www.academia.edu/Documents/in/Multi_objective_optimization">Multi objective optimization</a><script data-card-contents-for-ri="143163" type="text/json">{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=14625624]'), work: {"id":14625624,"title":"Fixed membrane wings for micro air vehicles: Experimental characterization, numerical modeling, and tailoring","created_at":"2015-08-03T09:56:09.409-07:00","url":"https://www.academia.edu/14625624/Fixed_membrane_wings_for_micro_air_vehicles_Experimental_characterization_numerical_modeling_and_tailoring?f_ri=143163","dom_id":"work_14625624","summary":null,"downloadable_attachments":[{"id":44021525,"asset_id":14625624,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":33572000,"first_name":"Roberto","last_name":"Albertani","domain_name":"oregonstate","page_name":"RobertoAlbertani","display_name":"Roberto Albertani","profile_url":"https://oregonstate.academia.edu/RobertoAlbertani?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":60,"name":"Mechanical Engineering","url":"https://www.academia.edu/Documents/in/Mechanical_Engineering?f_ri=143163","nofollow":false},{"id":88,"name":"Aerospace Engineering","url":"https://www.academia.edu/Documents/in/Aerospace_Engineering?f_ri=143163","nofollow":false},{"id":59707,"name":"Drag Reduction","url":"https://www.academia.edu/Documents/in/Drag_Reduction?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163","nofollow":false},{"id":196514,"name":"Center of Gravity","url":"https://www.academia.edu/Documents/in/Center_of_Gravity?f_ri=143163"},{"id":205274,"name":"Micro Air Vehicle","url":"https://www.academia.edu/Documents/in/Micro_Air_Vehicle?f_ri=143163"},{"id":497452,"name":"Numerical Model","url":"https://www.academia.edu/Documents/in/Numerical_Model?f_ri=143163"},{"id":895065,"name":"Low Reynolds Number","url":"https://www.academia.edu/Documents/in/Low_Reynolds_Number?f_ri=143163"},{"id":1189635,"name":"Aspect Ratio","url":"https://www.academia.edu/Documents/in/Aspect_Ratio?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div><div class="u-borderBottom1 u-borderColorGrayLighter"><div class="clearfix u-pv7x u-mb0x js-work-card work_3780649" data-work_id="3780649" itemscope="itemscope" itemtype="https://schema.org/ScholarlyArticle"><div class="header"><div class="title u-fontSerif u-fs22 u-lineHeight1_3"><a class="u-tcGrayDarkest js-work-link" href="https://www.academia.edu/3780649/NON_DOMINATED_RANKED_GENETIC_ALGORITHM_FOR_SOLVING_MULTI_OBJECTIVE_OPTIMIZATION_PROBLEMS_NRGA">NON-DOMINATED RANKED GENETIC ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS: NRGA</a></div></div><div class="u-pb4x u-mt3x"></div><ul class="InlineList u-ph0x u-fs13"><li class="InlineList-item logged_in_only"><div class="share_on_academia_work_button"><a class="academia_share Button Button--inverseBlue Button--sm js-bookmark-button" data-academia-share="Work/3780649" data-share-source="work_strip" data-spinner="small_white_hide_contents"><i class="fa fa-plus"></i><span class="work-strip-link-text u-ml1x" data-content="button_text">Bookmark</span></a></div></li><li class="InlineList-item"><div class="download"><a id="3fb07cbc4a0600712691768a026a3e6d" rel="nofollow" data-download="{"attachment_id":50136489,"asset_id":3780649,"asset_type":"Work","always_allow_download":false,"track":null,"button_location":"work_strip","source":null,"hide_modal":null}" class="Button Button--sm Button--inverseGreen js-download-button prompt_button doc_download" href="https://www.academia.edu/attachments/50136489/download_file?st=MTczMjcyNjUyOSw4LjIyMi4yMDguMTQ2&s=work_strip"><i class="fa fa-arrow-circle-o-down fa-lg"></i><span class="u-textUppercase u-ml1x" data-content="button_text">Download</span></a></div></li><li class="InlineList-item"><ul class="InlineList InlineList--bordered u-ph0x"><li class="InlineList-item InlineList-item--bordered"><span class="InlineList-item-text">by <span itemscope="itemscope" itemprop="author" itemtype="https://schema.org/Person"><a class="u-tcGrayDark u-fw700" data-has-card-for-user="4646739" href="https://rakmhsu.academia.edu/oaljadaan">omar al jadaan</a><script data-card-contents-for-user="4646739" type="text/json">{"id":4646739,"first_name":"omar","last_name":"al jadaan","domain_name":"rakmhsu","page_name":"oaljadaan","display_name":"omar al jadaan","profile_url":"https://rakmhsu.academia.edu/oaljadaan?f_ri=143163","photo":"/images/s65_no_pic.png"}</script></span></span></li><li class="js-paper-rank-work_3780649 InlineList-item InlineList-item--bordered hidden"><span class="js-paper-rank-view hidden u-tcGrayDark" data-paper-rank-work-id="3780649"><i class="u-m1x fa fa-bar-chart"></i><strong class="js-paper-rank"></strong></span><script>$(function() { new Works.PaperRankView({ workId: 3780649, container: ".js-paper-rank-work_3780649", }); });</script></li><li class="js-percentile-work_3780649 InlineList-item InlineList-item--bordered hidden u-tcGrayDark"><span class="percentile-widget hidden"><span class="u-mr2x percentile-widget" style="display: none">•</span><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3780649; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-percentile-work_3780649"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></li><li class="js-view-count-work_3780649 InlineList-item InlineList-item--bordered hidden"><div><span><span class="js-view-count view-count u-mr2x" data-work-id="3780649"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3780649; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3780649]").text(description); $(".js-view-count-work_3780649").attr('title', description).tooltip(); }); });</script></span><script>$(function() { $(".js-view-count-work_3780649").removeClass('hidden') })</script></div></li><li class="InlineList-item u-positionRelative" style="max-width: 250px"><div class="u-positionAbsolute" data-has-card-for-ri-list="3780649"><i class="fa fa-tag InlineList-item-icon u-positionRelative"></i> <a class="InlineList-item-text u-positionRelative">7</a> </div><span class="InlineList-item-text u-textTruncate u-pl9x"><a class="InlineList-item-text" data-has-card-for-ri="1681" href="https://www.academia.edu/Documents/in/Decision_Making">Decision Making</a>, <script data-card-contents-for-ri="1681" type="text/json">{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="2189" href="https://www.academia.edu/Documents/in/Computational_Complexity">Computational Complexity</a>, <script data-card-contents-for-ri="2189" type="text/json">{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="30329" href="https://www.academia.edu/Documents/in/Genetic_Algorithm">Genetic Algorithm</a>, <script data-card-contents-for-ri="30329" type="text/json">{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false}</script><a class="InlineList-item-text" data-has-card-for-ri="122993" href="https://www.academia.edu/Documents/in/Stochastic_Simulation">Stochastic Simulation</a><script data-card-contents-for-ri="122993" type="text/json">{"id":122993,"name":"Stochastic Simulation","url":"https://www.academia.edu/Documents/in/Stochastic_Simulation?f_ri=143163","nofollow":false}</script></span></li><script>(function(){ if (true) { new Aedu.ResearchInterestListCard({ el: $('*[data-has-card-for-ri-list=3780649]'), work: {"id":3780649,"title":"NON-DOMINATED RANKED GENETIC ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS: NRGA","created_at":"2013-06-24T16:37:07.108-07:00","url":"https://www.academia.edu/3780649/NON_DOMINATED_RANKED_GENETIC_ALGORITHM_FOR_SOLVING_MULTI_OBJECTIVE_OPTIMIZATION_PROBLEMS_NRGA?f_ri=143163","dom_id":"work_3780649","summary":null,"downloadable_attachments":[{"id":50136489,"asset_id":3780649,"asset_type":"Work","always_allow_download":false}],"ordered_authors":[{"id":4646739,"first_name":"omar","last_name":"al jadaan","domain_name":"rakmhsu","page_name":"oaljadaan","display_name":"omar al jadaan","profile_url":"https://rakmhsu.academia.edu/oaljadaan?f_ri=143163","photo":"/images/s65_no_pic.png"}],"research_interests":[{"id":1681,"name":"Decision Making","url":"https://www.academia.edu/Documents/in/Decision_Making?f_ri=143163","nofollow":false},{"id":2189,"name":"Computational Complexity","url":"https://www.academia.edu/Documents/in/Computational_Complexity?f_ri=143163","nofollow":false},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm?f_ri=143163","nofollow":false},{"id":122993,"name":"Stochastic Simulation","url":"https://www.academia.edu/Documents/in/Stochastic_Simulation?f_ri=143163","nofollow":false},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization?f_ri=143163"},{"id":151959,"name":"Population Size","url":"https://www.academia.edu/Documents/in/Population_Size?f_ri=143163"},{"id":1032348,"name":"Pareto Optimality","url":"https://www.academia.edu/Documents/in/Pareto_Optimality?f_ri=143163"}]}, }) } })();</script></ul></li></ul></div></div></div><div class="u-taCenter Pagination"><ul class="pagination"><li class="next_page"><a href="/Documents/in/Multi_objective_optimization?after=50%2C3780649" rel="next">Next</a></li><li class="last next"><a href="/Documents/in/Multi_objective_optimization?page=last">Last »</a></li></ul></div></div><div class="hidden-xs hidden-sm"><div class="u-pl6x"><div style="width: 300px;"><div class="panel panel-flat u-mt7x"><div class="panel-heading u-p5x"><div class="u-tcGrayDark u-taCenter u-fw700 u-textUppercase">Related Topics</div></div><ul class="list-group"><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Multi-objective_Decision_Making_Problem">Multi-objective Decision Making Problem</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="34004">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="34004">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Stochastic_Programming">Stochastic Programming</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="6432">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="6432">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Multi_Criteria_Decision_Making">Multi Criteria Decision Making</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="19211">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="19211">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Decision_Making_Under_Uncertainty">Decision Making Under Uncertainty</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="16097">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="16097">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Fuzzy_Optimization_and_Decision_Making">Fuzzy Optimization and Decision Making</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="93583">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="93583">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Evolutionary_Algorithm">Evolutionary Algorithm</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="265625">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="265625">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Evaluated_and_controlled_process_operations">Evaluated and controlled process operations</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="285336">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="285336">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Optimization_Problem">Optimization Problem</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="46254">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="46254">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/Optimal_Design">Optimal Design</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="789521">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="789521">Following</a></div></li><li class="list-group-item media_v2 u-mt0x u-p3x"><div class="media-body"><div class="u-tcGrayDarker u-fw700"><a class="u-tcGrayDarker" href="https://www.academia.edu/Documents/in/ASPEN_PLUS">ASPEN PLUS</a></div></div><div class="media-right media-middle"><a class="u-tcGreen u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-follow-ri-id="650486">Follow</a><a class="u-tcGray u-textDecorationNone u-linkUnstyled u-fw500 hidden" data-unfollow-ri-id="650486">Following</a></div></li></ul></div></div></div></div></div></div><script>// MIT License // Copyright © 2011 Sebastian Tschan, https://blueimp.net // Permission is hereby granted, free of charge, to any person obtaining a copy of // this software and associated documentation files (the "Software"), to deal in // the Software without restriction, including without limitation the rights to // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of // the Software, and to permit persons to whom the Software is furnished to do so, // subject to the following conditions: // The above copyright notice and this permission notice shall be included in all // copies or substantial portions of the Software. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. !function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this);</script><script>window.AbTest = (function() { return { 'ab_test': (uniqueId, test_name, buckets) => { let override = new URLSearchParams(window.location.search).get(`ab_test[${test_name}]`); if ( override ) { return override; } const bucketNames = buckets.map((bucket) => { return typeof bucket === 'string' ? bucket : Object.keys(bucket)[0]; }); const weights = buckets.map((bucket) => { return typeof bucket === 'string' ? 1 : Object.values(bucket)[0]; }); const total = weights.reduce((sum, weight) => sum + weight); const hash = md5(`${uniqueId}${test_name}`); const hashNum = parseInt(hash.slice(-12), 16); let bucketPoint = total * (hashNum % 100000) / 100000; const bucket = bucketNames.find((_, i) => { if (weights[i] > bucketPoint) { return true; } bucketPoint -= weights[i]; return false; }); return bucket; } }; })();</script><div data-auto_select="false" data-client_id="331998490334-rsn3chp12mbkiqhl6e7lu2q0mlbu0f1b" data-landing_url="https://www.academia.edu/Documents/in/Multi_objective_optimization" data-login_uri="https://www.academia.edu/registrations/google_one_tap" data-moment_callback="onGoogleOneTapEvent" id="g_id_onload"></div><script>function onGoogleOneTapEvent(event) { var momentType = event.getMomentType(); var momentReason = null; if (event.isNotDisplayed()) { momentReason = event.getNotDisplayedReason(); } else if (event.isSkippedMoment()) { momentReason = event.getSkippedReason(); } else if (event.isDismissedMoment()) { momentReason = event.getDismissedReason(); } Aedu.arbitraryEvents.write('GoogleOneTapEvent', { moment_type: momentType, moment_reason: momentReason, }); }</script><script>(function() { var auvid = unescape( document.cookie .split(/; ?/) .find((s) => s.startsWith('auvid')) .substring(6)); var bucket = AbTest.ab_test(auvid, 'lo_ri_one_tap_google_sign_on', ['control', 'one_tap_google_sign_on']); if (bucket === 'control') return; var oneTapTag = document.createElement('script') oneTapTag.async = true oneTapTag.defer = true oneTapTag.src = 'https://accounts.google.com/gsi/client' document.body.appendChild(oneTapTag) })();</script></div></div></div> </div> <div class="bootstrap login"><div class="modal fade login-modal" id="login-modal"><div class="login-modal-dialog modal-dialog"><div class="modal-content"><div class="modal-header"><button class="close close" data-dismiss="modal" type="button"><span aria-hidden="true">×</span><span class="sr-only">Close</span></button><h4 class="modal-title text-center"><strong>Log In</strong></h4></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><button class="btn btn-fb btn-lg btn-block btn-v-center-content" id="login-facebook-oauth-button"><svg style="float: left; width: 19px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="facebook-square" class="svg-inline--fa fa-facebook-square fa-w-14" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 448 512"><path fill="currentColor" d="M400 32H48A48 48 0 0 0 0 80v352a48 48 0 0 0 48 48h137.25V327.69h-63V256h63v-54.64c0-62.15 37-96.48 93.67-96.48 27.14 0 55.52 4.84 55.52 4.84v61h-31.27c-30.81 0-40.42 19.12-40.42 38.73V256h68.78l-11 71.69h-57.78V480H400a48 48 0 0 0 48-48V80a48 48 0 0 0-48-48z"></path></svg><small><strong>Log in</strong> with <strong>Facebook</strong></small></button><br /><button class="btn btn-google btn-lg btn-block btn-v-center-content" id="login-google-oauth-button"><svg style="float: left; width: 22px; line-height: 1em; margin-right: .3em;" aria-hidden="true" focusable="false" data-prefix="fab" data-icon="google-plus" class="svg-inline--fa fa-google-plus fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M256,8C119.1,8,8,119.1,8,256S119.1,504,256,504,504,392.9,504,256,392.9,8,256,8ZM185.3,380a124,124,0,0,1,0-248c31.3,0,60.1,11,83,32.3l-33.6,32.6c-13.2-12.9-31.3-19.1-49.4-19.1-42.9,0-77.2,35.5-77.2,78.1S142.3,334,185.3,334c32.6,0,64.9-19.1,70.1-53.3H185.3V238.1H302.2a109.2,109.2,0,0,1,1.9,20.7c0,70.8-47.5,121.2-118.8,121.2ZM415.5,273.8v35.5H380V273.8H344.5V238.3H380V202.8h35.5v35.5h35.2v35.5Z"></path></svg><small><strong>Log in</strong> with <strong>Google</strong></small></button><br /><style type="text/css">.sign-in-with-apple-button { width: 100%; height: 52px; border-radius: 3px; border: 1px solid black; cursor: pointer; }</style><script src="https://appleid.cdn-apple.com/appleauth/static/jsapi/appleid/1/en_US/appleid.auth.js" type="text/javascript"></script><div class="sign-in-with-apple-button" data-border="false" data-color="white" id="appleid-signin"><span ="Sign Up with Apple" class="u-fs11"></span></div><script>AppleID.auth.init({ clientId: 'edu.academia.applesignon', scope: 'name email', redirectURI: 'https://www.academia.edu/sessions', state: "be6dd9b67c00f8fbf3d29e024217aa71b4bd75f37e978e1d02f510f5711cc91f", });</script><script>// Hacky way of checking if on fast loswp if (window.loswp == null) { (function() { const Google = window?.Aedu?.Auth?.OauthButton?.Login?.Google; const Facebook = window?.Aedu?.Auth?.OauthButton?.Login?.Facebook; if (Google) { new Google({ el: '#login-google-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } if (Facebook) { new Facebook({ el: '#login-facebook-oauth-button', rememberMeCheckboxId: 'remember_me', track: null }); } })(); }</script></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><div class="hr-heading login-hr-heading"><span class="hr-heading-text">or</span></div></div></div></div><div class="modal-body"><div class="row"><div class="col-xs-10 col-xs-offset-1"><form class="js-login-form" action="https://www.academia.edu/sessions" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="YMb8fDf5HccAIkekW0uIp2o9x/W0kBiaDww4hqQCI6aaNwttnXDCGwanfRHVlZK4AaIEvkbN0fV7SiWDYmpU2Q==" autocomplete="off" /><div class="form-group"><label class="control-label" for="login-modal-email-input" style="font-size: 14px;">Email</label><input class="form-control" id="login-modal-email-input" name="login" type="email" /></div><div class="form-group"><label class="control-label" for="login-modal-password-input" style="font-size: 14px;">Password</label><input class="form-control" id="login-modal-password-input" name="password" type="password" /></div><input type="hidden" name="post_login_redirect_url" id="post_login_redirect_url" value="https://www.academia.edu/Documents/in/Multi_objective_optimization" autocomplete="off" /><div class="checkbox"><label><input type="checkbox" name="remember_me" id="remember_me" value="1" checked="checked" /><small style="font-size: 12px; margin-top: 2px; display: inline-block;">Remember me on this computer</small></label></div><br><input type="submit" name="commit" value="Log In" class="btn btn-primary btn-block btn-lg js-login-submit" data-disable-with="Log In" /></br></form><script>typeof window?.Aedu?.recaptchaManagedForm === 'function' && window.Aedu.recaptchaManagedForm( document.querySelector('.js-login-form'), document.querySelector('.js-login-submit') );</script><small style="font-size: 12px;"><br />or <a data-target="#login-modal-reset-password-container" data-toggle="collapse" href="javascript:void(0)">reset password</a></small><div class="collapse" id="login-modal-reset-password-container"><br /><div class="well margin-0x"><form class="js-password-reset-form" action="https://www.academia.edu/reset_password" accept-charset="UTF-8" method="post"><input name="utf8" type="hidden" value="✓" autocomplete="off" /><input type="hidden" name="authenticity_token" value="Q8cb7QCL1cBWET9a76BQc9BYNcFsMnjM/XsqH0lEfzS5Nuz8qgIKHFCUBe9hfkpsu8f2ip5vsaOJPTcajywISw==" autocomplete="off" /><p>Enter the email address you signed up with and we'll email you a reset link.</p><div class="form-group"><input class="form-control" name="email" type="email" /></div><script src="https://recaptcha.net/recaptcha/api.js" async defer></script> <script> var invisibleRecaptchaSubmit = function () { var closestForm = function (ele) { var curEle = ele.parentNode; while (curEle.nodeName !== 'FORM' && curEle.nodeName !== 'BODY'){ curEle = curEle.parentNode; } return curEle.nodeName === 'FORM' ? curEle : null }; var eles = document.getElementsByClassName('g-recaptcha'); if (eles.length > 0) { var form = closestForm(eles[0]); if (form) { form.submit(); } } }; </script> <input type="submit" data-sitekey="6Lf3KHUUAAAAACggoMpmGJdQDtiyrjVlvGJ6BbAj" data-callback="invisibleRecaptchaSubmit" class="g-recaptcha btn btn-primary btn-block" value="Email me a link" value=""/> </form></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/collapse-45805421cf446ca5adf7aaa1935b08a3a8d1d9a6cc5d91a62a2a3a00b20b3e6a.js"], function() { // from javascript_helper.rb $("#login-modal-reset-password-container").on("shown.bs.collapse", function() { $(this).find("input[type=email]").focus(); }); }); </script> </div></div></div><div class="modal-footer"><div class="text-center"><small style="font-size: 12px;">Need an account? <a rel="nofollow" href="https://www.academia.edu/signup">Click here to sign up</a></small></div></div></div></div></div></div><script>// If we are on subdomain or non-bootstrapped page, redirect to login page instead of showing modal (function(){ if (typeof $ === 'undefined') return; var host = window.location.hostname; if ((host === $domain || host === "www."+$domain) && (typeof $().modal === 'function')) { $("#nav_log_in").click(function(e) { // Don't follow the link and open the modal e.preventDefault(); $("#login-modal").on('shown.bs.modal', function() { $(this).find("#login-modal-email-input").focus() }).modal('show'); }); } })()</script> <div class="bootstrap" id="footer"><div class="footer-content clearfix text-center padding-top-7x" style="width:100%;"><ul class="footer-links-secondary footer-links-wide list-inline margin-bottom-1x"><li><a href="https://www.academia.edu/about">About</a></li><li><a href="https://www.academia.edu/press">Press</a></li><li><a rel="nofollow" href="https://medium.com/academia">Blog</a></li><li><a href="https://www.academia.edu/documents">Papers</a></li><li><a href="https://www.academia.edu/topics">Topics</a></li><li><a href="https://www.academia.edu/journals">Academia.edu Journals</a></li><li><a rel="nofollow" href="https://www.academia.edu/hiring"><svg style="width: 13px; height: 13px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="briefcase" class="svg-inline--fa fa-briefcase fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M320 336c0 8.84-7.16 16-16 16h-96c-8.84 0-16-7.16-16-16v-48H0v144c0 25.6 22.4 48 48 48h416c25.6 0 48-22.4 48-48V288H320v48zm144-208h-80V80c0-25.6-22.4-48-48-48H176c-25.6 0-48 22.4-48 48v48H48c-25.6 0-48 22.4-48 48v80h512v-80c0-25.6-22.4-48-48-48zm-144 0H192V96h128v32z"></path></svg> <strong>We're Hiring!</strong></a></li><li><a rel="nofollow" href="https://support.academia.edu/"><svg style="width: 12px; height: 12px;" aria-hidden="true" focusable="false" data-prefix="fas" data-icon="question-circle" class="svg-inline--fa fa-question-circle fa-w-16" role="img" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 512 512"><path fill="currentColor" d="M504 256c0 136.997-111.043 248-248 248S8 392.997 8 256C8 119.083 119.043 8 256 8s248 111.083 248 248zM262.655 90c-54.497 0-89.255 22.957-116.549 63.758-3.536 5.286-2.353 12.415 2.715 16.258l34.699 26.31c5.205 3.947 12.621 3.008 16.665-2.122 17.864-22.658 30.113-35.797 57.303-35.797 20.429 0 45.698 13.148 45.698 32.958 0 14.976-12.363 22.667-32.534 33.976C247.128 238.528 216 254.941 216 296v4c0 6.627 5.373 12 12 12h56c6.627 0 12-5.373 12-12v-1.333c0-28.462 83.186-29.647 83.186-106.667 0-58.002-60.165-102-116.531-102zM256 338c-25.365 0-46 20.635-46 46 0 25.364 20.635 46 46 46s46-20.636 46-46c0-25.365-20.635-46-46-46z"></path></svg> <strong>Help Center</strong></a></li></ul><ul class="footer-links-tertiary list-inline margin-bottom-1x"><li class="small">Find new research papers in:</li><li class="small"><a href="https://www.academia.edu/Documents/in/Physics">Physics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Chemistry">Chemistry</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Biology">Biology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Health_Sciences">Health Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Ecology">Ecology</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Earth_Sciences">Earth Sciences</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Cognitive_Science">Cognitive Science</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Mathematics">Mathematics</a></li><li class="small"><a href="https://www.academia.edu/Documents/in/Computer_Science">Computer Science</a></li></ul></div></div><div class="DesignSystem" id="credit" style="width:100%;"><ul class="u-pl0x footer-links-legal list-inline"><li><a rel="nofollow" href="https://www.academia.edu/terms">Terms</a></li><li><a rel="nofollow" href="https://www.academia.edu/privacy">Privacy</a></li><li><a rel="nofollow" href="https://www.academia.edu/copyright">Copyright</a></li><li>Academia ©2024</li></ul></div><script> //<![CDATA[ window.detect_gmtoffset = true; window.Academia && window.Academia.set_gmtoffset && Academia.set_gmtoffset('/gmtoffset'); //]]> </script> <div id='overlay_background'></div> <div id='bootstrap-modal-container' class='bootstrap'></div> <div id='ds-modal-container' class='bootstrap DesignSystem'></div> <div id='full-screen-modal'></div> </div> </body> </html>