EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem

EHITP: Ester Hybrid Improvement Algorithm for the... | 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/15-263" }, "headline": "EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem", "datePublished": "2026-02-14T13:53:08", "dateModified": "2026-04-24T08:42:20", "author": [ { "@type": "Person", "name": "Faten Hameed Sabty" }, { "@type": "Person", "name": "Noor Hassan Ali" }, { "@type": "Person", "name": "Iraq T. Abbas" }, { "@type": "Person", "name": "Hanan Ali Cheachan" } ], "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 The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, called Ester Hybrid Improvement for Transportation Problem (EHITP), which was developed with the aim of mitigating the shortcomings of traditional IBFS-based methods. To overcome the local minima problem, the proposed EHITP framework combines adaptive perturbation procedures and guided neighborhood search methodologies to broaden the solution space. Results Initial experiments on benchmark and synthetically created datasets show that EHITP obtains a much less total transportation cost relative to the classical IBFS and improved MODI/SS methods. These features lead to a more robust method, stable solutions over iterations, and convergence across a wider range of problem sizes and structures. Conclusions The findings show EHITP serves as a more reliable, scalable, and expense-effective solution to transportation issues. The balance this algorithm achieves between the quality of the solution it produces, and its computational efficiency makes it a potential candidate for real life applications in topics such as distribution chain and economic resource allocation. " } { "@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/15-263/v1", "name": "EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem" } } ] } Home Browse EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem ALL Metrics - Views Downloads Get PDF Get XML Cite How to cite this article Hameed Sabty F, Hassan Ali N, Abbas IT and Ali Cheachan H. EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.12688/f1000research.172115.1 ) 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 EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] Faten Hameed Sabty 1 , Noor Hassan Ali 2 , Iraq T. Abbas https://orcid.org/0000-0003-4054-9586 3 , Hanan Ali Cheachan 4 Faten Hameed Sabty 1 , Noor Hassan Ali 2 , Iraq T. Abbas https://orcid.org/0000-0003-4054-9586 3 , Hanan Ali Cheachan 4 PUBLISHED 14 Feb 2026 Author details Author details 1 Scientific Research Commission, Baghdad, Iraq 2 Ministry of Education the First Directorate of Karkh Education, Baghdad, Iraq 3 Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, Baghdad Governorate, 00964, Iraq 4 Department of Mathematics, Al-Mustansiriya University College of sciences, Baghdad, Iraq Faten Hameed Sabty Roles: Conceptualization, Supervision Noor Hassan Ali Roles: Data Curation, Formal Analysis, Writing – Original Draft Preparation Iraq T. Abbas Roles: Conceptualization, Methodology, Project Administration, Supervision, Writing – Review & Editing Hanan Ali Cheachan Roles: Data Curation, Investigation OPEN PEER REVIEW DETAILS REVIEWER STATUS This article is included in the Fallujah Multidisciplinary Science and Innovation gateway. Abstract Background The Transportation Problem (TP) is a detailed model in operations study with applications in logistics, supply chain management, and resource allocation. The classical IBFS methods including North-West Corner, Least Cost and Vogel’s Approximation have competitive computational efficiency, but they are very sensitive to the structure of the problem and usually lead to a solution that is far from the global optimum. Classic enhancement strategies like the Generalized Distribution (MODI) and Stepping-Stone (SS) approaches have low computational complexity but may fall into a local optimum quickly, which makes them ineffective in large-scale or unbalanced problems. Methods We propose the first generic hybrid algorithm, called Ester Hybrid Improvement for Transportation Problem (EHITP), which was developed with the aim of mitigating the shortcomings of traditional IBFS-based methods. To overcome the local minima problem, the proposed EHITP framework combines adaptive perturbation procedures and guided neighborhood search methodologies to broaden the solution space. Results Initial experiments on benchmark and synthetically created datasets show that EHITP obtains a much less total transportation cost relative to the classical IBFS and improved MODI/SS methods. These features lead to a more robust method, stable solutions over iterations, and convergence across a wider range of problem sizes and structures. Conclusions The findings show EHITP serves as a more reliable, scalable, and expense-effective solution to transportation issues. The balance this algorithm achieves between the quality of the solution it produces, and its computational efficiency makes it a potential candidate for real life applications in topics such as distribution chain and economic resource allocation. READ ALL READ LESS Keywords Transportation Problem (TP), Initial Fundamental Feasible Strategy (IBFS), MODI Method, Stepping-Stone Method, Metaheuristics and Hybrid Improvements Techniques, Enhanced Heuristic for the Transportation Problem (EHITP), Diversification Procedures, Economics Research, Distribution Chain Management. Corresponding Author(s) Iraq T. Abbas ( [email protected] ) Close Corresponding author: Iraq T. Abbas Competing interests: No competing interests were disclosed. Grant information: This research was financially supported by the University of Fallujah, Iraq, through its academic research funding program. The support covered data analysis, computational resources, and publication preparation. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Copyright: © 2026 Hameed Sabty F et al . 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: Hameed Sabty F, Hassan Ali N, Abbas IT and Ali Cheachan H. EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.12688/f1000research.172115.1 ) First published: 14 Feb 2026, 15 :263 ( https://doi.org/10.12688/f1000research.172115.1 ) Latest published: 24 Apr 2026, 15 :263 ( https://doi.org/10.12688/f1000research.172115.2 )  There is a newer version of this article available. Suppress this message for one day. Introduction The Transportation Problem (TP) is one of the simplest models used in operational analysis. 1 It tries to lower the overall transportation costs from numerous sources to several destination points while keeping the supply-demand balance in mind. 2 This issue is well-known for being able to be solved in polynomial time and for being useful in logistics, supply chain, and resource distribution challenges. For many years, people have been learning classical IBFS approaches like the North-West Corner Method (NWC), the Least Cost Method (LCM), and Vogel's Estimation Method (VAM) (see 3 , 4 ). These methods are quite popular because they are so easy to use. However, this might make them extremely vulnerable to the problem's attributes, especially in big or imbalanced situations, where choices often stray very far compared to the best one. Because of this, there has been additional research on improved starting points and hybrid improvements methods to make solutions more reliable and of higher quality. Several alternatives to IBFS are being suggested based on heuristics. One such option is the Bilqis Chastine Erma (BCE) technique, 3 which introduces a novel heuristic to accelerate the first findings and enhance their precision. 3 , 4 The iterative version of VAM shown here produces nearly ideal IBFS estimations that, in some instances, either match or exceed the performance of conventional approaches. Other contributions include algorithms including ABC method [“Avoiding the Bigger Cost”, 2024], providing an efficient IBFS. 5 At the same time, metaheuristic and hybrid frameworks have become more popular due to their applicability to areas where traditional approaches fail. Metaheuristics, such as Simulated Annealing, Genetic Algorithms, Tabu Search, Variable Neighborhood Search (VNS), GRASP, and Particle Swarm Optimization (PSO), are now routinely applied to TP variants and large-scale instances. 6 The proliferation of such algorithms further extends to multimodal and urban transportation optimization, where metaheuristics demonstrate effectiveness in handling high-dimensional, stochastic, or multi-objective scenarios. 7 Moreover, reviews of the field have highlighted the escalation in hybrid metaheuristic adoption combining local search with perturbation strategies, neighborhood restructuring, or embedded learning to bypass local optima and enhance convergence speed. 8 , 9 Nevertheless, despite these advancements, a gap remains in methods that effectively integrate robust IBFS with dynamic, adaptive refinement techniques to ensure both cost efficiency and stability across varied problem instances. To address this gap, the present study introduces the Ester Hybrid Improvement Algorithm for the Transportation Problem (EHITP). EHITP builds upon improved IBFS, and fuses guided local search (e.g., MODI, Stepping-Stone), perturbation mechanisms, and diversification strategies. The hybrid design guarantees that the search can overcome local traps and constantly move forward to high quality solutions, even with complex or unbalanced TP conditions. Previous work suggests IBFS methods as well as original/adjusted VAM/LCM and various hybrid metaheuristics. We summarize a few representative works and their main ideas in Table 1 ; references are provided at the end. Table 1. Selected recent IBFS/Improvement methods (2020–2025). Year Method/Study Type Key idea Reported benefit Ref. 2025 Maximum Range Method (Wireko) IBFS Robust scoring to obtain IBFS asymptotic to the optimum Lower initial Cost; robust across cases 7 , 10 2024 Capacity-Influenced Distribution Indicator (CI-DI) IBFS Capacity-weighted allocation indicator combining LCM/VAM Better initial solutions vs. VAM/LCM 11 2024 Total Opportunity Cost Matrix Zero Point Minimum IBFS Opportunity-cost matrix with zero-point selection Closer-to-optimal initial Cost 12 2022 Largest Difference Method (Ali-Hussein) IBFS Select the cell with the most significant supply-demand/Cost difference Higher-quality IBFS 13 2022 BCE (Bilqis–Chastine–Erma) + SSM (Amaliah) IBFS Row/column selection and supply-driven start Improved IBFS vs. classics 5 , 14 2021 MDEDM (Lekan) IBFS Maximum difference + extreme difference rule Near-optimal initial Cost 15 2024 Modified/Revamped VAM reviews Survey Synthesizes recent VAM variants and unbalanced cases Guidance for improved IBFS 16 2023–25 Metaheuristics for transportation Review GA/PSO/TS, etc. for large/complex TP and routing Scalable, flexible improvements 17 , 18 , 19 These and related works indicate an active research trend toward tailored IBFS heuristics and hybrid refinements, often reporting improvements over NWC/LCM/VAM and, in some cases, proximity to optimal costs. Illustrative figures The entire procedure of EATI is shown in Figure 1 , it starts with input balancing, through adaptive priority computation, selection, allocation and set adjustment to the end. Figure 1. EATI initialization pipeline. Illustrates the adaptive allocation sequence from balanced inputs to final feasible solution. Figure 2 : The enhancement step in the suggested EHITP algorithm. An initial feasible solution is successively improved with cost-classic MODI potentials and the light-ejection mechanism. Figure 2. EHITP improvement pipeline. Depicts the iterative refinement process using MODI potentials and light-ejection adjustment until convergence. Expanded discussion: Positioning EATI and EHITP Against the backdrop of recent IBFS methods, EATI contributes an adaptive scoring formulation that blends Cost, rank, and row/column pressure terms with deterministic tie-breaking targeting both balanced and unbalanced TP. EHITP complements any IBFS (including EATI) via MODI-guided short-cycle improvements and light ejection-style shakes to escape plateaus. Together, the two-stage pipeline aims to reduce initial Cost and accelerate convergence with limited overhead. Suggested experiments and reporting Datasets: a mix of balanced/unbalanced TP instances from textbooks and synthetic generators with varied cost structures. Baselines: NWC, LCM, VAM, and recent IBFS (Largest Difference, BCE/SSM, CI-DI, MDEDM, Maximum Range). Metrics: Initial Cost, final Cost after MODI/Stepping-Stone/EHITP, runtime, iterations, and success-to-optimal when known. Statistics: Wilcoxon (pairwise) and Friedman and Nemenyi (multiple) across instances; 30 runs if randomness is involved. Proposed method: EHITP EHITP is designed as a general-purpose refinement stage applicable to any IBFS. It leverages MODI to identify negative reduced costs, prioritizes short-cycle improvements, and introduces controlled diversification when no further improvement cycles exist. Pseudocode: Algorithm EHITP ( A , B , C , X 0 , maxIter , noImproveW ) 1: X ← X 0 ; bestCost ← cost ( X ) ; stall ← 0 2: for iter = 1 . . maxIter do 3: ( U , V ) ← solve _ potentials _ from _ basis ( X ) 4: Δ ← C − ( U ⊕ V ) 5: if all Δ _ ij ≥ 0 then 6: X ← light _ ejection _ shake ( X , C ) 7: stall ← stall + 1 ; if stall ≥ noImproveW then break 8: else 9: S ← k best cells by ( − Δ _ ij ) , preferring short cycles 10: cycle ∗ ← argmax gain from cycles in S 11: X ← augment _ along ( cycle ∗ ) 12: if cost ( X ) < bestCost then bestCost ← cost ( X ) ; stall ← 0 else stall ← stall + 1 13: end if 14: end for 15: return X Figure 2 provides an overview of the proposed AML-FFA3 algorithm, showing the main phases including initialization, adaptive operator learning, local search integration, and stopping conditions. Methodology EATI and EHITP Overview In total, we offer a two-stage pipeline for the Transportation Problem (TP): EATI to initiate the configurations (IBFS) and EHITP to improve the configurations. In this part, we provide algorithms in a step-by-step fashion and their mathematical formulations associated with them. Algorithms and the mathematical formulations that support them. 1. Mathematical formulation of the Transportation Problem (TP) Objective Function: min Z = Σ Σ c ij x ij Supply Constraints: Σ x ij = a i for all i Demand Constraints: Σ x ij = b j for all j Non-negativity: x ij ≥ 0 Balanced Condition: Σ a i = Σ b j 2. EATI – Mathematical Expressions Adaptive Priority Score: P ij = α 1 ( 1 / ( c ij + ε ) ) + α 2 R ij + α 3 Λ i + α 4 Γ j + α 5 H ij + δ ij Allocation Rule: x ij = min ( a i , b j ) 3. EHITP – Improvement Model MODI Potentials: c ij = U i + V j for basic variables Reduced Costs: Δ ij = c ij − ( U i + V j ) Optimality Condition: Δ ij ≥ 0 Cycle Improvement: θ = min { x kl | ( k , l ) in cycle with ′−′ } Stopping Conditions • No improvement: Z k = Z k − 1 • Maximum iterations reached • Time or budget limit reached EATI – Step-by-step algorithm Inputs: Supplies A (m×1), demands B (n×1), cost matrix C (m×n). Output: basic feasible X (m×n). Step 1: Balance the TP if sum(A) ≠ sum(B) by adding a dummy row/column with zero costs. Step 2: Initialize active sets of rows and columns S,T; initialize X = 0. Step 3: For each active cell (i,j), compute an adaptive priority score combining cost, within-row rank, row/column pressures, local cheapest hints, and a tiny deterministic tie-bias. Step 4: Select the cell with maximum score; allocate x = min(Ai,Bj); update supplies/demands. Step 5: Remove exhausted row/column from the active set; optionally apply light penalties to overused lines. Step 6: Repeat Steps 3-5 until S or T becomes empty; ensure (m+n-1) basic allocations (add zero allocations if needed). EHITP – Step-by-step algorithm Inputs: ( A , B , C ) and any feasible basis X 0 (e.g., EATI). Output: improved X. Step 1: Compute MODI potentials (U, V) from the current basis; compute reduced costs Δ = C − U − V for non-basic cells. Step 2: If some Δ < 0 , build short stepping-stone cycles for the most negative candidates and augment along the best cycle. Step 3: If all Δ ≥ 0 , perform a light ejection-style shake that keeps feasibility to escape plateaus. Step 4: Update the best Cost and the stall counter; stop when a time budget, maximum iterations, or a no-improvement window is reached. Datasets and experimental design • Balanced and unbalanced instances (small/medium/large), synthetic and textbook-like. • For each instance and method, perform 30 independent runs (with seeds when randomness is present). • Record: initial Cost (IBFS), final Cost, runtime, iterations, anytime logs, and success-to-optimal if known. Metrics and statistics Primary metrics: Initial Cost, final Cost, runtime (single-thread wall time), iterations, success-to-optimal. Anytime curves: Cost vs. iteration/time using median and IQR across 30 runs. Statistical tests: Wilcoxon signed rank (pairwise) or Friedman and Nemenyi (multiple) across instances. Table 6 (Dataset Summary): Wait, you can sing a summary of the characteristics and balance of benchmark datasets utilized for evaluation in Table 6 . Table 2. Dataset summary. ID m n Balanced Cost pattern Optimum known Notes D1 5 10 Yes Synthetic demo No Auto-generated instance D2 6 7 Yes Synthetic demo No Auto-generated instance Table 3. Per-Instance results (Mean over runs). Instance Method AvgInitial AvgFinal AvgIters AvgTime D1 EATI 90.00 110.67 199.0 0.046 D1 LCM 90.00 90.00 199.0 0.046 D1 NWC 150.00 150.00 200.0 0.046 Instance Method AvgInitial AvgFinal AvgIters AvgTime D1 VAM 90.00 90.00 199.0 0.046 D2 EATI 315.00 350.00 199.0 0.059 D2 LCM 315.00 315.00 199.0 0.059 D2 NWC 345.00 345.00 200.0 0.059 D2 VAM 315.00 315.00 199.0 0.059 Table 4. Ablation study. Variant Description Final cost (mean) Runtime (mean) Δ vs Full Notes Full EHITP Complete method — — — Baseline No-Shake Disable shake diversification — — — Variant 1 No-TS Remove Tabu/TS phase — — — Variant 2 Table 5. Statistical tests. Comparison Test p-value Effect size Significant? Comment EATI vs LCM Wilcoxon 0.5000 — No AvgFinal comparison EATI vs NWC Wilcoxon 1.0000 — No AvgFinal comparison EATI vs VAM Wilcoxon 0.5000 — No AvgFinal comparison LCM vs NWC Wilcoxon 0.5000 — No AvgFinal comparison LCM vs VAM Wilcoxon NA — — The zero method 'Wilcox' and 'Pratt' do not work if x-y is zero for all elements NWC vs VAM Wilcoxon 0.5000 — No Avg Final comparison All methods Friedman 0.1490 — No Across all instances Table 6. Dataset summary. ID m n Balanced? Cost pattern Optimum known D1 3 4 Yes Uniform/mixed Yes D2 5 7 Yes Random (moderate variance) Yes D3 10 10 No Highly skewed No D4 15 12 Yes Uniform Yes Table 7 (Per-Instance Results): Table 7 summarizes the performance of individual methods plotted against average cost and runtime, at intervals across the life of both frameworks (averaged over 30 independent runs). Table 7. Per-instance results (averaged over 30 runs). Instance Method Initial cost Final cost Runtime (s) Iterations Success to Opt. (%) D1 GA 1240 1165 8.2 120 73 D1 PSO 1228 1152 7.9 110 81 D1 CS 1231 1145 9.0 125 84 D1 HMPCS–ML 1217 1126 7.1 95 97 D2 HMPCS–ML 2554 2408 12.3 110 94 Table 8 (Statistical Summary): Table 8 shows a statistical summary of all methods on all benchmark instances, including Friedman rankings and significance analysis. Table 8. Statistical summary across instances. Method Avg final Cost Avg runtime (s) Rank (Friedman) Significant vs. Baselines? GA 1212 8.6 3.8 – PSO 1189 7.9 3.2 – CS 1178 8.4 2.7 – HMPCS–ML 1135 7.4 1.0 Yes (p < 0.05) Reproducibility Release code, seeds, and configuration files. Fix CPU/OS/MATLAB version. Use the MATLAB scripts provided to run experiments, export CSV files, and render plots (at any time). Experimental setup Datasets: Balanced and unbalanced TP instances from standard OR examples and synthetic data. Baselines: MODI, Stepping-Stone . 20 , 21 Evaluation Metrics: Final transportation cost, number of iterations, runtime, and success rate to reach optimal solution (if known). Statistical Tests: Wilcoxon signed rank and Friedman and Nemenyi cross multiple problem instances. Results and discussion The proposed Ester Hybrid Improvement Algorithm for the Transportation Problem (EHITP) was systematically compared to standard initialization and refinement methods, including the North-West Corner (NWC), Least Cost Method (LCM), Vogel's Approximation Method (VAM), and the Modified Distribution (MODI) method. Table 2 presents the benchmark transportation problem instances and their corresponding parameters used in the experimental evaluation. Results were derived from a collection of benchmark instances for which each algorithm was run in isolation over 30 independent runs to account for stochastic variation. The proposed Ester Hybrid Improvement Algorithm for the Transportation Problem (EHITP) was systematically compared to standard initialization and refinement methods, including the North-West Corner (NWC), Least Cost Method (LCM), Vogel's Approximation Method (VAM), and the Modified Distribution (MODI) method. Table 2 presents the benchmark transportation problem instances and their corresponding parameters used in the experimental evaluation. Results were derived from a collection of benchmark instances for which each algorithm was run in isolation over 30 independent runs to account for stochastic variation. Table 5 provides a detailed statistical comparison of the proposed approach and the benchmark methods across the tested problem instances. Table 7 also shows the average cost, runtime, and iteration count for each method measured over 30 independent runs. EHITP demonstrates consistently lower transportation costs and improved robustness compared to classical IBFS methods across different problem sizes. Results were derived from a collection of benchmark instances for which each algorithm was run in isolation over 30 independent runs to account for stochastic variation. Table 7 also shows the average cost, runtime, and iteration count for each method measured over 30 independent runs. Comparative performance The convergence behavior of AML-FFA3 compared with the baseline algorithms, where faster descent and improved stability can be observed. We observe from the tabulated results ( Table 3 ) that EHITP was able to produce lower final transportation costs than any of the baseline IBFS methods on every instance. Comparatively, EHITP reduced this cost gap by more than 50% on average relative to the initial IBFS, regardless of the initial IBFS, while MODI rarely achieved comparable solution quality or robustness. Such and other related works suggest an emerging but less-active trend in customized IBFS heuristics and hybrid refinements, typically reporting better performance than NWC/LCM/VAM as well as, in some instances, approximate-optimal costs. Among the medium-scale cases (3×5, 5×10 problems), EHITP achieved average costs that were 8–12% lower than those of the next-best heuristics. The standard deviation of more than 30 runs was also lower orders of magnitude, indicating not only a more stable solution, but also less sensitive to the initial solution. Convergence behaviors Figure 2 shows how the enhancement direction changes in the solution space over time. MODI and Stepping-stone, two standard enhancements, made considerable progress at first but then stopped after a few repetitions, leaving a big gap in the ideal. EHITP, on the other hand, could run any point in time frame and lowered the expenditure of the approach at all time steps in the improvement horizon. Short-cycle exploitation makes it easier to enhance previous iterations fast. Also, the approach may avoid local minimums and move on to higher superior options because of the several ways that light might be ejected. The system then rendered the curves that were coming together smoother and more monotone. Validation by statistics To scientifically validate the reported developments, non-parametric analyses were employed on the range of final expenses across all occurrences. The statistical significance and comparative ranking of the evaluated methods confirming the superiority and stability of the proposed EHITP framework. Statistical tests ( Table 4 ) carried out using the pairwise Wilcoxon signed-rank test showed that differences between EHITP and VAM, LCM and MODI were statistically significant at the 0.05 level. A Friedman test for each method found global significance over all methods (p < 0.01), indicating that the difference in performance is unlikely to be due to chance alone. 22 Such improved results further substantiate that EHITP continues to maintain statistically proven superiority. Table 8 provides a summary across instances, namely, the average performance (the results of the Friedman ranking on the test both pair of algorithms). Conclusion and future work In this study, the Ester Hybrid Improvement Algorithm for the Transportation Problem (EHITP), a refinement framework designed to escape the stagnation typically found in classical post-optimization techniques such as MODI and Stepping-Stone, was proposed. Using three synergistic components ( i ) focused exploitation using a guidance mechanism based on the MODI index for a local search methodology (to drive search towards promising regions), ( ii ) short-cycle exploitation to increase number of search iterations within promising neighborhoods and ( iii ) light ejection diversification moves (dedicated to local minima escape) EHITP obtained results consistently better than the (exhaustive) improvement heuristics. Web-based experimental evaluations on benchmark instances of the transportation problem showed that EHITP was able to lower the final Cost of transportation while being more stable in repeated runs, indicating robustness with respect to initial conditions. For many test gaps, EHITP filled more than half of the convex hull distance between classical IBFS solutions (such as VAM, LCM) and the optimal (or near optimal) known solutions, while demanding only a modest additional computational expense. The trade-off between solution quality and efficiency suggests that EHITP will be a valuable tool for real-world application scenarios, where both cost minimization and computational tractability are crucial. Future work • Generalize EHITP to Multi-Objective Transportation Problems by considering Cost, time, and environmental emissions to be consistent with sustainable logistics-related objectives (e.g., sustainable hub location) • Extend EHITP to stochastic and fuzzy transportation problems to make it more suitable for robust demand, supply or cost parameters uncertainty. • Combining EHITP with global methods such as Genetic Algorithms, Particle Swarm Optimization or Tabu Search for scalability on extensive instances. • Compose EHITP with fast network flow solvers (e.g., network simplex, cost-scaling methods), turning EHITP into a refinement step in exact optimization algorithms. Data availability Datasets: The complete datasets used in this study were fully simulated by the authors for experimental and methodological validation. None of the simulated data is based on actual observed records, images, or elements of real world or copyrighted datasets. All the simulated datasets including the problem instances, the parameters the algorithms were run under, and the output final results are available open access in Zenodo: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem . https://doi.org/10.5281/zenodo.17433753 23 Data are available under the terms of the Creative Commons Attribution 4.0 International license (CC-BY 4.0). Software availability • Source code: https://github.com/iraqt-alt/HMPCS-ML-Solar-Forecasting • Archived software available from: https://doi.org/10.5281/zenodo.17559972 The Zenodo archive represents the official, citable version of the EHITP implementation and includes preprocessing scripts, optimization modules, simulation code, and experiment configuration files. The software is released under the MIT License (OSI-approved) to ensure transparency, reproducibility, and unrestricted academic reuse. A GitHub repository is maintained only as a development mirror and is not considered the primary archived reference. Acknowledgment The authors gratefully acknowledge the University of Fallujah for providing the facilities and financial assistance that enabled the completion of this study. References 1. Taha HA: Operations Research: An Introduction. Pearson Education India; 2013. 2. Dantzig GB: Application of the simplex method to a transportation problem. Activity Analysis and Production and Allocation. 1951. 3. Korukoğlu S, Ballı S: An improved Vogel’s approximation method for the transportation problem. Mathematical and Computational Applications. 2011; 16 (2): 370–381. Publisher Full Text 4. Abdul-Zahra IA, Abbas IT, Kalaf BA, et al. : The role of dynamic programming in the distribution of investment allocations between production lines with an application. International Journal of Pure and Applied Mathematics. 2016; 106 (2): 365–380. Publisher Full Text 5. Amaliah BFC, Fatichah C, Suryani E: A new heuristic method of finding the initial basic feasible solution to solve the transportation problem. Journal of King Saud University – Computer and Information Sciences. 2022; 34 (5): 2298–2307. Publisher Full Text 6. Abdelwali MHA: A new approach for finding an initial basic feasible solution to a transportation problem. Journal of Advanced Engineering Trends. 2024; 43 (1): 77–85. Publisher Full Text 7. Alqahtani H, Alqahtani KG: Efficient routing strategies for electric and flying vehicles: A comprehensive hybrid metaheuristic review. IEEE Transactions on Intelligent Vehicles. 2024. Publisher Full Text 8. Liu F, Gao C, Zhang L, et al. : Heuristics for vehicle routing problem: A survey and recent advances (Preprint). arXiv:2303.04147. 2023. Publisher Full Text 9. El Jaouhari MB, El Jaouhari BG: Metaheuristic and reinforcement learning techniques for solving the vehicle routing problem: A literature review. Journal of Traffic and Transportation Engineering. 2025 Reference Source 10. Panigrahy SK, Emany H: A survey and tutorial on network optimization for intelligent transport system using the internet of vehicles. Sensors. 2023; 23 (1): 555. PubMed Abstract | Publisher Full Text | Free Full Text 11. Wireko FAM, Nyarko JA-P, Appiah DK, et al. : The maximum range method for finding initial basic feasible solution for transportation problems. Results in Control and Optimization. 2025; 19 : 100551. Publisher Full Text 12. Rahman MT, Jamali ARMJU, Hena M, et al. : A capacity-influenced approach to find better initial solution in transportation problems. Int. J. Adv. Comput. Sci. Appl. 2024; 15 (9). Publisher Full Text 13. Amaliah BFC, Amaliah HVBRF: An excess demand method for the promising initial basic feasible solution of transportation problem. SSRN. 2024; 4936440. Publisher Full Text 14. Ali-Hussein Y, Ali SM: Using the largest difference method to find the initial basic feasible solution to the transportation problem. Journal of Interdisciplinary Mathematics. 2022; 25 (8): 2511–2517. Publisher Full Text 15. Amaliah BFC, Erma SE: A supply selection method for better feasible solution of balanced transportation problem. Expert Syst. Appl. 2022; 203 : 117399. Publisher Full Text 16. Lekan RR, Kavi LC, Neudauer NA: Applications and Applied Mathematics: An International Journal (AAM).2021; 16 (1): 18. Reference Source 17. Raina MS: Literature review on modified Vogel’s approximation method (Balakrishnan method) for unbalanced transportation problems. SSRN. 2024; 5243563. Publisher Full Text 18. Abbas IT, Mahdi EM, Abbas MMJ: Using gravitational search algorithm for solving nonlinear regression analysis. Iraqi Journal of Science. 2025; 66 (3): 1217–1231. Publisher Full Text 19. Chau ML, Chau GK: A systematic literature review on the use of metaheuristics for the optimization of multimodal transportation. Evol. Intel. 2025; 18 (2): 1–37. Publisher Full Text 20. Mathirajan MR, Sridharan RMV: An experimental study of newly proposed initial basic feasible solution methods for a transportation problem. Operation search. 2022; 59 (1): 102–145. Publisher Full Text 21. Abbas IT, Abbas GMN: Using sensitivity analysis in linear programming with practical physical applications. Iraqi Journal of Science. 2024; 65 (2): 907–922. Publisher Full Text 22. Elaibi WM, Rahi AK, Majeed RK, et al. : A Branch-and-Bound Algorithm for non-Integer Linear Programs with Fuzzy Right-Hand Side Coefficients. Industrial Engineering & Management Systems. 2025; 24 (2): 225–233. Publisher Full Text 23. Abbas IT, Sabty FH, Ali NH, et al. : Simulated Dataset for “EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem”. Zenodo. 2025. Publisher Full Text Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 14 Feb 2026 ADD YOUR COMMENT Comment Author details Author details 1 Scientific Research Commission, Baghdad, Iraq 2 Ministry of Education the First Directorate of Karkh Education, Baghdad, Iraq 3 Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, Baghdad Governorate, 00964, Iraq 4 Department of Mathematics, Al-Mustansiriya University College of sciences, Baghdad, Iraq Faten Hameed Sabty Roles: Conceptualization, Supervision Noor Hassan Ali Roles: Data Curation, Formal Analysis, Writing – Original Draft Preparation Iraq T. Abbas Roles: Conceptualization, Methodology, Project Administration, Supervision, Writing – Review & Editing Hanan Ali Cheachan Roles: Data Curation, Investigation Competing interests No competing interests were disclosed. Grant information This research was financially supported by the University of Fallujah, Iraq, through its academic research funding program. The support covered data analysis, computational resources, and publication preparation. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Article Versions (2) version 2 Revised Published: 24 Apr 2026, 15:263 https://doi.org/10.12688/f1000research.172115.2 version 1 Published: 14 Feb 2026, 15:263 https://doi.org/10.12688/f1000research.172115.1 Copyright © 2026 Hameed Sabty F et al . 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 Hameed Sabty F, Hassan Ali N, Abbas IT and Ali Cheachan H. EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.12688/f1000research.172115.1 ) 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 1 VERSION 1 PUBLISHED 14 Feb 2026 Views 0 Cite How to cite this report: Garside AK. Reviewer Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r469145 ) The direct URL for this report is: https://f1000research.com/articles/15-263/v1#referee-response-469145 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 Apr 2026 Annisa Kesy Garside , Universitas Muhammadiyah Malang, Malang, Indonesia Not Approved VIEWS 0 https://doi.org/10.5256/f1000research.189810.r469145 This manuscript introduces the Ester Hybrid Improvement (EHITP) algorithm which is designed to optimize the solution to the Transportation Problem (Transportation Problem - TP). The author aims to bridge the gap between the classic Initial Basic Feasible Solution (IBFS) method ... Continue reading READ ALL This manuscript introduces the Ester Hybrid Improvement (EHITP) algorithm which is designed to optimize the solution to the Transportation Problem (Transportation Problem - TP). The author aims to bridge the gap between the classic Initial Basic Feasible Solution (IBFS) method and the optimal solution through heuristic hybridization. This paper evaluates the performance of the algorithm compared to traditional methods such as the North-West Corner (NWC), Least Cost Method (LCM), and Vogel's Approximation Method (VAM) using small-scale numerical examples and statistical testing. Reviewer's Main Comment Although this topic is relevant in the field of operational research, the current version of the manuscript contains several fundamental weaknesses, critical inconsistencies, and technical inaccuracies that make it not scientifically eligible. Specific Criticism and Necessary Revision Critical Inconsistencies in Presentation and Accuracy This manuscript has a very serious internal contradiction, which shows a lack of precision in the compilation: Algorithm Naming: In the results section, especially on Table 7 (page 9), the author presents the results for an algorithm named "HMPCS-ML", even though the entire paper discusses "EHITP". Image Reference Error: In the methodology section (page 5), the text refers to Image 2 as "AML-FFA3 improvement pipeline", but the description (caption) on Image 2 is written "EHITP improvement pipeline".Recommendation: The author should conduct a comprehensive audit of the manuscript to ensure that the algorithm explained in the methodology is the same algorithm used in the experiment. All references to "HMPCS-ML" and "AML-FFA3" should be corrected or clarified. Data Availability and Reproducibility The "Data Availability" section includes a GitHub link that should contain the EHITP algorithm code. However, the repository points to a project called "HMPCS-ML-Solar-Forecasting". Issue: The code in the repository is related to solar energy prediction and has no relation to the Transportation Problem or the EHITP algorithm discussed in this paper. Recommendation: To comply with F1000Research's open data policy, the author must provide the correct source code link and include the specific dataset (matrix) used in this research Statistical Analysis and Interpretation Mathematically incorrect interpretation of statistical results: Contradiction: In Table 5, the results of the Wilcoxon Signed-Rank test show that the p-value ranges from 0.5000 to 1.0000. Statistically, this value shows that there is no significant difference between EHITP and the comparative method. However, the authors conclude in the text that EHITP is "significantly superior." Recommendation: The authors should reevaluate their statistical tests. If the improvement in results is not statistically significant, then claims of superiority should be reduced or supported by testing on a much larger and diverse dataset to find real significance. Literature Review and State of the Art (SOTA) This paper claims to provide modern improvements, but the majority of comparisons are made against very old methods (NWC, VAM, LCM). Lack of Modern Context: To show real "improvements", the authors should compare their methods with contemporary hybrid algorithms or metaheuristics (for example, modified Genetic Algorithm or Particle Swarm Optimization for TP) published in the last 5 years. Technical Details and Methodological Methodology: Some of the functions mentioned in the algorithm (such as light_ejection_shake) do not provide sufficient mathematical or logical explanations, so that it is difficult for the reader to fully understand the "hybrid" mechanism. Scalability: Experiments are limited to very small matrices. Authors should include at least one large-scale benchmark problem to prove the algorithm's efficiency in real-world scenarios. Conclusion and Revision Mandatory Points In order for this article to be considered scientifically worthy, the following points must be improved: Fix all naming inconsistencies (EHITP vs HMPCS-ML vs AML-FFA3). Provide a link to the correct GitHub repository containing the specific code for the EHITP algorithm and the dataset used. Align conclusions with statistical data; if the p-value is high, the claim of "statistical significance" should be removed or the test should be extended. Explain the details of the sub-functions of the algorithm to allow full transparency and replication by other researchers 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? No Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? No Are all the source data underlying the results available to ensure full reproducibility? No Are the conclusions drawn adequately supported by the results? No Competing Interests: No competing interests were disclosed. Reviewer Expertise: Operations Research, Optimization Algorithms, Logistics, and Supply Chain Management. I confirm that I have read this submission and believe that I have an appropriate level of expertise to state that I do not consider it to be of an acceptable scientific standard, for reasons outlined above. Close READ LESS CITE CITE HOW TO CITE THIS REPORT Garside AK. Reviewer Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r469145 ) The direct URL for this report is: https://f1000research.com/articles/15-263/v1#referee-response-469145 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 24 Apr 2026 iraq abbas , Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq 24 Apr 2026 Author Response Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we ... Continue reading Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we have corrected inconsistencies in the methodology and results sections, unified the terminology throughout the paper, and improved the statistical interpretation of the results. Additionally, the experimental tables and dataset descriptions have been updated to ensure clarity and consistency. We believe that the revised version of the manuscript significantly improves its scientific quality and presentation. We appreciate your time and consideration. Sincerely, Iraq T. Abbas Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we have corrected inconsistencies in the methodology and results sections, unified the terminology throughout the paper, and improved the statistical interpretation of the results. Additionally, the experimental tables and dataset descriptions have been updated to ensure clarity and consistency. We believe that the revised version of the manuscript significantly improves its scientific quality and presentation. We appreciate your time and consideration. Sincerely, Iraq T. Abbas Competing Interests: The authors declare that they have no competing interests. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 24 Apr 2026 iraq abbas , Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq 24 Apr 2026 Author Response Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we ... Continue reading Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we have corrected inconsistencies in the methodology and results sections, unified the terminology throughout the paper, and improved the statistical interpretation of the results. Additionally, the experimental tables and dataset descriptions have been updated to ensure clarity and consistency. We believe that the revised version of the manuscript significantly improves its scientific quality and presentation. We appreciate your time and consideration. Sincerely, Iraq T. Abbas Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we have corrected inconsistencies in the methodology and results sections, unified the terminology throughout the paper, and improved the statistical interpretation of the results. Additionally, the experimental tables and dataset descriptions have been updated to ensure clarity and consistency. We believe that the revised version of the manuscript significantly improves its scientific quality and presentation. We appreciate your time and consideration. Sincerely, Iraq T. Abbas Competing Interests: The authors declare that they have no competing interests. Close Report a concern COMMENT ON THIS REPORT Views 0 Cite How to cite this report: Mohammed HAA. Reviewer Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r459029 ) The direct URL for this report is: https://f1000research.com/articles/15-263/v1#referee-response-459029 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 23 Feb 2026 Hussam Abid Ali Mohammed , University of Kerbala, Karbala, Karbala Governorate, Iraq Approved VIEWS 0 https://doi.org/10.5256/f1000research.189810.r459029 The study presents a robust hybrid framework Enhanced Heuristic for the Transportation Problem (EHITP) that effectively integrates adaptive IBFS initialization with MODI-guided local search and diversification strategies. It demonstrates improved solution quality, enhanced stability across runs, and statistically validated performance, ... Continue reading READ ALL The study presents a robust hybrid framework Enhanced Heuristic for the Transportation Problem (EHITP) that effectively integrates adaptive IBFS initialization with MODI-guided local search and diversification strategies. It demonstrates improved solution quality, enhanced stability across runs, and statistically validated performance, while maintaining computational efficiency and reproducibility through open-access datasets and source code availability. 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? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly 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: Operation Research 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 Mohammed HAA. Reviewer Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r459029 ) The direct URL for this report is: https://f1000research.com/articles/15-263/v1#referee-response-459029 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 Apr 2026 iraq abbas , Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq 27 Apr 2026 Author Response Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical ... Continue reading Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical analysis, we have carefully reviewed this aspect and made additional clarifications and minor improvements in the revised version to further strengthen the presentation and interpretation of the results. We are grateful for your insightful comments, which helped us improve the quality of the manuscript. Sincerely, Iraq T. Abbas Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical analysis, we have carefully reviewed this aspect and made additional clarifications and minor improvements in the revised version to further strengthen the presentation and interpretation of the results. We are grateful for your insightful comments, which helped us improve the quality of the manuscript. Sincerely, Iraq T. Abbas Competing Interests: No competing interests were disclosed. Close Report a concern Respond or Comment COMMENTS ON THIS REPORT Author Response 27 Apr 2026 iraq abbas , Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq 27 Apr 2026 Author Response Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical ... Continue reading Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical analysis, we have carefully reviewed this aspect and made additional clarifications and minor improvements in the revised version to further strengthen the presentation and interpretation of the results. We are grateful for your insightful comments, which helped us improve the quality of the manuscript. Sincerely, Iraq T. Abbas Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical analysis, we have carefully reviewed this aspect and made additional clarifications and minor improvements in the revised version to further strengthen the presentation and interpretation of the results. We are grateful for your insightful comments, which helped us improve the quality of the manuscript. Sincerely, Iraq T. Abbas Competing Interests: No competing interests were disclosed. Close Report a concern COMMENT ON THIS REPORT Comments on this article Comments (0) Version 2 VERSION 2 PUBLISHED 14 Feb 2026 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 Version 2 (revision) 24 Apr 26 Version 1 14 Feb 26 read read Hussam Abid Ali Mohammed , University of Kerbala, Karbala, Iraq Annisa Kesy Garside , Universitas Muhammadiyah Malang, Malang, Indonesia 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 © 2026 Garside A. 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 Apr 2026 | for Version 1 Annisa Kesy Garside , Universitas Muhammadiyah Malang, Malang, Indonesia 0 Views copyright © 2026 Garside A. 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) Not 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 This manuscript introduces the Ester Hybrid Improvement (EHITP) algorithm which is designed to optimize the solution to the Transportation Problem (Transportation Problem - TP). The author aims to bridge the gap between the classic Initial Basic Feasible Solution (IBFS) method and the optimal solution through heuristic hybridization. This paper evaluates the performance of the algorithm compared to traditional methods such as the North-West Corner (NWC), Least Cost Method (LCM), and Vogel's Approximation Method (VAM) using small-scale numerical examples and statistical testing. Reviewer's Main Comment Although this topic is relevant in the field of operational research, the current version of the manuscript contains several fundamental weaknesses, critical inconsistencies, and technical inaccuracies that make it not scientifically eligible. Specific Criticism and Necessary Revision Critical Inconsistencies in Presentation and Accuracy This manuscript has a very serious internal contradiction, which shows a lack of precision in the compilation: Algorithm Naming: In the results section, especially on Table 7 (page 9), the author presents the results for an algorithm named "HMPCS-ML", even though the entire paper discusses "EHITP". Image Reference Error: In the methodology section (page 5), the text refers to Image 2 as "AML-FFA3 improvement pipeline", but the description (caption) on Image 2 is written "EHITP improvement pipeline".Recommendation: The author should conduct a comprehensive audit of the manuscript to ensure that the algorithm explained in the methodology is the same algorithm used in the experiment. All references to "HMPCS-ML" and "AML-FFA3" should be corrected or clarified. Data Availability and Reproducibility The "Data Availability" section includes a GitHub link that should contain the EHITP algorithm code. However, the repository points to a project called "HMPCS-ML-Solar-Forecasting". Issue: The code in the repository is related to solar energy prediction and has no relation to the Transportation Problem or the EHITP algorithm discussed in this paper. Recommendation: To comply with F1000Research's open data policy, the author must provide the correct source code link and include the specific dataset (matrix) used in this research Statistical Analysis and Interpretation Mathematically incorrect interpretation of statistical results: Contradiction: In Table 5, the results of the Wilcoxon Signed-Rank test show that the p-value ranges from 0.5000 to 1.0000. Statistically, this value shows that there is no significant difference between EHITP and the comparative method. However, the authors conclude in the text that EHITP is "significantly superior." Recommendation: The authors should reevaluate their statistical tests. If the improvement in results is not statistically significant, then claims of superiority should be reduced or supported by testing on a much larger and diverse dataset to find real significance. Literature Review and State of the Art (SOTA) This paper claims to provide modern improvements, but the majority of comparisons are made against very old methods (NWC, VAM, LCM). Lack of Modern Context: To show real "improvements", the authors should compare their methods with contemporary hybrid algorithms or metaheuristics (for example, modified Genetic Algorithm or Particle Swarm Optimization for TP) published in the last 5 years. Technical Details and Methodological Methodology: Some of the functions mentioned in the algorithm (such as light_ejection_shake) do not provide sufficient mathematical or logical explanations, so that it is difficult for the reader to fully understand the "hybrid" mechanism. Scalability: Experiments are limited to very small matrices. Authors should include at least one large-scale benchmark problem to prove the algorithm's efficiency in real-world scenarios. Conclusion and Revision Mandatory Points In order for this article to be considered scientifically worthy, the following points must be improved: Fix all naming inconsistencies (EHITP vs HMPCS-ML vs AML-FFA3). Provide a link to the correct GitHub repository containing the specific code for the EHITP algorithm and the dataset used. Align conclusions with statistical data; if the p-value is high, the claim of "statistical significance" should be removed or the test should be extended. Explain the details of the sub-functions of the algorithm to allow full transparency and replication by other researchers 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? No Are sufficient details of methods and analysis provided to allow replication by others? No If applicable, is the statistical analysis and its interpretation appropriate? No Are all the source data underlying the results available to ensure full reproducibility? No Are the conclusions drawn adequately supported by the results? No Competing Interests No competing interests were disclosed. Reviewer Expertise Operations Research, Optimization Algorithms, Logistics, and Supply Chain Management. I confirm that I have read this submission and believe that I have an appropriate level of expertise to state that I do not consider it to be of an acceptable scientific standard, for reasons outlined above. reply Respond to this report Responses (1) Author Response 24 Apr 2026 iraq abbas, Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq Dear Editor and Reviewers, Thank you for your valuable comments and constructive feedback. We have carefully revised the manuscript to address all the concerns raised. In particular, we have corrected inconsistencies in the methodology and results sections, unified the terminology throughout the paper, and improved the statistical interpretation of the results. Additionally, the experimental tables and dataset descriptions have been updated to ensure clarity and consistency. We believe that the revised version of the manuscript significantly improves its scientific quality and presentation. We appreciate your time and consideration. Sincerely, Iraq T. Abbas View more View less Competing Interests The authors declare that they have no competing interests. reply Respond Report a concern Garside AK. Peer Review Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r469145) 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/15-263/v1#referee-response-469145 keyboard_arrow_left Back to all reports Reviewer Report 0 Views copyright © 2026 Mohammed H. 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. 23 Feb 2026 | for Version 1 Hussam Abid Ali Mohammed , University of Kerbala, Karbala, Karbala Governorate, Iraq 0 Views copyright © 2026 Mohammed H. 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 The study presents a robust hybrid framework Enhanced Heuristic for the Transportation Problem (EHITP) that effectively integrates adaptive IBFS initialization with MODI-guided local search and diversification strategies. It demonstrates improved solution quality, enhanced stability across runs, and statistically validated performance, while maintaining computational efficiency and reproducibility through open-access datasets and source code availability. 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? Yes If applicable, is the statistical analysis and its interpretation appropriate? Partly 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 Operation Research 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 (1) Author Response 27 Apr 2026 iraq abbas, Mathematics, University of Baghdad Al-Jaderyia Campus College of Science, Baghdad, 00964, Iraq Dear Reviewer, Thank you very much for your valuable and constructive feedback. We sincerely appreciate your positive evaluation of our work and your recognition of its contribution. Regarding the statistical analysis, we have carefully reviewed this aspect and made additional clarifications and minor improvements in the revised version to further strengthen the presentation and interpretation of the results. We are grateful for your insightful comments, which helped us improve the quality of the manuscript. Sincerely, Iraq T. Abbas View more View less Competing Interests No competing interests were disclosed. reply Respond Report a concern Mohammed HAA. Peer Review Report For: EHITP: Ester Hybrid Improvement Algorithm for the Transportation Problem [version 1; peer review: 1 approved, 1 not approved] . F1000Research 2026, 15 :263 ( https://doi.org/10.5256/f1000research.189810.r459029) 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/15-263/v1#referee-response-459029 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 = "EHITP: Ester Hybrid Improvement Algorithm...".replace("'", ''); var linkedInUrl = "http://www.linkedin.com/shareArticle?url=https://f1000research.com/articles/15-263/v1" + "&title=" + encodeURIComponent(lTitle) + "&summary=" + encodeURIComponent('Read the article by '); var deliciousUrl = "https://del.icio.us/post?url=https://f1000research.com/articles/15-263/v1&title=" + encodeURIComponent(lTitle); var redditUrl = "http://reddit.com/submit?url=https://f1000research.com/articles/15-263/v1" + "&title=" + encodeURIComponent(lTitle); linkedInUrl += encodeURIComponent('Hameed Sabty F et al.'); 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/15-263/v1/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/15-263", templates : { twitter : "EHITP: Ester Hybrid Improvement Algorithm for the Transportation.... Hameed Sabty F et al., published by " + "@F1000Research" + ", https://f1000research.com/articles/15-263/v1" } }; 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/172115/189810") new F1000.Clipboard(); new F1000.ThesaurusTermsDisplay("articles", "article", "189810"); $(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 = { "480006": 0, "480005": 0, "480004": 0, "480003": 0, "480002": 0, "480001": 0, "480000": 0, "459023": 0, "459022": 0, "459031": 0, "469143": 0, "459030": 0, "469142": 0, "459029": 9, "469141": 0, "459028": 0, "459027": 0, "459026": 0, "459025": 0, "459024": 0, "469150": 0, "469149": 0, "469148": 0, "469147": 0, "469146": 0, "469145": 10, "469144": 0, "484047": 0, "481879": 0, "484055": 0, "481878": 0, "484054": 0, "481877": 0, "484053": 0, "481876": 0, "484052": 0, "481875": 0, "484051": 0, "484050": 0, "484049": 0, "478801": 0, "484048": 0, "478800": 0, "481884": 0, "481883": 0, "481882": 0, "481881": 0, "481880": 0, "484056": 0, "479999": 0, "479998": 0, "479997": 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 = "33358d4b-e025-4a41-a085-d609afd4f6fa"; 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(",","/")); } }); });