A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation

A novel hybrid genetic algorithm and Nelder-Mead... | F1000Research "use strict";function _typeof(t){return(_typeof="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t})(t)}!function(){var t=function(){var t,e,o=[],n=window,r=n;for(;r;){try{if(r.frames.__tcfapiLocator){t=r;break}}catch(t){}if(r===n.top)break;r=r.parent}t||(!function t(){var e=n.document,o=!!n.frames.__tcfapiLocator;if(!o)if(e.body){var r=e.createElement("iframe");r.style.cssText="display:none",r.name="__tcfapiLocator",e.body.appendChild(r)}else setTimeout(t,5);return!o}(),n.__tcfapi=function(){for(var t=arguments.length,n=new Array(t),r=0;r 3&&2===parseInt(n[1],10)&&"boolean"==typeof n[3]&&(e=n[3],"function"==typeof n[2]&&n[2]("set",!0)):"ping"===n[0]?"function"==typeof n[2]&&n[2]({gdprApplies:e,cmpLoaded:!1,cmpStatus:"stub"}):o.push(n)},n.addEventListener("message",(function(t){var e="string"==typeof t.data,o={};if(e)try{o=JSON.parse(t.data)}catch(t){}else o=t.data;var n="object"===_typeof(o)&&null!==o?o.__tcfapiCall:null;n&&window.__tcfapi(n.command,n.version,(function(o,r){var a={__tcfapiReturn:{returnValue:o,success:r,callId:n.callId}};t&&t.source&&t.source.postMessage&&t.source.postMessage(e?JSON.stringify(a):a,"*")}),n.parameter)}),!1))};"undefined"!=typeof module?module.exports=t:t()}(); dataLayer = dataLayer || []; // Standard GTM initialization - Google Consent Mode handles consent automatically (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+ '>m_auth=hzk0Vc3qFsQYhCrIoHz68A>m_preview=env-1>m_cookies_win=x';f.parentNode.insertBefore(j,f); })(window,document,'script','dataLayer','GTM-MWFK8L5J'); ;window.NREUM||(NREUM={});NREUM.init={distributed_tracing:{enabled:true},privacy:{cookies_enabled:true},ajax:{deny_list:["bam.nr-data.net"]}}; ;NREUM.loader_config={accountID:"438030",trustKey:"438030",agentID:"772317073",licenseKey:"97f8f67f26",applicationID:"772317073"} ;NREUM.info={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net",licenseKey:"97f8f67f26",applicationID:"772317073",sa:1} ;/*! For license information please see nr-loader-spa-1.236.0.min.js.LICENSE.txt */ (()=>{"use strict";var e,t,r={5763:(e,t,r)=>{r.d(t,{P_:()=>l,Mt:()=>g,C5:()=>s,DL:()=>v,OP:()=>T,lF:()=>D,Yu:()=>y,Dg:()=>h,CX:()=>c,GE:()=>b,sU:()=>_});var n=r(8632),i=r(9567);const o={beacon:n.ce.beacon,errorBeacon:n.ce.errorBeacon,licenseKey:void 0,applicationID:void 0,sa:void 0,queueTime:void 0,applicationTime:void 0,ttGuid:void 0,user:void 0,account:void 0,product:void 0,extra:void 0,jsAttributes:{},userAttributes:void 0,atts:void 0,transactionName:void 0,tNamePlain:void 0},a={};function s(e){if(!e)throw new Error("All info objects require an agent identifier!");if(!a[e])throw new Error("Info for ".concat(e," was never set"));return a[e]}function c(e,t){if(!e)throw new Error("All info objects require an agent identifier!");a[e]=(0,i.D)(t,o),(0,n.Qy)(e,a[e],"info")}var u=r(7056);const d=()=>{const e={blockSelector:"[data-nr-block]",maskInputOptions:{password:!0}};return{allow_bfcache:!0,privacy:{cookies_enabled:!0},ajax:{deny_list:void 0,enabled:!0,harvestTimeSeconds:10},distributed_tracing:{enabled:void 0,exclude_newrelic_header:void 0,cors_use_newrelic_header:void 0,cors_use_tracecontext_headers:void 0,allowed_origins:void 0},session:{domain:void 0,expiresMs:u.oD,inactiveMs:u.Hb},ssl:void 0,obfuscate:void 0,jserrors:{enabled:!0,harvestTimeSeconds:10},metrics:{enabled:!0},page_action:{enabled:!0,harvestTimeSeconds:30},page_view_event:{enabled:!0},page_view_timing:{enabled:!0,harvestTimeSeconds:30,long_task:!1},session_trace:{enabled:!0,harvestTimeSeconds:10},harvest:{tooManyRequestsDelay:60},session_replay:{enabled:!1,harvestTimeSeconds:60,sampleRate:.1,errorSampleRate:.1,maskTextSelector:"*",maskAllInputs:!0,get blockClass(){return"nr-block"},get ignoreClass(){return"nr-ignore"},get maskTextClass(){return"nr-mask"},get blockSelector(){return e.blockSelector},set blockSelector(t){e.blockSelector+=",".concat(t)},get maskInputOptions(){return e.maskInputOptions},set maskInputOptions(t){e.maskInputOptions={...t,password:!0}}},spa:{enabled:!0,harvestTimeSeconds:10}}},f={};function l(e){if(!e)throw new Error("All configuration objects require an agent identifier!");if(!f[e])throw new Error("Configuration for ".concat(e," was never set"));return f[e]}function h(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");f[e]=(0,i.D)(t,d()),(0,n.Qy)(e,f[e],"config")}function g(e,t){if(!e)throw new Error("All configuration objects require an agent identifier!");var r=l(e);if(r){for(var n=t.split("."),i=0;i {r.d(t,{D:()=>i});var n=r(50);function i(e,t){try{if(!e||"object"!=typeof e)return(0,n.Z)("Setting a Configurable requires an object as input");if(!t||"object"!=typeof t)return(0,n.Z)("Setting a Configurable requires a model to set its initial properties");const r=Object.create(Object.getPrototypeOf(t),Object.getOwnPropertyDescriptors(t)),o=0===Object.keys(r).length?e:r;for(let a in o)if(void 0!==e[a])try{"object"==typeof e[a]&&"object"==typeof t[a]?r[a]=i(e[a],t[a]):r[a]=e[a]}catch(e){(0,n.Z)("An error occurred while setting a property of a Configurable",e)}return r}catch(e){(0,n.Z)("An error occured while setting a Configurable",e)}}},6818:(e,t,r)=>{r.d(t,{Re:()=>i,gF:()=>o,q4:()=>n});const n="1.236.0",i="PROD",o="CDN"},385:(e,t,r)=>{r.d(t,{FN:()=>a,IF:()=>u,Nk:()=>f,Tt:()=>s,_A:()=>o,il:()=>n,pL:()=>c,v6:()=>i,w1:()=>d});const n="undefined"!=typeof window&&!!window.document,i="undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self.navigator instanceof WorkerNavigator||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis.navigator instanceof WorkerNavigator),o=n?window:"undefined"!=typeof WorkerGlobalScope&&("undefined"!=typeof self&&self instanceof WorkerGlobalScope&&self||"undefined"!=typeof globalThis&&globalThis instanceof WorkerGlobalScope&&globalThis),a=""+o?.location,s=/iPad|iPhone|iPod/.test(navigator.userAgent),c=s&&"undefined"==typeof SharedWorker,u=(()=>{const e=navigator.userAgent.match(/Firefox[/\s](\d+\.\d+)/);return Array.isArray(e)&&e.length>=2?+e[1]:0})(),d=Boolean(n&&window.document.documentMode),f=!!navigator.sendBeacon},1117:(e,t,r)=>{r.d(t,{w:()=>o});var n=r(50);const i={agentIdentifier:"",ee:void 0};class o{constructor(e){try{if("object"!=typeof e)return(0,n.Z)("shared context requires an object as input");this.sharedContext={},Object.assign(this.sharedContext,i),Object.entries(e).forEach((e=>{let[t,r]=e;Object.keys(i).includes(t)&&(this.sharedContext[t]=r)}))}catch(e){(0,n.Z)("An error occured while setting SharedContext",e)}}}},8e3:(e,t,r)=>{r.d(t,{L:()=>d,R:()=>c});var n=r(2177),i=r(1284),o=r(4322),a=r(3325);const s={};function c(e,t){const r={staged:!1,priority:a.p[t]||0};u(e),s[e].get(t)||s[e].set(t,r)}function u(e){e&&(s[e]||(s[e]=new Map))}function d(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:"",t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:"feature";if(u(e),!e||!s[e].get(t))return a(t);s[e].get(t).staged=!0;const r=[...s[e]];function a(t){const r=e?n.ee.get(e):n.ee,a=o.X.handlers;if(r.backlog&&a){var s=r.backlog[t],c=a[t];if(c){for(var u=0;s&&u {let[t,r]=e;return r.staged}))&&(r.sort(((e,t)=>e[1].priority-t[1].priority)),r.forEach((e=>{let[t]=e;a(t)})))}function f(e,t){var r=e[1];(0,i.D)(t[r],(function(t,r){var n=e[0];if(r[0]===n){var i=r[1],o=e[3],a=e[2];i.apply(o,a)}}))}},2177:(e,t,r)=>{r.d(t,{c:()=>f,ee:()=>u});var n=r(8632),i=r(2210),o=r(1284),a=r(5763),s="nr@context";let c=(0,n.fP)();var u;function d(){}function f(e){return(0,i.X)(e,s,l)}function l(){return new d}function h(){u.aborted=!0,u.backlog={}}c.ee?u=c.ee:(u=function e(t,r){var n={},c={},f={},g=!1;try{g=16===r.length&&(0,a.OP)(r).isolatedBacklog}catch(e){}var p={on:b,addEventListener:b,removeEventListener:y,emit:v,get:x,listeners:w,context:m,buffer:A,abort:h,aborted:!1,isBuffering:E,debugId:r,backlog:g?{}:t&&"object"==typeof t.backlog?t.backlog:{}};return p;function m(e){return e&&e instanceof d?e:e?(0,i.X)(e,s,l):l()}function v(e,r,n,i,o){if(!1!==o&&(o=!0),!u.aborted||i){t&&o&&t.emit(e,r,n);for(var a=m(n),s=w(e),d=s.length,f=0;fn,p:()=>i});var n=r(2177).ee.get("handle");function i(e,t,r,i,o){o?(o.buffer([e],i),o.emit(e,t,r)):(n.buffer([e],i),n.emit(e,t,r))}},4322:(e,t,r)=>{r.d(t,{X:()=>o});var n=r(5546);o.on=a;var i=o.handlers={};function o(e,t,r,o){a(o||n.E,i,e,t,r)}function a(e,t,r,i,o){o||(o="feature"),e||(e=n.E);var a=t[o]=t[o]||{};(a[r]=a[r]||[]).push([e,i])}},3239:(e,t,r)=>{r.d(t,{bP:()=>s,iz:()=>c,m$:()=>a});var n=r(385);let i=!1,o=!1;try{const e={get passive(){return i=!0,!1},get signal(){return o=!0,!1}};n._A.addEventListener("test",null,e),n._A.removeEventListener("test",null,e)}catch(e){}function a(e,t){return i||o?{capture:!!e,passive:i,signal:t}:!!e}function s(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;window.addEventListener(e,t,a(r,n))}function c(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2],n=arguments.length>3?arguments[3]:void 0;document.addEventListener(e,t,a(r,n))}},4402:(e,t,r)=>{r.d(t,{Ht:()=>u,M:()=>c,Rl:()=>a,ky:()=>s});var n=r(385);const i="xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx";function o(e,t){return e?15&e[t]:16*Math.random()|0}function a(){const e=n._A?.crypto||n._A?.msCrypto;let t,r=0;return e&&e.getRandomValues&&(t=e.getRandomValues(new Uint8Array(31))),i.split("").map((e=>"x"===e?o(t,++r).toString(16):"y"===e?(3&o()|8).toString(16):e)).join("")}function s(e){const t=n._A?.crypto||n._A?.msCrypto;let r,i=0;t&&t.getRandomValues&&(r=t.getRandomValues(new Uint8Array(31)));const a=[];for(var s=0;s {r.d(t,{Bq:()=>n,Hb:()=>o,oD:()=>i});const n="NRBA",i=144e5,o=18e5},7894:(e,t,r)=>{function n(){return Math.round(performance.now())}r.d(t,{z:()=>n})},7243:(e,t,r)=>{r.d(t,{e:()=>o});var n=r(385),i={};function o(e){if(e in i)return i[e];if(0===(e||"").indexOf("data:"))return{protocol:"data"};let t;var r=n._A?.location,o={};if(n.il)t=document.createElement("a"),t.href=e;else try{t=new URL(e,r.href)}catch(e){return o}o.port=t.port;var a=t.href.split("://");!o.port&&a[1]&&(o.port=a[1].split("/")[0].split("@").pop().split(":")[1]),o.port&&"0"!==o.port||(o.port="https"===a[0]?"443":"80"),o.hostname=t.hostname||r.hostname,o.pathname=t.pathname,o.protocol=a[0],"/"!==o.pathname.charAt(0)&&(o.pathname="/"+o.pathname);var s=!t.protocol||":"===t.protocol||t.protocol===r.protocol,c=t.hostname===r.hostname&&t.port===r.port;return o.sameOrigin=s&&(!t.hostname||c),"/"===o.pathname&&(i[e]=o),o}},50:(e,t,r)=>{function n(e,t){"function"==typeof console.warn&&(console.warn("New Relic: ".concat(e)),t&&console.warn(t))}r.d(t,{Z:()=>n})},2587:(e,t,r)=>{r.d(t,{N:()=>c,T:()=>u});var n=r(2177),i=r(5546),o=r(8e3),a=r(3325);const s={stn:[a.D.sessionTrace],err:[a.D.jserrors,a.D.metrics],ins:[a.D.pageAction],spa:[a.D.spa],sr:[a.D.sessionReplay,a.D.sessionTrace]};function c(e,t){const r=n.ee.get(t);e&&"object"==typeof e&&(Object.entries(e).forEach((e=>{let[t,n]=e;void 0===u[t]&&(s[t]?s[t].forEach((e=>{n?(0,i.p)("feat-"+t,[],void 0,e,r):(0,i.p)("block-"+t,[],void 0,e,r),(0,i.p)("rumresp-"+t,[Boolean(n)],void 0,e,r)})):n&&(0,i.p)("feat-"+t,[],void 0,void 0,r),u[t]=Boolean(n))})),Object.keys(s).forEach((e=>{void 0===u[e]&&(s[e]?.forEach((t=>(0,i.p)("rumresp-"+e,[!1],void 0,t,r))),u[e]=!1)})),(0,o.L)(t,a.D.pageViewEvent))}const u={}},2210:(e,t,r)=>{r.d(t,{X:()=>i});var n=Object.prototype.hasOwnProperty;function i(e,t,r){if(n.call(e,t))return e[t];var i=r();if(Object.defineProperty&&Object.keys)try{return Object.defineProperty(e,t,{value:i,writable:!0,enumerable:!1}),i}catch(e){}return e[t]=i,i}},1284:(e,t,r)=>{r.d(t,{D:()=>n});const n=(e,t)=>Object.entries(e||{}).map((e=>{let[r,n]=e;return t(r,n)}))},4351:(e,t,r)=>{r.d(t,{P:()=>o});var n=r(2177);const i=()=>{const e=new WeakSet;return(t,r)=>{if("object"==typeof r&&null!==r){if(e.has(r))return;e.add(r)}return r}};function o(e){try{return JSON.stringify(e,i())}catch(e){try{n.ee.emit("internal-error",[e])}catch(e){}}}},3960:(e,t,r)=>{r.d(t,{K:()=>a,b:()=>o});var n=r(3239);function i(){return"undefined"==typeof document||"complete"===document.readyState}function o(e,t){if(i())return e();(0,n.bP)("load",e,t)}function a(e){if(i())return e();(0,n.iz)("DOMContentLoaded",e)}},8632:(e,t,r)=>{r.d(t,{EZ:()=>u,Qy:()=>c,ce:()=>o,fP:()=>a,gG:()=>d,mF:()=>s});var n=r(7894),i=r(385);const o={beacon:"bam.nr-data.net",errorBeacon:"bam.nr-data.net"};function a(){return i._A.NREUM||(i._A.NREUM={}),void 0===i._A.newrelic&&(i._A.newrelic=i._A.NREUM),i._A.NREUM}function s(){let e=a();return e.o||(e.o={ST:i._A.setTimeout,SI:i._A.setImmediate,CT:i._A.clearTimeout,XHR:i._A.XMLHttpRequest,REQ:i._A.Request,EV:i._A.Event,PR:i._A.Promise,MO:i._A.MutationObserver,FETCH:i._A.fetch}),e}function c(e,t,r){let i=a();const o=i.initializedAgents||{},s=o[e]||{};return Object.keys(s).length||(s.initializedAt={ms:(0,n.z)(),date:new Date}),i.initializedAgents={...o,[e]:{...s,[r]:t}},i}function u(e,t){a()[e]=t}function d(){return function(){let e=a();const t=e.info||{};e.info={beacon:o.beacon,errorBeacon:o.errorBeacon,...t}}(),function(){let e=a();const t=e.init||{};e.init={...t}}(),s(),function(){let e=a();const t=e.loader_config||{};e.loader_config={...t}}(),a()}},7956:(e,t,r)=>{r.d(t,{N:()=>i});var n=r(3239);function i(e){let t=arguments.length>1&&void 0!==arguments[1]&&arguments[1],r=arguments.length>2?arguments[2]:void 0,i=arguments.length>3?arguments[3]:void 0;return void(0,n.iz)("visibilitychange",(function(){if(t)return void("hidden"==document.visibilityState&&e());e(document.visibilityState)}),r,i)}},1214:(e,t,r)=>{r.d(t,{em:()=>v,u5:()=>N,QU:()=>S,_L:()=>I,Gm:()=>L,Lg:()=>M,gy:()=>U,BV:()=>Q,Kf:()=>ee});var n=r(2177);const i="nr@original";var o=Object.prototype.hasOwnProperty,a=!1;function s(e,t){return e||(e=n.ee),r.inPlace=function(e,t,n,i,o){n||(n="");var a,s,c,u="-"===n.charAt(0);for(c=0;c 2?n-2:0),o=2;o {r(A[T],e,w),r(E[T],e,w)})),r(l._A,"fetch",y),t.on(y+"end",(function(e,r){var n=this;if(r){var i=r.headers.get("content-length");null!==i&&(n.rxSize=i),t.emit(y+"done",[null,r],n)}else t.emit(y+"done",[e],n)})),t}const O={},j=["pushState","replaceState"];function S(e){const t=function(e){return(e||n.ee).get("history")}(e);return!l.il||O[t.debugId]++||(O[t.debugId]=1,s(t).inPlace(window.history,j,"-")),t}var P=r(3239);const C={},R=["appendChild","insertBefore","replaceChild"];function I(e){const t=function(e){return(e||n.ee).get("jsonp")}(e);if(!l.il||C[t.debugId])return t;C[t.debugId]=!0;var r=s(t),i=/[?&](?:callback|cb)=([^&#]+)/,o=/(.*)\.([^.]+)/,a=/^(\w+)(\.|$)(.*)$/;function c(e,t){var r=e.match(a),n=r[1],i=r[3];return i?c(i,t[n]):t[n]}return r.inPlace(Node.prototype,R,"dom-"),t.on("dom-start",(function(e){!function(e){if(!e||"string"!=typeof e.nodeName||"script"!==e.nodeName.toLowerCase())return;if("function"!=typeof e.addEventListener)return;var n=(a=e.src,s=a.match(i),s?s[1]:null);var a,s;if(!n)return;var u=function(e){var t=e.match(o);if(t&&t.length>=3)return{key:t[2],parent:c(t[1],window)};return{key:e,parent:window}}(n);if("function"!=typeof u.parent[u.key])return;var d={};function f(){t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}function l(){t.emit("jsonp-error",[],d),t.emit("jsonp-end",[],d),e.removeEventListener("load",f,(0,P.m$)(!1)),e.removeEventListener("error",l,(0,P.m$)(!1))}r.inPlace(u.parent,[u.key],"cb-",d),e.addEventListener("load",f,(0,P.m$)(!1)),e.addEventListener("error",l,(0,P.m$)(!1)),t.emit("new-jsonp",[e.src],d)}(e[0])})),t}var k=r(5763);const H={};function L(e){const t=function(e){return(e||n.ee).get("mutation")}(e);if(!l.il||H[t.debugId])return t;H[t.debugId]=!0;var r=s(t),i=k.Yu.MO;return i&&(window.MutationObserver=function(e){return this instanceof i?new i(r(e,"fn-")):i.apply(this,arguments)},MutationObserver.prototype=i.prototype),t}const z={};function M(e){const t=function(e){return(e||n.ee).get("promise")}(e);if(z[t.debugId])return t;z[t.debugId]=!0;var r=n.c,o=s(t),a=k.Yu.PR;return a&&function(){function e(r){var n=t.context(),i=o(r,"executor-",n,null,!1);const s=Reflect.construct(a,[i],e);return t.context(s).getCtx=function(){return n},s}l._A.Promise=e,Object.defineProperty(e,"name",{value:"Promise"}),e.toString=function(){return a.toString()},Object.setPrototypeOf(e,a),["all","race"].forEach((function(r){const n=a[r];e[r]=function(e){let i=!1;[...e||[]].forEach((e=>{this.resolve(e).then(a("all"===r),a(!1))}));const o=n.apply(this,arguments);return o;function a(e){return function(){t.emit("propagate",[null,!i],o,!1,!1),i=i||!e}}}})),["resolve","reject"].forEach((function(r){const n=a[r];e[r]=function(e){const r=n.apply(this,arguments);return e!==r&&t.emit("propagate",[e,!0],r,!1,!1),r}})),e.prototype=a.prototype;const n=a.prototype.then;a.prototype.then=function(){var e=this,i=r(e);i.promise=e;for(var a=arguments.length,s=new Array(a),c=0;c e())),t};function m(e,t){i.inPlace(t,["onreadystatechange"],"fn-",E)}function b(){var e=this,t=r.context(e);e.readyState>3&&!t.resolved&&(t.resolved=!0,r.emit("xhr-resolved",[],e)),i.inPlace(e,f,"fn-",E)}if(function(e,t){for(var r in e)t[r]=e[r]}(o,p),p.prototype=o.prototype,i.inPlace(p.prototype,J,"-xhr-",E),r.on("send-xhr-start",(function(e,t){m(e,t),function(e){h.push(e),a&&(y?y.then(A):u?u(A):(w=-w,x.data=w))}(t)})),r.on("open-xhr-start",m),a){var y=c&&c.resolve();if(!u&&!c){var w=1,x=document.createTextNode(w);new a(A).observe(x,{characterData:!0})}}else t.on("fn-end",(function(e){e[0]&&e[0].type===d||A()}));function A(){for(var e=0;e {r.d(t,{t:()=>n});const n=r(3325).D.ajax},6660:(e,t,r)=>{r.d(t,{A:()=>i,t:()=>n});const n=r(3325).D.jserrors,i="nr@seenError"},3081:(e,t,r)=>{r.d(t,{gF:()=>o,mY:()=>i,t9:()=>n,vz:()=>s,xS:()=>a});const n=r(3325).D.metrics,i="sm",o="cm",a="storeSupportabilityMetrics",s="storeEventMetrics"},4649:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageAction},7633:(e,t,r)=>{r.d(t,{Dz:()=>i,OJ:()=>a,qw:()=>o,t9:()=>n});const n=r(3325).D.pageViewEvent,i="firstbyte",o="domcontent",a="windowload"},9251:(e,t,r)=>{r.d(t,{t:()=>n});const n=r(3325).D.pageViewTiming},3614:(e,t,r)=>{r.d(t,{BST_RESOURCE:()=>i,END:()=>s,FEATURE_NAME:()=>n,FN_END:()=>u,FN_START:()=>c,PUSH_STATE:()=>d,RESOURCE:()=>o,START:()=>a});const n=r(3325).D.sessionTrace,i="bstResource",o="resource",a="-start",s="-end",c="fn"+a,u="fn"+s,d="pushState"},7836:(e,t,r)=>{r.d(t,{BODY:()=>A,CB_END:()=>E,CB_START:()=>u,END:()=>x,FEATURE_NAME:()=>i,FETCH:()=>_,FETCH_BODY:()=>v,FETCH_DONE:()=>m,FETCH_START:()=>p,FN_END:()=>c,FN_START:()=>s,INTERACTION:()=>l,INTERACTION_API:()=>d,INTERACTION_EVENTS:()=>o,JSONP_END:()=>b,JSONP_NODE:()=>g,JS_TIME:()=>T,MAX_TIMER_BUDGET:()=>a,REMAINING:()=>f,SPA_NODE:()=>h,START:()=>w,originalSetTimeout:()=>y});var n=r(5763);const i=r(3325).D.spa,o=["click","submit","keypress","keydown","keyup","change"],a=999,s="fn-start",c="fn-end",u="cb-start",d="api-ixn-",f="remaining",l="interaction",h="spaNode",g="jsonpNode",p="fetch-start",m="fetch-done",v="fetch-body-",b="jsonp-end",y=n.Yu.ST,w="-start",x="-end",A="-body",E="cb"+x,T="jsTime",_="fetch"},5938:(e,t,r)=>{r.d(t,{W:()=>o});var n=r(5763),i=r(2177);class o{constructor(e,t,r){this.agentIdentifier=e,this.aggregator=t,this.ee=i.ee.get(e,(0,n.OP)(this.agentIdentifier).isolatedBacklog),this.featureName=r,this.blocked=!1}}},9144:(e,t,r)=>{r.d(t,{j:()=>m});var n=r(3325),i=r(5763),o=r(5546),a=r(2177),s=r(7894),c=r(8e3),u=r(3960),d=r(385),f=r(50),l=r(3081),h=r(8632);function g(){const e=(0,h.gG)();["setErrorHandler","finished","addToTrace","inlineHit","addRelease","addPageAction","setCurrentRouteName","setPageViewName","setCustomAttribute","interaction","noticeError","setUserId"].forEach((t=>{e[t]=function(){for(var r=arguments.length,n=new Array(r),i=0;i 1?r-1:0),i=1;i {e.exposed&&e.api[t]&&o.push(e.api[t](...n))})),o.length>1?o:o[0]}(t,...n)}}))}var p=r(2587);function m(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{},m=arguments.length>2?arguments[2]:void 0,v=arguments.length>3?arguments[3]:void 0,{init:b,info:y,loader_config:w,runtime:x={loaderType:m},exposed:A=!0}=t;const E=(0,h.gG)();y||(b=E.init,y=E.info,w=E.loader_config),(0,i.Dg)(e,b||{}),(0,i.GE)(e,w||{}),(0,i.sU)(e,x),y.jsAttributes??={},d.v6&&(y.jsAttributes.isWorker=!0),(0,i.CX)(e,y),g();const T=function(e,t){t||(0,c.R)(e,"api");const h={};var g=a.ee.get(e),p=g.get("tracer"),m="api-",v=m+"ixn-";function b(t,r,n,o){const a=(0,i.C5)(e);return null===r?delete a.jsAttributes[t]:(0,i.CX)(e,{...a,jsAttributes:{...a.jsAttributes,[t]:r}}),x(m,n,!0,o||null===r?"session":void 0)(t,r)}function y(){}["setErrorHandler","finished","addToTrace","inlineHit","addRelease"].forEach((e=>h[e]=x(m,e,!0,"api"))),h.addPageAction=x(m,"addPageAction",!0,n.D.pageAction),h.setCurrentRouteName=x(m,"routeName",!0,n.D.spa),h.setPageViewName=function(t,r){if("string"==typeof t)return"/"!==t.charAt(0)&&(t="/"+t),(0,i.OP)(e).customTransaction=(r||"http://custom.transaction")+t,x(m,"setPageViewName",!0)()},h.setCustomAttribute=function(e,t){let r=arguments.length>2&&void 0!==arguments[2]&&arguments[2];if("string"==typeof e){if(["string","number"].includes(typeof t)||null===t)return b(e,t,"setCustomAttribute",r);(0,f.Z)("Failed to execute setCustomAttribute.\nNon-null value must be a string or number type, but a type of was provided."))}else(0,f.Z)("Failed to execute setCustomAttribute.\nName must be a string type, but a type of was provided."))},h.setUserId=function(e){if("string"==typeof e||null===e)return b("enduser.id",e,"setUserId",!0);(0,f.Z)("Failed to execute setUserId.\nNon-null value must be a string type, but a type of was provided."))},h.interaction=function(){return(new y).get()};var w=y.prototype={createTracer:function(e,t){var r={},i=this,a="function"==typeof t;return(0,o.p)(v+"tracer",[(0,s.z)(),e,r],i,n.D.spa,g),function(){if(p.emit((a?"":"no-")+"fn-start",[(0,s.z)(),i,a],r),a)try{return t.apply(this,arguments)}catch(e){throw p.emit("fn-err",[arguments,this,"string"==typeof e?new Error(e):e],r),e}finally{p.emit("fn-end",[(0,s.z)()],r)}}}};function x(e,t,r,i){return function(){return(0,o.p)(l.xS,["API/"+t+"/called"],void 0,n.D.metrics,g),i&&(0,o.p)(e+t,[(0,s.z)(),...arguments],r?null:this,i,g),r?void 0:this}}function A(){r.e(439).then(r.bind(r,7438)).then((t=>{let{setAPI:r}=t;r(e),(0,c.L)(e,"api")})).catch((()=>(0,f.Z)("Downloading runtime APIs failed...")))}return["actionText","setName","setAttribute","save","ignore","onEnd","getContext","end","get"].forEach((e=>{w[e]=x(v,e,void 0,n.D.spa)})),h.noticeError=function(e,t){"string"==typeof e&&(e=new Error(e)),(0,o.p)(l.xS,["API/noticeError/called"],void 0,n.D.metrics,g),(0,o.p)("err",[e,(0,s.z)(),!1,t],void 0,n.D.jserrors,g)},d.il?(0,u.b)((()=>A()),!0):A(),h}(e,v);return(0,h.Qy)(e,T,"api"),(0,h.Qy)(e,A,"exposed"),(0,h.EZ)("activatedFeatures",p.T),T}},3325:(e,t,r)=>{r.d(t,{D:()=>n,p:()=>i});const n={ajax:"ajax",jserrors:"jserrors",metrics:"metrics",pageAction:"page_action",pageViewEvent:"page_view_event",pageViewTiming:"page_view_timing",sessionReplay:"session_replay",sessionTrace:"session_trace",spa:"spa"},i={[n.pageViewEvent]:1,[n.pageViewTiming]:2,[n.metrics]:3,[n.jserrors]:4,[n.ajax]:5,[n.sessionTrace]:6,[n.pageAction]:7,[n.spa]:8,[n.sessionReplay]:9}}},n={};function i(e){var t=n[e];if(void 0!==t)return t.exports;var o=n[e]={exports:{}};return r[e](o,o.exports,i),o.exports}i.m=r,i.d=(e,t)=>{for(var r in t)i.o(t,r)&&!i.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},i.f={},i.e=e=>Promise.all(Object.keys(i.f).reduce(((t,r)=>(i.f[r](e,t),t)),[])),i.u=e=>(({78:"page_action-aggregate",147:"metrics-aggregate",242:"session-manager",317:"jserrors-aggregate",348:"page_view_timing-aggregate",412:"lazy-feature-loader",439:"async-api",538:"recorder",590:"session_replay-aggregate",675:"compressor",733:"session_trace-aggregate",786:"page_view_event-aggregate",873:"spa-aggregate",898:"ajax-aggregate"}[e]||e)+"."+{78:"ac76d497",147:"3dc53903",148:"1a20d5fe",242:"2a64278a",317:"49e41428",348:"bd6de33a",412:"2f55ce66",439:"30bd804e",538:"1b18459f",590:"cf0efb30",675:"ae9f91a8",733:"83105561",786:"06482edd",860:"03a8b7a5",873:"e6b09d52",898:"998ef92b"}[e]+"-1.236.0.min.js"),i.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),e={},t="NRBA:",i.l=(r,n,o,a)=>{if(e[r])e[r].push(n);else{var s,c;if(void 0!==o)for(var u=document.getElementsByTagName("script"),d=0;d {s.onerror=s.onload=null,clearTimeout(h);var i=e[r];if(delete e[r],s.parentNode&&s.parentNode.removeChild(s),i&&i.forEach((e=>e(n))),t)return t(n)},h=setTimeout(l.bind(null,void 0,{type:"timeout",target:s}),12e4);s.onerror=l.bind(null,s.onerror),s.onload=l.bind(null,s.onload),c&&document.head.appendChild(s)}},i.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})},i.j=364,i.p="https://js-agent.newrelic.com/",(()=>{var e={364:0,953:0};i.f.j=(t,r)=>{var n=i.o(e,t)?e[t]:void 0;if(0!==n)if(n)r.push(n[2]);else{var o=new Promise(((r,i)=>n=e[t]=[r,i]));r.push(n[2]=o);var a=i.p+i.u(t),s=new Error;i.l(a,(r=>{if(i.o(e,t)&&(0!==(n=e[t])&&(e[t]=void 0),n)){var o=r&&("load"===r.type?"missing":r.type),a=r&&r.target&&r.target.src;s.message="Loading chunk "+t+" failed.\n("+o+": "+a+")",s.name="ChunkLoadError",s.type=o,s.request=a,n[1](s)}}),"chunk-"+t,t)}};var t=(t,r)=>{var n,o,[a,s,c]=r,u=0;if(a.some((t=>0!==e[t]))){for(n in s)i.o(s,n)&&(i.m[n]=s[n]);if(c)c(i)}for(t&&t(r);u {i.r(o);var e=i(3325),t=i(5763);const r=Object.values(e.D);function n(e){const n={};return r.forEach((r=>{n[r]=function(e,r){return!1!==(0,t.Mt)(r,"".concat(e,".enabled"))}(r,e)})),n}var a=i(9144);var s=i(5546),c=i(385),u=i(8e3),d=i(5938),f=i(3960),l=i(50);class h extends d.W{constructor(e,t,r){let n=!(arguments.length>3&&void 0!==arguments[3])||arguments[3];super(e,t,r),this.auto=n,this.abortHandler,this.featAggregate,this.onAggregateImported,n&&(0,u.R)(e,r)}importAggregator(){let e=arguments.length>0&&void 0!==arguments[0]?arguments[0]:{};if(this.featAggregate||!this.auto)return;const r=c.il&&!0===(0,t.Mt)(this.agentIdentifier,"privacy.cookies_enabled");let n;this.onAggregateImported=new Promise((e=>{n=e}));const o=async()=>{let t;try{if(r){const{setupAgentSession:e}=await Promise.all([i.e(860),i.e(242)]).then(i.bind(i,3228));t=e(this.agentIdentifier)}}catch(e){(0,l.Z)("A problem occurred when starting up session manager. This page will not start or extend any session.",e)}try{if(!this.shouldImportAgg(this.featureName,t))return void(0,u.L)(this.agentIdentifier,this.featureName);const{lazyFeatureLoader:r}=await i.e(412).then(i.bind(i,8582)),{Aggregate:o}=await r(this.featureName,"aggregate");this.featAggregate=new o(this.agentIdentifier,this.aggregator,e),n(!0)}catch(e){(0,l.Z)("Downloading and initializing ".concat(this.featureName," failed..."),e),this.abortHandler?.(),n(!1)}};c.il?(0,f.b)((()=>o()),!0):o()}shouldImportAgg(r,n){return r!==e.D.sessionReplay||!1!==(0,t.Mt)(this.agentIdentifier,"session_trace.enabled")&&(!!n?.isNew||!!n?.state.sessionReplay)}}var g=i(7633),p=i(7894);class m extends h{static featureName=g.t9;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];if(super(r,n,g.t9,i),("undefined"==typeof PerformanceNavigationTiming||c.Tt)&&"undefined"!=typeof PerformanceTiming){const n=(0,t.OP)(r);n[g.Dz]=Math.max(Date.now()-n.offset,0),(0,f.K)((()=>n[g.qw]=Math.max((0,p.z)()-n[g.Dz],0))),(0,f.b)((()=>{const t=(0,p.z)();n[g.OJ]=Math.max(t-n[g.Dz],0),(0,s.p)("timing",["load",t],void 0,e.D.pageViewTiming,this.ee)}))}this.importAggregator()}}var v=i(1117),b=i(1284);class y extends v.w{constructor(e){super(e),this.aggregatedData={}}store(e,t,r,n,i){var o=this.getBucket(e,t,r,i);return o.metrics=function(e,t){t||(t={count:0});return t.count+=1,(0,b.D)(e,(function(e,r){t[e]=w(r,t[e])})),t}(n,o.metrics),o}merge(e,t,r,n,i){var o=this.getBucket(e,t,n,i);if(o.metrics){var a=o.metrics;a.count+=r.count,(0,b.D)(r,(function(e,t){if("count"!==e){var n=a[e],i=r[e];i&&!i.c?a[e]=w(i.t,n):a[e]=function(e,t){if(!t)return e;t.c||(t=x(t.t));return t.min=Math.min(e.min,t.min),t.max=Math.max(e.max,t.max),t.t+=e.t,t.sos+=e.sos,t.c+=e.c,t}(i,a[e])}}))}else o.metrics=r}storeMetric(e,t,r,n){var i=this.getBucket(e,t,r);return i.stats=w(n,i.stats),i}getBucket(e,t,r,n){this.aggregatedData[e]||(this.aggregatedData[e]={});var i=this.aggregatedData[e][t];return i||(i=this.aggregatedData[e][t]={params:r||{}},n&&(i.custom=n)),i}get(e,t){return t?this.aggregatedData[e]&&this.aggregatedData[e][t]:this.aggregatedData[e]}take(e){for(var t={},r="",n=!1,i=0;i t.max&&(t.max=e),e 2&&void 0!==arguments[2])||arguments[2];super(e,r,j.t,n),c.il&&((0,t.OP)(e).initHidden=Boolean("hidden"===document.visibilityState),(0,N.N)((()=>(0,s.p)("docHidden",[(0,p.z)()],void 0,j.t,this.ee)),!0),(0,O.bP)("pagehide",(()=>(0,s.p)("winPagehide",[(0,p.z)()],void 0,j.t,this.ee))),this.importAggregator())}}var P=i(3081);class C extends h{static featureName=P.t9;constructor(e,t){let r=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(e,t,P.t9,r),this.importAggregator()}}var R,I=i(2210),k=i(1214),H=i(2177),L={};try{R=localStorage.getItem("__nr_flags").split(","),console&&"function"==typeof console.log&&(L.console=!0,-1!==R.indexOf("dev")&&(L.dev=!0),-1!==R.indexOf("nr_dev")&&(L.nrDev=!0))}catch(e){}function z(e){try{L.console&&z(e)}catch(e){}}L.nrDev&&H.ee.on("internal-error",(function(e){z(e.stack)})),L.dev&&H.ee.on("fn-err",(function(e,t,r){z(r.stack)})),L.dev&&(z("NR AGENT IN DEVELOPMENT MODE"),z("flags: "+(0,b.D)(L,(function(e,t){return e})).join(", ")));var M=i(6660);class B extends h{static featureName=M.t;constructor(r,n){let i=!(arguments.length>2&&void 0!==arguments[2])||arguments[2];super(r,n,M.t,i),this.skipNext=0;try{this.removeOnAbort=new AbortController}catch(e){}const o=this;o.ee.on("fn-start",(function(e,t,r){o.abortHandler&&(o.skipNext+=1)})),o.ee.on("fn-err",(function(t,r,n){o.abortHandler&&!n[M.A]&&((0,I.X)(n,M.A,(function(){return!0})),this.thrown=!0,(0,s.p)("err",[n,(0,p.z)()],void 0,e.D.jserrors,o.ee))})),o.ee.on("fn-end",(function(){o.abortHandler&&!this.thrown&&o.skipNext>0&&(o.skipNext-=1)})),o.ee.on("internal-error",(function(t){(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,o.ee)})),this.origOnerror=c._A.onerror,c._A.onerror=this.onerrorHandler.bind(this),c._A.addEventListener("unhandledrejection",(t=>{const r=function(e){let t="Unhandled Promise Rejection: ";if(e instanceof Error)try{return e.message=t+e.message,e}catch(t){return e}if(void 0===e)return new Error(t);try{return new Error(t+(0,D.P)(e))}catch(e){return new Error(t)}}(t.reason);(0,s.p)("err",[r,(0,p.z)(),!1,{unhandledPromiseRejection:1}],void 0,e.D.jserrors,this.ee)}),(0,O.m$)(!1,this.removeOnAbort?.signal)),(0,k.gy)(this.ee),(0,k.BV)(this.ee),(0,k.em)(this.ee),(0,t.OP)(r).xhrWrappable&&(0,k.Kf)(this.ee),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}onerrorHandler(t,r,n,i,o){"function"==typeof this.origOnerror&&this.origOnerror(...arguments);try{this.skipNext?this.skipNext-=1:(0,s.p)("err",[o||new F(t,r,n),(0,p.z)()],void 0,e.D.jserrors,this.ee)}catch(t){try{(0,s.p)("ierr",[t,(0,p.z)(),!0],void 0,e.D.jserrors,this.ee)}catch(e){}}return!1}}function F(e,t,r){this.message=e||"Uncaught error with no additional information",this.sourceURL=t,this.line=r}let U=1;const q="nr@id";function G(e){const t=typeof e;return!e||"object"!==t&&"function"!==t?-1:e===c._A?0:(0,I.X)(e,q,(function(){return U++}))}function V(e){if("string"==typeof e&&e.length)return e.length;if("object"==typeof e){if("undefined"!=typeof ArrayBuffer&&e instanceof ArrayBuffer&&e.byteLength)return e.byteLength;if("undefined"!=typeof Blob&&e instanceof Blob&&e.size)return e.size;if(!("undefined"!=typeof FormData&&e instanceof FormData))try{return(0,D.P)(e).length}catch(e){return}}}var X=i(7243);class W{constructor(e){this.agentIdentifier=e,this.generateTracePayload=this.generateTracePayload.bind(this),this.shouldGenerateTrace=this.shouldGenerateTrace.bind(this)}generateTracePayload(e){if(!this.shouldGenerateTrace(e))return null;var r=(0,t.DL)(this.agentIdentifier);if(!r)return null;var n=(r.accountID||"").toString()||null,i=(r.agentID||"").toString()||null,o=(r.trustKey||"").toString()||null;if(!n||!i)return null;var a=(0,_.M)(),s=(0,_.Ht)(),c=Date.now(),u={spanId:a,traceId:s,timestamp:c};return(e.sameOrigin||this.isAllowedOrigin(e)&&this.useTraceContextHeadersForCors())&&(u.traceContextParentHeader=this.generateTraceContextParentHeader(a,s),u.traceContextStateHeader=this.generateTraceContextStateHeader(a,c,n,i,o)),(e.sameOrigin&&!this.excludeNewrelicHeader()||!e.sameOrigin&&this.isAllowedOrigin(e)&&this.useNewrelicHeaderForCors())&&(u.newrelicHeader=this.generateTraceHeader(a,s,c,n,i,o)),u}generateTraceContextParentHeader(e,t){return"00-"+t+"-"+e+"-01"}generateTraceContextStateHeader(e,t,r,n,i){return i+"@nr=0-1-"+r+"-"+n+"-"+e+"----"+t}generateTraceHeader(e,t,r,n,i,o){if(!("function"==typeof c._A?.btoa))return null;var a={v:[0,1],d:{ty:"Browser",ac:n,ap:i,id:e,tr:t,ti:r}};return o&&n!==o&&(a.d.tk=o),btoa((0,D.P)(a))}shouldGenerateTrace(e){return this.isDtEnabled()&&this.isAllowedOrigin(e)}isAllowedOrigin(e){var r=!1,n={};if((0,t.Mt)(this.agentIdentifier,"distributed_tracing")&&(n=(0,t.P_)(this.agentIdentifier).distributed_tracing),e.sameOrigin)r=!0;else if(n.allowed_origins instanceof Array)for(var i=0;i 2&&void 0!==arguments[2])||arguments[2];super(r,n,Z.t,i),(0,t.OP)(r).xhrWrappable&&(this.dt=new W(r),this.handler=(e,t,r,n)=>(0,s.p)(e,t,r,n,this.ee),(0,k.u5)(this.ee),(0,k.Kf)(this.ee),function(r,n,i,o){function a(e){var t=this;t.totalCbs=0,t.called=0,t.cbTime=0,t.end=E,t.ended=!1,t.xhrGuids={},t.lastSize=null,t.loadCaptureCalled=!1,t.params=this.params||{},t.metrics=this.metrics||{},e.addEventListener("load",(function(r){_(t,e)}),(0,O.m$)(!1)),c.IF||e.addEventListener("progress",(function(e){t.lastSize=e.loaded}),(0,O.m$)(!1))}function s(e){this.params={method:e[0]},T(this,e[1]),this.metrics={}}function u(e,n){var i=(0,t.DL)(r);i.xpid&&this.sameOrigin&&n.setRequestHeader("X-NewRelic-ID",i.xpid);var a=o.generateTracePayload(this.parsedOrigin);if(a){var s=!1;a.newrelicHeader&&(n.setRequestHeader("newrelic",a.newrelicHeader),s=!0),a.traceContextParentHeader&&(n.setRequestHeader("traceparent",a.traceContextParentHeader),a.traceContextStateHeader&&n.setRequestHeader("tracestate",a.traceContextStateHeader),s=!0),s&&(this.dt=a)}}function d(e,t){var r=this.metrics,i=e[0],o=this;if(r&&i){var a=V(i);a&&(r.txSize=a)}this.startTime=(0,p.z)(),this.listener=function(e){try{"abort"!==e.type||o.loadCaptureCalled||(o.params.aborted=!0),("load"!==e.type||o.called===o.totalCbs&&(o.onloadCalled||"function"!=typeof t.onload)&&"function"==typeof o.end)&&o.end(t)}catch(e){try{n.emit("internal-error",[e])}catch(e){}}};for(var s=0;s 1?e[1]=i:e.push(i)}else e[0]&&e[0].headers&&s(e[0].headers,n)&&(this.dt=n);function s(e,t){var r=!1;return t.newrelicHeader&&(e.set("newrelic",t.newrelicHeader),r=!0),t.traceContextParentHeader&&(e.set("traceparent",t.traceContextParentHeader),t.traceContextStateHeader&&e.set("tracestate",t.traceContextStateHeader),r=!0),r}}function x(e,t){this.params={},this.metrics={},this.startTime=(0,p.z)(),this.dt=t,e.length>=1&&(this.target=e[0]),e.length>=2&&(this.opts=e[1]);var r,n=this.opts||{},i=this.target;"string"==typeof i?r=i:"object"==typeof i&&i instanceof Y?r=i.url:c._A?.URL&&"object"==typeof i&&i instanceof URL&&(r=i.href),T(this,r);var o=(""+(i&&i instanceof Y&&i.method||n.method||"GET")).toUpperCase();this.params.method=o,this.txSize=V(n.body)||0}function A(t,r){var n;this.endTime=(0,p.z)(),this.params||(this.params={}),this.params.status=r?r.status:0,"string"==typeof this.rxSize&&this.rxSize.length>0&&(n=+this.rxSize);var o={txSize:this.txSize,rxSize:n,duration:(0,p.z)()-this.startTime};i("xhr",[this.params,o,this.startTime,this.endTime,"fetch"],this,e.D.ajax)}function E(t){var r=this.params,n=this.metrics;if(!this.ended){this.ended=!0;for(var o=0;o 2&&void 0!==arguments[2])||arguments[2];super(e,t,we.t,r),this.importAggregator()}}new class{constructor(e){let t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:(0,_.ky)(16);c._A?(this.agentIdentifier=t,this.sharedAggregator=new y({agentIdentifier:this.agentIdentifier}),this.features={},this.desiredFeatures=new Set(e.features||[]),this.desiredFeatures.add(m),Object.assign(this,(0,a.j)(this.agentIdentifier,e,e.loaderType||"agent")),this.start()):(0,l.Z)("Failed to initial the agent. Could not determine the runtime environment.")}get config(){return{info:(0,t.C5)(this.agentIdentifier),init:(0,t.P_)(this.agentIdentifier),loader_config:(0,t.DL)(this.agentIdentifier),runtime:(0,t.OP)(this.agentIdentifier)}}start(){const t="features";try{const r=n(this.agentIdentifier),i=[...this.desiredFeatures];i.sort(((t,r)=>e.p[t.featureName]-e.p[r.featureName])),i.forEach((t=>{if(r[t.featureName]||t.featureName===e.D.pageViewEvent){const n=function(t){switch(t){case e.D.ajax:return[e.D.jserrors];case e.D.sessionTrace:return[e.D.ajax,e.D.pageViewEvent];case e.D.sessionReplay:return[e.D.sessionTrace];case e.D.pageViewTiming:return[e.D.pageViewEvent];default:return[]}}(t.featureName);n.every((e=>r[e]))||(0,l.Z)("".concat(t.featureName," is enabled but one or more dependent features has been disabled (").concat((0,D.P)(n),"). This may cause unintended consequences or missing data...")),this.features[t.featureName]=new t(this.agentIdentifier,this.sharedAggregator)}})),(0,T.Qy)(this.agentIdentifier,this.features,t)}catch(e){(0,l.Z)("Failed to initialize all enabled instrument classes (agent aborted) -",e);for(const e in this.features)this.features[e].abortHandler?.();const r=(0,T.fP)();return delete r.initializedAgents[this.agentIdentifier]?.api,delete r.initializedAgents[this.agentIdentifier]?.[t],delete this.sharedAggregator,r.ee?.abort(),delete r.ee?.get(this.agentIdentifier),!1}}}({features:[J,m,S,class extends h{static featureName=oe;constructor(t,r){if(super(t,r,oe,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;const n=this.ee;let i;(0,k.QU)(n),this.eventsEE=(0,k.em)(n),this.eventsEE.on(se,(function(e,t){this.bstStart=(0,p.z)()})),this.eventsEE.on(ae,(function(t,r){(0,s.p)("bst",[t[0],r,this.bstStart,(0,p.z)()],void 0,e.D.sessionTrace,n)})),n.on(ce+ne,(function(e){this.time=(0,p.z)(),this.startPath=location.pathname+location.hash})),n.on(ce+ie,(function(t){(0,s.p)("bstHist",[location.pathname+location.hash,this.startPath,this.time],void 0,e.D.sessionTrace,n)}));try{i=new PerformanceObserver((t=>{const r=t.getEntries();(0,s.p)(te,[r],void 0,e.D.sessionTrace,n)})),i.observe({type:re,buffered:!0})}catch(e){}this.importAggregator({resourceObserver:i})}},C,xe,B,class extends h{static featureName=de;constructor(e,r){if(super(e,r,de,!(arguments.length>2&&void 0!==arguments[2])||arguments[2]),!c.il)return;if(!(0,t.OP)(e).xhrWrappable)return;try{this.removeOnAbort=new AbortController}catch(e){}let n,i=0;const o=this.ee.get("tracer"),a=(0,k._L)(this.ee),s=(0,k.Lg)(this.ee),u=(0,k.BV)(this.ee),d=(0,k.Kf)(this.ee),f=this.ee.get("events"),l=(0,k.u5)(this.ee),h=(0,k.QU)(this.ee),g=(0,k.Gm)(this.ee);function m(e,t){h.emit("newURL",[""+window.location,t])}function v(){i++,n=window.location.hash,this[ve]=(0,p.z)()}function b(){i--,window.location.hash!==n&&m(0,!0);var e=(0,p.z)();this[pe]=~~this[pe]+e-this[ve],this[ye]=e}function y(e,t){e.on(t,(function(){this[t]=(0,p.z)()}))}this.ee.on(ve,v),s.on(be,v),a.on(be,v),this.ee.on(ye,b),s.on(ge,b),a.on(ge,b),this.ee.buffer([ve,ye,"xhr-resolved"],this.featureName),f.buffer([ve],this.featureName),u.buffer(["setTimeout"+le,"clearTimeout"+fe,ve],this.featureName),d.buffer([ve,"new-xhr","send-xhr"+fe],this.featureName),l.buffer([me+fe,me+"-done",me+he+fe,me+he+le],this.featureName),h.buffer(["newURL"],this.featureName),g.buffer([ve],this.featureName),s.buffer(["propagate",be,ge,"executor-err","resolve"+fe],this.featureName),o.buffer([ve,"no-"+ve],this.featureName),a.buffer(["new-jsonp","cb-start","jsonp-error","jsonp-end"],this.featureName),y(l,me+fe),y(l,me+"-done"),y(a,"new-jsonp"),y(a,"jsonp-end"),y(a,"cb-start"),h.on("pushState-end",m),h.on("replaceState-end",m),window.addEventListener("hashchange",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("load",m,(0,O.m$)(!0,this.removeOnAbort?.signal)),window.addEventListener("popstate",(function(){m(0,i>1)}),(0,O.m$)(!0,this.removeOnAbort?.signal)),this.abortHandler=this.#e,this.importAggregator()}#e(){this.removeOnAbort?.abort(),this.abortHandler=void 0}}],loaderType:"spa"})})(),window.NRBA=o})(); window.jQuery || document.write(' ') CKEDITOR_BASEPATH='https://f1000research.com/js/vendor/ckeditor/' window.reactTheme = 'research'; window.MathJax = { CommonHTML: { linebreaks: { automatic: true } }, 'HTML-CSS': { linebreaks: { automatic: true } }, SVG: { linebreaks: { automatic: true } }, AuthorInit: function() { MathJax.Hub.Register.MessageHook('End Process', function () { let timeout = false; // holder for timeout id const delay = 250; // delay after event is "complete" to run callback const reflowMath = function() { const dispFormulas = document.querySelectorAll('.disp-formula.panel'); if (!dispFormulas) { return; } for (const dispFormula of dispFormulas) { const child = dispFormula.querySelector('.MathJax_Preview').nextSibling.firstChild; const isMultiline = MathJax.Hub.getAllJax(dispFormula)[0].root.isMultiline; if (dispFormula.offsetWidth < child.offsetWidth || isMultiline) { MathJax.Hub.Queue(['Rerender', MathJax.Hub, dispFormula]); } } }; window.addEventListener('resize', function() { clearTimeout(timeout); // clear the timeout timeout = setTimeout(reflowMath, delay); // start timing for event "completion" }); }); }, }; if (window.location.hash == '#_=_'){ window.location = window.location.href.split('#')[0] } !function(f,b,e,v,n,t,s){if(f.fbq)return;n=f.fbq=function() {n.callMethod? n.callMethod.apply(n,arguments):n.queue.push(arguments)} ;if(!f._fbq)f._fbq=n; n.push=n;n.loaded=!0;n.version='2.0';n.queue=[];t=b.createElement(e);t.async=!0; t.src=v;s=b.getElementsByTagName(e)[0];s.parentNode.insertBefore(t,s)}(window, document,'script','https://connect.facebook.net/en_US/fbevents.js'); fbq('init', '1641728616063202'); fbq('track', "PixelInitialized", {}); (function(h,o,t,j,a,r){ h.hj=h.hj||function(){(h.hj.q=h.hj.q||[]).push(arguments)}; h._hjSettings={hjid:2318163,hjsv:6}; a=o.getElementsByTagName('head')[0]; r=o.createElement('script');r.async=1; r.src=t+h._hjSettings.hjid+j+h._hjSettings.hjsv; a.appendChild(r); })(window,document,'https://static.hotjar.com/c/hotjar-','.js?sv='); search file_upload Submit your research search menu close search Browse Gateways & Collections How to Publish Submit your Research My Submissions Article Guidelines Article Guidelines (New Versions) Open Data, Software and Code Guidelines Open Data and Accessible Source Materials Guidelines (HSS) Open Data, Software and Code Guidelines (PSE) Prepublication Checks Production Process Posters and Slides Guidelines Document Guidelines Article Processing Charges Peer Review Finding Article Reviewers About How it Works For Reviewers Our Advisors Policies Glossary FAQs For Developers Newsroom Contact My Research Submissions Content and Tracking Alerts My Details Sign In file_upload Submit your research { "@context": "https://schema.org", "@type": "ScholarlyArticle", "mainEntityOfPage": { "@type": "WebPage", "@id": "https://f1000research.com/articles/13-1073" }, "headline": "A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation", "datePublished": "2024-09-19T15:47:04", "dateModified": "2025-04-07T10:09:21", "author": [ { "@type": "Person", "name": "Neha Majhi" }, { "@type": "Person", "name": "Rajashree Mishra" } ], "publisher": { "@type": "Organization", "name": "F1000Research", "logo": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 480, "width": 60 } }, "image": { "@type": "ImageObject", "url": "https://f1000research.com/img/AMP/F1000Research_image.png", "height": 1200, "width": 150 }, "description": " Background Traditional optimization methods often struggle to balance global exploration and local refinement, particularly in complex real-world problems. To address this challenge, we introduce a novel hybrid optimization strategy that integrates the Nelder-Mead (NM) technique and the Genetic Algorithm (GA), named the Genetic and Nelder-Mead Algorithm (GANMA). This hybrid approach aims to enhance performance across various benchmark functions and parameter estimation tasks. Methods GANMA combines the global search capabilities of GA with the local refinement strength of NM. It is first tested on 15 benchmark functions commonly used to evaluate optimization strategies. The effectiveness of GANMA is also demonstrated through its application to parameter estimation problems, showcasing its practical utility in real-world scenarios. Results GANMA outperforms traditional optimization methods in terms of robustness, convergence speed, and solution quality. The hybrid algorithm excels across different function landscapes, including those with high dimensionality and multimodality, which are often encountered in real-world optimization issues. Additionally, GANMA improves model accuracy and interpretability in parameter estimation tasks, enhancing both model fitting and prediction. Conclusions GANMA proves to be a flexible and powerful optimization method suitable for both benchmark optimization and real-world parameter estimation challenges. Its capability to efficiently explore parameter spaces and refine solutions makes it a promising tool for scientific, engineering, and economic applications. GANMA offers a valuable solution for improving model performance and effectively handling complex optimization problems. " } { "@context": "http://schema.org", "@type": "BreadcrumbList", "itemListElement": [ { "@type": "ListItem", "position": "1", "item": { "@id": "https://f1000research.com/", "name": "Home" } }, { "@type": "ListItem", "position": "2", "item": { "@id": "https://f1000research.com/browse/articles", "name": "Browse" } }, { "@type": "ListItem", "position": "3", "item": { "@id": "https://f1000research.com/articles/13-1073", "name": "A novel hybrid genetic algorithm and Nelder-Mead approach and it’s..." } } ] } Home Browse A novel hybrid genetic algorithm and Nelder-Mead approach and it’s... ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Majhi N and Mishra R. A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.12688/f1000research.154598.3 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. Close Copy Citation Details Export Export Citation Sciwheel EndNote Ref. Manager Bibtex ProCite Sente EXPORT Select a format first Track Share ▬ ✚ Research Article Revised A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] Neha Majhi 1 , Rajashree Mishra https://orcid.org/0009-0007-5711-1704 1 Neha Majhi 1 , Rajashree Mishra https://orcid.org/0009-0007-5711-1704 1 PUBLISHED 07 Apr 2025 Author details Author details 1 Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, Odisha, 751024, India Neha Majhi Roles: Conceptualization, Writing – Original Draft Preparation Rajashree Mishra Roles: Methodology, Writing – Review & Editing OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the Artificial Intelligence and Machine Learning gateway. Abstract Background Traditional optimization methods often struggle to balance global exploration and local refinement, particularly in complex real-world problems. To address this challenge, we introduce a novel hybrid optimization strategy that integrates the Nelder-Mead (NM) technique and the Genetic Algorithm (GA), named the Genetic and Nelder-Mead Algorithm (GANMA). This hybrid approach aims to enhance performance across various benchmark functions and parameter estimation tasks. Methods GANMA combines the global search capabilities of GA with the local refinement strength of NM. It is first tested on 15 benchmark functions commonly used to evaluate optimization strategies. The effectiveness of GANMA is also demonstrated through its application to parameter estimation problems, showcasing its practical utility in real-world scenarios. Results GANMA outperforms traditional optimization methods in terms of robustness, convergence speed, and solution quality. The hybrid algorithm excels across different function landscapes, including those with high dimensionality and multimodality, which are often encountered in real-world optimization issues. Additionally, GANMA improves model accuracy and interpretability in parameter estimation tasks, enhancing both model fitting and prediction. Conclusions GANMA proves to be a flexible and powerful optimization method suitable for both benchmark optimization and real-world parameter estimation challenges. Its capability to efficiently explore parameter spaces and refine solutions makes it a promising tool for scientific, engineering, and economic applications. GANMA offers a valuable solution for improving model performance and effectively handling complex optimization problems. READ ALL READ LESS Keywords Genetic Algorithm, Maximum Likelihood Estimation, Nelder-Mead algorithm, Power Density, Weibull Distribution, Wind speed analysis Corresponding Author(s) Rajashree Mishra ( [email protected] ) Close Corresponding author: Rajashree Mishra Competing interests: No competing interests were disclosed. Grant information: Kalinga Institute of Industrial Technology The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Copyright: © 2025 Majhi N and Mishra R. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. How to cite: Majhi N and Mishra R. A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.12688/f1000research.154598.3 ) First published: 19 Sep 2024, 13 :1073 ( https://doi.org/10.12688/f1000research.154598.1 ) Latest published: 07 Apr 2025, 13 :1073 ( https://doi.org/10.12688/f1000research.154598.3 ) Revised Amendments from Version 2 We have included some references as per the suggestions of reviewers 1 and 2, in the reference section. We have included some references as per the suggestions of reviewers 1 and 2, in the reference section. See the authors' detailed response to the review by El-ghalia Boudissa and HABBI FATIHA See the authors' detailed response to the review by Olympia Roeva READ REVIEWER RESPONSES 1. Introduction In the continuous pursuit of optimization, where achieving the finest possible outcomes with utmost efficiency and accuracy is crucial, the fusion of diverse methodologies frequently yields superior solutions. Optimization algorithms are always looking for ways to improve efficiency and robustness, encouraging professionals and scholars to investigate novel ideas that happen to be mostly inspired by nature or mathematical concepts. Hybridization in optimization algorithms has garnered significant attention in recent years, offering a potent means to enhance efficacy and efficiency. Among these methodologies, Genetic Algorithms (GA) and the Nelder-Mead Simplex Algorithm (NM) emerge as prominent contenders, each boasting distinct advantages and applications. However, the fusion of these theories has recently proven to be an enticing strategy for enhancing optimization capabilities across various domains. Inspired by evolution and natural selection, genetic algorithms operate by repeatedly developing a population of potential solutions over a series of generations. The concepts of genetic recombination and survival of the fittest are collectively mirrored by the selection, crossover, and mutation operators involved in this evolutionary process. GAs are a popular choice in various industries, including engineering, finance, and biology, because of their impressive effectiveness in solving complicated, high-dimensional optimization problems with non-linear and multimodal objective functions. The Nelder-Mead Simplex Algorithm, on the other hand, provides a geometric method for repeatedly refining a simplex—a multi-dimensional geometric shape in the direction of the ideal solution. Its foundation is mathematical optimization. Nelder- Mead algorithms are especially well-suited for problems with few variables or smooth objective functions because, in contrast to GAs, which rely on a population-based approach, they operate on a single point or simplex at each iteration. Due to its ease of use, simplicity, and speedy convergence to local optima, it now has a deserving place within the optimization toolbox. Genetic Algorithm (GA) based hybrids have emerged as powerful tools for optimization, combining GA’s global search capabilities with the local refinement strengths of other algorithms. These hybrids balance exploration and exploitation, allowing for efficient navigation of complex, high-dimensional search spaces. However, they are not without limitations. Challenges such as slow convergence rates, parameter sensitivity, and computational overhead remain prevalent. Furthermore, many existing studies lack comprehensive comparisons of hybrid methodologies and fail to explore their scalability and adaptability to diverse optimization problems. Gaps also persist in understanding the interplay between exploration and exploitation in these hybrids, leaving room for novel approaches that address these issues. Overview of Recent GA Hybrids Genetic Algorithm (GA) based hybrid approaches have become a cornerstone in modern optimization research, combining GA’s global exploration abilities with various techniques to enhance local refinement. The following highlights some key advancements: 1. GA-Nelder–Mead (GA-NM): 1 • Methodology: Integrates GA for its broad search capabilities with the Nelder–Mead (NM) simplex algorithm, which excels in refining solutions locally. • Strengths: Offers improved convergence speeds and precision in parameter estimation, effectively balancing exploration and exploitation. • Weaknesses: Struggles with scalability in higher dimensions and demands careful tuning of parameters for optimal performance. 2. GA-Harris Hawks Optimization (GA-HHO): 2 • Methodology: Combines GA’s exploration strength with the Harris Hawks Optimization (HHO) method for exploiting promising regions. • Strengths: Demonstrates exceptional performance in handling complex, multimodal optimization problems. • Weaknesses: Computational demands increase significantly, and parameter sensitivity can affect robustness. 3. Real-Value Genetic Algorithm and Extended Nelder–Mead (RVGA- ENM): 3 • Methodology: Employs RVGA for global searches and the Extended Nelder–Mead (ENM) algorithm for refining solutions, specifically applied to energy demand forecasting. • Strengths: Achieves superior accuracy in predictions and effective refinement of solutions. • Weaknesses: Highly reliant on the quality of the initial population and available training data. 4. GA-Tabu Search (GA-TS): 4 • Methodology: Utilizes GA for broad search capabilities and Tabu Search (TS) for local optimization, designed for maintenance scheduling in cogeneration plants. • Strengths: Efficiently handles scheduling challenges in complex systems. • Weaknesses: Suffers from significant computational overhead as the problem size grows. 5. GA-Machine Learning (GA-ML): 5 • Methodology: Integrates GA with machine learning (ML) models to optimize graph-related problems. • Strengths: Provides adaptability and enhanced performance through insights derived from ML techniques. • Weaknesses: Complexity increases due to the integration of ML, leading to greater computational requirements. 6. Harris Hawks-Nelder–Mead (HH-NM): 6 • Methodology: Combines HHO and NM for tackling optimization in design and manufacturing scenarios. • Strengths: Demonstrates strong convergence performance and resilience in solving intricate problems. • Weaknesses: Requires fine-tuned parameter adjustments to maintain consistency. 7. GA-Artificial Neural Network (GA-ANN): 7 • Methodology: Couples GA with Artificial Neural Networks (ANNs) for optimizing process parameters, particularly in plastic injection molding. • Strengths: Effectively enhances manufacturing quality and process efficiency. • Weaknesses: Dependence on ANN training data can limit its applicability to diverse scenarios. 8. GA-Simulated Annealing (GA-SA): 8 • Methodology: Merges GA’s exploratory capabilities with Simulated Annealing’s (SA) temperature-based refinement strategy. • Strengths: Efficiently escapes local optima and maintains diversity in the search process. • Weaknesses: Computational costs are high, with slower convergence for high-dimensional tasks. 9. GA-Particle Swarm Optimization (GA-PSO): 9 • Methodology: Combines GA’s global exploration with Particle Swarm Optimization (PSO) for exploiting solutions. • Strengths: Performs exceptionally well in multimodal optimization landscapes. • Weaknesses: Risks stagnation in local optima if not equipped with adaptive mechanisms. 10. GA-Nelder-Mead (GA-NM): 10 • Methodology: Utilizes the NM simplex method within GA to enhance solution precision in smooth, low-dimensional problems. • Strengths: Improves optimization precision through effective local refinement. • Weaknesses: Faces challenges in scalability and requires precise parameter settings. These developments illustrate the versatility and potential of GA hybrids in addressing a range of optimization challenges while emphasizing the need for careful parameter tuning and scalability enhancements. GANMA builds on this foundation by offering a structured, robust framework that addresses existing limitations. Despite advancements in hybrid optimization algorithms, several key challenges persist. Many studies lack comprehensive comparisons, failing to evaluate scalability, convergence, and adaptability across diverse tasks. Additionally, the balance between global exploration and local exploitation remains under-explored, limiting efficiency in finding optimal solutions. Scalability issues are prominent, as many hybrids falter in high-dimensional problems, highlighting the need for robust methods capable of maintaining performance in complex spaces. Parameter sensitivity is another hurdle, with insufficient adaptive tuning mechanisms leading to inconsistent results. Furthermore, validation is often restricted to benchmark functions, offering limited insight into real world applicability where constraints and objectives are more complex. These gaps emphasize the need for innovative hybrids that address these issues while ensuring efficiency, scalability, and practical relevance. Individually, both GA and NM have strengths and limits that make them appropriate for specific optimization scenarios. GA excels in global exploration, utilizing population variety to explore large solution spaces and avoid local optima. On the other hand, NM excels at local refinement, expertly traversing convex and smooth terrain to locate specific optima. The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, at which NMA excels. This synergy improves the algorithm’s convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. The GANMA method effectively addresses these gaps through its innovative design and balanced approach. By seamlessly integrating Genetic Algorithm (GA) and Nelder-Mead Algorithm (NM), GANMA achieves a robust balance between global exploration and local exploitation, enhancing its efficiency in diverse optimization tasks. Its structured framework allows for improved scalability, maintaining performance even in high-dimensional problem spaces. Additionally, GANMA incorporates adaptive mechanisms for parameter tuning, reducing sensitivity and ensuring consistent results across various scenarios. Unlike many existing hybrids, GANMA has been rigorously tested on both benchmark functions and real-world parameter estimation tasks, demonstrating its adaptability and robustness. These features position GANMA as a superior hybrid optimization method, addressing the limitations of existing approaches while offering practical solutions for complex, multidimensional challenges. Many industries are interested in using the Nelder-Mead Simplex Algorithm (NM) working together with Genetic Algorithms (GA), including bio-informatics, 11 finance, 12 , 13 and engineering. 14 , 15 Combining these methods provides a potent method of resolving challenging optimization issues in engineering, where designs are complicated and rules are demanding. Combining GA with NM helps improve portfolio management and risk assessment in the financial industry, where on-time and correct choices are essential. Similarly, hybrid algorithms speed up tasks like genomic analysis and drug discovery 16 , 17 in bio-informatics, where understanding biology relies on smart computer methods. This article explores how combining NM and GA enhances both, highlighting how they work together to solve real-world issues. This paper has tested the GANMA algorithm on fifteen benchmark problems in three dimensions (10, 20, and 30). According to the results from the experiment, the suggested GANMA algorithm is a promising one that can quickly find the best or almost the best solution for most of the functions examined. The remaining portion of the research study is structured as follows: Section 2 provides the fundamentals of the Genetic Algorithm and the Nelder-Mead simplex search. Section 3 discusses the proposed hybridized method, benchmark functions, and an alternative hybridization approach. The parameter setup for all methods and computational configurations are detailed in Section 4 . Section 5 presents the results and discussion for benchmark functions, while Section 6 focuses on the Weibull distribution. Parameter estimation methods are described in Section 7 , and Section 8 provides an analysis of Monte Carlo simulations and results. Two real-world wind speed datasets are analyzed in Section 9 to demonstrate the effectiveness of the proposed technique. Finally, Section 10 concludes the study with key observations. 2. Overview of GA, and NM A brief overview of GA, and NM have been described below. 2.1 Real-Coded Genetic Algorithm (GA) Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. So, we can say that GA is an approach to heuristic search. The ideas of the biological evolution of species serve as its inspiration. In contrast to traditional optimization methods, GA 11 , 18 starts with a collection of starting solutions known as chromosomes. Genetic algorithms (GAs) work by continually improving solutions based on their fitness, which measures how well they solve a problem. Unlike some traditional methods, GAs don’t assume anything about the problem, like whether it’s smooth or has just one best solution. Instead, they explore different possibilities to find good solutions, even in complex situations where there might be many equally good answers. GAs have been used successfully in many difficult optimization problems. They often work better than traditional methods, especially when there are multiple equally good solutions. This flexibility and ability to handle complex situations make GA a valuable tool for solving optimization problems in various fields. Following is a summary of the GA stages in this study: I. Initialization: • First, create a vector of real values for each variable between predefined ranges. This vector will represent the initial population of individuals. II. Evaluation: • Evaluate the fitness of each individual using an objective function. III. Selection: • Select individuals from the population to create a mating pool based on their fitness values. IV. Crossover (Recombination): • Pair selected individuals and perform crossover to create offspring by blending or combining their real values. V. Mutation: • Introduce random changes to the real values of offspring to promote exploration of the search space. VI. Combining Populations: • Combine the offspring generated from crossover and mutation with the initial population. VII. Sorting: • The combined population is sorted based on their fitness levels, with the most fit people having the lowest fitness values. VIII. Elitism: • Keep only the top half of the sorted population, discarding the bottom half. This ensures that the best-performing individuals from the previous generation are preserved for the next generation. IX. Termination: • Steps 2 through Step 8 should be repeated for the designated number of generations or until a termination criterion—such as achieving a maximum number of iterations or reaching a certain fitness level is satisfied. This approach with elitism helps maintain diversity in the population while ensuring that the best individuals are preserved across generations, ultimately leading to the discovery of better solutions in the optimization process. Real-coded genetic algorithms are suitable for optimization problems with continuous decision variables and offer advantages such as direct representation of real-valued solutions, robustness, and ability to handle high-dimensional search spaces. 2.2 Nelder–Mead Simplex Search Method (NM) The simplex search technique has been widely used for basic unconstrained minimization problems, such as nonlinear least squares, nonlinear simultaneous equations, and general function minimization. 19 Originally proposed by Spendley, Hext, and Himsworth (1962), 20 the method was later refined by Nelder and Mead (1965) 21 to improve its efficiency and applicability. The Nelder-Mead Algorithm (NMA) is selected for its simplicity and effectiveness in local solution refinement, making it a strong complement to the Genetic Algorithm’s (GA) global search capabilities. While a variety of optimization algorithms exist, NMA’s low computational overhead and reliability in small-dimensional spaces make it an efficient and practical choice for hybridization. However, NMA’s reliance on simplex geometry and localized operations restricts its exploratory capacity, often causing it to converge prematurely to local optima in complex, multi-modal landscapes. Preliminary experiments (to be included) under these limitations highlight the necessity of GA’s global search to overcome such challenges. The steps of the Nelder-Mead 21 , 22 algorithm are summarized in as follows: I. Initialization: • A simplex is a collection of n + 1 vertices in a n dimensional space. These vertices can be deliberately selected or created at random. • At every simplex vertex, evaluate the objective of the function. II. Ordering: • Order the vertices based on their corresponding function values. • Let x 1 , x 2 , …, x n +1 denote the vertices such that f ( x 1 ) ≤ f ( x 2 ) ≤ … ≤ f ( x n +1 ). III. Centroid: • Calculate the centroid of each vertex, except the worst (highest) one: (1) x centroid = 1 n ∑ i = 1 n x i IV. Reflection: • Reflect the worst vertex (highest) through the centroid to obtain a trial point (2) x r = x centroid + α ( x centroid − x n + 1 ) where α is a reflection coefficient, typically set to 1 • Evaluate the objective function at x r . V. Expansion: • Expanding further should be considered if the reflected point x e is superior to the second-worst vertex: (3) x e = x centroid + γ ( x r − x centroid ) where γ is an expansion coefficient, usually γ > 1 • Evaluate the objective function at x e . VI. Contraction: • Contraction should be done if the reflected point x r is worse than the worst vertex: – Outside contraction: (4) x c = x centroid + ρ ( x r − x centroid ) – Inside contraction: (5) x c = x centroid + σ ( x centroid − x r ) where ρ is a contraction coefficient, typically 0 < ρ, σ < 1 (typically 0.5). • Evaluate the objective function at x c . VII. Update simplex: • Replace the worst vertex with the new trial point if it improves the function value. VIII. Termination: • Till a termination criterion such as a maximum number of iterations, a small modification in step size, or a slight modification in the function value is satisfied, repeat the steps described above. The algorithm converges when the simplex becomes sufficiently small or when the function values at the vertices are close to each other. The choice of parameters α , γ , and ρ can significantly affect the performance of the algorithm and may need to be tuned based on the problem characteristics. 3. Methods 3.1 Motivation The combination of Genetic Algorithms (GA) with the Nelder-Mead simplex algorithm (NM) is driven by their supportive characteristics in both global exploration and local exploitation. GA is a population-based technique that effectively explores diverse sections of the search space, although fine-tuning solutions at local optima may provide issues. In contrast, it requires greater capacity for worldwide investigation. Combining both methods intends to take advantage of the characteristics of both algorithms, resulting in a more balanced and efficient optimization process. This hybridization method has the potential to improve convergence rates, solution quality, and robustness, making it a compelling choice for handling complicated optimization problems across several domains. 3.2 Genetic algorithm with Nelder-Mead Simplex Search (GANMA) The suggested algorithm’s (GANMA) stages are summed up as follows: I. Initialization: • Generate an initial population of solutions for the GA. II. Evaluation: • Analyze each solution’s objective function within the population. III. Genetic Algorithm (GA) Cycle: • Selection: Select a parent from the current population. Selection techniques that are often used include rank-based, roulette wheel, and tournament selection. • Crossover: Perform crossover to create offspring solutions. Since this is a real coded GA, a common method is the arithmetic crossover or simulated binary crossover. • Mutation: Apply mutation operators to the offspring solutions. Here is where the Nelder-Mead simplex algorithm comes into play. After mutation, the simplex is formed around the mutated solutions. • Elitism: Combine the initial population and offspring after mutation, then calculate the mean combination. Sort the combined population according to their fitness and keep the first half population while rejecting the other half. • Replacement: Replace the initial population with the best half from the previous step. IV. Nelder-Mead Simplex Algorithm: • Define the simplex for the NM algorithm. This can be done by selecting a set of initial points around the best solution found by the GA so far. (The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA’s exploration strength, as demonstrated in our results section.) • Reflection: Take the centroid of the remaining points and reflect the worst point of the simplex. • Expansion: Attempt to extend the simplex in that direction if the reflected point is superior to the second-worst but not superior to the greatest. • Contraction: If neither reflection nor expansion produces a better point, contract the simplex towards the best point. • Update the simplex based on the chosen operation (reflection, expansion, contraction, or shrinkage). • Repeat the above steps until convergence criteria are met. V. Termination: • Repeat the GA cycle and NM algorithm until a termination criterion is satisfied. This could be a maximum number of iterations, reaching a specific fitness threshold, or convergence of the simplex. VI. Output: • The best solution found after the termination criterion is met. • Apply the Nelder-Mead simplex algorithm to the best solution. VII. Optimal: • The best solution found after the NM algorithm. NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. By combining GA with NM in this way, you leverage the GA’s global exploration capability with the NM’s local refinement ability, potentially leading to improved convergence and robustness in optimization tasks. GANMA stands out as a versatile hybrid algorithm capable of addressing a wide range of optimization problems, transcending the domain-specific focus of many existing hybrids. Its well-balanced framework effectively combines the global search power of Genetic Algorithms (GA) with the local refinement precision of the Nelder-Mead Algorithm (NMA), ensuring scalability, robustness, and efficiency. This synergy enables GANMA to overcome common challenges, such as parameter sensitivity and poor performance in high-dimensional or multimodal landscapes. Furthermore, GANMA’s structured approach is rigorously validated, making it a reliable solution for both theoretical benchmark functions and complex real-world applications. The pseudo-code for the hybridization of the GA and Nelder-Mead simplex algorithm is presented in Algorithm 1 . Algorithm 1. Combination of GA and Nelder-Mead. 1: Initialize GA parameters (size of population, rate of mutation, rate of crossover, number of generations) 2: Initial population 3: while termination condition is not met do 4: Evaluate each individual’s current level of fitness 5: Select parents (using tournament selection) for crossover 6: for each pair of parents do 7: Apply one-point crossover 8: Apply uniform mutation 9: end for 10: Combine initial population with offspring 11: Evaluate the fitness of the combined population 12: Sort the combined population by fitness 13: Keep the top half of the sorted population 14: Create a simplex from the best individuals (e.g., top 2) 15: Perform Nelder-Mead steps on the simplex: 16: - Reflection 17: - Expansion 18: - Contraction 19: - Shrink 20: Update the simplex 21: Replace the worst individuals with the simplex’s best individuals 22: Evaluate the fitness of the updated population 23: end while 24: From the final population, choose the best solution 25: Perform Nelder-Mead steps on the best solution 26: Find the optimal solution The detailed flow diagram of the proposed algorithm is shown in Figure 1 . Figure 1. Flow-chart of GANMA. 3.3 Hybrid Genetic Algorithm with Nelder-Mead (GA-NMA) Here is an algorithm that combines a Genetic Algorithm (GA) with the Nelder-Mead Algorithm (NMA), where the GA first locates the interval containing the global minimum, and NMA refines the solution: I. Initialize GA Population Generate an initial population of candidate solutions. Define the fitness function for evaluation. II. Apply GA Operations Selection: Choose individuals based on their fitness. Crossover: Combine pairs of individuals to produce offspring. Mutation: Introduce random variations to maintain diversity. III. Evaluate the Population Compute the fitness of each individual. IV. Iterate GA Process Repeat the selection, crossover, mutation, and evaluation steps for a predefined number of generations or until convergence criteria are met. V. Identify Promising Interval Extract the best individual(s) from the final GA population. Define the search interval around the best individual to locate the global minimum. VI. Initialize NMA Use the best solution from GA as the starting point for NMA. Construct an initial simplex based on the chosen starting point. VII. Apply NMA Iteratively refine the solution using simplex operations (reflection, expansion, contraction, and shrinkage). Stop when the termination criteria (e.g., small simplex size or convergence) are met. VIII. Output Final Solution Return the refined solution as the global minimum estimate. The pseudo-code for the hybridization of the GA and Nelder-Mead simplex algorithm is presented in Algorithm 2 . Algorithm 2. Hybrid GA-NMA Algorithm. 1: Initialize GA Population: Generate an initial population of candidate solutions. Define the fitness function for evaluation. 2: while stopping criteria are not met do 3: Selection: Choose individuals based on their fitness. 4: Crossover: Combine pairs of individuals to produce offspring. 5: Mutation: Introduce random variations to maintain diversity. 6: Evaluate Population: Compute the fitness of each individual. 7: end while 8: Identify Promising Interval: Extract the best individual(s) from the final GA population and define the search interval around the best individual. 9: Initialize NMA: Use the best solution from GA as the starting point. Construct an initial simplex based on this starting point. 10: repeat 11: Apply Simplex Operations: Perform reflection, expansion, contraction, and shrinkage steps. 12: until termination criteria are met (e.g., small simplex size or convergence) 13: Output Final Solution: Return the refined solution as the global minimum estimate. 3.4 Benchmark functions This study analyzes 15 benchmark test functions for simulation tests to fully investigate the feasibility as well as the effectiveness of GANMA. The 15 benchmark test functions (denoted as f 1 to f 15 ), cover different types. The unimodal functions (A function with a single peak or trough, making it straightforward to locate the global optimum) f 1 through f 4 are included in the first kind. Multimodal functions (A function with multiple peaks or troughs, presenting challenges in finding the global optimum due to local optima) f 5 through f 9 are included in the second category. Shifted unimodal and multimodal functions (Shifted Unimodal Function: an unimodal function whose peak or trough is relocated to a different position in the search space. Shifted Multimodal Function: A multimodal function with its peaks or troughs displaced, adding complexity by altering the relative positions of local and global optima), f 10 - f 15 , are included in the third category. Table 1 displays the expressions, ranges, and global minimum values of the 15 test functions. The function’s dimensions (n) are 10, 20, and 30, in that order. Table 1. Benchmark test functions. No Function name Formulation Range f min f 1 Sphere ∑ i = 1 n x i 2 [-100,100] 0 f 2 Rosenbrock ∑ i = 1 n − 1 ( 100 ( x i + 1 − x i 2 ) 2 + ( 1 − x i ) 2 ) [-2,2] 0 f 3 Rotated high-conditioned elliptic ∑ i = 1 n ( 10 6 ) i − 1 n − 1 x i 2 [-100,100] 0 f 4 Ellipsoid ∑ i = 1 n ( i . x i ) 2 [-100,100] 0 f 5 Ackley − 20 exp ( − 0.2 1 n ∑ i = 1 n x i 2 ) − exp ( 1 n ∑ i = 1 n cos ( 2 π x i ) ) + 20 + e [-30,30] 0 f 6 Griewank ∑ i = 1 n x i 2 / 4000 − ∏ i = 1 n cos ( x i i ) + 1 [-600,600] 0 f 7 Rastrigin 10 n + ∑ i = 1 n ( x i 2 − 10 cos ( 2 π x i ) ) [-5,5] 0 f 8 Schwefel 418.9829 n − ∑ i = 1 n x i sin ( | x i | ) [-500,500] 0 f 9 Schwefel 1.2 ∑ i = 1 n | x i | [-5,5] 0 f 10 Shifted Sphere ∑ i = 1 n ( x i − Ο i ) 2 [-100,100] 0 f 11 Shifted Elliptic ∑ i = 1 n ( 10 6 ) i − 1 n − 1 ( x i − Ο i ) 2 [-100,100] 0 f 12 Shifted Rosenbrock ∑ i = 1 n − 1 ( 100 ( x i + 1 − x i 2 ) 2 + ( x i − Ο i ) 2 ) [-30,30] 0 f 13 Shifted Rastrigin ∑ i = 1 n [ ( x i − Ο i ) 2 − 10 cos ( 2 π ( x i − Ο i ) ) ] [-5,5] 0 f 14 Shifted Griewank 1 4000 ∑ i = 1 n ( x i − Ο i ) 2 − ∏ i = 1 n cos ( x i − Ο i i ) + 1 [-600,600] 0 f 15 Shifted Ackley − 20 exp ( − 0.2 1 n ∑ i = 1 n ( x i − Ο i ) 2 ) − exp ( 1 n ∑ i = 1 n cos ( 2 π ( x i − Ο i ) ) ) + 20 + e [-30,30] 0 4. Parameter setup 4.1 Genetic Algorithm (GA) Parameters For problem dimensions 10, 20, and 30, the Genetic Algorithm (GA) was executed for 300, 400, and 600 generations, respectively, starting with a population of 100 individuals. Eighty percent of the population had a one-point crossover, which translates to a crossover rate of 0.8. With a mutation rate of 0.05, random mutation was employed. With a tournament size of five, parents were selected by tournament selection, and the top 10 percent of each generation’s top performers were preserved through an elitism technique. 4.2 Nelder-Mead Algorithm (NM) Parameters The Nelder-Mead (NM) algorithm was initialized using the solutions provided by the GA. Standard transformation coefficients were applied, including a reflection coefficient ( α ) of 1, an expansion coefficient ( γ ) of 1.5, and both contraction ( ρ ) and shrinkage ( σ ) coefficients set to 0.5. The step size was maintained at 1.0. The algorithm’s simplex shrinking process concluded when the convergence tolerance reached 10 − 6 . 4.3 Hybrid Algorithm (GANMA) Settings The hybrid process iterated through GA and NMA stages for 300, 400, and 600 generations for 10, 20, and 30 dimensions respectively. The stopping criteria were based on either the maximum number of iterations or fitness convergence, defined by a fitness tolerance of ϵ = 10 − 5 , ensuring early detection of optimal solutions. Table 1 displays the expressions, dimensions, ranges, and global minimum values of the fifteen benchmark test functions (denoted as f 1 - f 15 ). 4.4 Computational Environment The experiments were conducted in a consistent computational environment using Python 3.11. The hybrid GANMA algorithm was implemented from scratch, leveraging key Python libraries. NumPy handled arrays and matrix operations, Matplotlib was used for visualizing convergence and results, and SciPy supported NMA-based optimization. All tests were executed in a Jupyter Notebook environment to allow for easy experimentation and tuning. Each experiment was repeated 50 times to ensure statistical reliability. Table 2 demonstrates how the performance of the GANMA, GA, and NM algorithms for dimensions (n) 10, 20, and 30 have been evaluated by comparing the mean value (Mean), standard deviation (Std), and best value (Best) of the final solutions for each benchmark function throughout 30 trials. The algorithm achieves the best optimization performance with the least standard deviation, optimal value, and average value closer to the theoretical ideal value. Any value less than 10 − 6 in terms of mean, standard deviation, and best value will be regarded as zero. The ideal experimental outcomes are truncated. Table 2. For n = 10, 20, and 30, the best, mean, and standard deviation of the GANMA, GA, and NM solutions. Fun Method n = 10 Best Mean Std n = 20 Best Mean Std n = 30 Best Mean Std f 1 GANMA 3.92E-278 1.01E-235 0.00E+00 4.62E-52 1.10E-45 3.30E-45 1.09E-20 4.10E-17 1.10E-16 GA-NMA 1.24E-201 1.95E-184 0.00E+00 4.24E-49 2.97E-43 6.64E-43 3.85E-14 1.53E-12 4.03E-12 GA 2.96E-01 8.90E-01 1.39E-02 1.24E+00 3.03E+00 1.45E+00 1.5E+02 2.8E+02 1.0E+02 NM 3.96E-183 6.63E-166 0.00E+00 5.39E-37 2.03E-32 5.48E-32 2.51E-18 7.47E-13 1.11E-12 f 2 GANMA 5.22E-29 1.44E-28 7.60E-29 3.69E-27 6.94E-26 9.75E-26 6.49E-18 1.80E-14 1.85E-14 GA-NMA 6.18E29 4.06E-27 6.02E-27 2.22E-26 8.78E-25 2.11E-24 1.02E-24 8.93E-24 1.49E-23 GA 5.67E+00 6.90E+00 8.78E-01 1.64E+01 1.74E+01 4.81E-01 2.62E+01 4.07E+01 1.63E+01 NM 5.91E-29 2.38E-27 2.31E-27 1.89E-26 2.30E-25 3.20E-25 9.10E-16 1.43E-11 2.60E-11 f 3 GANMA 7.88E-243 4.78E-232 0.00E+00 6.93E-49 3.97E-45 1.12E-44 1.58E-16 7.55E-14 1.39E-13 GA-NMA 1.17E-195 1.91E-179 0.00E+00 1.00E-49 7.69E-46 1.57E-45 1.76E-27 2.32E-25 4.67E-25 GA 1.36E+03 5.08E+04 1.03E+04 9.85E+03 5.22E+04 2.93E+04 7.98E+03 2.41E+04 1.00E+04 NM 9.32E-186 4.62E-165 0.00E+00 1.16E+01 1.44E+04 1.14E+04 8.87E+04 9.68E+05 3.88E+05 f 4 GANMA 7.43E-250 6.45E-235 0.00E+00 2.09E-50 5.42E-44 1.57E-43 1.44E-16 3.78E-15 4.98E-15 GA-NMA 9.26E-199 1.10E-186 0.00E+00 4.03E-49 5.47E-45 8.47E-45 9.03E-27 7.78E-23 2.02E-22 GA 8.60E-02 5.56E-01 3.81E-01 1.11E+00 7.66E+00 6.05E+00 1.38E+04 2.15E+04 6.00E+03 NM 6.30E-184 4.58E-171 0.00E+00 4.59E-39 1.00E-32 2.53E-32 2.31E-15 3.89E-11 1.05E-10 f 5 GANMA 2.88E-14 3.18E-13 1.62E-13 4.01E-13 1.11E-11 1.45E-11 7.09E-10 4.39E-11 1.29E-11 GA-NMA 2.17E-14 1.22E-01 2.09E-01 3.77E-13 1.22E-01 8.16E-01 1.52E-11 2.70E+00 1.58E+00 GA 7.17E-02 9.74E-01 6.37E-01 4.40E-01 8.93E-01 2.78E-01 2.23E+00 3.21E+00 5.99E-01 NM 1.86E+01 1.93E+01 3.00E-01 1.90E+01 1.94E+01 2.17E-01 1.84E+01 1.89E+01 2.53E-01 f 6 GANMA 7.13E-02 1.46E-01 5.22E-02 1.66E-01 2.52E-01 2.17E-01 9.41E-01 1.66E+00 5.25E-01 GA-NMA 1.23E-02 1.40E-01 9.68E-02 5.21E-01 2.50E-01 1.74E-01 1.01E+00 2.133E+00 2.20E+00 GA 1.86E-01 3.56E-01 1.11E-01 1.00E+00 1.02E+00 1.39E-02 2.47E+00 3.53E+00 9.43E-01 NM 1.42E+00 2.57E+01 1.34E+01 7.39E-02 5.71E+00 7.57E+00 9.09E-13 2.02E+00 1.65E+00 f 7 GANMA 1.96E-05 2.00E-04 2.00E-03 4.00E-04 8.90E-03 7.70E-03 1.19E+00 2.84E+00 1.16E+00 GA-NMA 5.65E-02 1.75E-01 1.24E-01 6.95E-01 1.18E+00 3.71E-01 8.78E+00 1.36E+01 3.28E+00 GA 6.29E-05 2.20E-02 3.40E-02 1.00E-03 1.46E-02 1.56E-02 2.47E+00 3.58E+00 1.80E+00 NM 8.30E+01 1.06E+02 1.74E+01 1.19E+02 1.71E+02 5.18E+01 1.88E+02 2.89E+02 5.49E+01 f 8 GANMA -1.97E+01 -1.57E+01 7.89E+00 -3.94E+01 -1.18E+01 1.57E+01 -9.86E+01 -4.73E+01 2.95E+01 GA-NMA 1.27E-04 1.27E-04 3.03E-10 2.54E-04 2.54E-04 3.66E-08 3.81E-04 3.81E-04 2.56E-08 GA 3.45E-02 7.88E-02 4.12E-02 6.72E+00 8.25E+00 1.10E+00 1.09E+02 1.54E+02 3.0E+01 NM 6.31E+02 1.37E+04 3.81E+02 2.32E+03 2.84E+03 3.82E+02 4.06E+03 5.23E+03 1.04E+03 f 9 GANMA 5.11E-09 4.88E-06 4.95E-06 4.77E-06 1.56E-05 8.25E-06 8.83E-06 2.30E-05 1.05E-05 GA-NMA 1.86E-05 1.96E-03 1.80E-03 6.16E-04 4.73E-03 3.95E-03 1.14E-02 6.55E-02 6.38E-02 GA 8.00E-05 8.50E-02 7.60E-02 2.56E-01 5.47E-01 1.80E-01 2.38E+00 3.89E+00 9.46E-01 NM 6.98E-01 1.21E+00 4.94E-01 1.87E+00 6.43E+00 5.55E+00 2.25E+00 7.34E+00 4.84E+00 f 10 GANMA 2.46E-31 8.02E-31 5.62E-31 1.01E-29 4.13E-29 2.00E-29 9.12E-16 1.05E-16 3.02E-16 GA-NMA 1.23E-31 3.50E-29 7.57E-29 6.69E-29 9.97E-28 1.63E-27 1.75E-27 6.74E-25 1.64E-24 GA 1.18E-05 3.14E-02 6.74E-02 9.86E+01 1.37E+02 3.49E+01 1.89E+03 3.65E+03 1.11E+03 NM 1.78E-30 7.60E-30 6.09E-30 5.08E-29 1.96E-28 1.51E-28 1.84E-15 1.13E-09 3.00E-09 f 11 GANMA 2.90E-26 5.12E-25 5.85E-24 3.16E-24 7.45E-24 3.25E-24 1.46E-15 8.71E-14 1.69E-13 GA-NMA 4.39E-26 1.00E-24 2.12E-24 7.13E-24 4.67E-23 4.92E-23 3.03E-23 1.09E-21 1.60E-21 GA 1.01E+00 3.49E+02 5.78E+02 1.00E+05 1.62E+05 8.76E+03 5.63E+05 1.11E+06 3.41E+06 NM 3.68E-26 7.21E-25 1.13E-24 2.93E+03 1.98E+04 1.55E+04 1.29E+04 2.49E+05 1.51E+05 f 12 GANMA 8.13E-29 6.12E-28 4.43E-28 1.59E-26 1.45E-25 1.92E-25 1.14E-18 2.20E-15 4.29E-15 GA-NMA 9.81E-28 4.29E+00 1.87E+01 5.26E-26 5.97E-01 1.42E+00 2.37E-24 1.59E+00 1.95E+00 GA 9.03E+00 4.87E+01 3.27E+01 1.46E+02 2.11E+02 7.77E+01 7.88E+03 2.52E+04 1.12E+04 NM 1.15E-27 1.59E+00 1.95E+00 3.40E-25 7.97E-01 1.59E+00 2.94E-14 3.18E+00 1.59E+00 f 13 GANMA 1.44E-02 2.13E-02 1.02E-02 2.82E+00 3.74E+00 1.71E+00 9.01E+00 1.05E+01 1.43E+00 GA-NMA 3.61E-02 1.73E-01 7.70E-02 5.12E-01 9.97E-01 3.23E-01 8.86E+00 1.52E+01 2.74E+00 GA 4.60E-02 1.49E-01 1.19E-01 8.14E+00 9.42E+00 1.12E+00 1.58E+01 1.98E+01 3.71E+00 NM 6.40E+01 8.76E+01 2.60E+01 1.70E+02 2.07E+02 2.36E+01 2.08E+02 3.03E+02 5.42E+01 f 14 GANMA 1.42E-02 4.42E-02 2.85E-02 8.11E-02 1.21E-01 7.64E-02 1.21E-13 4.90E-02 4.10E-02 GA-NMA 2.33E-15 1.01E-01 7.00E-02 6.77E-15 9.34E-03 1.28E-02 1.57E-13 1.26E-02 1.29E-02 GA 2.10E-01 4.81E-01 1.79E-01 1.83E+00 2.32E+00 2.97E-01 2.73E+00 3.75E+00 5.10E-01 NM 5.36E+00 3.23E+01 4.09E+01 2.40E-01 1.34E+01 9.05E+00 7.30E-02 7.99E-01 9.70E-01 f 15 GANMA 5.01E-14 1.98E-12 3.10E-12 3.25E-12 1.43E+00 1.77E+01 2.22E+00 4.27E+00 3.10E+00 GA-NMA 3.24E-14 8.55E-02 1.31E-01 1.82E-12 4.49E+01 1.20E+01 1.48E-11 2.45E+02 1.66E+02 GA 1.10E-01 4.17E-01 1.20E-01 2.91E+00 3.85E+00 6.97E-01 9.29E+00 1.04E+01 1.23E+00 NM 1.85E+01 1.89E+01 2.95E-01 1.89E+01 1.93E+01 2.33E-01 1.92E+01 1.93E+01 1.31E-01 5. Experimental results and analysis The statistical results of GANMA’s performance on 15 benchmark functions with dimensions (n) of 10, 20, and 30 are shown in Table 2 . It also contains the final solutions’ best (Best), mean (Mean), and standard deviation (Std) across a 30-run period for each benchmark function. All benchmark functions for unimodal functions ( f 1 - f 4 ) have been solved in all three dimensions (10, 20, and 30). For the multimodal functions ( f 5 – f 9 ), the solutions for f 5 and f 9 occur in 10, 20, and 30 dimensions, whereas the solutions for f 6 and f 7 in 10 and 20 dimensions are almost optimal. The standard deviation range is 1 . 62 E − 13 ∼ 7 . 89 E + 00, 1 . 45 E − 11 ∼ 1 . 57 E + 01, and 1 . 29 E − 11 ∼ 2 . 95 E + 01, respectively, while the mean value’s variations range in the 10, 20, and 30 dimensions is 3 . 18 E − 13 ∼ 1 . 46 E − 01, 1 . 11 E − 11 ∼ 2 . 52 E − 01, and 4 . 39 E − 11 ∼ 2 . 84 E + 00. Six shifted test functions have been chosen for this study to validate the performance of GANMA: three shifted multimodal test functions, denoted as f 13 to f 15 ; and three shifted unimodal test functions, denoted as f 10 to f 12 , Sphere, Elliptic, and Rosenbrock. On functions f 10 , f 11 , f 12 (in 10, 20, and 30), and f 15 (in 10), GANMA achieved optimum solutions; on functions f 13 (in 10) and f 14 (in 10, 20, and 30), the solutions are nearly optimal. Even while GA is outperformed by the solutions of f 13 and f 15 (in 20 and 30) in GANMA, the solutions are still far from the optimal ones. Furthermore, the Std that GANMA found on five test functions is not too high, suggesting that GANMA’s performance on shifted test functions is steady. Therefore, for all unimodal functions (in 10, 20, and 30 dimensions), GANMA can obtain the global optimum. GANMA can identify outcomes with negligible deviations from the global optimal value for multimodal functions. Except for f 5 and f 9 in dimensions 10, 20, and 30, the results of f 6 , and f 7 in dimensions 10 and 20 are quite near to the optimal value. The outcomes produced by GANMA algorithms for shifted unimodal and multimodal functions are optimal or extremely near-optimal in all functions for all three dimensions, except f 13 and f 15 (in 20 and 30). The benefits of the GANMA algorithm include excellent robustness, high convergence accuracy, and steady performance in all scenarios, whether they involve multimodal functions, unimodal functions, or shifting unimodal and multimodal functions. This is shown in Table 2 under the various numbers of iterations for the corresponding dimensions, which are 300, 400, and 600 for the dimensions 10, 20, and 30, respectively. GANMA consistently outperforms GA-NMA, shown in Table 2 , across various function categories, particularly in unimodal functions. For example, in f 1 and f 4 , GANMA achieves near-zero fitness values across all dimensions, demonstrating its ability to efficiently refine solutions in smooth landscapes. Its lower standard deviations further indicate robust and stable convergence compared to GA-NMA, which struggles to maintain similar precision. In multimodal functions like f 8 , GANMA excels by navigating complex landscapes with multiple local optima, achieving superior results in higher dimensions (e.g., n = 30). Its hybrid structure effectively balances global exploration and local exploitation, reducing the risk of premature convergence. In contrast, GA-NMA often stagnates in local optima due to less dynamic exploration capabilities, leading to higher fitness values and greater variability. For shifted unimodal functions such as f 10 , GANMA demonstrates its adaptability by achieving significantly lower best and mean fitness values, overcoming challenges introduced by displaced optima. Similarly, in shifted multimodal functions like f 13 and f 15 , GANMA showcases its robustness by effectively handling complex, displaced landscapes. GANMA achieves accurate and dependable convergence by fine-tuning solutions even in challenging environments by utilizing Nelder-Mead for local refining. GA-NMA, however, struggles with the combined challenges of shifting and multimodal complexity, resulting in higher fitness values and inconsistent performance. Overall, GANMA’s adaptability and superior optimization capabilities make it a robust choice for diverse and challenging optimization problems. To help further investigate the evolutionary behavior of various methods, the convergence curves of GANMA and GA for a few chosen benchmark functions are displayed in Figure 2 , Figure 3 , and Figure 4 for dimensions (n) = 10, 20, and 30, respectively. These graphs demonstrate the convergence behavior of methods that can help to analyze the evolutionary behavior of various algorithms. The y- and x-axes, respectively, represent the values of the fitness function and the number of iterations. The blue solid line shows the genetic algorithm (GA), while the suggested method GANMA is shown by the solid orange line. Figure 2. Convergence graphs of functions for n = 10. Figure 3. Convergence graphs of functions for n = 20. Figure 4. Convergence graphs of functions for n = 30. Until the ideal solution is discovered, GA shows a decreasing trend for unimodal functions like f 1 , f 2 , f 3 , and f 4 . In contrast, GANMA presents a straight line for all three dimensions (n = 10, 20, and 30). Similar to this, for multimodal functions other than f 5 and f 7 (in 30), there is a greater similarity between the global optimum solution and the GANMA optimal solution in f 5 , f 7 (in 10, and 20), and f 6 , f 8 (in 10, 20, and 30). As a result, of these two algorithms, the lowest optimum solution and the fastest rate of convergence are found through GANMA. The curves for shifted functions, except f 15 (in 20 and 30), demonstrate how well the proposed method was able to obtain the ideal solution for other functions like f 10 , f 11 , and f 12 (in 10, 20, and 30). The dynamic character of the algorithm during its exploitation phases is reflected in the zigzag behavior shown in the figures. The main cause of this pattern is the optimization algorithms’ natural localized refinement processes. Local search methods cause local search methods cause local search methods cause these variations, such as the Nelder-Mead algorithm, which concentrates on enhancing solutions within a limited area of the search space. Furthermore, mutation processes in Genetic Algorithms (GA) add variation by slightly altering individual solutions. The observed zigzag patterns might result from these alterations, which can lead to brief departures from a smooth convergence trajectory. Even while these variations can seem erratic, they highlight how the exploration and exploitation stages actively interact, demonstrating the algorithm’s attempts to improve solutions and converge to the best result. Out of these two methods, GANMA yields the lowest optimum solution and has the fastest convergence rate than GA’s in both the multimodal and shifted functions. It is demonstrated by analyzing the convergence curve and experimental findings that GANMA typically exhibits remarkable performance on the 15 test functions, with a fraction of proper convergence to the global optimal solution that is close to 90%. In terms of exploration and exploitation, GANMA performs better than GA and the NM algorithm. Consequently, GANMA achieves lower fitness values, less variability, and more steady convergence than GA-NMA, GA, and NM. GANMA is a flexible and dependable hybrid algorithm because of its capacity to adjust to optimization problems ranging from simple unimodal functions to intricate shifting multimodal ones. This robustness highlights its advantage in solving diverse real-world optimization problems. 6. Application of proposed algorithm (GANMA) for Weibull-Parameter Estimation The Weibull distribution is a probability distribution that is often used in reliability and survival research. Weibull et al. 23 had shown that the Weibull distribution fit many different datasets and offered satisfactory results, even for small samples. The Weibull distribution, known for its flexibility in modeling various failure and survival scenarios, is defined by two parameters: the shape ( β ) and scale ( η ) parameters. In some cases, a location ( α ) parameter is added to create a three-parameter Weibull distribution, allowing for greater flexibility in fitting data with location shifts. The three-parameter probability density function (pdf ) will have only two parameters 24 when the location parameter ( α ) is equal to zero. Due to the fact that no failure may occur before or after the time is zero, the two Weibull parameters are frequently utilized in failure analysis. 25 Weibull parameter estimation employs a variety of methods. Method of Moments (MOM), the maximum likelihood (ML) approach, and modified maximum likelihood (MML) methods were all used by Seguro and Lambert. 26 They discovered that the time series data sets are more suited for the ML approach. They advised utilizing the MML technique for data sets that were formatted as frequency distributions. The least squares approach, the ML method, and the MML method were contrasted by Akgül et al. 27 ML was shown to be the most effective approach overall, but they also noted that MML and ML are equally effective for big data sets, despite MML’s lower computational complexity. The ML technique was used in the studies of Kollu et al. 28 and Akpnar and Akpnar 29 to estimate the Weibull parameters. Teimouri et al. 30 investigated the MoM using their proposed L-moment estimator, the ML approach, the logarithmic moment method, and the percentile method. They discovered that the ML method and their suggested approach are the most effective estimators. The power density approach was proposed by Akda and Dinler. 31 They concluded that it outperformed popular techniques like MoM and ML techniques. After evaluating five different methods for approximating the Weibull distribution, Saleh et al. 32 recommended the mean wind speed methodology and the ML method. Azad and colleagues 33 discovered that the MoM and ML techniques were more effective than other approaches. Considering the Weibull distribution has a nonlinear log-likelihood function and is compatible with numerical optimization techniques like Newton-Raphson (NR) and Nelder-Mead (NM), previous studies have often used MLE approaches for parameterizing the Weibull distribution. 34 , 35 However, the effectiveness of these iterative methods heavily relies on the initial value chosen. 36 In a departure from traditional approaches, this study employs Genetic Algorithms (GAs) as a heuristic search method, considering a set of solutions within the search space rather than individual points, to address the initial value problem in Weibull parameter Maximum Likelihood Estimation. 37 , 38 GAs have been successfully applied in various optimization contexts, ranging from optimizing mixing parameters for high-performance concrete to signal control optimization. 39 Parameterization of distributions such as the skew-normal distribution, 40 nonlinear regression, 41 and negative binomial gamma mixed distribution 42 have all been applied in previous works. Notably, Thomas et al. 43 pioneered the use of GA for Weibull distribution parameter estimation in the context of breakdown periods of insulating fluid data, achieving performance comparable to traditional methods based on maximizing the log-likelihood function. Furthermore, hybrid approaches combining GA with other methods, such as the improved Nelder-Mead algorithm for controlling synchronous generator output voltage, 36 and memetic algorithms applied to parameter identification in electrical engineering, 44 underscore the versatility of heuristic and hybrid optimization techniques in solving complex problems. In addition, improved Nelder-Mead techniques have been used for synchronous generator output voltage control, as in the efforts of Boudissa et al. 45 and Fatiha et al. 46 In reliability analysis, Weibull parameter estimation is an important problem, with recent developments employing successive approximation 47 and techniques specific to zero-failure data situations, 48 enhancing estimation efficiency in small sample situations. 6.1 Weibull distribution A versatile continuous probability distribution, the Weibull distribution is frequently used in survival analysis and reliability engineering. It is characterized by its ability to model the distribution of time until an event occurs. Named after Wallodi Weibull, who described it in the 1950s, the distribution is flexible and can take different shapes depending on its parameters. The shape parameter affects the structure of the Weibull distribution curve resulting in whether the distribution appears to be a Rayleigh distribution ( β = 2), an exponential distribution ( β = 1), or another shape. The scale parameter determines the distribution’s scale or size. Together, these factors enable the Weibull distribution to simulate a wide range of events with varying shapes and sizes. The following is the Weibull two-parameter distribution’s probability density function (PDF): (6) f ( x ; β , η ) = { β η ( x η ) β − 1 e − ( x / η ) β , x ≥ 0 0 , x < 0 where: • x is the random variable, • β is the shape parameter, • η is the scale parameter. The following represents the Weibull distribution’s cumulative distribution function (or CDF): (7) F ( x ; β , η ) = { 1 − e − ( x / η ) β , x ≥ 0 0 , x < 0 Probability density and cumulative distribution plots for some different parameter values are given in Figure 5 . Figure 5. Different values of (a) shape parameter β and (b) scale parameter η are plotted in Weibull PDF (solid line) and CDF (dashed line) plots. Two-Parameter Weibull is Commonly applied in reliability engineering for modeling time until the failure of components. Whereas, Three-Parameter Weibull is Useful when considering scenarios where the event initiation may not be at zero, such as analyzing the time until an event occurs after a certain threshold. 7. Methods for estimating parameters Estimating the parameters of the Weibull distribution poses a significant challenge due to the intricacies involved in utilizing sample data for accurate estimation. Parameter estimation involves the process of determining the distribution’s parameters using available sample data, aiming to derive optimal values that provide meaningful insights into the underlying data. Making incorrect parameter choices can lead to misleading results, underscoring the importance of analyzing and selecting appropriate estimation techniques for accurate modelling. Therefore, a thorough evaluation of estimation methods is essential to determine the most suitable approach for a given dataset and analysis context. 7.1 Maximum Likelihood Estimation (MLE) The statistical method known as Maximum Likelihood Estimation (MLE) is used to estimate Weibull parameters by maximizing the likelihood function, which determines how well the distribution fits the observed data. MLE is known for its efficiency, but its optimization can be complex due to non-linear equations and numerical stability issues. The PDF of the Weibull distribution is given by Equation (6) . Given a sample x 1 , x 2 , … x n from a Weibull distribution, the likelihood function is given by: (8) L ( β , η ) = ∏ i = 1 n f ( x i ; β , η ) where, f ( x ; β, η ) is the probability density function of the Weibull distribution. The Weibull distribution’s log-likelihood function is as follows: (9) LnL ( β , η ) = ∑ i = 1 n [ ln ( β η ) + ( β − 1 ) ln ( x i η ) − ( x i η ) β ] (10) LnL ( β , η ) = nlnβ − nβln η + ( β − 1 ) ∑ i = 1 n ln x i − η − β ∑ i = 1 n x i β The log-likelihood function is differentiated for β and η , the derivatives are set to zero, and the resultant system of equations is solved to get the MLE. (11) ∂ L ∂ η = − nβ η + β η β + 1 ∑ i = 1 n x i β = 0 (12) ∂ L ∂ β = n β − nlnη − ∑ i = 1 n x i β − ln η ∑ i = 1 n x i β η β + ∑ i = 1 n ln x i = 0 By eliminating α from the above equations and simplifying the equations we get, (13) η ̂ = ( 1 n ∑ i = 1 n x i β ) 1 β (14) 1 β − ∑ i = 1 n x i β ln x i ∑ i = 1 n x i β + 1 n ∑ i = 1 n ln x i = 0 Eqn. (13) may be used to calculate the estimate η ̂ . However, because of Eqn. (14) did not give an analytical solution, the estimate β ̂ must be calculated numerically. This is possible by using the optimization strategy. The Nelder-Mead, Newton Rapson, simulated annealing, or GA algorithms can all be used to solve the nonlinear function that the ML estimator of the shape parameter β contains. In this study, the suggested method, GA, and NM were all used to optimize the log-likelihood function. Nelder-Mead is a powerful algorithm that converges quickly, but its performance is dependent on the initial guess. As a result, we took into account the GA while maximizing the Weibull distribution’s loglikelihood function. Eqn. (10) is considered a fitness function for GA and NM methods. Below the proposed method on MLE of Weibull Distribution has been described briefly. 7.1.1 Proposed method (Genetic and Nelder -Mead Algorithm (GANMA)) To improve the precision and reliability of parameter estimation, we proposed a hybrid approach GANMA that integrates the GA and the NM method with MLE for two-parameter Weibull distributions. The GA aids in exploring the parameter space globally, generating diverse candidate solutions, while the NM fine-tunes these solutions through local search, aiming for optimal parameter estimates. To the best of our knowledge, this is the first instance where the GANMA is being utilized to estimate the Weibull distribution’s parameters. The steps of the proposed method in this study are summarized as follows: Step 1: Problem Formulation - We aim to find the MLE parameters β (shape) and η (scale) for a Weibull distribution. Step 2: Genetic Algorithm (GA) Phase - • Generate an initial population (P) of possible solutions. For the Weibull distribution, each solution indicates a collection of parameters ( β , η ). • Define the fitness function f ( β , η ) that measures the goodness of fit between the observed data and the Weibull distribution with the given parameters. A suitable fitness function could be the log-likelihood shown in Equation 10 . • Select individuals within the population according to their fitness by using a selection process (tournament selection). Higher fitness levels increase the probability of selection. • Apply crossover operations (one-point crossover) to pairs of selected individuals to create new candidate solutions. • Introduce small random changes (mutations) to the parameters of some individuals to add diversity to the population. Step 3: Nelder-Mead Algorithm (NM) Phase - • Take the best individual from the final population of the GA as an initial guess for the parameters ( β 1, η 1). • Define the log-likelihood function L( β , η ) for the Weibull distribution shown in Equation 5 . • To minimize the log-likelihood function and improve the parameter estimations (i.e., reflection, expansion, contraction, and shrinkage), apply the Nelder-Mead method. • Repeat the iterations until convergence criteria are met (e.g., small changes in parameters or a maximum number of iterations). Step 4: Repeat the selection, crossover, and mutation steps for several generations until convergence is met (i.e. end of GA phase). Step 5: Apply the NM method to the best GA solution once again after the GA phase. Step 6: Result - The final parameters ( β ̂ , η ̂ ) obtained from the Nelder-Mead optimization represent the Maximum Likelihood Estimates (MLE) for the Weibull distribution. 8. Monte Carlo simulations The two-parameter Weibull distribution parameter estimation methods were investigated using a Monte Carlo simulation. The scale parameter was set to 1, while the other shape parameters were set to 0.5, 1, 3, and 6. The simulation has been repeated 1000 times for sample sizes of 20, 100, and 500 respectively. With a population size of 100, the GA and GANMA have corresponding crossover and mutation rates of 0.1 and 0.8. The parameters that are used to compare the goodness-of-fit of different parameter estimating methods are mean absolute error (MAE) and bias. For the parameters β (shape) and η (scale), MAE and bias are computed using the formula provided by: (For shape parameter) (15) MAE ( β ̂ ) = 1 n ∑ i = 1 n | β i ̂ − β i | (16) bias ( β ̂ ) = 1 n ∑ i = 1 n ( β i ̂ − β i ) (For scale parameter) (17) MAE ( η ̂ ) = 1 n ∑ i = 1 n | η i ̂ − η i | (18) bias ( η ̂ ) = 1 n ∑ i = 1 n ( η i ̂ − η i ) Greater efficiency is implied by lower absolute values of the bias and MAE. For various data sizes and shape parameters, Tables 3 - 5 display the parameter estimates, bias, and MAE for each parameter estimation method. The results of the simulation demonstrate that the GANMA approach performed better than NM and GA when estimating shape and scale parameters based on MAE and bias criteria. The best results are highlighted in bold. Table 3. Estimations of parameters, MAE, and bias values for several simulation scenarios with n = 20 of a two-parameter distribution for β = 0.5, 1, 3, and 6. n β Method β ̂ η ̂ Mean MAE Bias Mean MAE Bias NM 0.62394 0.12395 0.12393 2.19877 1.19876 1.19871 0.5 GA 0.60901 0.13641 0.10901 1.76523 0.81895 0.76523 GANMA 0.60514 0.10514 0.10514 1.50806 0.50806 0.50806 NM 1.21029 0.21028 0.21029 1.22803 0.22810 0.22808 1 GA 1.23962 0.29000 0.23961 1.380531 0.41456 0.38053 20 GANMA 1.21029 0.21029 0.21009 1.22803 0.22803 0.22805 NM 2.04136 0.95863 -0.95863 1.95863 0.14163 -0.14163 3 GA 3.63089 0.70843 0.41377 1.07488 0.09595 0.074881 GANMA 3.41374 0.63089 0.63088 1.07087 0.070870 0.070870 NM 3.08815 2.91184 -2.91146 1.91184 0.08815 -0.08813 6 GA 5.3846 1.0844 -0.61433 1.05115 0.07196 0.05115 GANMA 6.26177 1.06178 1.26178 1.03482 0.03482 0.034828 Table 4. Estimations of parameters, MAE, and bias values for several simulation scenarios with n = 100 of a two-parameter distribution for β = 0.5, 1, 3, and 6. n β Method β ̂ η ̂ Mean MAE Bias Mean MAE Bias NM 0.50000 2.66453 2.88657 1.24999 0.24999 0.24989 0.5 GA 0.58267 0.08833 -0.04039 1.74933 0.92293 0.67225 GANMA 0.49477 0.01522 -0.0152 0.08211 0.17880 -0.17868 NM 1.00000 1.7763 1.7322 1.0000 0.0000 0.0000 1 GA 0.76607 0.17435 -0.01683 0.83393 0.28349 0.11227 100 GANMA 0.97954 0.03045 -0.03045 0.90620 0.09379 -0.09386 NM 2.10606 0.89393 -0.89396 0.89393 0.10606 -0.10606 3 GA 2.90103 0.45456 -0.01648 1.07781 0.09780 -0.08386 GANMA 2.91863 0.09136 -0.09135 0.96769 0.03230 -0.03231 NM 2.12499 3.87500 -3.87501 0.87500 0.12499 -0.12497 6 GA 4.48285 1.10891 -0.93864 0.98534 0.05621 -0.01811 GANMA 5.51726 0.18273 -0.18273 0.98371 0.01628 -0.01625 Table 5. Estimations of parameters, MAE, and bias values for several simulation scenarios with n = 500 of a two-parameter distribution for β = 0.5, 1, 3, and 6. n β Method β ̂ η ̂ Mean MAE Bias Mean MAE Bias NM 0.50392 0.00392 0.00391 1.24934 0.249345 0.249344 0.5 GA 0.50555 0.0863 0.0055 1.8336 0.9586 0.8336 GANMA 0.49826 0.00677 -0.00671 1.0054 0.00545 -0.00544 NM 1.0000 0.0000 0.0000 1.0000 0.000 0.000 1 GA 0.9676 0.1473 -0.0323 1.1998 0.29807 0.19986 100 GANMA 0.98653 0.0134 -0.0133 1.00272 0.00272 -0.00277 NM 2.0825 0.91747 -0.91746 0.91747 0.08252 -0.08251 3 GA 3.2000 0.52541 0.20000 1.0404 0.08547 0.0404 GANMA 2.95959 0.04040 -0.04040 1.00090 0.00090 -0.00080 NM 2.1166 3.88335 -3.88334 0.88335 0.11664 -0.11667 6 GA 5.2108 1.0329 -0.7891 1.0060 0.06851 0.00605 GANMA 5.6191 0.08080 -0.080801 1.0004 0.00045 -0.00043 8.1 Result analysis Figures 6 - 8 illustrate the outcome across various shape parameters while keeping the scale parameter constant—as well as various data sizes by plotting the convergence graph of the PDF of Weibull parameters and the PDF of MLE of parameters using NM, GA, and GANMA. The solid black line depicts the PDF of parameters ( β , η ), whilst the usual genetic algorithm is illustrated by the solid green line, the yellow solid line shows the Weibull PDF using NM, and the suggested method GANMA is shown by the solid red line. It has been found that parameter estimation using the suggested technique converges with the original PDF as the shape parameter and data size increase. GANMA, the suggested algorithm, performs better than GA and NM in all types of situations. Figure 6. Histogram and MLE PDF of Weibull 2- parameter Distribution for β = 0.5, 1, 3, and 6 with n = 20. Figure 7. Histogram and MLE PDF of Weibull 2- parameter Distribution for β = 0.5, 1, 3, and 6 with n = 100. Figure 8. Histogram and MLE PDF of Weibull 2- parameter Distribution for β = 0.5, 1, 3, and 6 with n = 500. Based on MAE and bias criteria, the simulation results demonstrate that the GANMA technique outperformed NM and GA in the estimation of shape and scale parameters. In each simulated scenario, the GANMA technique yielded the best shape parameter efficiency in terms of bias and MAE for sample sizes of 20, 100, and 500 respectively. Throughout almost every simulated scenario, GANMA achieved the maximum efficiency in the estimate of scale parameters for sample sizes of 20, 100, and 500, based on at least one decision criterion. By analyzing MAE and bias for each simulation scenario, GANMA proved to be the most effective approach for the data size 20. For small, moderate, and high sample sizes, GANMA is a fairly effective strategy overall. Additionally shown in Figures 9 - 12 are the absolute values of the biases and the MAE. Figure 9. Comparison of parameter estimate approaches for β using the MAE criteria. Figure 10. Comparison of parameter estimate approaches for η using the MAE criteria. Figure 11. Comparison of parameter estimate approaches for β using the bias criteria. Figure 12. Comparison of parameter estimate approaches for η using the bias criteria. The MAE values for the shape parameter β are shown in Figure 9 . In every simulated scenario, GANMA outperformed NM and GA in terms of efficiency. The second-best approach is NM. An increase in sample size resulted in lower MAE values. On the other hand, MAE values increased along with an increase in the form parameter value. The scale parameter η ’s MAE values are displayed in Figure 10 . For sample sizes of 20, 100, and 500, GANMA proved to be the most effective approach. When the shape parameter is set to a higher value, the MAE values drop. Likewise, as the sample size is raised, the MAE values drop. The shape parameter β ’s absolute bias value is displayed in Figure 11 . The most efficient results were obtained using GANMA. NM outperformed GA on some occasions. As with MAE values, larger sample sizes resulted in lower absolute bias levels. Increasing the parameter value resulted in higher absolute bias levels. The absolute bias for the scale parameter η is shown in Figure 12 . Most of the time, GANMA outperformed other methods in terms of efficiency. The second-best approach is NM. Increasing the shape parameter and sample size leads to lower absolute bias levels. 9. Estimation of Weibull-Parameter in Wind speed analysis The decrease in fossil fuel supplies and their lack of reliability in meeting future energy demands have made renewable energy a hot topic for academics. Wind is one of the main sources of renewable energy, and wind speed modeling has been studied in great detail. In wind power applications, the most popular Weibull distribution is two parameters. It has been discovered that this PDF is correct for the majority of wind regimes observed in nature, is easy to use, and is adaptable. In several research, it has been noted that the wind speed data cannot be adequately represented for specific applications, including those with bimodal distributions, short time horizons, low and high wind speeds, and with a high frequency of nulls. 49 – 51 The given equation may be used to determine the probability density function. (19) f ( v ) = β η ( v η ) β − 1 e − ( v / η ) β where v is wind speed. Power density Power density in wind speed analysis refers to the amount of power that can be obtained from the wind per unit area. This statistic is critical when evaluating the feasibility and potential viability of wind energy projects since it quantifies the energy available from the wind at a given place. The power density ( P D ) may be easily calculated using the following equation once β and η have been established. (20) P D = ρ a η 3 2 3 β Γ ( 3 β ) where, ρ a is the air density and symbol Γ denotes the gamma function. The standard value of air density ρ a is taken as ρ a = 1.225 kg / m 3 . 9.1 Result and Discussion In this challenge, two real-world data sets have been used to examine wind-speed analysis. The very first set of data came from the seas surrounding the Maluku Islands and Sulawesi. The data under analysis were gathered by the satellite Quikscat, which measured the ocean wind 10 meters above sea level using a scatterometer. The measurement’s horizontal and vertical spatial resolution is 0.25°earth grid. The information from the January measurement point at latitude 116° and longitude 85.5° is included in the accessible data. 52 Tarama Island and Iriomote Island, which are close to northern Taiwan, had their wind speeds recorded in the second data set. At Iriomotejima Meteorological Station, the maximum daily wind speed and direction were recorded in March 2012. 53 The Kolmogorov-Smirnov (K-S) test is a nonparametric statistical test used to compare two distributions. The K-S test calculates the maximum absolute difference between the empirical cumulative distribution functions (ECDFs) of the distributions being compared, providing a test statistic (D). A p-value derived from this statistic indicates the significance of the difference, helping in goodness-of-fit testing, comparing sample distributions, and model validation without assuming any specific distribution for the data. The statistical confirmation that the monthly data sets come from the Weibull distribution can be obtained by doing the K-S test separately for each data set. The most significant difference between the theoretical distribution, S N ( x ), and the observed distribution, F 0 ( x ), is the K-S test statistic. 54 (21) D = max | F o ( x ) − S N ( x ) | Monthly distributions from the Weibull distribution are selected for further investigation following the K-S test ( p − value ≥ 0.05 ), which indicates the probability of observing a discrepancy as large as the one computed if the two distributions were the same. Results across shape and scale parameters were obtained by plotting the convergence graph between the PDF and CDF of MLE of parameters using NM, GA, and GANMA, as shown in Figures 13 and 14 . The solid green line and dotted green line represent the PDF and CDF of the standard genetic algorithm, the yellow solid line, and dotted yellow line represent the Weibull PDF and CDF using NM, and the solid red line and dotted red line represent the suggested method for both the PDF and CDF, respectively. Figure 13 illustrates that the PDF and CDF for both GANMA and NM convergence are on the same line. Figure 13. Histogram, MLE PDF and CDF using GA, NM, and GANMA for data set 1. Figure 14. Histogram, MLE PDF and CDF using GA, NM, and GANMA for data set 2. Tables 6 and 7 present the shape and scale parameters, k-s value, p-value, and power density for the first and second data sets, respectively, for all three estimation techniques. The greatest p-value and the lowest k-s statistic for both data sets are produced by the suggested approach (GANMA) out of the three estimation techniques. The Weibull distribution and the actual wind speed data seem similar, as indicated by the p-value exceeding the selected significance threshold (e.g., 0.05). In other words, the data is well-fitted by the Weibull distribution. The parameters estimated using GANMA are considered the best fit for describing the wind speed data, based on the K-S test findings. The observed wind speed data and the predicted Weibull distribution with these parameters were well recognized, as evidenced by the low K-S statistic and high p-value. Table 6. Parameter estimations for data set-1. Method β ̂ η ̂ k-s value p-value P D (watt/m 2 ) NM 9.52382 6.44868 0.13685 0.56069 147.05921 GA 3.48312 4.97007 0.67756 1.274E-14 71.36770 GANMA 9.52340 6.44863 0.13682 0.560978 147.05541 Table 7. Parameter estimations for data set-2. Method β ̂ η ̂ k-s value p-value P D (watt/m 2 ) NM 2.0 1.0 0.99999 2.63E-285 0.81422 GA 1.07418 4.97152 0.62512 3.105E-12 350.27224 GANMA 1.35925 9.85611 0.35982 0.00042 1431.63678 The maximum power density is demonstrated by the parameters estimated through MLE implementing NM, as shown in Table 6 . This suggests that the parameters possess greater absolute performance in terms of power generation. Despite the slightly lower power density value of the parameters estimated by MLE using GANMA compared to NM, they are nevertheless selected as the best fit since they have the greatest p-value and the least k-s statistic. This suggests that for wind speed data set 1, parameters calculated by MLE using GANMA offer the best match. The parameters that are estimated by MLE using GANMA are found to provide the best fit in Table 7 , as shown by their lowest K-S statistic and highest p-value. Additionally, superior performance in terms of power generation is indicated by the higher power density value associated with these parameters. 10. Conclusion To improve the exploitation capabilities of GA, this study presents a unique hybridized approach called the Genetic and Nelder-Mead Algorithm (GANMA), in which NM is included. GANMA has been employed to verify the robustness and efficiency of the suggested technique on fifteen benchmark problems for three separate dimensions. Because of its high level of accuracy and stability, GANMA performs very well in improving unimodal, multimodal, and shifting unimodal/multi-modal functions, as shown by the test function comparison experiment table. According to the testing results, the suggested method is strong and has the potential to solve benchmark issues more quickly than the other two algorithms in the majority of situations. Furthermore, estimating the Weibull distribution’s scale ( η ) and shape ( β ) parameters, this study aims to assess the efficacy of three estimation methods: ML estimators employing GA, NM, and GANMA. The MAE and bias criteria are used to assess the efficiency of the parameter estimating techniques. Based on the conclusions drawn from the Monte Carlo simulation and the examination of real-world wind speed data, the ML estimator using GANMA performs better in Weibull parameter estimation than the ML estimator using NM and GA estimator. We used the K-S test to compare three sets of parameters for two fitting wind speed data sets with a Weibull distribution and selected the set of parameters that minimized the K-S statistic and maximized the associated p-value, indicating the best fit. Moreover, it may be said that the two sets of data were collected in two different geographic locations with different meteorological conditions. In these data sets, which included a variety of meteorological situations, GANMA demonstrated superiority. Compliance with ethical standards Disclosures & disclaimer We certify that the submitted manuscript is our original work that is not currently being considered elsewhere. The paper is an unfunded independent piece of labor. Ethical approval This article does not include any research that any of the authors conducted using humans or animals. Data availability Underlying data All data supporting the findings of this study, including figures and tables, have been deposited in the given link; https://doi.org/10.5281/zenodo.13309711 55 The files are as follows: [Data Sets] data has been obtained from a third party for two real-life problems, which are available at data sets.docx Extended data The extended data files are available in Zenodo at the following DOI: [ https://doi.org/10.5281/zenodo.13309711.v3 ] 55 [Algorithm] The algorithm described in the manuscript available at algorithm.docx The files included: raw data of functions.docx and raw data of functions (generation wise).docx Contains data analysis that supports the study but is not included in the main manuscript. [Tables] This file contains all the tables referenced in the manuscript. tables.docx [Figures] This file contains all the figures referenced in the manuscript, including detailed captions. figures.docx Data are available under the terms of the Creative Commons Attribution 4.0 International license (CC-BY 4.0). Software availability Python is an open-source source and is available at https://python.org Archived software is available from: https://doi.org/10.5281/zenodo.13309711 55 (source code.zip) where archived source code can be accessed. References 1. Durand N, Alliot JM: Genetic algorithms applied to air traffic management. Proceedings of the 1999 IEEE International Conference on Systems, Man, and Cybernetics. 1999; 1 : 609–614. 2. Hashim FA, Houssein EH, Helmy BEM, et al. : Harris hawks optimization: Algorithm and applications. Future Generation Computer Systems. 2020; 97 : 849–872. 3. Li J, Wang Y: An extended Nelder-Mead and genetic algorithm hybrid optimization strategy for short-term energy demand forecasting. Energy Reports. 2020; 6 : 1426–1435. 4. Lee DH, Kim KJ: Genetic algorithm and tabu search hybrid scheme for solving scheduling problems. Computers & Industrial Engineering. 2001; 41 (3): 231–246. 5. Júarez-López C, López-Bonilla OR, Zamudio A: Hybrid genetic algorithms and machine learning for solving graph optimization problems. Engineering Applications of Artificial Intelligence. 2017; 62 : 40–52. 6. Ouyang T, Yu H, Jin L: Hybrid Harris hawks and Nelder-Mead optimization algorithm for engineering design problems. Expert Systems with Applications. 2021; 175 : 114765. 7. El Ghadoui M, Mouchtachi A, Majdoul R: A hybrid optimization approach for intelligent manufacturing in plastic injection molding by using artificial neural network and genetic algorithm. Scientific Reports. 2023; 13 (1): 21817. PubMed Abstract | Publisher Full Text | Free Full Text 8. Hwang CL, He CC: Adaptive genetic algorithm for the maximum entropy model. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). 2006; 36 (3): 683–691. 9. Fan H, Lampinen J: A trigonometric mutation operation to differential evolution. Journal of Global Optimization. 2003; 27 (1): 105–129. Publisher Full Text 10. Hooke R, Jeeves TA: Direct search solution of numerical and statistical problems. Journal of the ACM. 1961; 8 (2): 212–229. Publisher Full Text 11. Holland JH: Adaptation in natural and artificial systems. Ann Arbor: Univ. of Mich. Press; 1975; Vol. 7 . ; pp. 390–401. 12. Gilli M, Schumann E: Heuristic optimization in financial modeling. Annals of Operations Research. 2010; 193 (1): 129–158. Publisher Full Text 13. Chen S-H, Yeh C-H: Evolving traders and the business school with genetic programming: A new architecture of the agent-based artificial stock market. Journal of Economic Dynamics and Control. 2001; 25 (3–4): 363–393. Publisher Full Text 14. Deb K: An efficient constraint-handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering. 2000; 186 (2–4): 311–338. Publisher Full Text 15. Coello CAC, Pulido GT, Lechuga MS: Handling multiple objectives with particle swarm optimization. IEEE Transactions on Evolutionary Computation. 2004; 8 (3): 256–279. Publisher Full Text 16. Dobson PD, Doig AJ: Distinguishing enzyme structures from non-enzymes without alignments. Journal of Molecular Biology. 2003; 330 (4): 771–783. PubMed Abstract | Publisher Full Text 17. Schneider G: Automated de novo drug design: are we nearly there yet? Expert Opinion on Drug Discovery. 2010; 5 (3): 261–263. 18. Beasley D, Bull DR: An Overview of Genetic Algorithms: Part 1, Fundamentals 1 Introduction 2 Basic Principles. Building. 1993: p. 116. 19. Olsson DM, Nelson LS: The Nelder-Mead simplex procedure for function minimization. Technometrics. 1975; 17 (1): 45–51. Publisher Full Text 20. Spendley WGRFR, Hext GR, Himsworth FR: Sequential application of simplex designs in optimisation and evolutionary operation. Technometrics. 1962; 4 (4): 441–461. Publisher Full Text 21. Nelder JA, Mead R: A Simplex method for function minimization. The Computer Journal. 1965; 7 (4): 308–313. Publisher Full Text 22. Selvam M, Ramachandran M, Saravanan V: Nelder–Mead Simplex Search Method-A Study. Data Analytics and Artificial Intelligence. 2022; 2 (2): 117–122. Publisher Full Text 23. Weibull W: A statistical theory of strength of materials. Ingeniors Vetenskaps Akademiens Handingar. 1939; 151 . 24. Bütikofer L, Stawarczyk B, Roos M: Two regression methods for estimation of a two-parameter Weibull distribution for reliability of dental materials. Dental Materials. 2015; 31 (2): e33–e50. PubMed Abstract | Publisher Full Text 25. Coles S, Bawa J, Trenner L, et al. : An introduction to statistical modeling of extreme values. London: Springer; 2001; 208. Publisher Full Text 26. Seguro JV, Lambert TW: Modern estimation of the parameters of the Weibull wind speed distribution for wind energy analysis. Journal of Wind Engineering and Industrial Aerodynamics. 2000; 85 : 75–84. Publisher Full Text 27. Akgül FG, S¸enoğlu B, Arslan T: An alternative distribution to Weibull for modeling the wind speed data: Inverse Weibull distribution. Energy Conversion and Management. 2016; 114 : 234–240. Publisher Full Text 28. Kollu R, Rayapudi SR, Narasimham SVL, et al. : Mixture probability distribution functions to model wind speed distributions. International Journal of Energy and Environmental Engineering. 2012; 3 (27): 27. Publisher Full Text 29. Akpınar EK, Akpınar S: Determination of the wind energy potential for Maden-Elazig, Turkey. Energy Conversion and Management. 2004; 45 : 2901–2914. Publisher Full Text 30. Teimouri M, Hoseini SM, Nadarajah S: Comparison of esti- mation methods for the Weibull distribution. Statistics. 2013; 47 (1): 93–109. Publisher Full Text 31. Akdağ SA, Dinler A: A new method to estimate Weibull parameters for wind energy applications. Energy Conversion and Management. 2009; 50 : 1761–1766. Publisher Full Text 32. Saleh H, Abou El-Azm Aly A, Abdel-Hady S: Assessment of different methods used to estimate Weibull distribution parameters for wind speed in Zafarana wind farm, Suez Gold, Egypt. Energy. 2012; 44 : 710–719. Publisher Full Text 33. Azad AK, Rasul MG, Yusaf T: Statistical diagnosis of the best Weibull methods for wind power assessment for agricultural applications. Energies. 2014; 7 : 3056–3085. Publisher Full Text 34. Guo J, Kong X, Wu N, et al. : Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology. 2023; 37 (11): 5797–5811. Publisher Full Text 35. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety. 2021; 207 : 107321. Publisher Full Text 36. Boudissa E, Habbi F, Gabour N, et al. : Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy. 2023; 44 (1): 2283–2295. Publisher Full Text 37. Dempster AP, Laird NM, Rubin DB: Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (methodological). 1977; 39 (1): 1–22. Publisher Full Text 38. Gove JH, Fairweather SE: Maximum-likelihood estimation of Weibull function parameters using a general interactive optimizer and grouped data. Forest Ecology and Management. 1989; 28 (1): 61–69. Publisher Full Text 39. Bounekhla M, Habbi F, Boudissa E, et al. : Combination of quadratic ranking selection real-coded genetic algorithm with the Hooke-Jeeves optimisation method for solar photovoltaic parameter estimation. International Journal of Ambient Energy. 2022; 43 (1): 7754–7765. Publisher Full Text 40. Yalçınkaya A, Şenoğlu B, Yolcu U: Maximum likelihood estimation for the parameters of skew normal distribution using genetic algorithm.Swarm and Evolutionary Computation.2018; 38 : 127–138. Publisher Full Text 41. Altunkaynak B, Esin A: The genetic algorithm method for parameters estimation in nonlinear regression. Gazi University Journal of Science. 2004; 17 (2): 43–51. 42. Genctürk Y, Yigiter A: Modelling claim number using a new mixture model: negative binomial gamma distribution. Journal of Statistical Computation and Simulation. 2016; 86 : 1829–1839. Publisher Full Text 43. Thomas GM, Gerth R, Velasco T, et al. : Using real-coded genetic algorithms for Weibull parameter estimation.Computers & Industrial Engineering.1995; 29 : 377–381. Publisher Full Text 44. Boudissa E, Habbi F, Bounekhla M, et al. :A Memetic algorithm applied to induction machine parameters identification based on an output error. Revue Roumaine Des Sciences Techniques — Série Électrotechnique et Énergétique. 2023; 68 (3): 266–270 . https://journal.iem.pub.ro/rrst- 45. Boudissa E, Habbi F, Gabour N, et al. : Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy. 2023; 44 (1):2283–2295. Publisher Full Text 46. Fatiha H, Nour El Houda G, Mohamed B, et al. : Output voltage control of synchronous generator using Nelder –Mead algorithm based PI controller. IEEE xplore. 47. Guo J, Kong X, Wu N, et al. : Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology. 2023; 37 (11):5797–5811. Publisher Full Text 48. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety. 2021; 207 :107321. Publisher Full Text 49. Akdag SA, Dinler A: A new method to estimate Weibull parameters for wind energy applications. Energy Conversion and Management. 2009; 50 (7): 1761–1766. Publisher Full Text 50. Kusiak A, Zheng H, Song Z: On-line monitoring of power curves. Renewable Energy. 2009; 34 (6): 1487–1493. Publisher Full Text 51. Morgan EC, Lackner M, Vogel RM, et al. : Probability dis- tributions for offshore wind speeds. Energy Conversion and Management. 2011; 52 (1): 15–26. Publisher Full Text 52. Mahmuddin F: Analysis of Wind Energy Potential with a Mobile Floating Structure around Sulawesi and Maluku Islands of Indonesia. In International Conference on Offshore Mechanics and Arctic Engineering. (Vol. 56574 , p. V009T09A064). American Society of Mechanical Engineers; 2015, May. 53. Komatsu T, Mizuno S, Natheer A, et al. : Unusual distribution of floating seaweeds in the East China Sea in the early spring of 2012. Journal of Applied Phycology. 2014; 26 : 1169–1179. PubMed Abstract | Publisher Full Text | Free Full Text 54. Massey FJ Jr: The Kolmogorov-Smirnov test for goodness of fit. Journal of the American statistical Association. 1951; 46 (253): 68–78. Publisher Full Text 55. Mishra R, Majhi N: Python code and raw data for our proposed algorithm (GANMA). 2024. Publisher Full Text Comments on this article Comments (0) Version 3 VERSION 3 PUBLISHED 19 Sep 2024 ADD YOUR COMMENT Comment Author details Author details 1 Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, Odisha, 751024, India Neha Majhi Roles: Conceptualization, Writing – Original Draft Preparation Rajashree Mishra Roles: Methodology, Writing – Review & Editing Competing interests No competing interests were disclosed. Grant information Kalinga Institute of Industrial Technology The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Article Versions (3) version 3 Revised Published: 07 Apr 2025, 13:1073 https://doi.org/10.12688/f1000research.154598.3 version 2 Revised Published: 10 Mar 2025, 13:1073 https://doi.org/10.12688/f1000research.154598.2 version 1 Published: 19 Sep 2024, 13:1073 https://doi.org/10.12688/f1000research.154598.1 Copyright © 2025 Majhi N and Mishra R. This is an open access article distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Download Export To Sciwheel Bibtex EndNote ProCite Ref. Manager (RIS) Sente metrics Views Downloads F1000Research - - PubMed Central info_outline Data from PMC are received and updated monthly. - - Citations open_in_new 0 open_in_new 0 open_in_new SEE MORE DETAILS CITE how to cite this article Majhi N and Mishra R. A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.12688/f1000research.154598.3 ) NOTE: If applicable, it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS track receive updates on this article Track an article to receive email alerts on any updates to this article. TRACK THIS ARTICLE Share Open Peer Review Current Reviewer Status: ? Key to Reviewer Statuses VIEW HIDE Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Version 3 VERSION 3 PUBLISHED 07 Apr 2025 Revised Views 0 Cite How to cite this report: Singh G. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.180009.r396886 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v3#referee-response-396886 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 14 Aug 2025 Gyan Singh , National Institute of Technology Agartala, Agartala, Tripura, India Approved VIEWS 0 https://doi.org/10.5256/f1000research.180009.r396886 The approach leverages the global exploration capabilities of the GA to identify promising regions in the search space ,then utilize the local refinement capabilities of the Nelder-Mead algorithm to find the optimal solution within that region .The hybrid approach is ... Continue reading READ ALL The approach leverages the global exploration capabilities of the GA to identify promising regions in the search space ,then utilize the local refinement capabilities of the Nelder-Mead algorithm to find the optimal solution within that region .The hybrid approach is applied to various parameter estimation problems, demonstrating its solutions compared to traditional methods. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: Optimization and Hybrid Of Optimization Algorithm and Fuzzy logic I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Singh G. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.180009.r396886 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v3#referee-response-396886 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Respond or Comment COMMENT ON THIS REPORT Version 2 VERSION 2 PUBLISHED 10 Mar 2025 Revised Views 0 Cite How to cite this report: Boudissa Eg and FATIHA H. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.176873.r370272 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v2#referee-response-370272 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 25 Mar 2025 El-ghalia Boudissa , Faculty of Technology, Saad Dahlab University of Blida, Blida,, Blida Province, Algeria; Automatic-Electrotechnic, Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria HABBI FATIHA , Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria; Saad Dahlab University of Blida (Ringgold ID: 213442), Blida, Blida Province, Algeria Approved VIEWS 0 https://doi.org/10.5256/f1000research.176873.r370272 We are pleased to inform you of the final decision about the revised paper "A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation" Reviewer 1: Dr. BOUDISSA EL GHALIA ... Continue reading READ ALL We are pleased to inform you of the final decision about the revised paper "A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation" Reviewer 1: Dr. BOUDISSA EL GHALIA Decision: Accepted Reference 44 should be corrected as follows: 44. Boudissa E.,Habbi F., Bounekhla M., Dif N . : A Memetic algorithm applied to induction machine parameters identification based on an output error. Revue Roumaine Des Sciences Techniques — Série Électrotechnique et Énergétique. 2023; 68 (3): 266–270 . Publisher Full Text https://journal.iem.pub.ro/rrst- Reviewer 2: Dr. FATIHA HABBI I recommended that this manuscript can be indexed. References 1. BOUDISSA E, HABBI F, BOUNEKHLA M, DIF N: A MEMETIC ALGORITHM APPLIED TO INDUCTION MACHINE PARAMETERS IDENTIFICATION BASED ON AN OUTPUT ERROR. REVUE ROUMAINE DES SCIENCES TECHNIQUES — SÉRIE ÉLECTROTECHNIQUE ET ÉNERGÉTIQUE . 2023; 68 (3): 266-270 Publisher Full Text 2. Boudissa E, Habbi F, Gabour N, Bounekhla M: Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy . 2023; 44 (1): 2283-2295 Publisher Full Text 3. Guo J, Kong X, Wu N, Xie L: Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology . 2023; 37 (11): 5797-5811 Publisher Full Text 4. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety . 2021; 207 . Publisher Full Text 5. Fatiha.H., Nour El Houda G., Mohamed B., El Ghalia.B: Output voltage control of synchronous generator using Nelder –Mead algorithm based PI controller. IEEE xplore . Publisher Full Text Competing Interests: No competing interests were disclosed. Reviewer Expertise: Optimization methods; meta-heuristics; identification; induction machine; synchrounous generator; Automatic Voltage Regulation; Photovoltaic systems We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Boudissa Eg and FATIHA H. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.176873.r370272 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v2#referee-response-370272 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 27 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 27 Mar 2025 Author Response Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the ... Continue reading Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the reference section. Reviewer2 I recommended that this manuscript can be indexed. Ans: Thank you for your suggestion. As per the suggestion, the mentioned 5 references have been implemented in the reference sections as reference no 44, 45, 46, 47, and 48 on page 37. Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the reference section. Reviewer2 I recommended that this manuscript can be indexed. Ans: Thank you for your suggestion. As per the suggestion, the mentioned 5 references have been implemented in the reference sections as reference no 44, 45, 46, 47, and 48 on page 37. Competing Interests: No competing interests were disclosed. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 27 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 27 Mar 2025 Author Response Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the ... Continue reading Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the reference section. Reviewer2 I recommended that this manuscript can be indexed. Ans: Thank you for your suggestion. As per the suggestion, the mentioned 5 references have been implemented in the reference sections as reference no 44, 45, 46, 47, and 48 on page 37. Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the reference section. Reviewer2 I recommended that this manuscript can be indexed. Ans: Thank you for your suggestion. As per the suggestion, the mentioned 5 references have been implemented in the reference sections as reference no 44, 45, 46, 47, and 48 on page 37. Competing Interests: No competing interests were disclosed. Close Report a concern COMMENT ON THIS REPORT Version 1 VERSION 1 PUBLISHED 19 Sep 2024 Views 0 Cite How to cite this report: Roeva O. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r343361 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-343361 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 06 Dec 2024 Olympia Roeva , Bioinformatics and mathematical modelling, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, Sofia, Bulgaria Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.169646.r343361 Is the work clearly and accurately presented and does it cite the current literature?No. The paper structure should be reconsidered. First, all used/known methods and knowledge used in the research should be presented and then the proposed ... Continue reading READ ALL Is the work clearly and accurately presented and does it cite the current literature?No. The paper structure should be reconsidered. First, all used/known methods and knowledge used in the research should be presented and then the proposed new techniques, the new results obtained – only results and experiments made by the authors. The presented results should be discussed and compared with similar published results. The references are not up to date. Recent titles should be added. 1/3 of the references are related to Weibull-Parameter Estimation and at the same time there is no deep analysis of the hybrids based on GA – their advantages and disadvantages, the existing gaps, and the role of the proposed hybrid in the current state of the art. The figures should appear after their introduction in the text. Figure 1 is mentioned on page 19, but appears on page 12. Is the study design appropriate and does the work have academic merit? Yes. Are sufficient details of methods and analysis provided to allow replication by others? No. For example, the applied GA selection operator is not given. The GA parameter, ggap, is not given. The fitness function is unknown. If applicable, is the statistical analysis and its interpretation appropriate? Yes. Are all the source data underlying the results available to ensure full reproducibility? Yes. Are the conclusions drawn adequately supported by the results? Yes. I have a few questions: Why reference 12 is cited in the sentence “The pseudo-code for the hybridization of the GA and Nelder-Mead simplex algorithm is presented in Algorithm. 12 ”? The NM algorithm works with a single solution and GA works with a population of the solutions. How is it performed the following step in pseudo-code 21: “Replace the worst individuals with the simplex’s best individuals”? The NM algorithm returns/gives only one solution, so only one worst individual can be replaced. How the GA and NM algorithm parameters are set? Are these parameters optimal? Is the work clearly and accurately presented and does it cite the current literature? No Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests: No competing interests were disclosed. Reviewer Expertise: metaheuristic algorithms for mathematical modelling and optimization I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Roeva O. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r343361 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-343361 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 10 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 10 Mar 2025 Author Response Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s ... Continue reading Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s observation regarding the application of the Nelder-Mead (NM) algorithm, which works with a single solution while the Genetic Algorithm (GA) operates on a population. In our implementation, we address this by applying the NM algorithm to the first five best individuals from the population. For each individual, NM refines the solution, and the improved solution replaces the corresponding worst individual in the population. This process ensures that the benefits of NM’s local refinement are distributed across multiple candidates, effectively enhancing the population's overall quality. This approach leverages NM's exploitation strength while maintaining the diversity necessary for GA’s global exploration, striking an effective balance between the two methods. We address this in, sub-section 3.2(IV) We have created a section for parameter setups for GA, NMA, and GANMA. To ensure these parameters were suitable for our specific application, we conducted sensitivity analyses on a subset of benchmark functions, varying key parameters and assessing their impact on convergence speed and solution quality. The selected parameters demonstrated consistent performance across unimodal, multimodal, and shifted test functions, indicating that they are close to optimal for the problems studied. However, we acknowledge that further tuning could potentially improve performance for specific problem instances and are open to exploring adaptive parameter control in future work. Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s observation regarding the application of the Nelder-Mead (NM) algorithm, which works with a single solution while the Genetic Algorithm (GA) operates on a population. In our implementation, we address this by applying the NM algorithm to the first five best individuals from the population. For each individual, NM refines the solution, and the improved solution replaces the corresponding worst individual in the population. This process ensures that the benefits of NM’s local refinement are distributed across multiple candidates, effectively enhancing the population's overall quality. This approach leverages NM's exploitation strength while maintaining the diversity necessary for GA’s global exploration, striking an effective balance between the two methods. We address this in, sub-section 3.2(IV) We have created a section for parameter setups for GA, NMA, and GANMA. To ensure these parameters were suitable for our specific application, we conducted sensitivity analyses on a subset of benchmark functions, varying key parameters and assessing their impact on convergence speed and solution quality. The selected parameters demonstrated consistent performance across unimodal, multimodal, and shifted test functions, indicating that they are close to optimal for the problems studied. However, we acknowledge that further tuning could potentially improve performance for specific problem instances and are open to exploring adaptive parameter control in future work. Competing Interests: No competing interests were disclosed. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 10 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 10 Mar 2025 Author Response Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s ... Continue reading Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s observation regarding the application of the Nelder-Mead (NM) algorithm, which works with a single solution while the Genetic Algorithm (GA) operates on a population. In our implementation, we address this by applying the NM algorithm to the first five best individuals from the population. For each individual, NM refines the solution, and the improved solution replaces the corresponding worst individual in the population. This process ensures that the benefits of NM’s local refinement are distributed across multiple candidates, effectively enhancing the population's overall quality. This approach leverages NM's exploitation strength while maintaining the diversity necessary for GA’s global exploration, striking an effective balance between the two methods. We address this in, sub-section 3.2(IV) We have created a section for parameter setups for GA, NMA, and GANMA. To ensure these parameters were suitable for our specific application, we conducted sensitivity analyses on a subset of benchmark functions, varying key parameters and assessing their impact on convergence speed and solution quality. The selected parameters demonstrated consistent performance across unimodal, multimodal, and shifted test functions, indicating that they are close to optimal for the problems studied. However, we acknowledge that further tuning could potentially improve performance for specific problem instances and are open to exploring adaptive parameter control in future work. Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s observation regarding the application of the Nelder-Mead (NM) algorithm, which works with a single solution while the Genetic Algorithm (GA) operates on a population. In our implementation, we address this by applying the NM algorithm to the first five best individuals from the population. For each individual, NM refines the solution, and the improved solution replaces the corresponding worst individual in the population. This process ensures that the benefits of NM’s local refinement are distributed across multiple candidates, effectively enhancing the population's overall quality. This approach leverages NM's exploitation strength while maintaining the diversity necessary for GA’s global exploration, striking an effective balance between the two methods. We address this in, sub-section 3.2(IV) We have created a section for parameter setups for GA, NMA, and GANMA. To ensure these parameters were suitable for our specific application, we conducted sensitivity analyses on a subset of benchmark functions, varying key parameters and assessing their impact on convergence speed and solution quality. The selected parameters demonstrated consistent performance across unimodal, multimodal, and shifted test functions, indicating that they are close to optimal for the problems studied. However, we acknowledge that further tuning could potentially improve performance for specific problem instances and are open to exploring adaptive parameter control in future work. Competing Interests: No competing interests were disclosed. Close Report a concern COMMENT ON THIS REPORT Views 0 Cite How to cite this report: FATIHA H and Boudissa Eg. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r329147 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-329147 NOTE: it is important to ensure the information in square brackets after the title is included in this citation. Close Copy Citation Details Reviewer Report 28 Oct 2024 HABBI FATIHA , Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria; Saad Dahlab University of Blida (Ringgold ID: 213442), Blida, Blida Province, Algeria El-ghalia Boudissa , Faculty of Technology, Saad Dahlab University of Blida, Blida,, Blida Province, Algeria; Automatic-Electrotechnic, Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria Approved with Reservations VIEWS 0 https://doi.org/10.5256/f1000research.169646.r329147 This paper aims to present a novel hybrid GA and NMA. It should make a contribution to enhance the exploitation capabilities of GA by using NMA. To highlight the performance of GANMA, it is tested across various benchmark functions and ... Continue reading READ ALL This paper aims to present a novel hybrid GA and NMA. It should make a contribution to enhance the exploitation capabilities of GA by using NMA. To highlight the performance of GANMA, it is tested across various benchmark functions and parameter estimation tasks. There are a number of issues with the methods and analysis that need to be clarified. The comments for authors are listed below 1- The authors should firstly focus on the necessity to hybrid the GA with NMA. This is followed by highlighting the problem that is still not covered by other researchers. 2- In the overview section, the authors mention that: GA is an approach to heuristic search. So, what is the difference between metaheuristic optimization method and heuristic search approach? 3- In Nelder–Mead Simplex Search Method section, the equations must be numbered. There is a sign error in one of the contraction equations of NMA. Equations 5 and 7 must be verified 4-The justification of using NMA in this paper is not clear. What is the merit of using NMA, while there are thousands of optimization algorithms? 5-The theoretical explanation on why the NMA tends to provide local solution, is not clearly explained. Please show a detail explanation on the demerit of the NMA. The author may support with some preliminary experiments 6-The authors define the simplex for the NM algorithm by selecting a set of initial points around the best solution found by the GA so far in the suggested algorithm’s (GANMA). Please show a detail explanation on the initial conditions choice of NMA 7-The authors must clarify what makes after mutation; just the mutated solutions are affected by NM algorithm. Or, the NM algorithm is applied to only the best solution after reproduction and when the end of the main loop is met. 8- When checking the Table 2, it shows less performance of GANMA for f 8 in three dimensions (-1.97E+01 (Best solution for n=10), -3.94E+01(Best solution for n=20), -9.86E+01(Best solution for n=30)). Please comment on these numbers. Therefore, the authors must clarify what makes the proposed method superior. 9- In conclusion, the authors mention that: To improve the exploitation capabilities of GA, this study presents a unique hybridized approach called the GANMA, in which NM is included. Please explain the point of a unique hybridized approach 10- The literature for the Weibull-parameter estimation methods is too old. The authors are required to use the most recent ones. Additionally, please put recent optimization algorithms Ref 1 Ref 2 Ref 3 Ref 4 Ref 5 The comments of co-reviewer This paper is an interesting study about parameter estimation using a hybrid genetic algorithm and Nelder Mead approach. Below, I give some major comments for improving it: 1. The authors need to mind the proper use of abbreviations and switching between them and their original terminologies. 2. Added reference to formulas. 3. An flowchart for proposed GANMA may be given by the authors in the paper for better understanding of the readers. 4. What is the role of benchmark function for an optimization technique? 5. In Table 2 on page 10 (f8 function), the GA gives best results than the GANMA in 10, 20 and 30 dimensions. Please comment on these numbers. 6. In page 7 (fourth section), the chosen reflected value α is not given in the paper. Also, the reason for the selected values of: γ=1.5, β=0.5 and η=0.5 must be listed. Why didn’t you use the standard NMA values ( α=1, β=2 and γ= η=0.5 ). In addition, these values ( α, β,γ and η) are the same values used for Weibull-Parameter Estimation. 7. In Figures 3 (f15), 4 (f5, f15) why there is a zigzag in the fitness graph. 7. In order to check the performance of the proposed GANMA, it is suggested to compare the proposed GANMA with another way of hybridization, which is explained below. - Apply the GA to locate the interval, which likely contains the global minimum. - Then, switch to the NMA assuming the final solution of the GA as a starting solution for NMA. 8. The literature for the Weibull-parameter estimation methods seems too old. Please put the recent optimization algorithms. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? I cannot comment. A qualified statistician is required. Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Bounekhla M, Habbi F, Boudissa E, Maamoun M, et al.: Combination of quadratic ranking selection real-coded genetic algorithm with the Hooke-Jeeves optimisation method for solar photovoltaic parameter estimation. International Journal of Ambient Energy . 2022; 43 (1): 7754-7765 Publisher Full Text 2. Boudissa E, Habbi F, Gabour N, Bounekhla M: Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy . 2023; 44 (1): 2283-2295 Publisher Full Text 3. Guo J, Kong X, Wu N, Xie L: Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology . 2023; 37 (11): 5797-5811 Publisher Full Text 4. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety . 2021; 207 . Publisher Full Text 5. EL-G BOUDISSA F, HABBI M, BOUNEKHLA N, DIF: A MEMETIC ALGORITHM APPLIED TO INDUCTION MACHINE PARAMETERS IDENTIFICATION BASED ON AN OUTPUT ERROR. https://journal.iem.pub.ro/rrst-ee/article/view/403/308 . 2023. Competing Interests: No competing interests were disclosed. Reviewer Expertise: Optimization methods; meta-heuristics; identification; induction machine; synchrounous generator; Automatic Voltage Regulation; Photovoltaic systems We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however we have significant reservations, as outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT FATIHA H and Boudissa Eg. Reviewer Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r329147 ) The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-329147 NOTE: it is important to ensure the information in square brackets after the title is included in all citations of this article. COPY CITATION DETAILS Report a concern Author Response 10 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 10 Mar 2025 Author Response Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning ... Continue reading Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, which NMA excels at. This synergy improves the algorithm's convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. Difference Between Metaheuristic Optimization and Heuristic Search: Response: Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. Errors in NMA Equations: Response: We have numbered all equations in the Nelder-Mead section and verify equations 5 and 7 for correctness. The contraction equations has been checked thoroughly for any sign errors and updated accordingly. Justification for Using NMA: Response: NMA is chosen for its simplicity and effectiveness in refining solutions locally, complementing the GA’s global search. While numerous algorithms exist, NMA’s low computational overhead and robustness in small-dimensional spaces make it a practical choice in this hybrid. Theoretical Explanation of NMA's Local Optimum Behavior: Response: NMA’s reliance on simplex geometry and local operations limits its exploration, often leading to convergence at local optima in complex landscapes. This demerit is illustrated through preliminary experiments (to be included) demonstrating its limitations in multimodal functions without GA’s global search support. Initial Conditions Choice in NMA: Response: The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA's exploration strength, as demonstrated in our results section. Application of NMA After Mutation: Response: NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. Performance in Table 2 (f8): Response: The less favorable performance of GANMA in f8 indicates its limitations in specific multimodal functions with narrow global basins. This highlights the need for further tuning of algorithm parameters or additional hybrid mechanisms to improve robustness. Unique Hybridized Approach: Response: GANMA uniquely integrates GA’s exploration with NMA’s exploitation in a seamless manner, ensuring a balance between global and local optimization that is not seen in existing hybrid methods. Recent Literature for Weibull Parameter Estimation: Response: Recent references for Weibull parameter estimation methods will be incorporated. We will also discuss newer optimization algorithms to enrich the literature review. Co-Reviewer Comments and Suggested Responses: Proper Use of Abbreviations: Response: We will ensure consistent use of abbreviations and their original terminologies throughout the manuscript. References to Formulas: Response: Additional references will be provided for all formulas where relevant. Flowchart for GANMA: Response: A flowchart illustrating GANMA’s process has been included to enhance understanding. Role of Benchmark Functions: Response: Benchmark functions serve as standard testbeds to evaluate and compare the performance of optimization algorithms in diverse scenarios. Performance in Table 2 (f8): Response: Addressed in point 8 above. Chosen NMA Parameters: Response: The chosen parameters (α, β, γ, η) align with standard practices and are validated through experiments for this study’s problem context. Their values are consistent across benchmark functions and Weibull parameter estimation. Zigzag in Fitness Graphs: Response: The zigzag behavior in Figures 3 and 4 reflects algorithm dynamics during exploitation phases, influenced by local searches or mutation operations. Alternative Hybridization Comparison: Response: We have added experimental result comparing with GANMA with a two-phase hybridization where GA identifies the interval, and NMA refines within it (GA-NMA). Section 5 (Table 2) Recent Optimization Algorithms: Response: Recent optimization methods has been reviewed and included to strengthen the manuscript’s relevance. Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, which NMA excels at. This synergy improves the algorithm's convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. Difference Between Metaheuristic Optimization and Heuristic Search: Response: Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. Errors in NMA Equations: Response: We have numbered all equations in the Nelder-Mead section and verify equations 5 and 7 for correctness. The contraction equations has been checked thoroughly for any sign errors and updated accordingly. Justification for Using NMA: Response: NMA is chosen for its simplicity and effectiveness in refining solutions locally, complementing the GA’s global search. While numerous algorithms exist, NMA’s low computational overhead and robustness in small-dimensional spaces make it a practical choice in this hybrid. Theoretical Explanation of NMA's Local Optimum Behavior: Response: NMA’s reliance on simplex geometry and local operations limits its exploration, often leading to convergence at local optima in complex landscapes. This demerit is illustrated through preliminary experiments (to be included) demonstrating its limitations in multimodal functions without GA’s global search support. Initial Conditions Choice in NMA: Response: The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA's exploration strength, as demonstrated in our results section. Application of NMA After Mutation: Response: NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. Performance in Table 2 (f8): Response: The less favorable performance of GANMA in f8 indicates its limitations in specific multimodal functions with narrow global basins. This highlights the need for further tuning of algorithm parameters or additional hybrid mechanisms to improve robustness. Unique Hybridized Approach: Response: GANMA uniquely integrates GA’s exploration with NMA’s exploitation in a seamless manner, ensuring a balance between global and local optimization that is not seen in existing hybrid methods. Recent Literature for Weibull Parameter Estimation: Response: Recent references for Weibull parameter estimation methods will be incorporated. We will also discuss newer optimization algorithms to enrich the literature review. Co-Reviewer Comments and Suggested Responses: Proper Use of Abbreviations: Response: We will ensure consistent use of abbreviations and their original terminologies throughout the manuscript. References to Formulas: Response: Additional references will be provided for all formulas where relevant. Flowchart for GANMA: Response: A flowchart illustrating GANMA’s process has been included to enhance understanding. Role of Benchmark Functions: Response: Benchmark functions serve as standard testbeds to evaluate and compare the performance of optimization algorithms in diverse scenarios. Performance in Table 2 (f8): Response: Addressed in point 8 above. Chosen NMA Parameters: Response: The chosen parameters (α, β, γ, η) align with standard practices and are validated through experiments for this study’s problem context. Their values are consistent across benchmark functions and Weibull parameter estimation. Zigzag in Fitness Graphs: Response: The zigzag behavior in Figures 3 and 4 reflects algorithm dynamics during exploitation phases, influenced by local searches or mutation operations. Alternative Hybridization Comparison: Response: We have added experimental result comparing with GANMA with a two-phase hybridization where GA identifies the interval, and NMA refines within it (GA-NMA). Section 5 (Table 2) Recent Optimization Algorithms: Response: Recent optimization methods has been reviewed and included to strengthen the manuscript’s relevance. Competing Interests: No competing interests were disclosed. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 10 Mar 2025 Rajashree Mishra , Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India 10 Mar 2025 Author Response Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning ... Continue reading Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, which NMA excels at. This synergy improves the algorithm's convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. Difference Between Metaheuristic Optimization and Heuristic Search: Response: Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. Errors in NMA Equations: Response: We have numbered all equations in the Nelder-Mead section and verify equations 5 and 7 for correctness. The contraction equations has been checked thoroughly for any sign errors and updated accordingly. Justification for Using NMA: Response: NMA is chosen for its simplicity and effectiveness in refining solutions locally, complementing the GA’s global search. While numerous algorithms exist, NMA’s low computational overhead and robustness in small-dimensional spaces make it a practical choice in this hybrid. Theoretical Explanation of NMA's Local Optimum Behavior: Response: NMA’s reliance on simplex geometry and local operations limits its exploration, often leading to convergence at local optima in complex landscapes. This demerit is illustrated through preliminary experiments (to be included) demonstrating its limitations in multimodal functions without GA’s global search support. Initial Conditions Choice in NMA: Response: The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA's exploration strength, as demonstrated in our results section. Application of NMA After Mutation: Response: NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. Performance in Table 2 (f8): Response: The less favorable performance of GANMA in f8 indicates its limitations in specific multimodal functions with narrow global basins. This highlights the need for further tuning of algorithm parameters or additional hybrid mechanisms to improve robustness. Unique Hybridized Approach: Response: GANMA uniquely integrates GA’s exploration with NMA’s exploitation in a seamless manner, ensuring a balance between global and local optimization that is not seen in existing hybrid methods. Recent Literature for Weibull Parameter Estimation: Response: Recent references for Weibull parameter estimation methods will be incorporated. We will also discuss newer optimization algorithms to enrich the literature review. Co-Reviewer Comments and Suggested Responses: Proper Use of Abbreviations: Response: We will ensure consistent use of abbreviations and their original terminologies throughout the manuscript. References to Formulas: Response: Additional references will be provided for all formulas where relevant. Flowchart for GANMA: Response: A flowchart illustrating GANMA’s process has been included to enhance understanding. Role of Benchmark Functions: Response: Benchmark functions serve as standard testbeds to evaluate and compare the performance of optimization algorithms in diverse scenarios. Performance in Table 2 (f8): Response: Addressed in point 8 above. Chosen NMA Parameters: Response: The chosen parameters (α, β, γ, η) align with standard practices and are validated through experiments for this study’s problem context. Their values are consistent across benchmark functions and Weibull parameter estimation. Zigzag in Fitness Graphs: Response: The zigzag behavior in Figures 3 and 4 reflects algorithm dynamics during exploitation phases, influenced by local searches or mutation operations. Alternative Hybridization Comparison: Response: We have added experimental result comparing with GANMA with a two-phase hybridization where GA identifies the interval, and NMA refines within it (GA-NMA). Section 5 (Table 2) Recent Optimization Algorithms: Response: Recent optimization methods has been reviewed and included to strengthen the manuscript’s relevance. Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, which NMA excels at. This synergy improves the algorithm's convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. Difference Between Metaheuristic Optimization and Heuristic Search: Response: Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. Errors in NMA Equations: Response: We have numbered all equations in the Nelder-Mead section and verify equations 5 and 7 for correctness. The contraction equations has been checked thoroughly for any sign errors and updated accordingly. Justification for Using NMA: Response: NMA is chosen for its simplicity and effectiveness in refining solutions locally, complementing the GA’s global search. While numerous algorithms exist, NMA’s low computational overhead and robustness in small-dimensional spaces make it a practical choice in this hybrid. Theoretical Explanation of NMA's Local Optimum Behavior: Response: NMA’s reliance on simplex geometry and local operations limits its exploration, often leading to convergence at local optima in complex landscapes. This demerit is illustrated through preliminary experiments (to be included) demonstrating its limitations in multimodal functions without GA’s global search support. Initial Conditions Choice in NMA: Response: The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA's exploration strength, as demonstrated in our results section. Application of NMA After Mutation: Response: NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. Performance in Table 2 (f8): Response: The less favorable performance of GANMA in f8 indicates its limitations in specific multimodal functions with narrow global basins. This highlights the need for further tuning of algorithm parameters or additional hybrid mechanisms to improve robustness. Unique Hybridized Approach: Response: GANMA uniquely integrates GA’s exploration with NMA’s exploitation in a seamless manner, ensuring a balance between global and local optimization that is not seen in existing hybrid methods. Recent Literature for Weibull Parameter Estimation: Response: Recent references for Weibull parameter estimation methods will be incorporated. We will also discuss newer optimization algorithms to enrich the literature review. Co-Reviewer Comments and Suggested Responses: Proper Use of Abbreviations: Response: We will ensure consistent use of abbreviations and their original terminologies throughout the manuscript. References to Formulas: Response: Additional references will be provided for all formulas where relevant. Flowchart for GANMA: Response: A flowchart illustrating GANMA’s process has been included to enhance understanding. Role of Benchmark Functions: Response: Benchmark functions serve as standard testbeds to evaluate and compare the performance of optimization algorithms in diverse scenarios. Performance in Table 2 (f8): Response: Addressed in point 8 above. Chosen NMA Parameters: Response: The chosen parameters (α, β, γ, η) align with standard practices and are validated through experiments for this study’s problem context. Their values are consistent across benchmark functions and Weibull parameter estimation. Zigzag in Fitness Graphs: Response: The zigzag behavior in Figures 3 and 4 reflects algorithm dynamics during exploitation phases, influenced by local searches or mutation operations. Alternative Hybridization Comparison: Response: We have added experimental result comparing with GANMA with a two-phase hybridization where GA identifies the interval, and NMA refines within it (GA-NMA). Section 5 (Table 2) Recent Optimization Algorithms: Response: Recent optimization methods has been reviewed and included to strengthen the manuscript’s relevance. Competing Interests: No competing interests were disclosed. Close Report a concern COMMENT ON THIS REPORT Comments on this article Comments (0) Version 3 VERSION 3 PUBLISHED 19 Sep 2024 ADD YOUR COMMENT Comment keyboard_arrow_left keyboard_arrow_right Open Peer Review Reviewer Status info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Reviewer Reports Invited Reviewers 1 2 3 Version 3 (revision) 07 Apr 25 read Version 2 (revision) 10 Mar 25 read Version 1 19 Sep 24 read read El-ghalia Boudissa , Saad Dahlab University of Blida, Blida,, Algeria; Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Algeria HABBI FATIHA , Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Algeria; Saad Dahlab University of Blida (Ringgold ID: 213442), Blida, Algeria Olympia Roeva , Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, Sofia, Bulgaria Gyan Singh , National Institute of Technology Agartala, Agartala, India Comments on this article All Comments (0) Add a comment Sign up for content alerts Sign Up You are now signed up to receive this alert Browse by related subjects keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Singh G. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 14 Aug 2025 | for Version 3 Gyan Singh , National Institute of Technology Agartala, Agartala, Tripura, India 0 Views copyright © 2025 Singh G. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (0) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions The approach leverages the global exploration capabilities of the GA to identify promising regions in the search space ,then utilize the local refinement capabilities of the Nelder-Mead algorithm to find the optimal solution within that region .The hybrid approach is applied to various parameter estimation problems, demonstrating its solutions compared to traditional methods. Is the work clearly and accurately presented and does it cite the current literature? Yes Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Partly If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise Optimization and Hybrid Of Optimization Algorithm and Fuzzy logic I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (0) Singh G. Peer Review Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.180009.r396886) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-1073/v3#referee-response-396886 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2025 Boudissa E et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 25 Mar 2025 | for Version 2 El-ghalia Boudissa , Faculty of Technology, Saad Dahlab University of Blida, Blida,, Blida Province, Algeria; Automatic-Electrotechnic, Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria HABBI FATIHA , Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria; Saad Dahlab University of Blida (Ringgold ID: 213442), Blida, Blida Province, Algeria 0 Views copyright © 2025 Boudissa E et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions We are pleased to inform you of the final decision about the revised paper "A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation" Reviewer 1: Dr. BOUDISSA EL GHALIA Decision: Accepted Reference 44 should be corrected as follows: 44. Boudissa E.,Habbi F., Bounekhla M., Dif N . : A Memetic algorithm applied to induction machine parameters identification based on an output error. Revue Roumaine Des Sciences Techniques — Série Électrotechnique et Énergétique. 2023; 68 (3): 266–270 . Publisher Full Text https://journal.iem.pub.ro/rrst- Reviewer 2: Dr. FATIHA HABBI I recommended that this manuscript can be indexed. References 1. BOUDISSA E, HABBI F, BOUNEKHLA M, DIF N: A MEMETIC ALGORITHM APPLIED TO INDUCTION MACHINE PARAMETERS IDENTIFICATION BASED ON AN OUTPUT ERROR. REVUE ROUMAINE DES SCIENCES TECHNIQUES — SÉRIE ÉLECTROTECHNIQUE ET ÉNERGÉTIQUE . 2023; 68 (3): 266-270 Publisher Full Text 2. Boudissa E, Habbi F, Gabour N, Bounekhla M: Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy . 2023; 44 (1): 2283-2295 Publisher Full Text 3. Guo J, Kong X, Wu N, Xie L: Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology . 2023; 37 (11): 5797-5811 Publisher Full Text 4. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety . 2021; 207 . Publisher Full Text 5. Fatiha.H., Nour El Houda G., Mohamed B., El Ghalia.B: Output voltage control of synchronous generator using Nelder –Mead algorithm based PI controller. IEEE xplore . Publisher Full Text Competing Interests No competing interests were disclosed. Reviewer Expertise Optimization methods; meta-heuristics; identification; induction machine; synchrounous generator; Automatic Voltage Regulation; Photovoltaic systems We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard. reply Respond to this report Responses (1) Author Response 27 Mar 2025 Rajashree Mishra, Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India Reviewer1 Reference 44 should be corrected as follows. Ans: Thank you for your suggestion, and as per the recommendation, Reference 44 has been corrected and implemented on page 37 in the reference section. Reviewer2 I recommended that this manuscript can be indexed. Ans: Thank you for your suggestion. As per the suggestion, the mentioned 5 references have been implemented in the reference sections as reference no 44, 45, 46, 47, and 48 on page 37. View more View less Competing Interests No competing interests were disclosed. reply Respond Report a concern Boudissa Eg and FATIHA H. Peer Review Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.176873.r370272) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-1073/v2#referee-response-370272 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Roeva O. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 06 Dec 2024 | for Version 1 Olympia Roeva , Bioinformatics and mathematical modelling, Institute of Biophysics and Biomedical Engineering, Bulgarian Academy of Sciences, Sofia, Bulgaria 0 Views copyright © 2024 Roeva O. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions Is the work clearly and accurately presented and does it cite the current literature?No. The paper structure should be reconsidered. First, all used/known methods and knowledge used in the research should be presented and then the proposed new techniques, the new results obtained – only results and experiments made by the authors. The presented results should be discussed and compared with similar published results. The references are not up to date. Recent titles should be added. 1/3 of the references are related to Weibull-Parameter Estimation and at the same time there is no deep analysis of the hybrids based on GA – their advantages and disadvantages, the existing gaps, and the role of the proposed hybrid in the current state of the art. The figures should appear after their introduction in the text. Figure 1 is mentioned on page 19, but appears on page 12. Is the study design appropriate and does the work have academic merit? Yes. Are sufficient details of methods and analysis provided to allow replication by others? No. For example, the applied GA selection operator is not given. The GA parameter, ggap, is not given. The fitness function is unknown. If applicable, is the statistical analysis and its interpretation appropriate? Yes. Are all the source data underlying the results available to ensure full reproducibility? Yes. Are the conclusions drawn adequately supported by the results? Yes. I have a few questions: Why reference 12 is cited in the sentence “The pseudo-code for the hybridization of the GA and Nelder-Mead simplex algorithm is presented in Algorithm. 12 ”? The NM algorithm works with a single solution and GA works with a population of the solutions. How is it performed the following step in pseudo-code 21: “Replace the worst individuals with the simplex’s best individuals”? The NM algorithm returns/gives only one solution, so only one worst individual can be replaced. How the GA and NM algorithm parameters are set? Are these parameters optimal? Is the work clearly and accurately presented and does it cite the current literature? No Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? Yes Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes Competing Interests No competing interests were disclosed. Reviewer Expertise metaheuristic algorithms for mathematical modelling and optimization I confirm that I have read this submission and believe that I have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however I have significant reservations, as outlined above. reply Respond to this report Responses (1) Author Response 10 Mar 2025 Rajashree Mishra, Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India Thank you for the comments and suggestions. Sorry, I have wrongly mentioned it and I have corrected it in the given new manuscript. We acknowledge the reviewer’s observation regarding the application of the Nelder-Mead (NM) algorithm, which works with a single solution while the Genetic Algorithm (GA) operates on a population. In our implementation, we address this by applying the NM algorithm to the first five best individuals from the population. For each individual, NM refines the solution, and the improved solution replaces the corresponding worst individual in the population. This process ensures that the benefits of NM’s local refinement are distributed across multiple candidates, effectively enhancing the population's overall quality. This approach leverages NM's exploitation strength while maintaining the diversity necessary for GA’s global exploration, striking an effective balance between the two methods. We address this in, sub-section 3.2(IV) We have created a section for parameter setups for GA, NMA, and GANMA. To ensure these parameters were suitable for our specific application, we conducted sensitivity analyses on a subset of benchmark functions, varying key parameters and assessing their impact on convergence speed and solution quality. The selected parameters demonstrated consistent performance across unimodal, multimodal, and shifted test functions, indicating that they are close to optimal for the problems studied. However, we acknowledge that further tuning could potentially improve performance for specific problem instances and are open to exploring adaptive parameter control in future work. View more View less Competing Interests No competing interests were disclosed. reply Respond Report a concern Roeva O. Peer Review Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r343361) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-343361 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2024 Boudissa E et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 28 Oct 2024 | for Version 1 HABBI FATIHA , Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria; Saad Dahlab University of Blida (Ringgold ID: 213442), Blida, Blida Province, Algeria El-ghalia Boudissa , Faculty of Technology, Saad Dahlab University of Blida, Blida,, Blida Province, Algeria; Automatic-Electrotechnic, Saad Dahlab University of Blida Faculty of Technology (Ringgold ID: 272254), Blida, Blida Province, Algeria 0 Views copyright © 2024 Boudissa E et al. This is an open access peer review report distributed under the terms of the Creative Commons Attribution License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. format_quote Cite this report speaker_notes Responses (1) Approved With Reservations info_outline Alongside their report, reviewers assign a status to the article: Approved The paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved Fundamental flaws in the paper seriously undermine the findings and conclusions This paper aims to present a novel hybrid GA and NMA. It should make a contribution to enhance the exploitation capabilities of GA by using NMA. To highlight the performance of GANMA, it is tested across various benchmark functions and parameter estimation tasks. There are a number of issues with the methods and analysis that need to be clarified. The comments for authors are listed below 1- The authors should firstly focus on the necessity to hybrid the GA with NMA. This is followed by highlighting the problem that is still not covered by other researchers. 2- In the overview section, the authors mention that: GA is an approach to heuristic search. So, what is the difference between metaheuristic optimization method and heuristic search approach? 3- In Nelder–Mead Simplex Search Method section, the equations must be numbered. There is a sign error in one of the contraction equations of NMA. Equations 5 and 7 must be verified 4-The justification of using NMA in this paper is not clear. What is the merit of using NMA, while there are thousands of optimization algorithms? 5-The theoretical explanation on why the NMA tends to provide local solution, is not clearly explained. Please show a detail explanation on the demerit of the NMA. The author may support with some preliminary experiments 6-The authors define the simplex for the NM algorithm by selecting a set of initial points around the best solution found by the GA so far in the suggested algorithm’s (GANMA). Please show a detail explanation on the initial conditions choice of NMA 7-The authors must clarify what makes after mutation; just the mutated solutions are affected by NM algorithm. Or, the NM algorithm is applied to only the best solution after reproduction and when the end of the main loop is met. 8- When checking the Table 2, it shows less performance of GANMA for f 8 in three dimensions (-1.97E+01 (Best solution for n=10), -3.94E+01(Best solution for n=20), -9.86E+01(Best solution for n=30)). Please comment on these numbers. Therefore, the authors must clarify what makes the proposed method superior. 9- In conclusion, the authors mention that: To improve the exploitation capabilities of GA, this study presents a unique hybridized approach called the GANMA, in which NM is included. Please explain the point of a unique hybridized approach 10- The literature for the Weibull-parameter estimation methods is too old. The authors are required to use the most recent ones. Additionally, please put recent optimization algorithms Ref 1 Ref 2 Ref 3 Ref 4 Ref 5 The comments of co-reviewer This paper is an interesting study about parameter estimation using a hybrid genetic algorithm and Nelder Mead approach. Below, I give some major comments for improving it: 1. The authors need to mind the proper use of abbreviations and switching between them and their original terminologies. 2. Added reference to formulas. 3. An flowchart for proposed GANMA may be given by the authors in the paper for better understanding of the readers. 4. What is the role of benchmark function for an optimization technique? 5. In Table 2 on page 10 (f8 function), the GA gives best results than the GANMA in 10, 20 and 30 dimensions. Please comment on these numbers. 6. In page 7 (fourth section), the chosen reflected value α is not given in the paper. Also, the reason for the selected values of: γ=1.5, β=0.5 and η=0.5 must be listed. Why didn’t you use the standard NMA values ( α=1, β=2 and γ= η=0.5 ). In addition, these values ( α, β,γ and η) are the same values used for Weibull-Parameter Estimation. 7. In Figures 3 (f15), 4 (f5, f15) why there is a zigzag in the fitness graph. 7. In order to check the performance of the proposed GANMA, it is suggested to compare the proposed GANMA with another way of hybridization, which is explained below. - Apply the GA to locate the interval, which likely contains the global minimum. - Then, switch to the NMA assuming the final solution of the GA as a starting solution for NMA. 8. The literature for the Weibull-parameter estimation methods seems too old. Please put the recent optimization algorithms. Is the work clearly and accurately presented and does it cite the current literature? Partly Is the study design appropriate and is the work technically sound? Yes Are sufficient details of methods and analysis provided to allow replication by others? Yes If applicable, is the statistical analysis and its interpretation appropriate? I cannot comment. A qualified statistician is required. Are all the source data underlying the results available to ensure full reproducibility? Yes Are the conclusions drawn adequately supported by the results? Yes References 1. Bounekhla M, Habbi F, Boudissa E, Maamoun M, et al.: Combination of quadratic ranking selection real-coded genetic algorithm with the Hooke-Jeeves optimisation method for solar photovoltaic parameter estimation. International Journal of Ambient Energy . 2022; 43 (1): 7754-7765 Publisher Full Text 2. Boudissa E, Habbi F, Gabour N, Bounekhla M: Improved Nelder-Mead algorithm for output voltage control of a synchronous generator. International Journal of Ambient Energy . 2023; 44 (1): 2283-2295 Publisher Full Text 3. Guo J, Kong X, Wu N, Xie L: Weibull parameter estimation and reliability analysis with small samples based on successive approximation method. Journal of Mechanical Science and Technology . 2023; 37 (11): 5797-5811 Publisher Full Text 4. Zhang C: Weibull parameter estimation and reliability analysis with zero-failure data from high-quality products. Reliability Engineering & System Safety . 2021; 207 . Publisher Full Text 5. EL-G BOUDISSA F, HABBI M, BOUNEKHLA N, DIF: A MEMETIC ALGORITHM APPLIED TO INDUCTION MACHINE PARAMETERS IDENTIFICATION BASED ON AN OUTPUT ERROR. https://journal.iem.pub.ro/rrst-ee/article/view/403/308 . 2023. Competing Interests No competing interests were disclosed. Reviewer Expertise Optimization methods; meta-heuristics; identification; induction machine; synchrounous generator; Automatic Voltage Regulation; Photovoltaic systems We confirm that we have read this submission and believe that we have an appropriate level of expertise to confirm that it is of an acceptable scientific standard, however we have significant reservations, as outlined above. reply Respond to this report Responses (1) Author Response 10 Mar 2025 Rajashree Mishra, Mathematics, Kalinga Institute of Industrial Technology, Bhubaneswar, 751024, India Reviewer Comments and Suggested Responses: Necessity of Hybridizing GA with NMA: Response: The hybridization of GA with NMA addresses the limitation of GA in fine-tuning solutions near optima, which NMA excels at. This synergy improves the algorithm's convergence speed and solution quality. Other researchers have primarily focused on individual optimization methods or hybridizations excluding GA and NMA, leaving a gap in fully exploiting the complementary strengths of these methods. Difference Between Metaheuristic Optimization and Heuristic Search: Response: Metaheuristic optimization methods like GA are higher-level frameworks designed to guide heuristic or local search procedures. In contrast, heuristic searches are problem-specific strategies for exploring the solution space. GA leverages metaheuristic principles to perform heuristic searches iteratively, balancing exploration and exploitation. Errors in NMA Equations: Response: We have numbered all equations in the Nelder-Mead section and verify equations 5 and 7 for correctness. The contraction equations has been checked thoroughly for any sign errors and updated accordingly. Justification for Using NMA: Response: NMA is chosen for its simplicity and effectiveness in refining solutions locally, complementing the GA’s global search. While numerous algorithms exist, NMA’s low computational overhead and robustness in small-dimensional spaces make it a practical choice in this hybrid. Theoretical Explanation of NMA's Local Optimum Behavior: Response: NMA’s reliance on simplex geometry and local operations limits its exploration, often leading to convergence at local optima in complex landscapes. This demerit is illustrated through preliminary experiments (to be included) demonstrating its limitations in multimodal functions without GA’s global search support. Initial Conditions Choice in NMA: Response: The simplex in NMA is defined around the best GA solution to ensure the refinement starts near a promising region. This choice leverages GA's exploration strength, as demonstrated in our results section. Application of NMA After Mutation: Response: NMA is applied to the best solution after reproduction and mutation in each iteration, not just the final solution. This strategy allows continuous refinement throughout the optimization process. Performance in Table 2 (f8): Response: The less favorable performance of GANMA in f8 indicates its limitations in specific multimodal functions with narrow global basins. This highlights the need for further tuning of algorithm parameters or additional hybrid mechanisms to improve robustness. Unique Hybridized Approach: Response: GANMA uniquely integrates GA’s exploration with NMA’s exploitation in a seamless manner, ensuring a balance between global and local optimization that is not seen in existing hybrid methods. Recent Literature for Weibull Parameter Estimation: Response: Recent references for Weibull parameter estimation methods will be incorporated. We will also discuss newer optimization algorithms to enrich the literature review. Co-Reviewer Comments and Suggested Responses: Proper Use of Abbreviations: Response: We will ensure consistent use of abbreviations and their original terminologies throughout the manuscript. References to Formulas: Response: Additional references will be provided for all formulas where relevant. Flowchart for GANMA: Response: A flowchart illustrating GANMA’s process has been included to enhance understanding. Role of Benchmark Functions: Response: Benchmark functions serve as standard testbeds to evaluate and compare the performance of optimization algorithms in diverse scenarios. Performance in Table 2 (f8): Response: Addressed in point 8 above. Chosen NMA Parameters: Response: The chosen parameters (α, β, γ, η) align with standard practices and are validated through experiments for this study’s problem context. Their values are consistent across benchmark functions and Weibull parameter estimation. Zigzag in Fitness Graphs: Response: The zigzag behavior in Figures 3 and 4 reflects algorithm dynamics during exploitation phases, influenced by local searches or mutation operations. Alternative Hybridization Comparison: Response: We have added experimental result comparing with GANMA with a two-phase hybridization where GA identifies the interval, and NMA refines within it (GA-NMA). Section 5 (Table 2) Recent Optimization Algorithms: Response: Recent optimization methods has been reviewed and included to strengthen the manuscript’s relevance. View more View less Competing Interests No competing interests were disclosed. reply Respond Report a concern FATIHA H and Boudissa Eg. Peer Review Report For: A novel hybrid genetic algorithm and Nelder-Mead approach and it’s application for parameter estimation [version 3; peer review: 2 approved, 1 approved with reservations] . F1000Research 2025, 13 :1073 ( https://doi.org/10.5256/f1000research.169646.r329147) NOTE: it is important to ensure the information in square brackets after the title is included in this citation. The direct URL for this report is: https://f1000research.com/articles/13-1073/v1#referee-response-329147 Alongside their report, reviewers assign a status to the article: Approved - the paper is scientifically sound in its current form and only minor, if any, improvements are suggested Approved with reservations - A number of small changes, sometimes more significant revisions are required to address specific details and improve the papers academic merit. Not approved - fundamental flaws in the paper seriously undermine the findings and conclusions Adjust parameters to alter display View on desktop for interactive features Includes Interactive Elements View on desktop for interactive features Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Stay Updated Sign up for content alerts and receive a weekly or monthly email with all newly published articles Register with F1000Research Already registered? Sign in Not now, thanks close PLEASE NOTE If you are an AUTHOR of this article, please check that you signed in with the account associated with this article otherwise we cannot automatically identify your role as an author and your comment will be labelled as a “User Comment”. If you are a REVIEWER of this article, please check that you have signed in with the account associated with this article and then go to your account to submit your report, please do not post your review here. If you do not have access to your original account, please contact us . All commenters must hold a formal affiliation as per our Policies . The information that you give us will be displayed next to your comment. User comments must be in English, comprehensible and relevant to the article under discussion. We reserve the right to remove any comments that we consider to be inappropriate, offensive or otherwise in breach of the User Comment Terms and Conditions . Commenters must not use a comment for personal attacks. When criticisms of the article are based on unpublished data, the data should be made available. I accept the User Comment Terms and Conditions Please confirm that you accept the User Comment Terms and Conditions. Affiliation ✕ refresh Please enter your institution. Note: To add your institution or organisation, start typing the name and then select the correct name from the list. Where applicable, the name will appear in both the original language and in English. Do not paste in the name. If the name does not appear in the drop-down list, we will display the information you have entered. ✕ refresh Country/Region * USA UK Canada China France Germany Afghanistan Aland Islands Albania Algeria American Samoa Andorra Angola Anguilla Antarctica Antigua and Barbuda Argentina Armenia Aruba Australia Austria Azerbaijan Bahamas Bahrain Bangladesh Barbados Belarus Belgium Belize Benin Bermuda Bhutan Bolivia Bosnia and Herzegovina Botswana Bouvet Island Brazil British Indian Ocean Territory British Virgin Islands Brunei Bulgaria Burkina Faso Burundi Cambodia Cameroon Canada Cape Verde Cayman Islands Central African Republic Chad Chile China Christmas Island Cocos (Keeling) Islands Colombia Comoros Congo Cook Islands Costa Rica Cote d'Ivoire Croatia Cuba Cyprus Czech Republic Democratic Republic of the Congo Denmark Djibouti Dominica Dominican Republic Ecuador Egypt El Salvador Equatorial Guinea Eritrea Estonia Ethiopia Falkland Islands Faroe Islands Federated States of Micronesia Fiji Finland France French Guiana French Polynesia French Southern Territories Gabon Georgia Germany Ghana Gibraltar Greece Greenland Grenada Guadeloupe Guam Guatemala Guernsey Guinea Guinea-Bissau Guyana Haiti Heard Island and Mcdonald Islands Holy See (Vatican City State) Honduras Hong Kong Hungary Iceland India Indonesia Iran Iraq Ireland Israel Italy Jamaica Japan Jersey Jordan Kazakhstan Kenya Kiribati Kosovo (Serbia and Montenegro) Kuwait Kyrgyzstan Lao People's Democratic Republic Latvia Lebanon Lesotho Liberia Libya Liechtenstein Lithuania Luxembourg Macao Madagascar Malawi Malaysia Maldives Mali Malta Marshall Islands Martinique Mauritania Mauritius Mayotte Mexico Minor Outlying Islands of the United States Moldova Monaco Mongolia Montenegro Montserrat Morocco Mozambique Myanmar Namibia Nauru Nepal Netherlands Antilles New Caledonia New Zealand Nicaragua Niger Nigeria Niue Norfolk Island North Korea North Macedonia Northern Mariana Islands Norway Oman Pakistan Palau Palestinian Territory Panama Papua New Guinea Paraguay Peru Philippines Pitcairn Poland Portugal Puerto Rico Qatar Reunion Romania Russian Federation Rwanda Saint Helena Saint Kitts and Nevis Saint Lucia Saint Pierre and Miquelon Saint Vincent and the Grenadines Samoa San Marino Sao Tome and Principe Saudi Arabia Senegal Serbia Seychelles Sierra Leone Singapore Slovakia Slovenia Solomon Islands Somalia South Africa South Georgia and the South Sandwich Is South Korea South Sudan Spain Sri Lanka Sudan Suriname Svalbard and Jan Mayen Swaziland Sweden Switzerland Syria Taiwan Tajikistan Tanzania Thailand The Gambia The Netherlands Timor-Leste Togo Tokelau Tonga Trinidad and Tobago Tunisia Turkey Turkmenistan Turks and Caicos Islands Tuvalu UK USA Uganda Ukraine United Arab Emirates United States Virgin Islands Uruguay Uzbekistan Vanuatu Venezuela Vietnam Wallis and Futuna West Bank and Gaza Strip Western Sahara Yemen Zambia Zimbabwe Please select your country/region. You must enter a comment. Competing Interests Please disclose any competing interests that might be construed to influence your judgment of the article's or peer review report's validity or importance. Competing Interests Policy Provide sufficient details of any financial or non-financial competing interests to enable users to assess whether your comments might lead a reasonable person to question your impartiality. Consider the following examples, but note that this is not an exhaustive list: Examples of 'Non-Financial Competing Interests' Within the past 4 years, you have held joint grants, published or collaborated with any of the authors of the selected paper. You have a close personal relationship (e.g. parent, spouse, sibling, or domestic partner) with any of the authors. You are a close professional associate of any of the authors (e.g. scientific mentor, recent student). You work at the same institute as any of the authors. You hope/expect to benefit (e.g. favour or employment) as a result of your submission. You are an Editor for the journal in which the article is published. Examples of 'Financial Competing Interests' You expect to receive, or in the past 4 years have received, any of the following from any commercial organisation that may gain financially from your submission: a salary, fees, funding, reimbursements. You expect to receive, or in the past 4 years have received, shared grant support or other funding with any of the authors. You hold, or are currently applying for, any patents or significant stocks/shares relating to the subject matter of the paper you are commenting on. Please state your competing interests The comment has been saved. An error has occurred. Please try again. Cancel Post var lTitle = "A novel hybrid genetic algorithm and Nelder-Mead...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/13-1073/v3" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/13-1073/v3&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/13-1073/v3" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Majhi N and Mishra R'); var offsetTop = /chrome/i.test( navigator.userAgent ) ? 4 : -10; var addthis_config = { ui_offset_top: offsetTop, services_compact : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_expanded : "facebook,twitter,www.linkedin.com,www.mendeley.com,reddit.com", services_custom : [ { name: "LinkedIn", url: linkedInUrl, icon:"/img/icon/at_linkedin.svg" }, { name: "Mendeley", url: "http://www.mendeley.com/import/?url=https://f1000research.com/articles/13-1073/v3/mendeley", icon:"/img/icon/at_mendeley.svg" }, { name: "Reddit", url: redditUrl, icon:"/img/icon/at_reddit.svg" }, ] }; var addthis_share = { url: "https://f1000research.com/articles/13-1073", templates : { twitter : "A novel hybrid genetic algorithm and Nelder-Mead approach and.... Majhi N and Mishra R, published by " + "@F1000Research" + ", https://f1000research.com/articles/13-1073/v3" } }; if (typeof(addthis) != "undefined"){ addthis.addEventListener('addthis.ready', checkCount); addthis.addEventListener('addthis.menu.share', checkCount); } $(".f1r-shares-twitter").attr("href", "https://twitter.com/intent/tweet?text=" + addthis_share.templates.twitter); $(".f1r-shares-facebook").attr("href", "https://www.facebook.com/sharer/sharer.php?u=" + addthis_share.url); $(".f1r-shares-linkedin").attr("href", addthis_config.services_custom[0].url); $(".f1r-shares-reddit").attr("href", addthis_config.services_custom[2].url); $(".f1r-shares-mendelay").attr("href", addthis_config.services_custom[1].url); function checkCount(){ setTimeout(function(){ $(".addthis_button_expanded").each(function(){ var count = $(this).text(); if (count !== "" && count != "0") $(this).removeClass("is-hidden"); else $(this).addClass("is-hidden"); }); }, 1000); } close How to cite this report {{reportCitation}} Cancel Copy Citation Details $(function(){R.ui.buttonDropdowns('.dropdown-for-downloads');}); $(function(){R.ui.toolbarDropdowns('.toolbar-dropdown-for-downloads');}); $.get("/articles/acj/154598/180009") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "180009"); $(document).ready(function() { $( "#frame1" ).on('load', function() { var mydiv = $(this).contents().find("div"); var h = mydiv.height(); console.log(h) }); var tooltipLivingFigure = jQuery(".interactive-living-figure-label .icon-more-info"), titleLivingFigure = tooltipLivingFigure.attr("title"); tooltipLivingFigure.simpletip({ fixed: true, position: ["-115", "30"], baseClass: 'small-tooltip', content:titleLivingFigure + " " }); tooltipLivingFigure.removeAttr("title"); $("body").on("click", ".cite-living-figure", function(e) { e.preventDefault(); var ref = $(this).attr("data-ref"); $(this).closest(".living-figure-list-container").find("#" + ref).fadeIn(200); }); $("body").on("click", ".close-cite-living-figure", function(e) { e.preventDefault(); $(this).closest(".popup-window-wrapper").fadeOut(200); }); $(document).on("mouseup", function(e) { var metricsContainer = $(".article-metrics-popover-wrapper"); if (!metricsContainer.is(e.target) && metricsContainer.has(e.target).length === 0) { $(".article-metrics-close-button").click(); } }); var articleId = $('#articleId').val(); if($("#main-article-count-box").attachArticleMetrics) { $("#main-article-count-box").attachArticleMetrics(articleId, { articleMetricsView: true }); } }); var figshareWidget = $(".new_figshare_widget"); if (figshareWidget.length > 0) { window.figshare.load("f1000", function(Widget) { // Select a tag/tags defined in your page. In this tag we will place the widget. _.map(figshareWidget, function(el){ var widget = new Widget({ articleId: $(el).attr("figshare_articleId") //height:300 // this is the height of the viewer part. [Default: 550] }); widget.initialize(); // initialize the widget widget.mount(el); // mount it in a tag that's on your page // this will save the widget on the global scope for later use from // your JS scripts. This line is optional. //window.widget = widget; }); }); } close Error Close Add Reset F1000.MICROSERVICES.AFFILIATION = ''; $(document).ready(function () { $('.js-affiliations-form').each((index, form) => { new AffiliationForm({ formId: form.id, institutionErrorSelector: '.comment-enter-institution', departmentErrorSelector: '.comment-enter-department', placeSelector: '.js-add-comment-place', stateSelector: '.js-add-comment-state', zipCodeSelector: '.js-add-comment-zipcode', countrySelector: '.js-add-comment-country', countryErrorSelector: '.comment-enter-country', }); }); }); $(document).ready(function () { var reportIds = { "329141": 0, "329143": 0, "376375": 0, "329142": 0, "376374": 0, "380854": 0, "329149": 0, "380861": 0, "329148": 0, "380860": 0, "380863": 0, "329150": 0, "380862": 0, "329145": 0, "380857": 0, "329144": 0, "380856": 0, "329147": 38, "380859": 0, "329146": 0, "380858": 0, "343365": 0, "343364": 0, "343367": 0, "343366": 0, "343361": 16, "343360": 0, "380864": 0, "343363": 0, "343362": 0, "396879": 0, "377935": 0, "377934": 0, "343369": 0, "343368": 0, "383189": 0, "377941": 0, "396886": 5, "396887": 0, "383188": 0, "377940": 0, "396884": 0, "383191": 0, "326359": 0, "396885": 0, "383190": 0, "396882": 0, "377937": 0, "396883": 0, "377936": 0, "396880": 0, "383187": 0, "377939": 0, "396881": 0, "383186": 0, "377938": 0, "332637": 0, "326364": 0, "332636": 0, "326365": 0, "332639": 0, "326366": 0, "370271": 0, "332638": 0, "326367": 0, "326360": 0, "383193": 0, "326361": 0, "383192": 0, "326362": 0, "396888": 0, "383195": 0, "326363": 0, "383194": 0, "332645": 0, "332644": 0, "332641": 0, "326368": 0, "332640": 0, "370272": 20, "332643": 0, "332642": 0, }; $(".referee-response-container,.js-referee-report").each(function(index, el) { var reportId = $(el).attr("data-reportid"), reportCount = reportIds[reportId] || 0; $(el).find(".comments-count-container,.js-referee-report-views").html(reportCount); }); var uuidInput = $("#article_uuid"), oldUUId = uuidInput.val(), newUUId = "06f2b391-b7b0-4c04-a3f4-a1eae5fa1182"; uuidInput.val(newUUId); $("a[href*='article_uuid=']").each(function(index, el) { var newHref = $(el).attr("href").replace(oldUUId, newUUId); $(el).attr("href", newHref); }); }); An innovative open access publishing platform offering rapid publication and open peer review, whilst supporting data deposition and sharing. Browse Gateways Collections How it Works Contact For Developers Cookie Notice Privacy Notice RSS Submit Your Research Follow us © 2012-2026 F1000 Research Ltd. ISSN 2046-1402 | Legal | Partner of Research4Life • CrossRef • ORCID • FAIRSharing R.templateTests.simpleTemplate = R.template(' $text $text $text $text $text '); R.templateTests.runTests(); var F1000platform = new F1000.Platform({ name: "f1000research", displayName: "F1000Research", hostName: "f1000research.com", id: "1", editorialEmail: "[email protected]", infoEmail: "[email protected]", usePmcStats: true }); $(function(){R.ui.dropdowns('.dropdown-for-authors, .dropdown-for-about, .dropdown-for-myresearch');}); // $(function(){R.ui.dropdowns('.dropdown-for-referees');}); $(document).ready(function () { if ($(".cookie-warning").is(":visible")) { $(".sticky").css("margin-bottom", "35px"); $(".devices").addClass("devices-and-cookie-warning"); } $(".cookie-warning .close-button").click(function (e) { $(".devices").removeClass("devices-and-cookie-warning"); $(".sticky").css("margin-bottom", "0"); }); $("#tweeter-feed .tweet-message").each(function (i, message) { var self = $(message); self.html(linkify(self.html())); }); $(".partner").on("mouseenter mouseleave", function() { $(this).find(".gray-scale, .colour").toggleClass("is-hidden"); }); }); Sign In Remember me Forgotten your password? Sign In Cancel Email or password not correct. Please try again Please wait... $(function(){ // Note: All the setup needs to run against a name attribute and *not* the id due the clonish // nature of facebox... $("a[id=googleSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("GOOGLE"); $("form[id=oAuthForm]").submit(); }); $("a[id=facebookSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("FACEBOOK"); $("form[id=oAuthForm]").submit(); }); $("a[id=orcidSignInButton]").click(function(event){ event.preventDefault(); $("input[id=oAuthSystem]").val("ORCID"); $("form[id=oAuthForm]").submit(); }); }); If you've forgotten your password, please enter your email address below and we'll send you instructions on how to reset your password. The email address should be the one you originally registered with F1000. Email address not valid, please try again You registered with F1000 via Google, so we cannot reset your password. To sign in, please click here . If you still need help with your Google account password, please click here . You registered with F1000 via Facebook, so we cannot reset your password. To sign in, please click here . If you still need help with your Facebook account password, please click here . Code not correct, please try again Reset password Cancel Email us for further assistance. Server error, please try again. If your email address is registered with us, we will email you instructions to reset your password. If you think you should have received this email but it has not arrived, please check your spam filters and/or contact for further assistance. Please wait... Register $(document).ready(function () { signIn.createSignInAsRow($("#sign-in-form-gfb-popup")); $(".target-field").each(function () { var uris = $(this).val().split("/"); if (uris.pop() === "login") { $(this).val(uris.toString().replace(",","/")); } }); });