CINXE.COM

<!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>Hanne Thomas | FHNW - Academia.edu</title>  <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': "profiles/works", 'action': "summary", 'controller_action': 'profiles/works#summary', '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="BB+6ant7rsLRpfsv7ahpx1gLJr0Z6HOFONbkkQhfdNF8h7SlM6BCcg64HyTN63BtgLE4zQTiCKuPYqt4doRzMg==" /> <link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/wow-77f7b87cb1583fc59aa8f94756ebfe913345937eb932042b4077563bebb5fb4b.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/social/home-1c712297ae3ac71207193b1bae0ecf1aae125886850f62c9c0139dd867630797.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/heading-b2b823dd904da60a48fd1bfa1defd840610c2ff414d3f39ed3af46277ab8df3b.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/button-3cea6e0ad4715ed965c49bfb15dedfc632787b32ff6d8c3a474182b231146ab7.css" /><link rel="stylesheet" media="all" href="//a.academia-assets.com/assets/design_system/body-8d679e925718b5e8e4b18e9a4fab37f7eaa99e43386459376559080ac8f2856a.css" /><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="author" content="hanne thomas" /> <meta name="description" content="Professors at FHNW, University of Applied Sciences and Art Northwestern Switzerland." /> <meta name="google-site-verification" content="bKJMBZA7E43xhDOopFZkssMMkBRjvYERV-NaN4R6mrs" /> <script> var $controller_name = 'works'; var $action_name = "summary"; var $rails_env = 'production'; var $app_rev = '65a690de66ffd0e9f9c3f528feae2fde26a171eb'; 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":277455190,"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(1732718030000); window.Aedu.timeDifference = new Date().getTime() - 1732718030000; 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>  <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-abfe14709f87872daacfe98b00812033ac214684652bef9d49abfed8b549f9f6.js"></script> <script src="//a.academia-assets.com/assets/webpack_bundles/core_webpack.wjs-bundle-57c07c4415ad4e6a22ced3639e4df9a5401c1e44346ffeb379134e0f2293c589.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>  <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>  <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://fhnw.academia.edu/HanneThomas" /> </head>   <body class='c-profiles/works a-summary logged_out'>  <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">  <noscript><iframe src="https://www.googletagmanager.com/ns.html?id=GTM-5G9JF7Z" height="0" width="0" style="display:none;visibility:hidden"></iframe></noscript>   <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"><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&nbsp<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&nbsp<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> <script src="//a.academia-assets.com/assets/webpack_bundles/profile.wjs-bundle-b83a2fd9dd2a75882a43a58ee3160b1ab3b6f66ac7d1ef9248d5ee4c09cebaae.js" defer="defer"></script><script>Aedu.rankings = { showPaperRankingsLink: false } $viewedUser = Aedu.User.set_viewed( {"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas","photo":"https://0.academia-photos.com/227503/11563080/12895703/s65_hanne.thomas.jpg","has_photo":true,"department":{"id":101438,"name":"Institute for Information Systems","url":"https://fhnw.academia.edu/Departments/Institute_for_Information_Systems/Documents","university":{"id":5556,"name":"FHNW","url":"https://fhnw.academia.edu/"}},"position":"Faculty Member","position_id":1,"is_analytics_public":true,"interests":[{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_"},{"id":15523,"name":"NP-Hard Optimization","url":"https://www.academia.edu/Documents/in/NP-Hard_Optimization"},{"id":34004,"name":"Multi-objective Decision Making Problem","url":"https://www.academia.edu/Documents/in/Multi-objective_Decision_Making_Problem"},{"id":2507,"name":"Combinatorial Optimization","url":"https://www.academia.edu/Documents/in/Combinatorial_Optimization"},{"id":31572,"name":"Hyper-heuristics","url":"https://www.academia.edu/Documents/in/Hyper-heuristics"},{"id":2508,"name":"Metaheuristics (Informatics)","url":"https://www.academia.edu/Documents/in/Metaheuristics_Informatics_"},{"id":29417,"name":"Particle Swarm Optimisation","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimisation"},{"id":2197,"name":"Simulation (Computer Science)","url":"https://www.academia.edu/Documents/in/Simulation_Computer_Science_"},{"id":21490,"name":"Simulation Based Optimization","url":"https://www.academia.edu/Documents/in/Simulation_Based_Optimization"},{"id":25773,"name":"Operations research and Optimization","url":"https://www.academia.edu/Documents/in/Operations_research_and_Optimization"},{"id":14381,"name":"System Dynamics Modeling (in Econ )omics","url":"https://www.academia.edu/Documents/in/System_Dynamics_Modeling_in_Econ_omics"},{"id":746,"name":"Transport Economics","url":"https://www.academia.edu/Documents/in/Transport_Economics"},{"id":23996,"name":"Ant Colony Optimisation","url":"https://www.academia.edu/Documents/in/Ant_Colony_Optimisation"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":12346,"name":"Differential Evolution","url":"https://www.academia.edu/Documents/in/Differential_Evolution"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm"},{"id":25896,"name":"Particle Swarm Optimization","url":"https://www.academia.edu/Documents/in/Particle_Swarm_Optimization"},{"id":9331,"name":"Local Search (Computer Science)","url":"https://www.academia.edu/Documents/in/Local_Search_Computer_Science_"},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems"},{"id":4974,"name":"Logistics","url":"https://www.academia.edu/Documents/in/Logistics"},{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research"},{"id":7357,"name":"Business Intelligence","url":"https://www.academia.edu/Documents/in/Business_Intelligence"},{"id":3521,"name":"Computational Intelligence","url":"https://www.academia.edu/Documents/in/Computational_Intelligence"},{"id":6132,"name":"Soft Computing","url":"https://www.academia.edu/Documents/in/Soft_Computing"},{"id":5395,"name":"Swarm Intelligence","url":"https://www.academia.edu/Documents/in/Swarm_Intelligence"},{"id":1335,"name":"Supply Chain Management","url":"https://www.academia.edu/Documents/in/Supply_Chain_Management"}]} ); if ($a.is_logged_in() && $viewedUser.is_current_user()) { $('body').addClass('profile-viewed-by-owner'); } $socialProfiles = [{"id":301167,"link":"http://www.linkedin.com/pub/thomas-hanne/22/13b/179","name":"Linkedin","link_domain":"www.linkedin.com","icon":"//www.google.com/s2/u/0/favicons?domain=www.linkedin.com"},{"id":301168,"link":"skype:thomas.hanne1?userinfo","name":"Skype","link_domain":null,"icon":"//www.google.com/s2/u/0/favicons?domain="},{"id":301173,"link":"http://www.mendeley.com/profiles/thomas-hanne/","name":"Mendeley profile","link_domain":"www.mendeley.com","icon":"//www.google.com/s2/u/0/favicons?domain=www.mendeley.com"},{"id":301185,"link":"https://www.fhnw.ch/people/thomas-hanne","name":"Homepage","link_domain":"www.fhnw.ch","icon":"//www.google.com/s2/u/0/favicons?domain=www.fhnw.ch"},{"id":301186,"link":"https://www.researchgate.net/profile/Thomas_Hanne/","name":"ResearchGate profile","link_domain":"www.researchgate.net","icon":"//www.google.com/s2/u/0/favicons?domain=www.researchgate.net"}]</script><div id="js-react-on-rails-context" style="display:none" data-rails-context="{"inMailer":false,"i18nLocale":"en","i18nDefaultLocale":"en","href":"https://fhnw.academia.edu/HanneThomas","location":"/HanneThomas","scheme":"https","host":"fhnw.academia.edu","port":null,"pathname":"/HanneThomas","search":null,"httpAcceptLanguage":null,"serverSide":false}"></div> <div class="js-react-on-rails-component" style="display:none" data-component-name="ProfileCheckPaperUpdate" data-props="{}" data-trace="false" data-dom-id="ProfileCheckPaperUpdate-react-component-b6263e50-cb6a-47ca-b352-9d448d67a4d5"></div> <div id="ProfileCheckPaperUpdate-react-component-b6263e50-cb6a-47ca-b352-9d448d67a4d5"></div> <div class="DesignSystem"><div class="onsite-ping" id="onsite-ping"></div></div><div class="profile-user-info DesignSystem"><div class="social-profile-container"><div class="left-panel-container"><div class="user-info-component-wrapper"><div class="user-summary-cta-container"><div class="user-summary-container"><div class="social-profile-avatar-container"><img class="profile-avatar u-positionAbsolute" alt="Hanne Thomas" border="0" onerror="if (this.src != '//a.academia-assets.com/images/s200_no_pic.png') this.src = '//a.academia-assets.com/images/s200_no_pic.png';" width="200" height="200" src="https://0.academia-photos.com/227503/11563080/12895703/s200_hanne.thomas.jpg" /></div><div class="title-container"><h1 class="ds2-5-heading-sans-serif-sm">Hanne Thomas</h1><div class="affiliations-container fake-truncate js-profile-affiliations"><div><a class="u-tcGrayDarker" href="https://fhnw.academia.edu/">FHNW</a>, <a class="u-tcGrayDarker" href="https://fhnw.academia.edu/Departments/Institute_for_Information_Systems/Documents">Institute for Information Systems</a>, <span class="u-tcGrayDarker">Faculty Member</span></div></div></div></div><div class="sidebar-cta-container"><button class="ds2-5-button hidden profile-cta-button grow js-profile-follow-button" data-broccoli-component="user-info.follow-button" data-click-track="profile-user-info-follow-button" data-follow-user-fname="Hanne" data-follow-user-id="227503" data-follow-user-source="profile_button" data-has-google="false"><span class="material-symbols-outlined" style="font-size: 20px" translate="no">add</span>Follow</button><button class="ds2-5-button hidden profile-cta-button grow js-profile-unfollow-button" data-broccoli-component="user-info.unfollow-button" data-click-track="profile-user-info-unfollow-button" data-unfollow-user-id="227503"><span class="material-symbols-outlined" style="font-size: 20px" translate="no">done</span>Following</button></div></div><div class="user-stats-container"><a><div class="stat-container js-profile-followers"><p class="label">Followers</p><p class="data">622</p></div></a><a><div class="stat-container js-profile-followees" data-broccoli-component="user-info.followees-count" data-click-track="profile-expand-user-info-following"><p class="label">Following</p><p class="data">29</p></div></a><a><div class="stat-container js-profile-coauthors" data-broccoli-component="user-info.coauthors-count" data-click-track="profile-expand-user-info-coauthors"><p class="label">Co-authors</p><p class="data">9</p></div></a><a href="https://fhnw.academia.edu/HanneThomas/Analytics"><div class="stat-container"><p class="label"><span class="js-profile-total-view-text">Public Views</span></p><p class="data"><span class="js-profile-view-count"></span></p></div></a></div><div class="user-bio-container"><div class="profile-bio fake-truncate js-profile-about" style="margin: 0px;">Professors at FHNW, University of Applied Sciences and Art Northwestern Switzerland.<br /><b>Address: </b>Riggenbachstr. 16, <br />4600 Olten, <br />Switzerland<br /><div class="js-profile-less-about u-linkUnstyled u-tcGrayDarker u-textDecorationUnderline u-displayNone">less</div></div></div><div class="ri-section"><div class="ri-section-header"><span>Interests</span><a class="ri-more-link js-profile-ri-list-card" data-click-track="profile-user-info-primary-research-interest" data-has-card-for-ri-list="227503">View All (27)</a></div><div class="ri-tags-container"><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227503" href="https://www.academia.edu/Documents/in/Optimization_Mathematics_"><div id="js-react-on-rails-context" style="display:none" data-rails-context="{"inMailer":false,"i18nLocale":"en","i18nDefaultLocale":"en","href":"https://fhnw.academia.edu/HanneThomas","location":"/HanneThomas","scheme":"https","host":"fhnw.academia.edu","port":null,"pathname":"/HanneThomas","search":null,"httpAcceptLanguage":null,"serverSide":false}"></div> <div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Optimization (Mathematics)"]}" data-trace="false" data-dom-id="Pill-react-component-d4db9433-624a-469c-9467-e0f4ac197afb"></div> <div id="Pill-react-component-d4db9433-624a-469c-9467-e0f4ac197afb"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227503" href="https://www.academia.edu/Documents/in/Multi-objective_Decision_Making_Problem"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Multi-objective Decision Making Problem"]}" data-trace="false" data-dom-id="Pill-react-component-70ffdae2-956e-45fb-8a0f-55bea662e2a8"></div> <div id="Pill-react-component-70ffdae2-956e-45fb-8a0f-55bea662e2a8"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227503" href="https://www.academia.edu/Documents/in/Combinatorial_Optimization"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Combinatorial Optimization"]}" data-trace="false" data-dom-id="Pill-react-component-0b8aafe3-6dce-4cee-badb-e3d966ca80f2"></div> <div id="Pill-react-component-0b8aafe3-6dce-4cee-badb-e3d966ca80f2"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227503" href="https://www.academia.edu/Documents/in/Hyper-heuristics"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Hyper-heuristics"]}" data-trace="false" data-dom-id="Pill-react-component-f047287c-6242-4f39-b374-3785698997b3"></div> <div id="Pill-react-component-f047287c-6242-4f39-b374-3785698997b3"></div> </a><a data-click-track="profile-user-info-expand-research-interests" data-has-card-for-ri-list="227503" href="https://www.academia.edu/Documents/in/Metaheuristics_Informatics_"><div class="js-react-on-rails-component" style="display:none" data-component-name="Pill" data-props="{"color":"gray","children":["Metaheuristics (Informatics)"]}" data-trace="false" data-dom-id="Pill-react-component-36d8e725-f50f-425b-9341-80c5d797c730"></div> <div id="Pill-react-component-36d8e725-f50f-425b-9341-80c5d797c730"></div> </a></div></div><div class="external-links-container"><ul class="profile-links new-profile js-UserInfo-social"><li class="profile-profiles js-social-profiles-container"><i class="fa fa-spin fa-spinner"></i></li></ul></div></div></div><div class="right-panel-container"><div class="user-content-wrapper"><div class="uploads-container" id="social-redesign-work-container"><div class="upload-header"><h2 class="ds2-5-heading-sans-serif-xs">Uploads</h2></div><div class="nav-container backbone-profile-documents-nav hidden-xs"><ul class="nav-tablist" role="tablist"><li class="nav-chip active" role="presentation"><a data-section-name="" data-toggle="tab" href="#all" role="tab">all</a></li><li class="nav-chip" role="presentation"><a class="js-profile-docs-nav-section u-textTruncate" data-click-track="profile-works-tab" data-section-name="Papers" data-toggle="tab" href="#papers" role="tab" title="Papers"><span>121</span> <span class="ds2-5-body-sm-bold">Papers</span></a></li><li class="nav-chip" role="presentation"><a class="js-profile-docs-nav-section u-textTruncate" data-click-track="profile-works-tab" data-section-name="Books" data-toggle="tab" href="#books" role="tab" title="Books"><span>3</span> <span class="ds2-5-body-sm-bold">Books</span></a></li><li class="nav-chip" role="presentation"><a class="js-profile-docs-nav-section u-textTruncate" data-click-track="profile-works-tab" data-section-name="Conference-Presentations" data-toggle="tab" href="#conferencepresentations" role="tab" title="Conference Presentations"><span>1</span> <span class="ds2-5-body-sm-bold">Conference Presentations</span></a></li><li class="nav-chip more-tab" role="presentation"><a class="js-profile-documents-more-tab link-unstyled u-textTruncate" data-toggle="dropdown" role="tab">More  <i class="fa fa-chevron-down"></i></a><ul class="js-profile-documents-more-dropdown dropdown-menu dropdown-menu-right profile-documents-more-dropdown" role="menu"><li role="presentation"><a data-click-track="profile-works-tab" data-section-name="Published-Papers" data-toggle="tab" href="#publishedpapers" role="tab" style="border: none;"><span>1</span> Published Papers</a></li></ul></li></ul></div><div class="divider ds-divider-16" style="margin: 0px;"></div><div class="documents-container backbone-social-profile-documents" style="width: 100%;"><div class="u-taCenter"></div><div class="profile--tab_content_container js-tab-pane tab-pane active" id="all"><div class="profile--tab_heading_container js-section-heading" data-section="Papers" id="Papers"><h3 class="profile--tab_heading_container">Papers by Hanne Thomas</h3></div><div class="js-work-strip profile--work_container" data-work-id="122256375"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem"><img alt="Research paper thumbnail of A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem">A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="122256375"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="122256375"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 122256375; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=122256375]").text(description); $(".js-view-count[data-work-id=122256375]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 122256375; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='122256375']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 122256375, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=122256375]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":122256375,"title":"A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem","translated_title":"","metadata":{"abstract":"The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.","publication_date":{"day":1,"month":9,"year":2016,"errors":{}}},"translated_abstract":"The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.","internal_url":"https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem","translated_internal_url":"","created_at":"2024-07-22T05:12:25.732-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":46939,"name":"Grasp","url":"https://www.academia.edu/Documents/in/Grasp"},{"id":245965,"name":"Vehicle Routing Problem","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_Problem"},{"id":272592,"name":"Mathematical Optimization","url":"https://www.academia.edu/Documents/in/Mathematical_Optimization"},{"id":419504,"name":"Heuristic","url":"https://www.academia.edu/Documents/in/Heuristic"},{"id":893452,"name":"Greedy Algorithm","url":"https://www.academia.edu/Documents/in/Greedy_Algorithm"}],"urls":[{"id":43634981,"url":"https://doi.org/10.1109/iscbi.2016.7743259"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121952939"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem"><img alt="Research paper thumbnail of An ant colony system solving the travelling salesman region problem" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem">An ant colony system solving the travelling salesman region problem</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">A variant of the well-known travelling salesman problem is about introducing particular dependenc...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121952939"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121952939"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121952939; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121952939]").text(description); $(".js-view-count[data-work-id=121952939]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121952939; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121952939']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121952939, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121952939]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121952939,"title":"An ant colony system solving the travelling salesman region problem","translated_title":"","metadata":{"abstract":"A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.","publication_date":{"day":1,"month":9,"year":2016,"errors":{}}},"translated_abstract":"A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.","internal_url":"https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem","translated_internal_url":"","created_at":"2024-07-10T23:36:45.699-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"An_ant_colony_system_solving_the_travelling_salesman_region_problem","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":261,"name":"Geography","url":"https://www.academia.edu/Documents/in/Geography"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":104401,"name":"Ant","url":"https://www.academia.edu/Documents/in/Ant"},{"id":311003,"name":"ANT COLONY","url":"https://www.academia.edu/Documents/in/ANT_COLONY"},{"id":884823,"name":"Travelling Salesman Problem","url":"https://www.academia.edu/Documents/in/Travelling_Salesman_Problem"}],"urls":[{"id":43469530,"url":"https://doi.org/10.1109/iscbi.2016.7743270"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121637676"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems"><img alt="Research paper thumbnail of Invasive weed optimization for solving index tracking problems" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems">Invasive weed optimization for solving index tracking problems</a></div><div class="wp-workCard_item"><span>Soft Computing</span><span>, Jul 29, 2015</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Index tracking belongs to one of the most important types of problems in portfolio management. In...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121637676"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121637676"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121637676; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121637676]").text(description); $(".js-view-count[data-work-id=121637676]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121637676; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121637676']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121637676, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121637676]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121637676,"title":"Invasive weed optimization for solving index tracking problems","translated_title":"","metadata":{"abstract":"Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.","publisher":"Springer Science+Business Media","publication_date":{"day":29,"month":7,"year":2015,"errors":{}},"publication_name":"Soft Computing"},"translated_abstract":"Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.","internal_url":"https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems","translated_internal_url":"","created_at":"2024-06-30T00:06:42.656-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Invasive_weed_optimization_for_solving_index_tracking_problems","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science"},{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":6132,"name":"Soft Computing","url":"https://www.academia.edu/Documents/in/Soft_Computing"},{"id":27827,"name":"Project Portfolio Management","url":"https://www.academia.edu/Documents/in/Project_Portfolio_Management"},{"id":56735,"name":"Portfolio Optimization","url":"https://www.academia.edu/Documents/in/Portfolio_Optimization"},{"id":61216,"name":"Portfolio","url":"https://www.academia.edu/Documents/in/Portfolio"},{"id":272592,"name":"Mathematical Optimization","url":"https://www.academia.edu/Documents/in/Mathematical_Optimization"},{"id":882596,"name":"Tracking Error","url":"https://www.academia.edu/Documents/in/Tracking_Error"}],"urls":[{"id":43297823,"url":"https://doi.org/10.1007/s00500-015-1799-x"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121179278"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors"><img alt="Research paper thumbnail of Optimizing staff rosters for emergency shifts for doctors" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors">Optimizing staff rosters for emergency shifts for doctors</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct go...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121179278"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121179278"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121179278; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121179278]").text(description); $(".js-view-count[data-work-id=121179278]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121179278; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121179278']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121179278, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121179278]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121179278,"title":"Optimizing staff rosters for emergency shifts for doctors","translated_title":"","metadata":{"abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","publication_date":{"day":1,"month":5,"year":2009,"errors":{}}},"translated_abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","internal_url":"https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_internal_url":"","created_at":"2024-06-18T04:53:00.658-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":19566,"name":"Emergency Management","url":"https://www.academia.edu/Documents/in/Emergency_Management"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm"},{"id":117269,"name":"Insects","url":"https://www.academia.edu/Documents/in/Insects"},{"id":172784,"name":"Workload","url":"https://www.academia.edu/Documents/in/Workload"}],"urls":[{"id":43035659,"url":"https://doi.org/10.1109/cec.2009.4983260"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="110506831"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/110506831/Multi_Criteria_Decision_Making"><img alt="Research paper thumbnail of Multi-Criteria Decision Making" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/110506831/Multi_Criteria_Decision_Making">Multi-Criteria Decision Making</a></div><div class="wp-workCard_item"><span>Genetic Algorithms and Evolutionary Computation</span><span>, 2002</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">One aspect that most of the current research on evolutionary multiobjective optimization (EMO) of...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="110506831"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="110506831"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 110506831; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=110506831]").text(description); $(".js-view-count[data-work-id=110506831]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 110506831; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='110506831']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 110506831, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=110506831]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":110506831,"title":"Multi-Criteria Decision Making","translated_title":"","metadata":{"abstract":"One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.","publication_date":{"day":null,"month":null,"year":2002,"errors":{}},"publication_name":"Genetic Algorithms and Evolutionary Computation"},"translated_abstract":"One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.","internal_url":"https://www.academia.edu/110506831/Multi_Criteria_Decision_Making","translated_internal_url":"","created_at":"2023-12-04T00:03:40.942-08:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Multi_Criteria_Decision_Making","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="107722629"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms"><img alt="Research paper thumbnail of Attraction and diffusion in nature-inspired optimization algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/106309202/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms">Attraction and diffusion in nature-inspired optimization algorithms</a></div><div class="wp-workCard_item"><span>Neural Computing and Applications</span><span>, May 15, 2015</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9ba35a3309310b1c55842edb8b880ba4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":106309202,"asset_id":107722629,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="107722629"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="107722629"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 107722629; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=107722629]").text(description); $(".js-view-count[data-work-id=107722629]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 107722629; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='107722629']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 107722629, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "9ba35a3309310b1c55842edb8b880ba4" } } $('.js-work-strip[data-work-id=107722629]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":107722629,"title":"Attraction and diffusion in nature-inspired optimization algorithms","translated_title":"","metadata":{"publisher":"Springer Science+Business Media","grobid_abstract":"Full bibliographic details must be given when referring to, or quoting from full items including the author's name, the title of the work, publication details where relevant (place, publisher, date), pagination, and for theses or dissertations the awarding institution, the degree type awarded, and the date of the award.","publication_date":{"day":15,"month":5,"year":2015,"errors":{}},"publication_name":"Neural Computing and Applications","grobid_abstract_attachment_id":106309202},"translated_abstract":null,"internal_url":"https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms","translated_internal_url":"","created_at":"2023-10-06T21:39:38.498-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":106309202,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/106309202/thumbnails/1.jpg","file_name":"Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final.pdf","download_url":"https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Attraction_and_diffusion_in_nature_inspi.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/106309202/Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final-libre.pdf?1696655205=\u0026response-content-disposition=attachment%3B+filename%3DAttraction_and_diffusion_in_nature_inspi.pdf\u0026Expires=1732715588\u0026Signature=THWciraH525O8TliFLxZZjOu8wWEXN6z1q93aDAlansImUP-tpFVGl7bK7cdsjeDAvU6y3OT-XOajKvo6yyDntW4S-k7o9o-b2U9tFrl8UcrmdliJFVdjjqVyJ31xH1D9DghKFt0-GX-Zx3v2N03TI54TIsZvUkAipfjVBLhJ8O8EVGb0xSdg1iAczTHdPQm~FO5vKmF618ye2htEqumNXzwfxMDDZW7wU5wbnWyqt-TRCbh7G5AQnqncHh8Lu3U9XZusn26lhXjRshHb1oNkyHWC4N9hN47FwscVB0d32TIFRetRAvy4bpxd1GqRxQlnqQX-P-o8wsWsQs24vCGGg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Attraction_and_diffusion_in_nature_inspired_optimization_algorithms","translated_slug":"","page_count":21,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":106309202,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/106309202/thumbnails/1.jpg","file_name":"Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final.pdf","download_url":"https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Attraction_and_diffusion_in_nature_inspi.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/106309202/Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final-libre.pdf?1696655205=\u0026response-content-disposition=attachment%3B+filename%3DAttraction_and_diffusion_in_nature_inspi.pdf\u0026Expires=1732715588\u0026Signature=THWciraH525O8TliFLxZZjOu8wWEXN6z1q93aDAlansImUP-tpFVGl7bK7cdsjeDAvU6y3OT-XOajKvo6yyDntW4S-k7o9o-b2U9tFrl8UcrmdliJFVdjjqVyJ31xH1D9DghKFt0-GX-Zx3v2N03TI54TIsZvUkAipfjVBLhJ8O8EVGb0xSdg1iAczTHdPQm~FO5vKmF618ye2htEqumNXzwfxMDDZW7wU5wbnWyqt-TRCbh7G5AQnqncHh8Lu3U9XZusn26lhXjRshHb1oNkyHWC4N9hN47FwscVB0d32TIFRetRAvy4bpxd1GqRxQlnqQX-P-o8wsWsQs24vCGGg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm"},{"id":83315,"name":"Diffusion","url":"https://www.academia.edu/Documents/in/Diffusion"},{"id":90268,"name":"Computational Science and Engineering","url":"https://www.academia.edu/Documents/in/Computational_Science_and_Engineering"},{"id":149735,"name":"Attraction","url":"https://www.academia.edu/Documents/in/Attraction"},{"id":176826,"name":"Firefly Algorithm","url":"https://www.academia.edu/Documents/in/Firefly_Algorithm"},{"id":238655,"name":"Implementation","url":"https://www.academia.edu/Documents/in/Implementation"},{"id":398158,"name":"Nature Inspired Computing","url":"https://www.academia.edu/Documents/in/Nature_Inspired_Computing"},{"id":423243,"name":"Bio and Nature Inspired Algorithms","url":"https://www.academia.edu/Documents/in/Bio_and_Nature_Inspired_Algorithms"}],"urls":[{"id":34396873,"url":"https://doi.org/10.1007/s00521-015-1925-9"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673951"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning"><img alt="Research paper thumbnail of Emotion Influenced Robotic Path Planning" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning">Emotion Influenced Robotic Path Planning</a></div><div class="wp-workCard_item"><span>Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence - ISMSI '17</span><span>, 2017</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We introduce an emotion influenced robotic path planning solution which offers the possibility of...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673951"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673951"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673951; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673951]").text(description); $(".js-view-count[data-work-id=76673951]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673951; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673951']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673951, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673951]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673951,"title":"Emotion Influenced Robotic Path Planning","translated_title":"","metadata":{"abstract":"We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.","publisher":"ACM Press","publication_date":{"day":null,"month":null,"year":2017,"errors":{}},"publication_name":"Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics \u0026 Swarm Intelligence - ISMSI '17"},"translated_abstract":"We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.","internal_url":"https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning","translated_internal_url":"","created_at":"2022-04-16T23:09:11.400-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Emotion_Influenced_Robotic_Path_Planning","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":77,"name":"Robotics","url":"https://www.academia.edu/Documents/in/Robotics"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":439576,"name":"Acm","url":"https://www.academia.edu/Documents/in/Acm"}],"urls":[{"id":19566810,"url":"http://dl.acm.org/ft_gateway.cfm?id=3059346\u0026ftid=1873895\u0026dwn=1"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673950"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure"><img alt="Research paper thumbnail of A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure">A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings</span><span>, 2001</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673950"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673950"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673950; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673950]").text(description); $(".js-view-count[data-work-id=76673950]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673950; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673950']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673950, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673950]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673950,"title":"A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure","translated_title":"","metadata":{"abstract":"Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...","publication_date":{"day":null,"month":null,"year":2001,"errors":{}},"publication_name":"Operations Research Proceedings"},"translated_abstract":"Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...","internal_url":"https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure","translated_internal_url":"","created_at":"2022-04-16T23:09:11.280-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning"},{"id":38532,"name":"Evolution of ERP","url":"https://www.academia.edu/Documents/in/Evolution_of_ERP"},{"id":46030,"name":"ERP","url":"https://www.academia.edu/Documents/in/ERP"},{"id":1751768,"name":"ERP Systems","url":"https://www.academia.edu/Documents/in/ERP_Systems"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673949"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM"><img alt="Research paper thumbnail of An Object-Oriented Decision Support System for MCDM" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM">An Object-Oriented Decision Support System for MCDM</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings</span><span>, 1994</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper deals with the basic ideas and implementation of an object-oriented decision support s...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673949"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673949"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673949; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673949]").text(description); $(".js-view-count[data-work-id=76673949]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673949; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673949']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673949, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673949]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673949,"title":"An Object-Oriented Decision Support System for MCDM","translated_title":"","metadata":{"abstract":"This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?","publication_date":{"day":null,"month":null,"year":1994,"errors":{}},"publication_name":"Operations Research Proceedings"},"translated_abstract":"This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?","internal_url":"https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM","translated_internal_url":"","created_at":"2022-04-16T23:09:11.144-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"An_Object_Oriented_Decision_Support_System_for_MCDM","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":98846,"name":"Multicriteria decision making","url":"https://www.academia.edu/Documents/in/Multicriteria_decision_making"},{"id":99432,"name":"Multicriteria Decision Aid","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Aid"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673948"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey"><img alt="Research paper thumbnail of Optimization problems in airline and railway planning - a comparative survey" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey">Optimization problems in airline and railway planning - a comparative survey</a></div><div class="wp-workCard_item"><span>Third International Workshop on Advanced Computational Intelligence</span><span>, 2010</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673948"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673948"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673948; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673948]").text(description); $(".js-view-count[data-work-id=76673948]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673948; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673948']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673948, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673948]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673948,"title":"Optimization problems in airline and railway planning - a comparative survey","translated_title":"","metadata":{"abstract":"Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...","publisher":"IEEE","publication_date":{"day":null,"month":null,"year":2010,"errors":{}},"publication_name":"Third International Workshop on Advanced Computational Intelligence"},"translated_abstract":"Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...","internal_url":"https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey","translated_internal_url":"","created_at":"2022-04-16T23:09:10.961-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimization_problems_in_airline_and_railway_planning_a_comparative_survey","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research"},{"id":2953,"name":"Transport Logistics","url":"https://www.academia.edu/Documents/in/Transport_Logistics"},{"id":3168,"name":"Transportation Studies","url":"https://www.academia.edu/Documents/in/Transportation_Studies"},{"id":3169,"name":"Railway Transport","url":"https://www.academia.edu/Documents/in/Railway_Transport"},{"id":6007,"name":"Transport Planning","url":"https://www.academia.edu/Documents/in/Transport_Planning"},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem"},{"id":65795,"name":"Airline operations","url":"https://www.academia.edu/Documents/in/Airline_operations"},{"id":134460,"name":"Travel Industry","url":"https://www.academia.edu/Documents/in/Travel_Industry"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673947"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM"><img alt="Research paper thumbnail of On the Development and Future Aspects of Vector Optimization and MCDM" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM">On the Development and Future Aspects of Vector Optimization and MCDM</a></div><div class="wp-workCard_item"><span>Multicriteria Analysis</span><span>, 1997</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of resear...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673947"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673947"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673947; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673947]").text(description); $(".js-view-count[data-work-id=76673947]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673947; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673947']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673947, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673947]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673947,"title":"On the Development and Future Aspects of Vector Optimization and MCDM","translated_title":"","metadata":{"abstract":"ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.","publication_date":{"day":null,"month":null,"year":1997,"errors":{}},"publication_name":"Multicriteria Analysis"},"translated_abstract":"ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.","internal_url":"https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM","translated_internal_url":"","created_at":"2022-04-16T23:09:10.843-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":3974445,"name":"Multicriteria Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Analysis"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673946"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making"><img alt="Research paper thumbnail of Some Aspects of Polytope Degeneracy in Multicriteria Decision Making" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making">Some Aspects of Polytope Degeneracy in Multicriteria Decision Making</a></div><div class="wp-workCard_item"><span>Intelligent Decision Support</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2Unive...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz <a href="mailto:tomas.gal@fernuni-hagen.de" rel="nofollow">tomas.gal@fernuni-hagen.de</a>, <a href="mailto:thomas.hanne@fhnw.ch" rel="nofollow">thomas.hanne@fhnw.ch</a> ... Abstract. Various methods ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673946"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673946"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673946; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673946]").text(description); $(".js-view-count[data-work-id=76673946]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673946; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673946']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673946, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673946]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673946,"title":"Some Aspects of Polytope Degeneracy in Multicriteria Decision Making","translated_title":"","metadata":{"abstract":"Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz tomas.gal@fernuni-hagen.de, thomas.hanne@fhnw.ch ... Abstract. Various methods ...","publication_name":"Intelligent Decision Support"},"translated_abstract":"Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz tomas.gal@fernuni-hagen.de, thomas.hanne@fhnw.ch ... Abstract. Various methods ...","internal_url":"https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making","translated_internal_url":"","created_at":"2022-04-16T23:09:10.722-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making","translated_slug":"","page_count":null,"language":"de","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_"},{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":40587,"name":"Degeneracy","url":"https://www.academia.edu/Documents/in/Degeneracy"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":774425,"name":"Intelligent Decision Support Systems","url":"https://www.academia.edu/Documents/in/Intelligent_Decision_Support_Systems"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673945"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms"><img alt="Research paper thumbnail of Scheduling in Software Development Using Multiobjective Evolutionary Algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/84304506/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms">Scheduling in Software Development Using Multiobjective Evolutionary Algorithms</a></div><div class="wp-workCard_item"><span>Multidisciplinary Scheduling: Theory and Applications</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="e44126a6f71672f0b3bc5274db63403b" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84304506,"asset_id":76673945,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673945"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673945"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673945; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673945]").text(description); $(".js-view-count[data-work-id=76673945]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673945; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673945']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673945, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "e44126a6f71672f0b3bc5274db63403b" } } $('.js-work-strip[data-work-id=76673945]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673945,"title":"Scheduling in Software Development Using Multiobjective Evolutionary Algorithms","translated_title":"","metadata":{"grobid_abstract":"We consider the problem of planning inspections and other tasks within a software development (SD) project with respect to the objectives quality (no. of defects), project duration, and costs. The considered model of SD processes comprises the phases of coding, inspection, test, and rework and includes assigning tasks to persons and generating a project schedule. Based on this model we discuss a multiobjective optimisation problem. For solving the problem (i.e., finding an approximation of the efficient set) we develop a multiobjective evolutionary algorithm. Details of the algorithm are discussed as well as results of its application to sample problems.","publication_name":"Multidisciplinary Scheduling: Theory and Applications","grobid_abstract_attachment_id":84304506},"translated_abstract":null,"internal_url":"https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms","translated_internal_url":"","created_at":"2022-04-16T23:09:10.502-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84304506,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84304506/thumbnails/1.jpg","file_name":"0-387-27744-7_4.pdf","download_url":"https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Scheduling_in_Software_Development_Using.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84304506/0-387-27744-7_4-libre.pdf?1650178020=\u0026response-content-disposition=attachment%3B+filename%3DScheduling_in_Software_Development_Using.pdf\u0026Expires=1732715589\u0026Signature=HIbbO2Nu1EklUSnq3XZULeQPPBhxIRA2xvzpT8bcN8arlLdiqqMJzUqMPLlA8pWDjmakAuy2n0HFlRFj3yvJLx-Jar1jDHGnvushlNsmg1sjtPOwJN~7WJS2SMjG8oZ4TPDmGY-bocENYE5CHIa4YgY6vFxWlY5m8ZkWCm2hM643Ax4V0aoz1TrN~2DIEJnPL5paRyttF~ZcXhQRqX3sKv9gcs8esMdTIeElVVYAyHGFU9s5TWd6LhBpRekGAFU9NR8L4JYcwCChGz8ckvDJwakkugETkxk~I3E2Ohm8Cu6T9uSTzErDKymvCxOOg~E5Syg4lB5QxXUvfpwuRBv5IQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms","translated_slug":"","page_count":2,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84304506,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84304506/thumbnails/1.jpg","file_name":"0-387-27744-7_4.pdf","download_url":"https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Scheduling_in_Software_Development_Using.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84304506/0-387-27744-7_4-libre.pdf?1650178020=\u0026response-content-disposition=attachment%3B+filename%3DScheduling_in_Software_Development_Using.pdf\u0026Expires=1732715589\u0026Signature=HIbbO2Nu1EklUSnq3XZULeQPPBhxIRA2xvzpT8bcN8arlLdiqqMJzUqMPLlA8pWDjmakAuy2n0HFlRFj3yvJLx-Jar1jDHGnvushlNsmg1sjtPOwJN~7WJS2SMjG8oZ4TPDmGY-bocENYE5CHIa4YgY6vFxWlY5m8ZkWCm2hM643Ax4V0aoz1TrN~2DIEJnPL5paRyttF~ZcXhQRqX3sKv9gcs8esMdTIeElVVYAyHGFU9s5TWd6LhBpRekGAFU9NR8L4JYcwCChGz8ckvDJwakkugETkxk~I3E2Ohm8Cu6T9uSTzErDKymvCxOOg~E5Syg4lB5QxXUvfpwuRBv5IQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":2277,"name":"Project Management","url":"https://www.academia.edu/Documents/in/Project_Management"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":55827,"name":"Software Process Models","url":"https://www.academia.edu/Documents/in/Software_Process_Models"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673944"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors"><img alt="Research paper thumbnail of Optimizing staff rosters for emergency shifts for doctors" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors">Optimizing staff rosters for emergency shifts for doctors</a></div><div class="wp-workCard_item"><span>2009 IEEE Congress on Evolutionary Computation</span><span>, 2009</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct go...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673944"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673944"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673944; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673944]").text(description); $(".js-view-count[data-work-id=76673944]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673944; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673944']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673944, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673944]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673944,"title":"Optimizing staff rosters for emergency shifts for doctors","translated_title":"","metadata":{"abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"2009 IEEE Congress on Evolutionary Computation"},"translated_abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","internal_url":"https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_internal_url":"","created_at":"2022-04-16T23:09:10.312-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":19566,"name":"Emergency Management","url":"https://www.academia.edu/Documents/in/Emergency_Management"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm"},{"id":117269,"name":"Insects","url":"https://www.academia.edu/Documents/in/Insects"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673943"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering"><img alt="Research paper thumbnail of Multiobjective and preference-based decision support for rail crew rostering" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering">Multiobjective and preference-based decision support for rail crew rostering</a></div><div class="wp-workCard_item"><span>2009 IEEE Congress on Evolutionary Computation</span><span>, 2009</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673943"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673943"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673943; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673943]").text(description); $(".js-view-count[data-work-id=76673943]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673943; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673943']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673943, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673943]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673943,"title":"Multiobjective and preference-based decision support for rail crew rostering","translated_title":"","metadata":{"abstract":"In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"2009 IEEE Congress on Evolutionary Computation"},"translated_abstract":"In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...","internal_url":"https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering","translated_internal_url":"","created_at":"2022-04-16T23:09:10.100-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization"},{"id":2953,"name":"Transport Logistics","url":"https://www.academia.edu/Documents/in/Transport_Logistics"},{"id":3169,"name":"Railway Transport","url":"https://www.academia.edu/Documents/in/Railway_Transport"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":6007,"name":"Transport Planning","url":"https://www.academia.edu/Documents/in/Transport_Planning"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":47980,"name":"Data Visualization","url":"https://www.academia.edu/Documents/in/Data_Visualization"},{"id":48591,"name":"Data Visualisation","url":"https://www.academia.edu/Documents/in/Data_Visualisation"},{"id":59695,"name":"Navigation","url":"https://www.academia.edu/Documents/in/Navigation"},{"id":149081,"name":"Decision Support","url":"https://www.academia.edu/Documents/in/Decision_Support"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm"},{"id":507981,"name":"Availability","url":"https://www.academia.edu/Documents/in/Availability"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function"},{"id":3236675,"name":"navigation tools","url":"https://www.academia.edu/Documents/in/navigation_tools"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673942"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System"><img alt="Research paper thumbnail of Strategies for Capacity Planning in a Complex Production System" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System">Strategies for Capacity Planning in a Complex Production System</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings 2001</span><span>, 2002</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We consider a lotsizing problem in a multi-stage production setting with capacity-constrained res...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673942"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673942"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673942; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673942]").text(description); $(".js-view-count[data-work-id=76673942]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673942; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673942']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673942, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673942]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673942,"title":"Strategies for Capacity Planning in a Complex Production System","translated_title":"","metadata":{"abstract":"We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.","publication_date":{"day":null,"month":null,"year":2002,"errors":{}},"publication_name":"Operations Research Proceedings 2001"},"translated_abstract":"We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.","internal_url":"https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System","translated_internal_url":"","created_at":"2022-04-16T23:09:09.910-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Strategies_for_Capacity_Planning_in_a_Complex_Production_System","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning"},{"id":38532,"name":"Evolution of ERP","url":"https://www.academia.edu/Documents/in/Evolution_of_ERP"},{"id":46030,"name":"ERP","url":"https://www.academia.edu/Documents/in/ERP"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673941"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems"><img alt="Research paper thumbnail of Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems" class="work-thumbnail" src="https://attachments.academia-assets.com/84303698/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems">Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems</a></div><div class="wp-workCard_item"><span>Fuzzy Sets and Systems</span><span>, 2009</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3607b2e3cd504087e29e91a3ad9065d4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303698,"asset_id":76673941,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673941"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673941"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673941; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673941]").text(description); $(".js-view-count[data-work-id=76673941]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673941; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673941']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673941, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3607b2e3cd504087e29e91a3ad9065d4" } } $('.js-work-strip[data-work-id=76673941]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673941,"title":"Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems","translated_title":"","metadata":{"publisher":"Elsevier BV","grobid_abstract":"The performance of information retrieval systems (IRSs) is usually measured using two different criteria, precision and recall. Precision is the ratio of the relevant documents retrieved by the IRS in response to a user's query to the total number of documents retrieved, whilst recall is the ratio of the number of relevant documents retrieved to the total number of relevant documents for the user's query that exist in the documentary database. In fuzzy ordinal linguistic IRSs (FOLIRSs), where extended Boolean queries are used, defining the user's queries in a manual way is usually a complex task. In this contribution, our interest is focused on the automatic learning of extended Boolean queries in FOLIRSs by means of multi-objective evolutionary algorithms considering both mentioned performance criteria. We present an analysis of two well-known general-purpose multi-objective evolutionary algorithms to learn extended Boolean queries in FOLIRSs. These evolutionary algorithms are the non-dominated sorting genetic algorithm (NSGA-II) and the strength Pareto evolutionary algorithm (SPEA2).","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"Fuzzy Sets and Systems","grobid_abstract_attachment_id":84303698},"translated_abstract":null,"internal_url":"https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems","translated_internal_url":"","created_at":"2022-04-16T23:09:09.783-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303698,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303698/thumbnails/1.jpg","file_name":"0976_2009-lopezHerrera-FSS.pdf","download_url":"https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Applying_multi_objective_evolutionary_al.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303698/0976_2009-lopezHerrera-FSS-libre.pdf?1650177291=\u0026response-content-disposition=attachment%3B+filename%3DApplying_multi_objective_evolutionary_al.pdf\u0026Expires=1732715589\u0026Signature=QpttAdkkEjdmhlrXI3BO7XDdW51YNEQPuGac758VZIIHhb8bf9g9T7R7tjjDS936YkCI0dUVPfT8n2JpWlvTxF4646oM9svJmkBeJd2sMIoF1BOt7LIa2YB1DVahi59YLFiy3tXFjHz419HS-eTFCGzLs0YZaJgyJyCwHwGLemrDqFL~k4SjH4ZauK73Puyec~a7qLVAb-1TPYAM5IWM7jCT3zp9fj2iUHBdwuD5NBRux82jIzHwZy5hYJuG9QVDoINhlVX8I8rCcPN5z~rMY8PEszIkE~4o2OpU9BWONJeSe~BTJxJkyvFOvmLwjU4N91MVVRY9vlQpnCPA7yJZwA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems","translated_slug":"","page_count":14,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303698,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303698/thumbnails/1.jpg","file_name":"0976_2009-lopezHerrera-FSS.pdf","download_url":"https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Applying_multi_objective_evolutionary_al.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303698/0976_2009-lopezHerrera-FSS-libre.pdf?1650177291=\u0026response-content-disposition=attachment%3B+filename%3DApplying_multi_objective_evolutionary_al.pdf\u0026Expires=1732715589\u0026Signature=QpttAdkkEjdmhlrXI3BO7XDdW51YNEQPuGac758VZIIHhb8bf9g9T7R7tjjDS936YkCI0dUVPfT8n2JpWlvTxF4646oM9svJmkBeJd2sMIoF1BOt7LIa2YB1DVahi59YLFiy3tXFjHz419HS-eTFCGzLs0YZaJgyJyCwHwGLemrDqFL~k4SjH4ZauK73Puyec~a7qLVAb-1TPYAM5IWM7jCT3zp9fj2iUHBdwuD5NBRux82jIzHwZy5hYJuG9QVDoINhlVX8I8rCcPN5z~rMY8PEszIkE~4o2OpU9BWONJeSe~BTJxJkyvFOvmLwjU4N91MVVRY9vlQpnCPA7yJZwA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm"},{"id":652157,"name":"Fuzzy Sets and Systems","url":"https://www.academia.edu/Documents/in/Fuzzy_Sets_and_Systems"},{"id":990889,"name":"Information Retrieval System","url":"https://www.academia.edu/Documents/in/Information_Retrieval_System"},{"id":1385957,"name":"Query by Example","url":"https://www.academia.edu/Documents/in/Query_by_Example"},{"id":1819995,"name":"Document Retrieval","url":"https://www.academia.edu/Documents/in/Document_Retrieval"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673940"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs"><img alt="Research paper thumbnail of E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs" class="work-thumbnail" src="https://attachments.academia-assets.com/84303269/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs">E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Scienc...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students&#x27; projects. As indicated in student assessments, the quality of teaching and the students&#x27; motivation are increasing significantly. Some topics of the new ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="cb56d7cb54ea689e6e4d76728acd3433" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303269,"asset_id":76673940,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673940"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673940"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673940; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673940]").text(description); $(".js-view-count[data-work-id=76673940]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673940; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673940']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673940, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "cb56d7cb54ea689e6e4d76728acd3433" } } $('.js-work-strip[data-work-id=76673940]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673940,"title":"E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs","translated_title":"","metadata":{"abstract":"We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students\u0026#x27; projects. As indicated in student assessments, the quality of teaching and the students\u0026#x27; motivation are increasing significantly. Some topics of the new ..."},"translated_abstract":"We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students\u0026#x27; projects. As indicated in student assessments, the quality of teaching and the students\u0026#x27; motivation are increasing significantly. Some topics of the new ...","internal_url":"https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs","translated_internal_url":"","created_at":"2022-04-16T23:09:09.527-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303269,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303269/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303269/EB183GA-libre.pdf?1650176446=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=BMkVXpv6YxmU0oD~44q-QkugUzqWyFBZZj7j-aGAa90-uy9QQcHIuVcsiHuY2pc~V6dYnnFLqTXXwd4u9hCLi0fccgjl8UokXu3AdlAgT1YssLj6MzOu~lAjrk2YoiHQSOE1c-PsIdl9PnHOWejI9LLN4TSu2zq7DZdDLV-rFU5KWLIkUEv6gZ3xA8enyigyq~TuRPEVNui-0ve7Eh14MG8acIxPr~EOWsmgdzB72U9Nryn6me0Tg-Fa3smofmZSfXzWQHOR39h7GsDsCok3hFqI8Lz-bDuHxG4nSr7R~evFXjHr1QRWCoR1q0peU5cbiJBaN3fACoTZknDEdnwxNw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs","translated_slug":"","page_count":6,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303269,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303269/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303269/EB183GA-libre.pdf?1650176446=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=BMkVXpv6YxmU0oD~44q-QkugUzqWyFBZZj7j-aGAa90-uy9QQcHIuVcsiHuY2pc~V6dYnnFLqTXXwd4u9hCLi0fccgjl8UokXu3AdlAgT1YssLj6MzOu~lAjrk2YoiHQSOE1c-PsIdl9PnHOWejI9LLN4TSu2zq7DZdDLV-rFU5KWLIkUEv6gZ3xA8enyigyq~TuRPEVNui-0ve7Eh14MG8acIxPr~EOWsmgdzB72U9Nryn6me0Tg-Fa3smofmZSfXzWQHOR39h7GsDsCok3hFqI8Lz-bDuHxG4nSr7R~evFXjHr1QRWCoR1q0peU5cbiJBaN3fACoTZknDEdnwxNw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303270,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303270/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303270/download_file","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303270/EB183GA-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=Vjnk1ZF7Xu8Hr80pDjhWvBx8ehFqdY2yLJITQhP~kYQPmF9OWFlkmPUcy0bJwNKJjHor6UsSHSPgrFcoqA6-v0P~vuyJkvvvfHuDXp7h3JJ~3uAMdK-L4PEsQmQHf3pziqsZmLZDHyx8IGj3~e0dyGkcX7Jea2aZQcyb4uPz~TjmvCs0xnkohlnRbuXqBxiZvcN3g8b5B7BneLA3MA8~rXFlN-oMbARjMIifyll56ibDoe7ysPmZO0ISswahCMYgkJLJy-jNam8-cLFpiC-k7khu7d3zM0Z~KBQmktcZJEsFCcxowliquYaeAzrU3wp90WH3PB8b8PLD5J2-Vt7iHw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[],"urls":[{"id":19566809,"url":"http://www.iiis.org/CDs2011/CD2011IMC/ICETI_2011/PapersPdf/EB183GA.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673939"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems"><img alt="Research paper thumbnail of How Advanced are Advanced Planning Systems?" class="work-thumbnail" src="https://attachments.academia-assets.com/84303268/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems">How Advanced are Advanced Planning Systems?</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="f6b9d178abc74401819d4e7a736b1bc8" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303268,"asset_id":76673939,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673939"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673939"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673939; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673939]").text(description); $(".js-view-count[data-work-id=76673939]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673939; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673939']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673939, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "f6b9d178abc74401819d4e7a736b1bc8" } } $('.js-work-strip[data-work-id=76673939]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673939,"title":"How Advanced are Advanced Planning Systems?","translated_title":"","metadata":{"abstract":"In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ..."},"translated_abstract":"In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ...","internal_url":"https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems","translated_internal_url":"","created_at":"2022-04-16T23:09:09.303-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303268,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303268/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303268/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=Cq-rJst~6uMtOS6wKU4~1AcdcYgoy56C1oVxwE3vZF8IhDZKxJSVfHexYCljhSQigSnexac4wi1slVXUDByIz6iZvbtC5HLSxPV9OP8nwXoFe884TFsRHTZowa1pfzEzYyCf6rq2MXrddaRJ4aCEUuDIQTBo7tSv8gzR4xhxCL-G9rmbiEw9WbegE1TFMp2ErGrndJAmDqBC~CRhADfvh1lCB0LQ0Nc0zl84~0Ocy3gKLKWsbfP1u2Phkotle5OryKnGTTGrtbh4kyodMmf06Hy0~IQv5J9gUD0PEMXY0M5Unkf5EZAi5M6NAsDHZIS4vw1pMu8nV3GHWHwhCbFhCg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"How_Advanced_are_Advanced_Planning_Systems","translated_slug":"","page_count":8,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303268,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303268/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303268/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=Cq-rJst~6uMtOS6wKU4~1AcdcYgoy56C1oVxwE3vZF8IhDZKxJSVfHexYCljhSQigSnexac4wi1slVXUDByIz6iZvbtC5HLSxPV9OP8nwXoFe884TFsRHTZowa1pfzEzYyCf6rq2MXrddaRJ4aCEUuDIQTBo7tSv8gzR4xhxCL-G9rmbiEw9WbegE1TFMp2ErGrndJAmDqBC~CRhADfvh1lCB0LQ0Nc0zl84~0Ocy3gKLKWsbfP1u2Phkotle5OryKnGTTGrtbh4kyodMmf06Hy0~IQv5J9gUD0PEMXY0M5Unkf5EZAi5M6NAsDHZIS4vw1pMu8nV3GHWHwhCbFhCg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303267,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303267/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303267/download_file","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303267/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=MgSLss1Yv3Y~mTg-grZQDWAZcfI5dXfk0HDu-HRirnq4U0PmMnmclM291d~DgtPUq1z04jeRwvOe7Fql06BLHF6m0kb9cDDnJsjWfA8HcJVQww4c8c7y8TcaIKmKcMbgm0yMhJQuGyodczp2Cnrb3LZz69m1~ASwr1HaFGwHhjCM4zfQEefnoac6b5PXy4K-Bw0xGAbJSzl-IzKaaNryzApIefUHsJrpyY1c3OzEPzUd0AQEKEXxgS~nWLTcGNLTAyh~7RdOfTCD5CXHyTA7RAu3UK7nWYIV-ZujLsNPGo4pz1f020LRD-LKzrwG0bTmwtyLClF0ionvdlpwUd3luw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[],"urls":[{"id":19566808,"url":"http://www.iiis.org/CDs2011/CD2011IMC/ISSE_2011/PapersPdf/IS658IV.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673938"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen"><img alt="Research paper thumbnail of Eine 脺bersicht zum Scheduling von Baustellen" class="work-thumbnail" src="https://attachments.academia-assets.com/84303265/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen">Eine 脺bersicht zum Scheduling von Baustellen</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fas...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="225fb8a4a18dad353930711dcf7e8f61" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303265,"asset_id":76673938,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673938"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673938"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673938; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673938]").text(description); $(".js-view-count[data-work-id=76673938]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673938; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673938']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673938, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "225fb8a4a18dad353930711dcf7e8f61" } } $('.js-work-strip[data-work-id=76673938]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673938,"title":"Eine 脺bersicht zum Scheduling von Baustellen","translated_title":"","metadata":{"abstract":"Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.","publisher":"ITWM","publication_date":{"day":null,"month":null,"year":2005,"errors":{}}},"translated_abstract":"Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.","internal_url":"https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen","translated_internal_url":"","created_at":"2022-04-16T23:09:09.130-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303265/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303265/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=YK9n5GBRxWjYyye72pHEuWWDSTz41gnTeogEFgBX0oMgpBrNmD9pZhyaI8-NBRqYTvS0BN8q2OwjwO-U9dQMgOvhHwmSszuNESywrdVRLdE1g66GiWZ2zQ8b-Pt8380iLE1rWiBWd65dLDYZYEtUzaYjbk~WaZ2RlJhEOxYH4K9yGICKRfVAWo3o~EswhFPXLiQGX6GEcn1-Mqq~NjVExA7ipLSNUFLR7a2RT-9OJQZfoLmXdaMsZYMZYr4PmwGR0l-eGCqJTecg1qkPBynqhFdnUcqPbhtJcSpwYiYbG--VYoxSNUzykp~ZwXaC3w7aS9M3nt4Hak3fOjGAoqVm0g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Eine_脺bersicht_zum_Scheduling_von_Baustellen","translated_slug":"","page_count":44,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303265/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303265/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=YK9n5GBRxWjYyye72pHEuWWDSTz41gnTeogEFgBX0oMgpBrNmD9pZhyaI8-NBRqYTvS0BN8q2OwjwO-U9dQMgOvhHwmSszuNESywrdVRLdE1g66GiWZ2zQ8b-Pt8380iLE1rWiBWd65dLDYZYEtUzaYjbk~WaZ2RlJhEOxYH4K9yGICKRfVAWo3o~EswhFPXLiQGX6GEcn1-Mqq~NjVExA7ipLSNUFLR7a2RT-9OJQZfoLmXdaMsZYMZYr4PmwGR0l-eGCqJTecg1qkPBynqhFdnUcqPbhtJcSpwYiYbG--VYoxSNUzykp~ZwXaC3w7aS9M3nt4Hak3fOjGAoqVm0g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303266,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303266/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303266/download_file","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303266/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=BW7kI4l0ZJ0c2~~VL4V2PayaAwujEWHyytbzWfR28Tylka5TSaGe7wJL3V1Hin-7TDiluERBgHRs4xYC3v6HAQAXlfX25WIJNI~jS25PaPZ48QKW3DTurAxjQmbIE3XVrb~hlJLZ9LkFTDCEKQcUv-VZ-YVpHciS4LQ8lGJ7yol64W5iMGMaHG5bj92tIxHaQ5bjLZjKkSv2kqP~4s1W6vic-0EJRId53XDALFARIkug6Q9-pbvMnLzbTAVOcePD8IQXwsJy78klci6L1RDk4K4oAGmmwv6zh2NFRoZR1fcCpsg6lWzxNT~j6xkY6hIvaeI5l8g4D6l~-L1OI7zbfg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2277,"name":"Project Management","url":"https://www.academia.edu/Documents/in/Project_Management"},{"id":3105,"name":"Construction Management","url":"https://www.academia.edu/Documents/in/Construction_Management"},{"id":4486,"name":"Political Science","url":"https://www.academia.edu/Documents/in/Political_Science"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":92270,"name":"Market Surveys","url":"https://www.academia.edu/Documents/in/Market_Surveys"}],"urls":[{"id":19566807,"url":"http://kluedo.ub.uni-kl.de/files/1645/bericht74.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div><div class="profile--tab_content_container js-tab-pane tab-pane" data-section-id="25762" id="papers"><div class="js-work-strip profile--work_container" data-work-id="122256375"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem"><img alt="Research paper thumbnail of A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem">A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="122256375"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="122256375"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 122256375; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=122256375]").text(description); $(".js-view-count[data-work-id=122256375]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 122256375; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='122256375']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 122256375, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=122256375]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":122256375,"title":"A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem","translated_title":"","metadata":{"abstract":"The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.","publication_date":{"day":1,"month":9,"year":2016,"errors":{}}},"translated_abstract":"The Two-Echelon Vehicle Routing Problem (2E-VRP) is a combinatorial optimization problem used in transport logistics with a two layered composition. In a first level trip, freight has to be delivered from a main depot to a set of possible satellites (intermediate depots). Afterwards the goods are served in second level trips to the final customers. Inspired by a paper from Nguyen, Prins and Prodhon we developed a novel heuristic comparison framework based on the open source simulation environment OpenCI. On the basis of the mentioned paper we implemented three heuristics to solve the 2E-VRP and a greedy randomized adaptive search procedure (GRASP) with a learning process (LP). The GRASP-LP uses two heuristics which improve their solution by a variable neighborhood descent (VND). The VND itself uses two different neighborhoods to enhance the result. The comparison framework is able to load different 2E-VRP maps which can be solved by single heuristics or the GRASP. The new heuristic comparison framework offers the possibility to add quickly different heuristics and to do experiments with them.","internal_url":"https://www.academia.edu/122256375/A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem","translated_internal_url":"","created_at":"2024-07-22T05:12:25.732-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"A_heuristic_comparison_framework_for_solving_the_Two_Echelon_Vehicle_Routing_Problem","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":48,"name":"Engineering","url":"https://www.academia.edu/Documents/in/Engineering"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":46939,"name":"Grasp","url":"https://www.academia.edu/Documents/in/Grasp"},{"id":245965,"name":"Vehicle Routing Problem","url":"https://www.academia.edu/Documents/in/Vehicle_Routing_Problem"},{"id":272592,"name":"Mathematical Optimization","url":"https://www.academia.edu/Documents/in/Mathematical_Optimization"},{"id":419504,"name":"Heuristic","url":"https://www.academia.edu/Documents/in/Heuristic"},{"id":893452,"name":"Greedy Algorithm","url":"https://www.academia.edu/Documents/in/Greedy_Algorithm"}],"urls":[{"id":43634981,"url":"https://doi.org/10.1109/iscbi.2016.7743259"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121952939"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem"><img alt="Research paper thumbnail of An ant colony system solving the travelling salesman region problem" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem">An ant colony system solving the travelling salesman region problem</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">A variant of the well-known travelling salesman problem is about introducing particular dependenc...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121952939"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121952939"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121952939; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121952939]").text(description); $(".js-view-count[data-work-id=121952939]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121952939; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121952939']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121952939, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121952939]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121952939,"title":"An ant colony system solving the travelling salesman region problem","translated_title":"","metadata":{"abstract":"A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.","publication_date":{"day":1,"month":9,"year":2016,"errors":{}}},"translated_abstract":"A variant of the well-known travelling salesman problem is about introducing particular dependencies among the cities. Such dependencies might describe the relations between single cities which can be used for autonomous vehicles that need to follow certain paths for some reasons. This paper deals with solving the Travelling Salesman Region Problem where particular connections of cities are already predefined. We are investigating and discussing the influences of the parameters of the Ant Colony Optimization algorithm solving travelling salesman region problems.","internal_url":"https://www.academia.edu/121952939/An_ant_colony_system_solving_the_travelling_salesman_region_problem","translated_internal_url":"","created_at":"2024-07-10T23:36:45.699-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"An_ant_colony_system_solving_the_travelling_salesman_region_problem","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":261,"name":"Geography","url":"https://www.academia.edu/Documents/in/Geography"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":104401,"name":"Ant","url":"https://www.academia.edu/Documents/in/Ant"},{"id":311003,"name":"ANT COLONY","url":"https://www.academia.edu/Documents/in/ANT_COLONY"},{"id":884823,"name":"Travelling Salesman Problem","url":"https://www.academia.edu/Documents/in/Travelling_Salesman_Problem"}],"urls":[{"id":43469530,"url":"https://doi.org/10.1109/iscbi.2016.7743270"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121637676"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems"><img alt="Research paper thumbnail of Invasive weed optimization for solving index tracking problems" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems">Invasive weed optimization for solving index tracking problems</a></div><div class="wp-workCard_item"><span>Soft Computing</span><span>, Jul 29, 2015</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Index tracking belongs to one of the most important types of problems in portfolio management. In...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121637676"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121637676"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121637676; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121637676]").text(description); $(".js-view-count[data-work-id=121637676]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121637676; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121637676']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121637676, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121637676]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121637676,"title":"Invasive weed optimization for solving index tracking problems","translated_title":"","metadata":{"abstract":"Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.","publisher":"Springer Science+Business Media","publication_date":{"day":29,"month":7,"year":2015,"errors":{}},"publication_name":"Soft Computing"},"translated_abstract":"Index tracking belongs to one of the most important types of problems in portfolio management. In contrast to classical (active) portfolio management and optimization, passive portfolio management usually seeks to replicate a given index for a financial market. Due to transaction costs or legal or other practical limitation on the tradability of the respective assets, such indexes are often not fully replicated by a respective portfolio. Instead, one seeks to use a subset of the index assets (or other types of assets) to obtain a portfolio most similar to the index. This index tracking problem can be formulated as an optimization problem with respect to the minimization of the tracking error. In this article, we explore possibilities to solve the index tracking problem with invasive weed optimization (IWO), a rather new population-based metaheuristics algorithm. The complexity of this real-life problem and especially its solution space and restrictions require substantial adaptation of the original IWO algorithm. We explore different possibilities to adapt IWO to the considered type of problem. The adapted IWO method is tested using MSCI USA Value data, and systematic studies to find suitable parameter values are conducted. Although the method basically works well, the obtained results do not fully reach our intended benchmark. Reasons for that and possibilities for further improvement of the methodology are discussed.","internal_url":"https://www.academia.edu/121637676/Invasive_weed_optimization_for_solving_index_tracking_problems","translated_internal_url":"","created_at":"2024-06-30T00:06:42.656-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Invasive_weed_optimization_for_solving_index_tracking_problems","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science"},{"id":305,"name":"Applied Mathematics","url":"https://www.academia.edu/Documents/in/Applied_Mathematics"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":6132,"name":"Soft Computing","url":"https://www.academia.edu/Documents/in/Soft_Computing"},{"id":27827,"name":"Project Portfolio Management","url":"https://www.academia.edu/Documents/in/Project_Portfolio_Management"},{"id":56735,"name":"Portfolio Optimization","url":"https://www.academia.edu/Documents/in/Portfolio_Optimization"},{"id":61216,"name":"Portfolio","url":"https://www.academia.edu/Documents/in/Portfolio"},{"id":272592,"name":"Mathematical Optimization","url":"https://www.academia.edu/Documents/in/Mathematical_Optimization"},{"id":882596,"name":"Tracking Error","url":"https://www.academia.edu/Documents/in/Tracking_Error"}],"urls":[{"id":43297823,"url":"https://doi.org/10.1007/s00500-015-1799-x"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="121179278"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors"><img alt="Research paper thumbnail of Optimizing staff rosters for emergency shifts for doctors" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors">Optimizing staff rosters for emergency shifts for doctors</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct go...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="121179278"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="121179278"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 121179278; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=121179278]").text(description); $(".js-view-count[data-work-id=121179278]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 121179278; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='121179278']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 121179278, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=121179278]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":121179278,"title":"Optimizing staff rosters for emergency shifts for doctors","translated_title":"","metadata":{"abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","publication_date":{"day":1,"month":5,"year":2009,"errors":{}}},"translated_abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","internal_url":"https://www.academia.edu/121179278/Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_internal_url":"","created_at":"2024-06-18T04:53:00.658-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":19566,"name":"Emergency Management","url":"https://www.academia.edu/Documents/in/Emergency_Management"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm"},{"id":117269,"name":"Insects","url":"https://www.academia.edu/Documents/in/Insects"},{"id":172784,"name":"Workload","url":"https://www.academia.edu/Documents/in/Workload"}],"urls":[{"id":43035659,"url":"https://doi.org/10.1109/cec.2009.4983260"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="110506831"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/110506831/Multi_Criteria_Decision_Making"><img alt="Research paper thumbnail of Multi-Criteria Decision Making" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/110506831/Multi_Criteria_Decision_Making">Multi-Criteria Decision Making</a></div><div class="wp-workCard_item"><span>Genetic Algorithms and Evolutionary Computation</span><span>, 2002</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">One aspect that most of the current research on evolutionary multiobjective optimization (EMO) of...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="110506831"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="110506831"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 110506831; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=110506831]").text(description); $(".js-view-count[data-work-id=110506831]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 110506831; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='110506831']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 110506831, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=110506831]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":110506831,"title":"Multi-Criteria Decision Making","translated_title":"","metadata":{"abstract":"One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.","publication_date":{"day":null,"month":null,"year":2002,"errors":{}},"publication_name":"Genetic Algorithms and Evolutionary Computation"},"translated_abstract":"One aspect that most of the current research on evolutionary multiobjective optimization (EMO) often disregards is the fact that the solution of a multiobjective optimization problem (MOP) really involves three stages: measurement, search, and decision making.","internal_url":"https://www.academia.edu/110506831/Multi_Criteria_Decision_Making","translated_internal_url":"","created_at":"2023-12-04T00:03:40.942-08:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Multi_Criteria_Decision_Making","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":143163,"name":"Multi objective optimization","url":"https://www.academia.edu/Documents/in/Multi_objective_optimization"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="107722629"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms"><img alt="Research paper thumbnail of Attraction and diffusion in nature-inspired optimization algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/106309202/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms">Attraction and diffusion in nature-inspired optimization algorithms</a></div><div class="wp-workCard_item"><span>Neural Computing and Applications</span><span>, May 15, 2015</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="9ba35a3309310b1c55842edb8b880ba4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":106309202,"asset_id":107722629,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="107722629"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="107722629"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 107722629; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=107722629]").text(description); $(".js-view-count[data-work-id=107722629]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 107722629; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='107722629']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 107722629, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "9ba35a3309310b1c55842edb8b880ba4" } } $('.js-work-strip[data-work-id=107722629]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":107722629,"title":"Attraction and diffusion in nature-inspired optimization algorithms","translated_title":"","metadata":{"publisher":"Springer Science+Business Media","grobid_abstract":"Full bibliographic details must be given when referring to, or quoting from full items including the author's name, the title of the work, publication details where relevant (place, publisher, date), pagination, and for theses or dissertations the awarding institution, the degree type awarded, and the date of the award.","publication_date":{"day":15,"month":5,"year":2015,"errors":{}},"publication_name":"Neural Computing and Applications","grobid_abstract_attachment_id":106309202},"translated_abstract":null,"internal_url":"https://www.academia.edu/107722629/Attraction_and_diffusion_in_nature_inspired_optimization_algorithms","translated_internal_url":"","created_at":"2023-10-06T21:39:38.498-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":106309202,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/106309202/thumbnails/1.jpg","file_name":"Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final.pdf","download_url":"https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Attraction_and_diffusion_in_nature_inspi.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/106309202/Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final-libre.pdf?1696655205=\u0026response-content-disposition=attachment%3B+filename%3DAttraction_and_diffusion_in_nature_inspi.pdf\u0026Expires=1732715588\u0026Signature=THWciraH525O8TliFLxZZjOu8wWEXN6z1q93aDAlansImUP-tpFVGl7bK7cdsjeDAvU6y3OT-XOajKvo6yyDntW4S-k7o9o-b2U9tFrl8UcrmdliJFVdjjqVyJ31xH1D9DghKFt0-GX-Zx3v2N03TI54TIsZvUkAipfjVBLhJ8O8EVGb0xSdg1iAczTHdPQm~FO5vKmF618ye2htEqumNXzwfxMDDZW7wU5wbnWyqt-TRCbh7G5AQnqncHh8Lu3U9XZusn26lhXjRshHb1oNkyHWC4N9hN47FwscVB0d32TIFRetRAvy4bpxd1GqRxQlnqQX-P-o8wsWsQs24vCGGg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Attraction_and_diffusion_in_nature_inspired_optimization_algorithms","translated_slug":"","page_count":21,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":106309202,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/106309202/thumbnails/1.jpg","file_name":"Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final.pdf","download_url":"https://www.academia.edu/attachments/106309202/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Attraction_and_diffusion_in_nature_inspi.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/106309202/Attraction_And_Diffusion_In_Nature-Inspired_Optimization_Algorithms_150120_final-libre.pdf?1696655205=\u0026response-content-disposition=attachment%3B+filename%3DAttraction_and_diffusion_in_nature_inspi.pdf\u0026Expires=1732715588\u0026Signature=THWciraH525O8TliFLxZZjOu8wWEXN6z1q93aDAlansImUP-tpFVGl7bK7cdsjeDAvU6y3OT-XOajKvo6yyDntW4S-k7o9o-b2U9tFrl8UcrmdliJFVdjjqVyJ31xH1D9DghKFt0-GX-Zx3v2N03TI54TIsZvUkAipfjVBLhJ8O8EVGb0xSdg1iAczTHdPQm~FO5vKmF618ye2htEqumNXzwfxMDDZW7wU5wbnWyqt-TRCbh7G5AQnqncHh8Lu3U9XZusn26lhXjRshHb1oNkyHWC4N9hN47FwscVB0d32TIFRetRAvy4bpxd1GqRxQlnqQX-P-o8wsWsQs24vCGGg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":237,"name":"Cognitive Science","url":"https://www.academia.edu/Documents/in/Cognitive_Science"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":428,"name":"Algorithms","url":"https://www.academia.edu/Documents/in/Algorithms"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":26817,"name":"Algorithm","url":"https://www.academia.edu/Documents/in/Algorithm"},{"id":83315,"name":"Diffusion","url":"https://www.academia.edu/Documents/in/Diffusion"},{"id":90268,"name":"Computational Science and Engineering","url":"https://www.academia.edu/Documents/in/Computational_Science_and_Engineering"},{"id":149735,"name":"Attraction","url":"https://www.academia.edu/Documents/in/Attraction"},{"id":176826,"name":"Firefly Algorithm","url":"https://www.academia.edu/Documents/in/Firefly_Algorithm"},{"id":238655,"name":"Implementation","url":"https://www.academia.edu/Documents/in/Implementation"},{"id":398158,"name":"Nature Inspired Computing","url":"https://www.academia.edu/Documents/in/Nature_Inspired_Computing"},{"id":423243,"name":"Bio and Nature Inspired Algorithms","url":"https://www.academia.edu/Documents/in/Bio_and_Nature_Inspired_Algorithms"}],"urls":[{"id":34396873,"url":"https://doi.org/10.1007/s00521-015-1925-9"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673951"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning"><img alt="Research paper thumbnail of Emotion Influenced Robotic Path Planning" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning">Emotion Influenced Robotic Path Planning</a></div><div class="wp-workCard_item"><span>Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence - ISMSI '17</span><span>, 2017</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We introduce an emotion influenced robotic path planning solution which offers the possibility of...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673951"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673951"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673951; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673951]").text(description); $(".js-view-count[data-work-id=76673951]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673951; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673951']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673951, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673951]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673951,"title":"Emotion Influenced Robotic Path Planning","translated_title":"","metadata":{"abstract":"We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.","publisher":"ACM Press","publication_date":{"day":null,"month":null,"year":2017,"errors":{}},"publication_name":"Proceedings of the 2017 International Conference on Intelligent Systems, Metaheuristics \u0026 Swarm Intelligence - ISMSI '17"},"translated_abstract":"We introduce an emotion influenced robotic path planning solution which offers the possibility of enabling emotions in the robot. The robot can change the speed of the path or learn where it should be and where it should not be. Most existing solutions for robotic path planning have no emotional influences. The most successful emotions were taken and included into the solution of this paper. The results were analyzed with regard to the time and speed it takes for a normal robotic path planning without emotions and with emotions of happiness, fear and novelty.","internal_url":"https://www.academia.edu/76673951/Emotion_Influenced_Robotic_Path_Planning","translated_internal_url":"","created_at":"2022-04-16T23:09:11.400-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Emotion_Influenced_Robotic_Path_Planning","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":77,"name":"Robotics","url":"https://www.academia.edu/Documents/in/Robotics"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":439576,"name":"Acm","url":"https://www.academia.edu/Documents/in/Acm"}],"urls":[{"id":19566810,"url":"http://dl.acm.org/ft_gateway.cfm?id=3059346\u0026ftid=1873895\u0026dwn=1"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673950"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure"><img alt="Research paper thumbnail of A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure">A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings</span><span>, 2001</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673950"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673950"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673950; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673950]").text(description); $(".js-view-count[data-work-id=76673950]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673950; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673950']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673950, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673950]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673950,"title":"A Heuristic Approach for a Multistage Lotsizing Problem with Dynamic Product Structure","translated_title":"","metadata":{"abstract":"Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...","publication_date":{"day":null,"month":null,"year":2001,"errors":{}},"publication_name":"Operations Research Proceedings"},"translated_abstract":"Abstract: We consider a multistage lotsizing problem with capacity-constrained resources, general product structures and nonzero lead times. This problem is motivated by a real-life application from a large manufacturer of electronic devices and deals with the determination of a production plan for the end items and their components to meet external prioritized demand in each period of a given planning horizon. Since resources are scarce, the main objective is to obtain a production plan that minimizes the total number of late orders. The ...","internal_url":"https://www.academia.edu/76673950/A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure","translated_internal_url":"","created_at":"2022-04-16T23:09:11.280-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"A_Heuristic_Approach_for_a_Multistage_Lotsizing_Problem_with_Dynamic_Product_Structure","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning"},{"id":38532,"name":"Evolution of ERP","url":"https://www.academia.edu/Documents/in/Evolution_of_ERP"},{"id":46030,"name":"ERP","url":"https://www.academia.edu/Documents/in/ERP"},{"id":1751768,"name":"ERP Systems","url":"https://www.academia.edu/Documents/in/ERP_Systems"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673949"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM"><img alt="Research paper thumbnail of An Object-Oriented Decision Support System for MCDM" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM">An Object-Oriented Decision Support System for MCDM</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings</span><span>, 1994</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">This paper deals with the basic ideas and implementation of an object-oriented decision support s...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673949"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673949"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673949; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673949]").text(description); $(".js-view-count[data-work-id=76673949]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673949; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673949']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673949, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673949]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673949,"title":"An Object-Oriented Decision Support System for MCDM","translated_title":"","metadata":{"abstract":"This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?","publication_date":{"day":null,"month":null,"year":1994,"errors":{}},"publication_name":"Operations Research Proceedings"},"translated_abstract":"This paper deals with the basic ideas and implementation of an object-oriented decision support system (DSS), especially for multiple criteria decision making (MCDM). There are various ways of integrating different MCDM methods in a DSS. One way is the interactive application of different methods by means of an integrative user interface. Integration can also be achieved by utilizing neural networks and similar concepts. Neural network-based DSS are able to combine different methods and to learn from historical decisions. They are able to answer questions like: Which method should be used? How can the parameters be adjusted? Is it useful to apply different methods and to aggregate their results to a compromise solution? And how should this be done?","internal_url":"https://www.academia.edu/76673949/An_Object_Oriented_Decision_Support_System_for_MCDM","translated_internal_url":"","created_at":"2022-04-16T23:09:11.144-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"An_Object_Oriented_Decision_Support_System_for_MCDM","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":453,"name":"Object Oriented Programming","url":"https://www.academia.edu/Documents/in/Object_Oriented_Programming"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":98846,"name":"Multicriteria decision making","url":"https://www.academia.edu/Documents/in/Multicriteria_decision_making"},{"id":99432,"name":"Multicriteria Decision Aid","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Aid"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673948"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey"><img alt="Research paper thumbnail of Optimization problems in airline and railway planning - a comparative survey" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey">Optimization problems in airline and railway planning - a comparative survey</a></div><div class="wp-workCard_item"><span>Third International Workshop on Advanced Computational Intelligence</span><span>, 2010</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673948"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673948"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673948; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673948]").text(description); $(".js-view-count[data-work-id=76673948]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673948; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673948']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673948, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673948]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673948,"title":"Optimization problems in airline and railway planning - a comparative survey","translated_title":"","metadata":{"abstract":"Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...","publisher":"IEEE","publication_date":{"day":null,"month":null,"year":2010,"errors":{}},"publication_name":"Third International Workshop on Advanced Computational Intelligence"},"translated_abstract":"Abstract聴Both areas, airline planning and railway planning, have attracted a significant interest from the operations research and optimization community during the past decades. Although both areas have significant similarities, ie transport of people and goods according to ...","internal_url":"https://www.academia.edu/76673948/Optimization_problems_in_airline_and_railway_planning_a_comparative_survey","translated_internal_url":"","created_at":"2022-04-16T23:09:10.961-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimization_problems_in_airline_and_railway_planning_a_comparative_survey","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":2535,"name":"Operations Research","url":"https://www.academia.edu/Documents/in/Operations_Research"},{"id":2953,"name":"Transport Logistics","url":"https://www.academia.edu/Documents/in/Transport_Logistics"},{"id":3168,"name":"Transportation Studies","url":"https://www.academia.edu/Documents/in/Transportation_Studies"},{"id":3169,"name":"Railway Transport","url":"https://www.academia.edu/Documents/in/Railway_Transport"},{"id":6007,"name":"Transport Planning","url":"https://www.academia.edu/Documents/in/Transport_Planning"},{"id":46254,"name":"Optimization Problem","url":"https://www.academia.edu/Documents/in/Optimization_Problem"},{"id":65795,"name":"Airline operations","url":"https://www.academia.edu/Documents/in/Airline_operations"},{"id":134460,"name":"Travel Industry","url":"https://www.academia.edu/Documents/in/Travel_Industry"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673947"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM"><img alt="Research paper thumbnail of On the Development and Future Aspects of Vector Optimization and MCDM" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM">On the Development and Future Aspects of Vector Optimization and MCDM</a></div><div class="wp-workCard_item"><span>Multicriteria Analysis</span><span>, 1997</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of resear...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673947"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673947"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673947; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673947]").text(description); $(".js-view-count[data-work-id=76673947]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673947; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673947']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673947, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673947]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673947,"title":"On the Development and Future Aspects of Vector Optimization and MCDM","translated_title":"","metadata":{"abstract":"ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.","publication_date":{"day":null,"month":null,"year":1997,"errors":{}},"publication_name":"Multicriteria Analysis"},"translated_abstract":"ABSTRACT The paper is divided into three parts: (1) Historical sketch, (2) Main streams of research, (3) Future development. In the first part, a concise review of the historical roots and the developments of vector optimization in the sense of decision making under several goals (objective functions) is presented. In the second part, various main streams are discussed. Two basic aspects of vector optimization can be distinguished: the pure theoretical, mainly mathematical one, and the more practical, methodologically oriented one. A brief survey of vector optimization theory is given. In the third part, we try to outline directions of future development based on the knowledge of past and present trends.","internal_url":"https://www.academia.edu/76673947/On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM","translated_internal_url":"","created_at":"2022-04-16T23:09:10.843-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"On_the_Development_and_Future_Aspects_of_Vector_Optimization_and_MCDM","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":3974445,"name":"Multicriteria Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Analysis"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673946"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making"><img alt="Research paper thumbnail of Some Aspects of Polytope Degeneracy in Multicriteria Decision Making" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making">Some Aspects of Polytope Degeneracy in Multicriteria Decision Making</a></div><div class="wp-workCard_item"><span>Intelligent Decision Support</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2Unive...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz <a href="mailto:tomas.gal@fernuni-hagen.de" rel="nofollow">tomas.gal@fernuni-hagen.de</a>, <a href="mailto:thomas.hanne@fhnw.ch" rel="nofollow">thomas.hanne@fhnw.ch</a> ... Abstract. Various methods ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673946"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673946"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673946; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673946]").text(description); $(".js-view-count[data-work-id=76673946]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673946; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673946']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673946, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673946]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673946,"title":"Some Aspects of Polytope Degeneracy in Multicriteria Decision Making","translated_title":"","metadata":{"abstract":"Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz tomas.gal@fernuni-hagen.de, thomas.hanne@fhnw.ch ... Abstract. Various methods ...","publication_name":"Intelligent Decision Support"},"translated_abstract":"Tomas Gal1 and Thomas Hanne2 1FernUniversit盲t in Hagen, Universit盲tsstra脽e 41, 58084 Hagen 2University of Applied Sciences, Riggenbachstr. 16, 4600 Olten, Schweiz tomas.gal@fernuni-hagen.de, thomas.hanne@fhnw.ch ... Abstract. Various methods ...","internal_url":"https://www.academia.edu/76673946/Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making","translated_internal_url":"","created_at":"2022-04-16T23:09:10.722-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Some_Aspects_of_Polytope_Degeneracy_in_Multicriteria_Decision_Making","translated_slug":"","page_count":null,"language":"de","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":3853,"name":"Optimization (Mathematics)","url":"https://www.academia.edu/Documents/in/Optimization_Mathematics_"},{"id":5447,"name":"Linear Programming","url":"https://www.academia.edu/Documents/in/Linear_Programming"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":40587,"name":"Degeneracy","url":"https://www.academia.edu/Documents/in/Degeneracy"},{"id":85068,"name":"Multicriteria Decision Analysis","url":"https://www.academia.edu/Documents/in/Multicriteria_Decision_Analysis"},{"id":774425,"name":"Intelligent Decision Support Systems","url":"https://www.academia.edu/Documents/in/Intelligent_Decision_Support_Systems"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673945"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms"><img alt="Research paper thumbnail of Scheduling in Software Development Using Multiobjective Evolutionary Algorithms" class="work-thumbnail" src="https://attachments.academia-assets.com/84304506/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms">Scheduling in Software Development Using Multiobjective Evolutionary Algorithms</a></div><div class="wp-workCard_item"><span>Multidisciplinary Scheduling: Theory and Applications</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="e44126a6f71672f0b3bc5274db63403b" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84304506,"asset_id":76673945,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673945"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673945"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673945; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673945]").text(description); $(".js-view-count[data-work-id=76673945]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673945; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673945']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673945, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "e44126a6f71672f0b3bc5274db63403b" } } $('.js-work-strip[data-work-id=76673945]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673945,"title":"Scheduling in Software Development Using Multiobjective Evolutionary Algorithms","translated_title":"","metadata":{"grobid_abstract":"We consider the problem of planning inspections and other tasks within a software development (SD) project with respect to the objectives quality (no. of defects), project duration, and costs. The considered model of SD processes comprises the phases of coding, inspection, test, and rework and includes assigning tasks to persons and generating a project schedule. Based on this model we discuss a multiobjective optimisation problem. For solving the problem (i.e., finding an approximation of the efficient set) we develop a multiobjective evolutionary algorithm. Details of the algorithm are discussed as well as results of its application to sample problems.","publication_name":"Multidisciplinary Scheduling: Theory and Applications","grobid_abstract_attachment_id":84304506},"translated_abstract":null,"internal_url":"https://www.academia.edu/76673945/Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms","translated_internal_url":"","created_at":"2022-04-16T23:09:10.502-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84304506,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84304506/thumbnails/1.jpg","file_name":"0-387-27744-7_4.pdf","download_url":"https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Scheduling_in_Software_Development_Using.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84304506/0-387-27744-7_4-libre.pdf?1650178020=\u0026response-content-disposition=attachment%3B+filename%3DScheduling_in_Software_Development_Using.pdf\u0026Expires=1732715589\u0026Signature=HIbbO2Nu1EklUSnq3XZULeQPPBhxIRA2xvzpT8bcN8arlLdiqqMJzUqMPLlA8pWDjmakAuy2n0HFlRFj3yvJLx-Jar1jDHGnvushlNsmg1sjtPOwJN~7WJS2SMjG8oZ4TPDmGY-bocENYE5CHIa4YgY6vFxWlY5m8ZkWCm2hM643Ax4V0aoz1TrN~2DIEJnPL5paRyttF~ZcXhQRqX3sKv9gcs8esMdTIeElVVYAyHGFU9s5TWd6LhBpRekGAFU9NR8L4JYcwCChGz8ckvDJwakkugETkxk~I3E2Ohm8Cu6T9uSTzErDKymvCxOOg~E5Syg4lB5QxXUvfpwuRBv5IQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Scheduling_in_Software_Development_Using_Multiobjective_Evolutionary_Algorithms","translated_slug":"","page_count":2,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84304506,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84304506/thumbnails/1.jpg","file_name":"0-387-27744-7_4.pdf","download_url":"https://www.academia.edu/attachments/84304506/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Scheduling_in_Software_Development_Using.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84304506/0-387-27744-7_4-libre.pdf?1650178020=\u0026response-content-disposition=attachment%3B+filename%3DScheduling_in_Software_Development_Using.pdf\u0026Expires=1732715589\u0026Signature=HIbbO2Nu1EklUSnq3XZULeQPPBhxIRA2xvzpT8bcN8arlLdiqqMJzUqMPLlA8pWDjmakAuy2n0HFlRFj3yvJLx-Jar1jDHGnvushlNsmg1sjtPOwJN~7WJS2SMjG8oZ4TPDmGY-bocENYE5CHIa4YgY6vFxWlY5m8ZkWCm2hM643Ax4V0aoz1TrN~2DIEJnPL5paRyttF~ZcXhQRqX3sKv9gcs8esMdTIeElVVYAyHGFU9s5TWd6LhBpRekGAFU9NR8L4JYcwCChGz8ckvDJwakkugETkxk~I3E2Ohm8Cu6T9uSTzErDKymvCxOOg~E5Syg4lB5QxXUvfpwuRBv5IQ__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":2277,"name":"Project Management","url":"https://www.academia.edu/Documents/in/Project_Management"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":4065,"name":"Software Process Improvement and Assessment","url":"https://www.academia.edu/Documents/in/Software_Process_Improvement_and_Assessment"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":55827,"name":"Software Process Models","url":"https://www.academia.edu/Documents/in/Software_Process_Models"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673944"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors"><img alt="Research paper thumbnail of Optimizing staff rosters for emergency shifts for doctors" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors">Optimizing staff rosters for emergency shifts for doctors</a></div><div class="wp-workCard_item"><span>2009 IEEE Congress on Evolutionary Computation</span><span>, 2009</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct go...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673944"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673944"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673944; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673944]").text(description); $(".js-view-count[data-work-id=76673944]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673944; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673944']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673944, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673944]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673944,"title":"Optimizing staff rosters for emergency shifts for doctors","translated_title":"","metadata":{"abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"2009 IEEE Congress on Evolutionary Computation"},"translated_abstract":"The creation of staff rosters for emergency shifts for doctors is a complex task. To construct good rosters, many restrictions (eg holydays and workload) have to be taken into account. These restrictions have been mathematically specified for a concrete case in order to solve the problem ...","internal_url":"https://www.academia.edu/76673944/Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_internal_url":"","created_at":"2022-04-16T23:09:10.312-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Optimizing_staff_rosters_for_emergency_shifts_for_doctors","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1701,"name":"Evolutionary algorithms","url":"https://www.academia.edu/Documents/in/Evolutionary_algorithms"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10924,"name":"Optimization techniques","url":"https://www.academia.edu/Documents/in/Optimization_techniques"},{"id":19566,"name":"Emergency Management","url":"https://www.academia.edu/Documents/in/Emergency_Management"},{"id":30329,"name":"Genetic Algorithm","url":"https://www.academia.edu/Documents/in/Genetic_Algorithm"},{"id":117269,"name":"Insects","url":"https://www.academia.edu/Documents/in/Insects"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673943"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering"><img alt="Research paper thumbnail of Multiobjective and preference-based decision support for rail crew rostering" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering">Multiobjective and preference-based decision support for rail crew rostering</a></div><div class="wp-workCard_item"><span>2009 IEEE Congress on Evolutionary Computation</span><span>, 2009</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed ...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673943"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673943"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673943; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673943]").text(description); $(".js-view-count[data-work-id=76673943]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673943; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673943']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673943, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673943]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673943,"title":"Multiobjective and preference-based decision support for rail crew rostering","translated_title":"","metadata":{"abstract":"In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"2009 IEEE Congress on Evolutionary Computation"},"translated_abstract":"In this paper we discuss a real-life problem in rail crew rostering. Specific emphasis is placed on the requirements of advanced approaches in rostering and the usage of optimization-based decision support. The modeling of the rostering problems is discussed including the ...","internal_url":"https://www.academia.edu/76673943/Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering","translated_internal_url":"","created_at":"2022-04-16T23:09:10.100-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Multiobjective_and_preference_based_decision_support_for_rail_crew_rostering","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":37,"name":"Information Systems","url":"https://www.academia.edu/Documents/in/Information_Systems"},{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":1440,"name":"Visualization","url":"https://www.academia.edu/Documents/in/Visualization"},{"id":2953,"name":"Transport Logistics","url":"https://www.academia.edu/Documents/in/Transport_Logistics"},{"id":3169,"name":"Railway Transport","url":"https://www.academia.edu/Documents/in/Railway_Transport"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":6007,"name":"Transport Planning","url":"https://www.academia.edu/Documents/in/Transport_Planning"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":10075,"name":"Decision Support Systems","url":"https://www.academia.edu/Documents/in/Decision_Support_Systems"},{"id":13445,"name":"Multiobjective Optimization","url":"https://www.academia.edu/Documents/in/Multiobjective_Optimization"},{"id":47980,"name":"Data Visualization","url":"https://www.academia.edu/Documents/in/Data_Visualization"},{"id":48591,"name":"Data Visualisation","url":"https://www.academia.edu/Documents/in/Data_Visualisation"},{"id":59695,"name":"Navigation","url":"https://www.academia.edu/Documents/in/Navigation"},{"id":149081,"name":"Decision Support","url":"https://www.academia.edu/Documents/in/Decision_Support"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm"},{"id":507981,"name":"Availability","url":"https://www.academia.edu/Documents/in/Availability"},{"id":2421822,"name":"Objective function","url":"https://www.academia.edu/Documents/in/Objective_function"},{"id":3236675,"name":"navigation tools","url":"https://www.academia.edu/Documents/in/navigation_tools"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673942"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System"><img alt="Research paper thumbnail of Strategies for Capacity Planning in a Complex Production System" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System">Strategies for Capacity Planning in a Complex Production System</a></div><div class="wp-workCard_item"><span>Operations Research Proceedings 2001</span><span>, 2002</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We consider a lotsizing problem in a multi-stage production setting with capacity-constrained res...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673942"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673942"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673942; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673942]").text(description); $(".js-view-count[data-work-id=76673942]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673942; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673942']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673942, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=76673942]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673942,"title":"Strategies for Capacity Planning in a Complex Production System","translated_title":"","metadata":{"abstract":"We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.","publication_date":{"day":null,"month":null,"year":2002,"errors":{}},"publication_name":"Operations Research Proceedings 2001"},"translated_abstract":"We consider a lotsizing problem in a multi-stage production setting with capacity-constrained resources and a general production structure which may change during the planning horizon. Based on an earlier presentation [1], we focus on some novel concepts of capacity planning. We also present computational results for test problems obtained with the most recent version of our planning software.","internal_url":"https://www.academia.edu/76673942/Strategies_for_Capacity_Planning_in_a_Complex_Production_System","translated_internal_url":"","created_at":"2022-04-16T23:09:09.910-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[],"slug":"Strategies_for_Capacity_Planning_in_a_Complex_Production_System","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2537,"name":"Heuristics","url":"https://www.academia.edu/Documents/in/Heuristics"},{"id":20202,"name":"Production Planning","url":"https://www.academia.edu/Documents/in/Production_Planning"},{"id":38532,"name":"Evolution of ERP","url":"https://www.academia.edu/Documents/in/Evolution_of_ERP"},{"id":46030,"name":"ERP","url":"https://www.academia.edu/Documents/in/ERP"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673941"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems"><img alt="Research paper thumbnail of Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems" class="work-thumbnail" src="https://attachments.academia-assets.com/84303698/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems">Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems</a></div><div class="wp-workCard_item"><span>Fuzzy Sets and Systems</span><span>, 2009</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="3607b2e3cd504087e29e91a3ad9065d4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303698,"asset_id":76673941,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673941"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673941"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673941; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673941]").text(description); $(".js-view-count[data-work-id=76673941]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673941; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673941']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673941, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "3607b2e3cd504087e29e91a3ad9065d4" } } $('.js-work-strip[data-work-id=76673941]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673941,"title":"Applying multi-objective evolutionary algorithms to the automatic learning of extended Boolean queries in fuzzy ordinal linguistic information retrieval systems","translated_title":"","metadata":{"publisher":"Elsevier BV","grobid_abstract":"The performance of information retrieval systems (IRSs) is usually measured using two different criteria, precision and recall. Precision is the ratio of the relevant documents retrieved by the IRS in response to a user's query to the total number of documents retrieved, whilst recall is the ratio of the number of relevant documents retrieved to the total number of relevant documents for the user's query that exist in the documentary database. In fuzzy ordinal linguistic IRSs (FOLIRSs), where extended Boolean queries are used, defining the user's queries in a manual way is usually a complex task. In this contribution, our interest is focused on the automatic learning of extended Boolean queries in FOLIRSs by means of multi-objective evolutionary algorithms considering both mentioned performance criteria. We present an analysis of two well-known general-purpose multi-objective evolutionary algorithms to learn extended Boolean queries in FOLIRSs. These evolutionary algorithms are the non-dominated sorting genetic algorithm (NSGA-II) and the strength Pareto evolutionary algorithm (SPEA2).","publication_date":{"day":null,"month":null,"year":2009,"errors":{}},"publication_name":"Fuzzy Sets and Systems","grobid_abstract_attachment_id":84303698},"translated_abstract":null,"internal_url":"https://www.academia.edu/76673941/Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems","translated_internal_url":"","created_at":"2022-04-16T23:09:09.783-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303698,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303698/thumbnails/1.jpg","file_name":"0976_2009-lopezHerrera-FSS.pdf","download_url":"https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Applying_multi_objective_evolutionary_al.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303698/0976_2009-lopezHerrera-FSS-libre.pdf?1650177291=\u0026response-content-disposition=attachment%3B+filename%3DApplying_multi_objective_evolutionary_al.pdf\u0026Expires=1732715589\u0026Signature=QpttAdkkEjdmhlrXI3BO7XDdW51YNEQPuGac758VZIIHhb8bf9g9T7R7tjjDS936YkCI0dUVPfT8n2JpWlvTxF4646oM9svJmkBeJd2sMIoF1BOt7LIa2YB1DVahi59YLFiy3tXFjHz419HS-eTFCGzLs0YZaJgyJyCwHwGLemrDqFL~k4SjH4ZauK73Puyec~a7qLVAb-1TPYAM5IWM7jCT3zp9fj2iUHBdwuD5NBRux82jIzHwZy5hYJuG9QVDoINhlVX8I8rCcPN5z~rMY8PEszIkE~4o2OpU9BWONJeSe~BTJxJkyvFOvmLwjU4N91MVVRY9vlQpnCPA7yJZwA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Applying_multi_objective_evolutionary_algorithms_to_the_automatic_learning_of_extended_Boolean_queries_in_fuzzy_ordinal_linguistic_information_retrieval_systems","translated_slug":"","page_count":14,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303698,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303698/thumbnails/1.jpg","file_name":"0976_2009-lopezHerrera-FSS.pdf","download_url":"https://www.academia.edu/attachments/84303698/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Applying_multi_objective_evolutionary_al.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303698/0976_2009-lopezHerrera-FSS-libre.pdf?1650177291=\u0026response-content-disposition=attachment%3B+filename%3DApplying_multi_objective_evolutionary_al.pdf\u0026Expires=1732715589\u0026Signature=QpttAdkkEjdmhlrXI3BO7XDdW51YNEQPuGac758VZIIHhb8bf9g9T7R7tjjDS936YkCI0dUVPfT8n2JpWlvTxF4646oM9svJmkBeJd2sMIoF1BOt7LIa2YB1DVahi59YLFiy3tXFjHz419HS-eTFCGzLs0YZaJgyJyCwHwGLemrDqFL~k4SjH4ZauK73Puyec~a7qLVAb-1TPYAM5IWM7jCT3zp9fj2iUHBdwuD5NBRux82jIzHwZy5hYJuG9QVDoINhlVX8I8rCcPN5z~rMY8PEszIkE~4o2OpU9BWONJeSe~BTJxJkyvFOvmLwjU4N91MVVRY9vlQpnCPA7yJZwA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":19997,"name":"Pure Mathematics","url":"https://www.academia.edu/Documents/in/Pure_Mathematics"},{"id":265625,"name":"Evolutionary Algorithm","url":"https://www.academia.edu/Documents/in/Evolutionary_Algorithm"},{"id":652157,"name":"Fuzzy Sets and Systems","url":"https://www.academia.edu/Documents/in/Fuzzy_Sets_and_Systems"},{"id":990889,"name":"Information Retrieval System","url":"https://www.academia.edu/Documents/in/Information_Retrieval_System"},{"id":1385957,"name":"Query by Example","url":"https://www.academia.edu/Documents/in/Query_by_Example"},{"id":1819995,"name":"Document Retrieval","url":"https://www.academia.edu/Documents/in/Document_Retrieval"}],"urls":[]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673940"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs"><img alt="Research paper thumbnail of E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs" class="work-thumbnail" src="https://attachments.academia-assets.com/84303269/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs">E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Scienc...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students&#x27; projects. As indicated in student assessments, the quality of teaching and the students&#x27; motivation are increasing significantly. Some topics of the new ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="cb56d7cb54ea689e6e4d76728acd3433" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303269,"asset_id":76673940,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673940"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673940"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673940; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673940]").text(description); $(".js-view-count[data-work-id=76673940]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673940; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673940']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673940, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "cb56d7cb54ea689e6e4d76728acd3433" } } $('.js-work-strip[data-work-id=76673940]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673940,"title":"E-Learning and Problem-Based Learning in Teaching Information Systems-Changing the Style of Teaching in the Information Systems Programs","translated_title":"","metadata":{"abstract":"We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students\u0026#x27; projects. As indicated in student assessments, the quality of teaching and the students\u0026#x27; motivation are increasing significantly. Some topics of the new ..."},"translated_abstract":"We discuss a renewed Information Systems Bachelor program and a newly introduced Master of Science (MSc) in Business Information Systems at our university. A large part of teaching is now based on e-learning and problem-based learning (or learning-by-doing) in order to provide the students more freedom to repeat and deepen the taught subjects, often in students\u0026#x27; projects. As indicated in student assessments, the quality of teaching and the students\u0026#x27; motivation are increasing significantly. Some topics of the new ...","internal_url":"https://www.academia.edu/76673940/E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs","translated_internal_url":"","created_at":"2022-04-16T23:09:09.527-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303269,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303269/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303269/EB183GA-libre.pdf?1650176446=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=BMkVXpv6YxmU0oD~44q-QkugUzqWyFBZZj7j-aGAa90-uy9QQcHIuVcsiHuY2pc~V6dYnnFLqTXXwd4u9hCLi0fccgjl8UokXu3AdlAgT1YssLj6MzOu~lAjrk2YoiHQSOE1c-PsIdl9PnHOWejI9LLN4TSu2zq7DZdDLV-rFU5KWLIkUEv6gZ3xA8enyigyq~TuRPEVNui-0ve7Eh14MG8acIxPr~EOWsmgdzB72U9Nryn6me0Tg-Fa3smofmZSfXzWQHOR39h7GsDsCok3hFqI8Lz-bDuHxG4nSr7R~evFXjHr1QRWCoR1q0peU5cbiJBaN3fACoTZknDEdnwxNw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"E_Learning_and_Problem_Based_Learning_in_Teaching_Information_Systems_Changing_the_Style_of_Teaching_in_the_Information_Systems_Programs","translated_slug":"","page_count":6,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303269,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303269/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303269/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303269/EB183GA-libre.pdf?1650176446=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=BMkVXpv6YxmU0oD~44q-QkugUzqWyFBZZj7j-aGAa90-uy9QQcHIuVcsiHuY2pc~V6dYnnFLqTXXwd4u9hCLi0fccgjl8UokXu3AdlAgT1YssLj6MzOu~lAjrk2YoiHQSOE1c-PsIdl9PnHOWejI9LLN4TSu2zq7DZdDLV-rFU5KWLIkUEv6gZ3xA8enyigyq~TuRPEVNui-0ve7Eh14MG8acIxPr~EOWsmgdzB72U9Nryn6me0Tg-Fa3smofmZSfXzWQHOR39h7GsDsCok3hFqI8Lz-bDuHxG4nSr7R~evFXjHr1QRWCoR1q0peU5cbiJBaN3fACoTZknDEdnwxNw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303270,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303270/thumbnails/1.jpg","file_name":"EB183GA.pdf","download_url":"https://www.academia.edu/attachments/84303270/download_file","bulk_download_file_name":"E_Learning_and_Problem_Based_Learning_in.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303270/EB183GA-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DE_Learning_and_Problem_Based_Learning_in.pdf\u0026Expires=1732715589\u0026Signature=Vjnk1ZF7Xu8Hr80pDjhWvBx8ehFqdY2yLJITQhP~kYQPmF9OWFlkmPUcy0bJwNKJjHor6UsSHSPgrFcoqA6-v0P~vuyJkvvvfHuDXp7h3JJ~3uAMdK-L4PEsQmQHf3pziqsZmLZDHyx8IGj3~e0dyGkcX7Jea2aZQcyb4uPz~TjmvCs0xnkohlnRbuXqBxiZvcN3g8b5B7BneLA3MA8~rXFlN-oMbARjMIifyll56ibDoe7ysPmZO0ISswahCMYgkJLJy-jNam8-cLFpiC-k7khu7d3zM0Z~KBQmktcZJEsFCcxowliquYaeAzrU3wp90WH3PB8b8PLD5J2-Vt7iHw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[],"urls":[{"id":19566809,"url":"http://www.iiis.org/CDs2011/CD2011IMC/ICETI_2011/PapersPdf/EB183GA.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673939"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems"><img alt="Research paper thumbnail of How Advanced are Advanced Planning Systems?" class="work-thumbnail" src="https://attachments.academia-assets.com/84303268/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems">How Advanced are Advanced Planning Systems?</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ...</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="f6b9d178abc74401819d4e7a736b1bc8" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303268,"asset_id":76673939,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673939"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673939"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673939; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673939]").text(description); $(".js-view-count[data-work-id=76673939]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673939; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673939']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673939, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "f6b9d178abc74401819d4e7a736b1bc8" } } $('.js-work-strip[data-work-id=76673939]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673939,"title":"How Advanced are Advanced Planning Systems?","translated_title":"","metadata":{"abstract":"In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ..."},"translated_abstract":"In this paper we study the usage of advanced planning technologies in Advanced Planning Systems (APS). In particular, we consider the utilization of approaches from the areas of modeling, simulation, and optimization. The study is based on a questionnaire-based survey asking commercial APS providers on utilizing such methods in general and with respect to specific modules of their APS. The results show that such methods are used mostly in accordance with suggestions coming from the academic ...","internal_url":"https://www.academia.edu/76673939/How_Advanced_are_Advanced_Planning_Systems","translated_internal_url":"","created_at":"2022-04-16T23:09:09.303-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303268,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303268/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303268/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=Cq-rJst~6uMtOS6wKU4~1AcdcYgoy56C1oVxwE3vZF8IhDZKxJSVfHexYCljhSQigSnexac4wi1slVXUDByIz6iZvbtC5HLSxPV9OP8nwXoFe884TFsRHTZowa1pfzEzYyCf6rq2MXrddaRJ4aCEUuDIQTBo7tSv8gzR4xhxCL-G9rmbiEw9WbegE1TFMp2ErGrndJAmDqBC~CRhADfvh1lCB0LQ0Nc0zl84~0Ocy3gKLKWsbfP1u2Phkotle5OryKnGTTGrtbh4kyodMmf06Hy0~IQv5J9gUD0PEMXY0M5Unkf5EZAi5M6NAsDHZIS4vw1pMu8nV3GHWHwhCbFhCg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"How_Advanced_are_Advanced_Planning_Systems","translated_slug":"","page_count":8,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303268,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303268/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303268/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303268/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=Cq-rJst~6uMtOS6wKU4~1AcdcYgoy56C1oVxwE3vZF8IhDZKxJSVfHexYCljhSQigSnexac4wi1slVXUDByIz6iZvbtC5HLSxPV9OP8nwXoFe884TFsRHTZowa1pfzEzYyCf6rq2MXrddaRJ4aCEUuDIQTBo7tSv8gzR4xhxCL-G9rmbiEw9WbegE1TFMp2ErGrndJAmDqBC~CRhADfvh1lCB0LQ0Nc0zl84~0Ocy3gKLKWsbfP1u2Phkotle5OryKnGTTGrtbh4kyodMmf06Hy0~IQv5J9gUD0PEMXY0M5Unkf5EZAi5M6NAsDHZIS4vw1pMu8nV3GHWHwhCbFhCg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303267,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303267/thumbnails/1.jpg","file_name":"IS658IV.pdf","download_url":"https://www.academia.edu/attachments/84303267/download_file","bulk_download_file_name":"How_Advanced_are_Advanced_Planning_Syste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303267/IS658IV-libre.pdf?1650176447=\u0026response-content-disposition=attachment%3B+filename%3DHow_Advanced_are_Advanced_Planning_Syste.pdf\u0026Expires=1732715589\u0026Signature=MgSLss1Yv3Y~mTg-grZQDWAZcfI5dXfk0HDu-HRirnq4U0PmMnmclM291d~DgtPUq1z04jeRwvOe7Fql06BLHF6m0kb9cDDnJsjWfA8HcJVQww4c8c7y8TcaIKmKcMbgm0yMhJQuGyodczp2Cnrb3LZz69m1~ASwr1HaFGwHhjCM4zfQEefnoac6b5PXy4K-Bw0xGAbJSzl-IzKaaNryzApIefUHsJrpyY1c3OzEPzUd0AQEKEXxgS~nWLTcGNLTAyh~7RdOfTCD5CXHyTA7RAu3UK7nWYIV-ZujLsNPGo4pz1f020LRD-LKzrwG0bTmwtyLClF0ionvdlpwUd3luw__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[],"urls":[{"id":19566808,"url":"http://www.iiis.org/CDs2011/CD2011IMC/ISSE_2011/PapersPdf/IS658IV.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="76673938"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen"><img alt="Research paper thumbnail of Eine 脺bersicht zum Scheduling von Baustellen" class="work-thumbnail" src="https://attachments.academia-assets.com/84303265/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen">Eine 脺bersicht zum Scheduling von Baustellen</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fas...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="225fb8a4a18dad353930711dcf7e8f61" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":84303265,"asset_id":76673938,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="76673938"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="76673938"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 76673938; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=76673938]").text(description); $(".js-view-count[data-work-id=76673938]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 76673938; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='76673938']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 76673938, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "225fb8a4a18dad353930711dcf7e8f61" } } $('.js-work-strip[data-work-id=76673938]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":76673938,"title":"Eine 脺bersicht zum Scheduling von Baustellen","translated_title":"","metadata":{"abstract":"Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.","publisher":"ITWM","publication_date":{"day":null,"month":null,"year":2005,"errors":{}}},"translated_abstract":"Das T盲tigkeitsfeld des Fraunhofer Instituts f眉r Techno-und Wirt schafts ma the ma tik ITWM um fasst an wen dungs na he Grund la gen for schung, angewandte For schung so wie Be ra tung und kun den spe zi fische L枚 sun gen auf allen Gebieten, die f眉r Techno-und Wirt schafts ma the ma tik be deut sam sind.","internal_url":"https://www.academia.edu/76673938/Eine_%C3%9Cbersicht_zum_Scheduling_von_Baustellen","translated_internal_url":"","created_at":"2022-04-16T23:09:09.130-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"paper","co_author_tags":[],"downloadable_attachments":[{"id":84303265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303265/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303265/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=YK9n5GBRxWjYyye72pHEuWWDSTz41gnTeogEFgBX0oMgpBrNmD9pZhyaI8-NBRqYTvS0BN8q2OwjwO-U9dQMgOvhHwmSszuNESywrdVRLdE1g66GiWZ2zQ8b-Pt8380iLE1rWiBWd65dLDYZYEtUzaYjbk~WaZ2RlJhEOxYH4K9yGICKRfVAWo3o~EswhFPXLiQGX6GEcn1-Mqq~NjVExA7ipLSNUFLR7a2RT-9OJQZfoLmXdaMsZYMZYr4PmwGR0l-eGCqJTecg1qkPBynqhFdnUcqPbhtJcSpwYiYbG--VYoxSNUzykp~ZwXaC3w7aS9M3nt4Hak3fOjGAoqVm0g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Eine_脺bersicht_zum_Scheduling_von_Baustellen","translated_slug":"","page_count":44,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[{"id":84303265,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303265/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303265/download_file?st=MTczMjcxODAyOSw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303265/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=YK9n5GBRxWjYyye72pHEuWWDSTz41gnTeogEFgBX0oMgpBrNmD9pZhyaI8-NBRqYTvS0BN8q2OwjwO-U9dQMgOvhHwmSszuNESywrdVRLdE1g66GiWZ2zQ8b-Pt8380iLE1rWiBWd65dLDYZYEtUzaYjbk~WaZ2RlJhEOxYH4K9yGICKRfVAWo3o~EswhFPXLiQGX6GEcn1-Mqq~NjVExA7ipLSNUFLR7a2RT-9OJQZfoLmXdaMsZYMZYr4PmwGR0l-eGCqJTecg1qkPBynqhFdnUcqPbhtJcSpwYiYbG--VYoxSNUzykp~ZwXaC3w7aS9M3nt4Hak3fOjGAoqVm0g__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"},{"id":84303266,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/84303266/thumbnails/1.jpg","file_name":"bericht74.pdf","download_url":"https://www.academia.edu/attachments/84303266/download_file","bulk_download_file_name":"Eine_Ubersicht_zum_Scheduling_von_Bauste.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/84303266/bericht74-libre.pdf?1650176449=\u0026response-content-disposition=attachment%3B+filename%3DEine_Ubersicht_zum_Scheduling_von_Bauste.pdf\u0026Expires=1732715589\u0026Signature=BW7kI4l0ZJ0c2~~VL4V2PayaAwujEWHyytbzWfR28Tylka5TSaGe7wJL3V1Hin-7TDiluERBgHRs4xYC3v6HAQAXlfX25WIJNI~jS25PaPZ48QKW3DTurAxjQmbIE3XVrb~hlJLZ9LkFTDCEKQcUv-VZ-YVpHciS4LQ8lGJ7yol64W5iMGMaHG5bj92tIxHaQ5bjLZjKkSv2kqP~4s1W6vic-0EJRId53XDALFARIkug6Q9-pbvMnLzbTAVOcePD8IQXwsJy78klci6L1RDk4K4oAGmmwv6zh2NFRoZR1fcCpsg6lWzxNT~j6xkY6hIvaeI5l8g4D6l~-L1OI7zbfg__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":422,"name":"Computer Science","url":"https://www.academia.edu/Documents/in/Computer_Science"},{"id":2277,"name":"Project Management","url":"https://www.academia.edu/Documents/in/Project_Management"},{"id":3105,"name":"Construction Management","url":"https://www.academia.edu/Documents/in/Construction_Management"},{"id":4486,"name":"Political Science","url":"https://www.academia.edu/Documents/in/Political_Science"},{"id":9048,"name":"Scheduling","url":"https://www.academia.edu/Documents/in/Scheduling"},{"id":92270,"name":"Market Surveys","url":"https://www.academia.edu/Documents/in/Market_Surveys"}],"urls":[{"id":19566807,"url":"http://kluedo.ub.uni-kl.de/files/1645/bericht74.pdf"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div><div class="profile--tab_content_container js-tab-pane tab-pane" data-section-id="414708" id="books"><div class="js-work-strip profile--work_container" data-work-id="3007889"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/3007889/Multiple_Criteria_Decision_Making_Proceedings_of_the_Twelfth_International_Conference_Hagen_Germany_"><img alt="Research paper thumbnail of Multiple Criteria Decision Making - Proceedings of the Twelfth International Conference Hagen (Germany)" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/3007889/Multiple_Criteria_Decision_Making_Proceedings_of_the_Twelfth_International_Conference_Hagen_Germany_">Multiple Criteria Decision Making - Proceedings of the Twelfth International Conference Hagen (Germany)</a></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="3007889"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="3007889"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3007889; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3007889]").text(description); $(".js-view-count[data-work-id=3007889]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3007889; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='3007889']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 3007889, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=3007889]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":3007889,"title":"Multiple Criteria Decision Making - Proceedings of the Twelfth International Conference Hagen (Germany)","translated_title":"","metadata":{},"translated_abstract":null,"internal_url":"https://www.academia.edu/3007889/Multiple_Criteria_Decision_Making_Proceedings_of_the_Twelfth_International_Conference_Hagen_Germany_","translated_internal_url":"","created_at":"2013-03-14T21:28:33.016-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"book","co_author_tags":[],"downloadable_attachments":[],"slug":"Multiple_Criteria_Decision_Making_Proceedings_of_the_Twelfth_International_Conference_Hagen_Germany_","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[],"urls":[{"id":849438,"url":"http://link.springer.com/book/10.1007/978-3-642-59132-7/page/1"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="3007850"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/3007850/Multicriteria_Decision_Making_Advances_in_MCDM_Models_Algorithms_Theory_and_Applications"><img alt="Research paper thumbnail of Multicriteria Decision Making - Advances in MCDM Models, Algorithms, Theory, and Applications" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/3007850/Multicriteria_Decision_Making_Advances_in_MCDM_Models_Algorithms_Theory_and_Applications">Multicriteria Decision Making - Advances in MCDM Models, Algorithms, Theory, and Applications</a></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="3007850"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="3007850"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3007850; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3007850]").text(description); $(".js-view-count[data-work-id=3007850]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3007850; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='3007850']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 3007850, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=3007850]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":3007850,"title":"Multicriteria Decision Making - Advances in MCDM Models, Algorithms, Theory, and Applications","translated_title":"","metadata":{},"translated_abstract":null,"internal_url":"https://www.academia.edu/3007850/Multicriteria_Decision_Making_Advances_in_MCDM_Models_Algorithms_Theory_and_Applications","translated_internal_url":"","created_at":"2013-03-14T21:25:51.696-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"book","co_author_tags":[],"downloadable_attachments":[],"slug":"Multicriteria_Decision_Making_Advances_in_MCDM_Models_Algorithms_Theory_and_Applications","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[],"urls":[{"id":849403,"url":"http://link.springer.com/book/10.1007/978-1-4615-5025-9/page/1"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> <div class="js-work-strip profile--work_container" data-work-id="3007843"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/3007843/Intelligent_Strategies_for_Meta_Multiple_Criteria_Decision_Making"><img alt="Research paper thumbnail of Intelligent Strategies for Meta Multiple Criteria Decision Making" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/3007843/Intelligent_Strategies_for_Meta_Multiple_Criteria_Decision_Making">Intelligent Strategies for Meta Multiple Criteria Decision Making</a></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="3007843"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="3007843"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 3007843; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=3007843]").text(description); $(".js-view-count[data-work-id=3007843]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 3007843; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='3007843']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 3007843, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=3007843]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":3007843,"title":"Intelligent Strategies for Meta Multiple Criteria Decision Making","translated_title":"","metadata":{},"translated_abstract":null,"internal_url":"https://www.academia.edu/3007843/Intelligent_Strategies_for_Meta_Multiple_Criteria_Decision_Making","translated_internal_url":"","created_at":"2013-03-14T21:24:24.198-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"book","co_author_tags":[],"downloadable_attachments":[],"slug":"Intelligent_Strategies_for_Meta_Multiple_Criteria_Decision_Making","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[],"urls":[{"id":849398,"url":"http://link.springer.com/book/10.1007/978-1-4615-1595-1/page/1"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div><div class="profile--tab_content_container js-tab-pane tab-pane" data-section-id="4602192" id="conferencepresentations"><div class="js-work-strip profile--work_container" data-work-id="21922833"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" rel="nofollow" href="https://www.academia.edu/21922833/4th_International_Symposium_on_Computational_and_Business_Intelligence_ISCBI_2016_in_Olten_Switzerland"><img alt="Research paper thumbnail of 4th International Symposium on Computational and Business Intelligence (ISCBI 2016) in Olten, Switzerland" class="work-thumbnail" src="https://a.academia-assets.com/images/blank-paper.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" rel="nofollow" href="https://www.academia.edu/21922833/4th_International_Symposium_on_Computational_and_Business_Intelligence_ISCBI_2016_in_Olten_Switzerland">4th International Symposium on Computational and Business Intelligence (ISCBI 2016) in Olten, Switzerland</a></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">The Symposium will be held in Olten, Switzerland during September 5-7, 2016. The aim as well as o...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">The Symposium will be held in Olten, Switzerland during September 5-7, 2016. The aim as well as objective of ISCBI 2016 is to present the latest research and results of scientists working in the fields related to Computational and Business Intelligence. <br />Topics include but are not limited to theoretical advances, new methods and applications in Business Intelligence, Neural networks, Fuzzy Systems and Evolutionary Computation. Please find further details at: : <a href="http://iscbi.com/cfp.html" rel="nofollow">http://iscbi.com/cfp.html</a>. The paper submission deadline is April 30, 2016.<br />ISCBI 2016 is organized by South Asia Institute of Science and Engineering (SAISE), the University of Applied Sciences and Arts Northwestern Switzerland and the International Neural Network Society (INNS) India Regional Chapter and is the flagship event of INNS-India. After the immensely successful ISCBI13, ISCBI14 & ISCBI15, ISCBI 2016 is expected to be more exciting, stimulating & educative. The intention is to establish an effective platform for institutions and industries to share ideas and to present the works of scientists, engineers, educators and students across the globe. The organizing committee of the Symposium is pleased to invite prospective authors to submit their original manuscripts for possible presentation at ISCBI 2016. Further details of the conference can be found at: <a href="http://iscbi.com/" rel="nofollow">http://iscbi.com/</a></span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="21922833"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="21922833"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 21922833; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=21922833]").text(description); $(".js-view-count[data-work-id=21922833]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 21922833; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='21922833']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 21922833, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (false){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "-1" } } $('.js-work-strip[data-work-id=21922833]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":21922833,"title":"4th International Symposium on Computational and Business Intelligence (ISCBI 2016) in Olten, Switzerland","translated_title":"","metadata":{"abstract":"The Symposium will be held in Olten, Switzerland during September 5-7, 2016. The aim as well as objective of ISCBI 2016 is to present the latest research and results of scientists working in the fields related to Computational and Business Intelligence. \nTopics include but are not limited to theoretical advances, new methods and applications in Business Intelligence, Neural networks, Fuzzy Systems and Evolutionary Computation. Please find further details at: : http://iscbi.com/cfp.html. The paper submission deadline is April 30, 2016.\nISCBI 2016 is organized by South Asia Institute of Science and Engineering (SAISE), the University of Applied Sciences and Arts Northwestern Switzerland and the International Neural Network Society (INNS) India Regional Chapter and is the flagship event of INNS-India. After the immensely successful ISCBI13, ISCBI14 \u0026 ISCBI15, ISCBI 2016 is expected to be more exciting, stimulating \u0026 educative. The intention is to establish an effective platform for institutions and industries to share ideas and to present the works of scientists, engineers, educators and students across the globe. The organizing committee of the Symposium is pleased to invite prospective authors to submit their original manuscripts for possible presentation at ISCBI 2016. Further details of the conference can be found at: http://iscbi.com/\n"},"translated_abstract":"The Symposium will be held in Olten, Switzerland during September 5-7, 2016. The aim as well as objective of ISCBI 2016 is to present the latest research and results of scientists working in the fields related to Computational and Business Intelligence. \nTopics include but are not limited to theoretical advances, new methods and applications in Business Intelligence, Neural networks, Fuzzy Systems and Evolutionary Computation. Please find further details at: : http://iscbi.com/cfp.html. The paper submission deadline is April 30, 2016.\nISCBI 2016 is organized by South Asia Institute of Science and Engineering (SAISE), the University of Applied Sciences and Arts Northwestern Switzerland and the International Neural Network Society (INNS) India Regional Chapter and is the flagship event of INNS-India. After the immensely successful ISCBI13, ISCBI14 \u0026 ISCBI15, ISCBI 2016 is expected to be more exciting, stimulating \u0026 educative. The intention is to establish an effective platform for institutions and industries to share ideas and to present the works of scientists, engineers, educators and students across the globe. The organizing committee of the Symposium is pleased to invite prospective authors to submit their original manuscripts for possible presentation at ISCBI 2016. Further details of the conference can be found at: http://iscbi.com/\n","internal_url":"https://www.academia.edu/21922833/4th_International_Symposium_on_Computational_and_Business_Intelligence_ISCBI_2016_in_Olten_Switzerland","translated_internal_url":"","created_at":"2016-02-13T10:07:22.759-08:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":227503,"coauthors_can_edit":true,"document_type":"conference_presentation","co_author_tags":[],"downloadable_attachments":[],"slug":"4th_International_Symposium_on_Computational_and_Business_Intelligence_ISCBI_2016_in_Olten_Switzerland","translated_slug":"","page_count":null,"language":"en","content_type":"Work","owner":{"id":227503,"first_name":"Hanne","middle_initials":null,"last_name":"Thomas","page_name":"HanneThomas","domain_name":"fhnw","created_at":"2010-08-03T06:03:56.584-07:00","display_name":"Hanne Thomas","url":"https://fhnw.academia.edu/HanneThomas"},"attachments":[],"research_interests":[{"id":2008,"name":"Machine Learning","url":"https://www.academia.edu/Documents/in/Machine_Learning"},{"id":3521,"name":"Computational Intelligence","url":"https://www.academia.edu/Documents/in/Computational_Intelligence"},{"id":3523,"name":"Evolutionary Computation","url":"https://www.academia.edu/Documents/in/Evolutionary_Computation"},{"id":4165,"name":"Fuzzy Logic","url":"https://www.academia.edu/Documents/in/Fuzzy_Logic"},{"id":5026,"name":"Genetic Algorithms","url":"https://www.academia.edu/Documents/in/Genetic_Algorithms"},{"id":5395,"name":"Swarm Intelligence","url":"https://www.academia.edu/Documents/in/Swarm_Intelligence"},{"id":7357,"name":"Business Intelligence","url":"https://www.academia.edu/Documents/in/Business_Intelligence"},{"id":11598,"name":"Neural Networks","url":"https://www.academia.edu/Documents/in/Neural_Networks"},{"id":51359,"name":"Business Analytics","url":"https://www.academia.edu/Documents/in/Business_Analytics"},{"id":54123,"name":"Artificial Neural Networks","url":"https://www.academia.edu/Documents/in/Artificial_Neural_Networks"},{"id":126300,"name":"Big Data","url":"https://www.academia.edu/Documents/in/Big_Data"}],"urls":[{"id":6719345,"url":"http://iscbi.com/"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div><div class="profile--tab_content_container js-tab-pane tab-pane" data-section-id="10675792" id="publishedpapers"><div class="js-work-strip profile--work_container" data-work-id="44189646"><div class="profile--work_thumbnail hidden-xs"><a class="js-work-strip-work-link" data-click-track="profile-work-strip-thumbnail" href="https://www.academia.edu/44189646/Freelancers_in_the_Software_Development_Process_A_Systematic_Mapping_Study"><img alt="Research paper thumbnail of Freelancers in the Software Development Process: A Systematic Mapping Study" class="work-thumbnail" src="https://attachments.academia-assets.com/64551197/thumbnails/1.jpg" /></a></div><div class="wp-workCard wp-workCard_itemContainer"><div class="wp-workCard_item wp-workCard--title"><a class="js-work-strip-work-link text-gray-darker" data-click-track="profile-work-strip-title" href="https://www.academia.edu/44189646/Freelancers_in_the_Software_Development_Process_A_Systematic_Mapping_Study">Freelancers in the Software Development Process: A Systematic Mapping Study</a></div><div class="wp-workCard_item wp-workCard--coauthors"><span>by </span><span><a class="" data-click-track="profile-work-strip-authors" href="https://upm-es.academia.edu/Jos%C3%A9Mar%C3%ADaFern%C3%A1ndezCrehuet">Jos茅 Mar铆a Fern谩ndez-Crehuet</a> and <a class="" data-click-track="profile-work-strip-authors" href="https://fhnw.academia.edu/HanneThomas">Hanne Thomas</a></span></div><div class="wp-workCard_item"><span>Processes</span><span>, 2020</span></div><div class="wp-workCard_item"><span class="js-work-more-abstract-truncated">Freelancers could catalyze the software development process by providing their niche skills to ge...</span><a class="js-work-more-abstract" data-broccoli-component="work_strip.more_abstract" data-click-track="profile-work-strip-more-abstract" href="javascript:;"><span> more </span><span><i class="fa fa-caret-down"></i></span></a><span class="js-work-more-abstract-untruncated hidden">Freelancers could catalyze the software development process by providing their niche skills to generate high quality outputs. They could help companies (including startups) to foster innovations by suggesting creative ideas and providing their expertise in implementing them (for instance, designing solutions, coding solutions etc.). Freelancers could effectively and efficiently work as a virtual member of the software development team. The company must make informed decisions about which task to allot to the freelancer, which freelancer to select, pricing the task, and evaluating the submitted work. On the other hand, the freelancer should make an informed decision about evaluating the monetary value of the task to be charged, trusting the requester, analyzing the skills requirement of the task (finding matches between skill requirement and skills processed), selecting the best task, and maintaining the highest level of reputation. However, the literature does not provide freelancers and the companies the guidelines that support their decision making. However, if freelancers are selected carefully for the most suitable task, the companies will benefit a lot in terms of improved software development metrics. [Objectives] The objective of this paper is to provide the research community the research trends in freelancer-supported software development. This helps to understand that which software development areas have higher concentrations of research efforts, which area has the support of empirical evidence to support management decision makings, and which area requires the research attention. [Method] The systematic study is conducted by planning the mapping protocol, executing the protocol, and reporting the findings using various visualization tools like bar charts and pie charts. The search process was planned to be executed using set of inclusion and exclusion conditions on four bibliographic databases (IEEExplore, Springerlink, Sciencedirect, and ACM digital library). The relevant papers are selected by applying inclusion and exclusion conditions. The google citations of the relevant papers are subject to the inclusion and exclusion conditions again to include the more relevant papers. Finally, the systematic schema was created and populated after analyzing the studies abstracts. [Results] The results indicate the following (a) The research focus is on generic software development (78%) rather on individual life cycle activities. (b) The number of empirical studies is limited (25%). (c) A number of studies proposing solutions and evaluating on live cases in industrial settings are missing from the literature. This is in comparison to the validation approaches (72%) i.e., solutions tested in laboratory settings. (d) At present, the literature has limited ability to provide the software companies (including startups) with the guidelines (in the form of opinions and experience reports) for involving freelancers in the software development process. (e) The reported challenges include Collaboration and Coordination (33%), Developer Recommendation (or selection) (19%), Team Formulation (14%), Task Recommendation (allocation) (14%), Task Decomposition (11%), Privacy and Security (Confidentiality) (11%), Budget Estimation (8%), Recognition (8%), Trust Issues (8%), Market Dynamism (6%), Intellectual Property Issues (6%), Participation of Crowd Worker (6%), and Capacity Utilization (3%). These challenges are highly interactive, and each challenge impacts all other challenges. (e) Recent Processes 2020, 8, 1215 2 of 25 focus of the researchers (total 7 studies in 2019) is on generic software development handling the collaboration and coordination (3 studies out of 7), Developer recommendation (2 studies out of 7), and task recommendation (2 studies out of 7). [Conclusion] The freelancer-driven software engineering research area has got the attraction of the researchers, but it will take a long time to gain maturity. This puts an urgent call for more empirical studies and evaluation-based solution research that could help companies (including startups) to foster innovations. Further, the research focus should be well distributed among the various development phases to address the unique challenges associated with individual activities. The accurate management of the freelancer in the software development could help companies and startups to foster innovations and remain competitive in the marketplace.</span></div><div class="wp-workCard_item wp-workCard--actions"><span class="work-strip-bookmark-button-container"></span><a id="200b4b8d88715c9582fc44807bd91ec4" class="wp-workCard--action" rel="nofollow" data-click-track="profile-work-strip-download" data-download="{"attachment_id":64551197,"asset_id":44189646,"asset_type":"Work","button_location":"profile"}" href="https://www.academia.edu/attachments/64551197/download_file?st=MTczMjcxODAzMCw4LjIyMi4yMDguMTQ2&s=profile"><span><i class="fa fa-arrow-down"></i></span><span>Download</span></a><span class="wp-workCard--action visible-if-viewed-by-owner inline-block" style="display: none;"><span class="js-profile-work-strip-edit-button-wrapper profile-work-strip-edit-button-wrapper" data-work-id="44189646"><a class="js-profile-work-strip-edit-button" tabindex="0"><span><i class="fa fa-pencil"></i></span><span>Edit</span></a></span></span><span id="work-strip-rankings-button-container"></span></div><div class="wp-workCard_item wp-workCard--stats"><span><span><span class="js-view-count view-count u-mr2x" data-work-id="44189646"><i class="fa fa-spinner fa-spin"></i></span><script>$(function () { var workId = 44189646; window.Academia.workViewCountsFetcher.queue(workId, function (count) { var description = window.$h.commaizeInt(count) + " " + window.$h.pluralize(count, 'View'); $(".js-view-count[data-work-id=44189646]").text(description); $(".js-view-count[data-work-id=44189646]").attr('title', description).tooltip(); }); });</script></span></span><span><span class="percentile-widget hidden"><span class="u-mr2x work-percentile"></span></span><script>$(function () { var workId = 44189646; window.Academia.workPercentilesFetcher.queue(workId, function (percentileText) { var container = $(".js-work-strip[data-work-id='44189646']"); container.find('.work-percentile').text(percentileText.charAt(0).toUpperCase() + percentileText.slice(1)); container.find('.percentile-widget').show(); container.find('.percentile-widget').removeClass('hidden'); }); });</script></span><span><script>$(function() { new Works.PaperRankView({ workId: 44189646, container: "", }); });</script></span></div><div id="work-strip-premium-row-container"></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/work_edit-ad038b8c047c1a8d4fa01b402d530ff93c45fee2137a149a4a5398bc8ad67560.js"], function() { // from javascript_helper.rb var dispatcherData = {} if (true){ window.WowProfile.dispatcher = window.WowProfile.dispatcher || _.clone(Backbone.Events); dispatcherData = { dispatcher: window.WowProfile.dispatcher, downloadLinkId: "200b4b8d88715c9582fc44807bd91ec4" } } $('.js-work-strip[data-work-id=44189646]').each(function() { if (!$(this).data('initialized')) { new WowProfile.WorkStripView({ el: this, workJSON: {"id":44189646,"title":"Freelancers in the Software Development Process: A Systematic Mapping Study","translated_title":"","metadata":{"doi":"10.3390/pr8101215","issue":"10","volume":"8","abstract":"Freelancers could catalyze the software development process by providing their niche skills to generate high quality outputs. They could help companies (including startups) to foster innovations by suggesting creative ideas and providing their expertise in implementing them (for instance, designing solutions, coding solutions etc.). Freelancers could effectively and efficiently work as a virtual member of the software development team. The company must make informed decisions about which task to allot to the freelancer, which freelancer to select, pricing the task, and evaluating the submitted work. On the other hand, the freelancer should make an informed decision about evaluating the monetary value of the task to be charged, trusting the requester, analyzing the skills requirement of the task (finding matches between skill requirement and skills processed), selecting the best task, and maintaining the highest level of reputation. However, the literature does not provide freelancers and the companies the guidelines that support their decision making. However, if freelancers are selected carefully for the most suitable task, the companies will benefit a lot in terms of improved software development metrics. [Objectives] The objective of this paper is to provide the research community the research trends in freelancer-supported software development. This helps to understand that which software development areas have higher concentrations of research efforts, which area has the support of empirical evidence to support management decision makings, and which area requires the research attention. [Method] The systematic study is conducted by planning the mapping protocol, executing the protocol, and reporting the findings using various visualization tools like bar charts and pie charts. The search process was planned to be executed using set of inclusion and exclusion conditions on four bibliographic databases (IEEExplore, Springerlink, Sciencedirect, and ACM digital library). The relevant papers are selected by applying inclusion and exclusion conditions. The google citations of the relevant papers are subject to the inclusion and exclusion conditions again to include the more relevant papers. Finally, the systematic schema was created and populated after analyzing the studies abstracts. [Results] The results indicate the following (a) The research focus is on generic software development (78%) rather on individual life cycle activities. (b) The number of empirical studies is limited (25%). (c) A number of studies proposing solutions and evaluating on live cases in industrial settings are missing from the literature. This is in comparison to the validation approaches (72%) i.e., solutions tested in laboratory settings. (d) At present, the literature has limited ability to provide the software companies (including startups) with the guidelines (in the form of opinions and experience reports) for involving freelancers in the software development process. (e) The reported challenges include Collaboration and Coordination (33%), Developer Recommendation (or selection) (19%), Team Formulation (14%), Task Recommendation (allocation) (14%), Task Decomposition (11%), Privacy and Security (Confidentiality) (11%), Budget Estimation (8%), Recognition (8%), Trust Issues (8%), Market Dynamism (6%), Intellectual Property Issues (6%), Participation of Crowd Worker (6%), and Capacity Utilization (3%). These challenges are highly interactive, and each challenge impacts all other challenges. (e) Recent Processes 2020, 8, 1215 2 of 25 focus of the researchers (total 7 studies in 2019) is on generic software development handling the collaboration and coordination (3 studies out of 7), Developer recommendation (2 studies out of 7), and task recommendation (2 studies out of 7). [Conclusion] The freelancer-driven software engineering research area has got the attraction of the researchers, but it will take a long time to gain maturity. This puts an urgent call for more empirical studies and evaluation-based solution research that could help companies (including startups) to foster innovations. Further, the research focus should be well distributed among the various development phases to address the unique challenges associated with individual activities. The accurate management of the freelancer in the software development could help companies and startups to foster innovations and remain competitive in the marketplace.","page_numbers":"1215","publication_date":{"day":null,"month":null,"year":2020,"errors":{}},"publication_name":"Processes"},"translated_abstract":"Freelancers could catalyze the software development process by providing their niche skills to generate high quality outputs. They could help companies (including startups) to foster innovations by suggesting creative ideas and providing their expertise in implementing them (for instance, designing solutions, coding solutions etc.). Freelancers could effectively and efficiently work as a virtual member of the software development team. The company must make informed decisions about which task to allot to the freelancer, which freelancer to select, pricing the task, and evaluating the submitted work. On the other hand, the freelancer should make an informed decision about evaluating the monetary value of the task to be charged, trusting the requester, analyzing the skills requirement of the task (finding matches between skill requirement and skills processed), selecting the best task, and maintaining the highest level of reputation. However, the literature does not provide freelancers and the companies the guidelines that support their decision making. However, if freelancers are selected carefully for the most suitable task, the companies will benefit a lot in terms of improved software development metrics. [Objectives] The objective of this paper is to provide the research community the research trends in freelancer-supported software development. This helps to understand that which software development areas have higher concentrations of research efforts, which area has the support of empirical evidence to support management decision makings, and which area requires the research attention. [Method] The systematic study is conducted by planning the mapping protocol, executing the protocol, and reporting the findings using various visualization tools like bar charts and pie charts. The search process was planned to be executed using set of inclusion and exclusion conditions on four bibliographic databases (IEEExplore, Springerlink, Sciencedirect, and ACM digital library). The relevant papers are selected by applying inclusion and exclusion conditions. The google citations of the relevant papers are subject to the inclusion and exclusion conditions again to include the more relevant papers. Finally, the systematic schema was created and populated after analyzing the studies abstracts. [Results] The results indicate the following (a) The research focus is on generic software development (78%) rather on individual life cycle activities. (b) The number of empirical studies is limited (25%). (c) A number of studies proposing solutions and evaluating on live cases in industrial settings are missing from the literature. This is in comparison to the validation approaches (72%) i.e., solutions tested in laboratory settings. (d) At present, the literature has limited ability to provide the software companies (including startups) with the guidelines (in the form of opinions and experience reports) for involving freelancers in the software development process. (e) The reported challenges include Collaboration and Coordination (33%), Developer Recommendation (or selection) (19%), Team Formulation (14%), Task Recommendation (allocation) (14%), Task Decomposition (11%), Privacy and Security (Confidentiality) (11%), Budget Estimation (8%), Recognition (8%), Trust Issues (8%), Market Dynamism (6%), Intellectual Property Issues (6%), Participation of Crowd Worker (6%), and Capacity Utilization (3%). These challenges are highly interactive, and each challenge impacts all other challenges. (e) Recent Processes 2020, 8, 1215 2 of 25 focus of the researchers (total 7 studies in 2019) is on generic software development handling the collaboration and coordination (3 studies out of 7), Developer recommendation (2 studies out of 7), and task recommendation (2 studies out of 7). [Conclusion] The freelancer-driven software engineering research area has got the attraction of the researchers, but it will take a long time to gain maturity. This puts an urgent call for more empirical studies and evaluation-based solution research that could help companies (including startups) to foster innovations. Further, the research focus should be well distributed among the various development phases to address the unique challenges associated with individual activities. The accurate management of the freelancer in the software development could help companies and startups to foster innovations and remain competitive in the marketplace.","internal_url":"https://www.academia.edu/44189646/Freelancers_in_the_Software_Development_Process_A_Systematic_Mapping_Study","translated_internal_url":"","created_at":"2020-09-29T04:10:16.830-07:00","preview_url":null,"current_user_can_edit":null,"current_user_is_owner":null,"owner_id":5884411,"coauthors_can_edit":true,"document_type":"book","co_author_tags":[{"id":35771775,"work_id":44189646,"tagging_user_id":5884411,"tagged_user_id":8302810,"co_author_invite_id":null,"email":"v***a@memyself.in","display_order":-1,"name":"Varun Gupta","title":"Freelancers in the Software Development Process: A Systematic Mapping Study"},{"id":35771759,"work_id":44189646,"tagging_user_id":5884411,"tagged_user_id":227503,"co_author_invite_id":null,"email":"t***e@fhnw.ch","affiliation":"FHNW","display_order":1,"name":"Hanne Thomas","title":"Freelancers in the Software Development Process: A Systematic Mapping Study"}],"downloadable_attachments":[{"id":64551197,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/64551197/thumbnails/1.jpg","file_name":"Freelancers in the Software.pdf","download_url":"https://www.academia.edu/attachments/64551197/download_file?st=MTczMjcxODAzMCw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Freelancers_in_the_Software_Development.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/64551197/Freelancers_in_the_Software-libre.pdf?1601391583=\u0026response-content-disposition=attachment%3B+filename%3DFreelancers_in_the_Software_Development.pdf\u0026Expires=1732715590\u0026Signature=Nb87OEIj~0C6PEkKhN7I5-6f26fQQ9fA5Rk7YG6KRZYD1K1mqi0a3Agecm0BqAWMOaiErNr8xrUJU4cKFmINCe5Qj5vAF57srbsXckPCh7TekUKSt4f~vhWiKAOrDoLXonlXC2e8V9Z67-QuLKPFoYyNhWZqigPYBebstS4ACFJHW1UIV2ms5BZWcuTDsFECV1g9GPH6aSGOUSBB7SWAjZTmSMaG3qHi56C5HF~oHX6b4PR5Lzt78RALi8Kmp7KyZTJMNihsB9~7HIEQzRWbJxWBjWX40CWErjWrTc4qwrMtEiiVAw0FytluboxEkwVTR0wdQ1L-et-8frJryMexnA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"slug":"Freelancers_in_the_Software_Development_Process_A_Systematic_Mapping_Study","translated_slug":"","page_count":25,"language":"en","content_type":"Work","owner":{"id":5884411,"first_name":"Jos茅 Mar铆a","middle_initials":null,"last_name":"Fern谩ndez-Crehuet","page_name":"Jos茅Mar铆aFern谩ndezCrehuet","domain_name":"upm-es","created_at":"2013-10-01T21:33:11.382-07:00","display_name":"Jos茅 Mar铆a Fern谩ndez-Crehuet","url":"https://upm-es.academia.edu/Jos%C3%A9Mar%C3%ADaFern%C3%A1ndezCrehuet"},"attachments":[{"id":64551197,"title":"","file_type":"pdf","scribd_thumbnail_url":"https://attachments.academia-assets.com/64551197/thumbnails/1.jpg","file_name":"Freelancers in the Software.pdf","download_url":"https://www.academia.edu/attachments/64551197/download_file?st=MTczMjcxODAzMCw4LjIyMi4yMDguMTQ2&","bulk_download_file_name":"Freelancers_in_the_Software_Development.pdf","bulk_download_url":"https://d1wqtxts1xzle7.cloudfront.net/64551197/Freelancers_in_the_Software-libre.pdf?1601391583=\u0026response-content-disposition=attachment%3B+filename%3DFreelancers_in_the_Software_Development.pdf\u0026Expires=1732715590\u0026Signature=Nb87OEIj~0C6PEkKhN7I5-6f26fQQ9fA5Rk7YG6KRZYD1K1mqi0a3Agecm0BqAWMOaiErNr8xrUJU4cKFmINCe5Qj5vAF57srbsXckPCh7TekUKSt4f~vhWiKAOrDoLXonlXC2e8V9Z67-QuLKPFoYyNhWZqigPYBebstS4ACFJHW1UIV2ms5BZWcuTDsFECV1g9GPH6aSGOUSBB7SWAjZTmSMaG3qHi56C5HF~oHX6b4PR5Lzt78RALi8Kmp7KyZTJMNihsB9~7HIEQzRWbJxWBjWX40CWErjWrTc4qwrMtEiiVAw0FytluboxEkwVTR0wdQ1L-et-8frJryMexnA__\u0026Key-Pair-Id=APKAJLOHF5GGSLRBV4ZA"}],"research_interests":[{"id":8129,"name":"Software Development","url":"https://www.academia.edu/Documents/in/Software_Development"},{"id":21556,"name":"Crowdsourcing","url":"https://www.academia.edu/Documents/in/Crowdsourcing"},{"id":1397271,"name":"Systematic Mapping Study","url":"https://www.academia.edu/Documents/in/Systematic_Mapping_Study"},{"id":1539217,"name":"Freelancers","url":"https://www.academia.edu/Documents/in/Freelancers"}],"urls":[{"id":9113329,"url":"https://www.mdpi.com/2227-9717/8/10/1215#cite"}]}, dispatcherData: dispatcherData }); $(this).data('initialized', true); } }); $a.trackClickSource(".js-work-strip-work-link", "profile_work_strip") }); </script> </div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js","https://a.academia-assets.com/assets/google_contacts-0dfb882d836b94dbcb4a2d123d6933fc9533eda5be911641f20b4eb428429600.js"], function() { // from javascript_helper.rb $('.js-google-connect-button').click(function(e) { e.preventDefault(); GoogleContacts.authorize_and_show_contacts(); Aedu.Dismissibles.recordClickthrough("WowProfileImportContactsPrompt"); }); $('.js-update-biography-button').click(function(e) { e.preventDefault(); Aedu.Dismissibles.recordClickthrough("UpdateUserBiographyPrompt"); $.ajax({ url: $r.api_v0_profiles_update_about_path({ subdomain_param: 'api', about: "", }), type: 'PUT', success: function(response) { location.reload(); } }); }); $('.js-work-creator-button').click(function (e) { e.preventDefault(); window.location = $r.upload_funnel_document_path({ source: encodeURIComponent(""), }); }); $('.js-video-upload-button').click(function (e) { e.preventDefault(); window.location = $r.upload_funnel_video_path({ source: encodeURIComponent(""), }); }); $('.js-do-this-later-button').click(function() { $(this).closest('.js-profile-nag-panel').remove(); Aedu.Dismissibles.recordDismissal("WowProfileImportContactsPrompt"); }); $('.js-update-biography-do-this-later-button').click(function(){ $(this).closest('.js-profile-nag-panel').remove(); Aedu.Dismissibles.recordDismissal("UpdateUserBiographyPrompt"); }); $('.wow-profile-mentions-upsell--close').click(function(){ $('.wow-profile-mentions-upsell--panel').hide(); Aedu.Dismissibles.recordDismissal("WowProfileMentionsUpsell"); }); $('.wow-profile-mentions-upsell--button').click(function(){ Aedu.Dismissibles.recordClickthrough("WowProfileMentionsUpsell"); }); new WowProfile.SocialRedesignUserWorks({ initialWorksOffset: 20, allWorksOffset: 20, maxSections: 3 }) }); </script> </div></div></div></div><script> require.config({ waitSeconds: 90 })(["https://a.academia-assets.com/assets/wow_profile_edit-5ea339ee107c863779f560dd7275595239fed73f1a13d279d2b599a28c0ecd33.js","https://a.academia-assets.com/assets/add_coauthor-22174b608f9cb871d03443cafa7feac496fb50d7df2d66a53f5ee3c04ba67f53.js","https://a.academia-assets.com/assets/tab-dcac0130902f0cc2d8cb403714dd47454f11fc6fb0e99ae6a0827b06613abc20.js","https://a.academia-assets.com/assets/wow_profile-f77ea15d77ce96025a6048a514272ad8becbad23c641fc2b3bd6e24ca6ff1932.js"], function() { // from javascript_helper.rb window.ae = window.ae || {}; window.ae.WowProfile = window.ae.WowProfile || {}; if(Aedu.User.current && Aedu.User.current.id === $viewedUser.id) { window.ae.WowProfile.current_user_edit = {}; new WowProfileEdit.EditUploadView({ el: '.js-edit-upload-button-wrapper', model: window.$current_user, }); new AddCoauthor.AddCoauthorsController(); } var userInfoView = new WowProfile.SocialRedesignUserInfo({ recaptcha_key: "6LdxlRMTAAAAADnu_zyLhLg0YF9uACwz78shpjJB" }); WowProfile.router = new WowProfile.Router({ userInfoView: userInfoView }); Backbone.history.start({ pushState: true, root: "/" + $viewedUser.page_name }); new WowProfile.UserWorksNav() }); </script> </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: "42871d8a653299e152972fe4e6455b36ca29506a79f59b2cb1ee65d8faaafc05", });</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="mT18jEGLGB8y/fwCxKPDLgIRJ+Yv1RQFDSrmCrtOaPPhpXJDCVD0r+3gGAnk4NqE2qs5ljLfbyu6nqnjxZVvEA==" 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://fhnw.academia.edu/HanneThomas" 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="I08Ge22RzVFq6yf8xZ4U79iM+wufTujFyCXtFLvRuKxb1wi0JUoh4bX2w/fl3Q1FADble4JEk+t/kaL9xQq/Tw==" 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>