{"version":"1.0","provider_name":"Editura ASE","provider_url":"https:\/\/dev.editura.ase.ro\/editura-ase","author_name":"Editura ASE","author_url":"https:\/\/dev.editura.ase.ro\/editura-ase","title":"Programare evolutiv\u0103 \u0219i algoritmi genetici - Editura ASE","type":"rich","width":600,"height":338,"html":"<blockquote class=\"wp-embedded-content\" data-secret=\"YGyLZY7Nbl\"><a href=\"https:\/\/dev.editura.ase.ro\/editura-ase\/product\/programare-evolutiva-si-algoritmi-genetici\/\">Programare evolutiv\u0103 \u0219i algoritmi genetici<\/a><\/blockquote><iframe sandbox=\"allow-scripts\" security=\"restricted\" src=\"https:\/\/dev.editura.ase.ro\/editura-ase\/product\/programare-evolutiva-si-algoritmi-genetici\/embed\/#?secret=YGyLZY7Nbl\" width=\"600\" height=\"338\" title=\"&#8222;Programare evolutiv\u0103 \u0219i algoritmi genetici&#8221; &#8211; Editura ASE\" data-secret=\"YGyLZY7Nbl\" frameborder=\"0\" marginwidth=\"0\" marginheight=\"0\" scrolling=\"no\" class=\"wp-embedded-content\"><\/iframe><script>\n\/*! This file is auto-generated *\/\n!function(d,l){\"use strict\";l.querySelector&&d.addEventListener&&\"undefined\"!=typeof URL&&(d.wp=d.wp||{},d.wp.receiveEmbedMessage||(d.wp.receiveEmbedMessage=function(e){var t=e.data;if((t||t.secret||t.message||t.value)&&!\/[^a-zA-Z0-9]\/.test(t.secret)){for(var s,r,n,a=l.querySelectorAll('iframe[data-secret=\"'+t.secret+'\"]'),o=l.querySelectorAll('blockquote[data-secret=\"'+t.secret+'\"]'),c=new RegExp(\"^https?:$\",\"i\"),i=0;i<o.length;i++)o[i].style.display=\"none\";for(i=0;i<a.length;i++)s=a[i],e.source===s.contentWindow&&(s.removeAttribute(\"style\"),\"height\"===t.message?(1e3<(r=parseInt(t.value,10))?r=1e3:~~r<200&&(r=200),s.height=r):\"link\"===t.message&&(r=new URL(s.getAttribute(\"src\")),n=new URL(t.value),c.test(n.protocol))&&n.host===r.host&&l.activeElement===s&&(d.top.location.href=t.value))}},d.addEventListener(\"message\",d.wp.receiveEmbedMessage,!1),l.addEventListener(\"DOMContentLoaded\",function(){for(var e,t,s=l.querySelectorAll(\"iframe.wp-embedded-content\"),r=0;r<s.length;r++)(t=(e=s[r]).getAttribute(\"data-secret\"))||(t=Math.random().toString(36).substring(2,12),e.src+=\"#?secret=\"+t,e.setAttribute(\"data-secret\",t)),e.contentWindow.postMessage({message:\"ready\",secret:t},\"*\")},!1)))}(window,document);\n\/\/# sourceURL=https:\/\/dev.editura.ase.ro\/editura-ase\/wp-includes\/js\/wp-embed.min.js\n<\/script>\n","description":"Lucrarea cuprinde rezolv\u0103ri \u00een manier\u0103 evolutiv\u0103 ale unor probleme clasice (One-Max, problema celor N regine) \u0219i de interes economic (problema comis-voiajorului, planificarea activit\u0103\u021bilor de tip sisteme de produc\u021bie bazate pe comand\u0103, clase de probleme de optimizare a portofoliilor: problema primar\u0103 de minimizare a riscului, problema primar\u0103 de maximizare a randamentului \u0219i variantele care folosesc func\u021bii obiectiv de tip mixtur\u0103). \u00cen cadrul acestor solu\u021bii sunt prezentate studii comparative relativ la o serie de operatori de varia\u021bie \u0219i selec\u021bie, respectiv modele de popula\u021bie \u0219i supravie\u021buire (selectarea genera\u021biei urm\u0103toare), cu indicarea unor variante convenabile de alegere a parametrilor modelelor.","thumbnail_url":"https:\/\/dev.editura.ase.ro\/editura-ase\/wp-content\/uploads\/2023\/02\/2015-COCIANU-USCATU-Programare-evolutiva-SITE.jpg","thumbnail_width":400,"thumbnail_height":578}