{"id":26428,"date":"2022-12-08T13:07:40","date_gmt":"2022-12-08T12:07:40","guid":{"rendered":"https:\/\/cio.umh.es\/?p=26428"},"modified":"2022-12-08T13:09:11","modified_gmt":"2022-12-08T12:09:11","slug":"towards-more-efficient-routing-in-dynamic-networks","status":"publish","type":"post","link":"https:\/\/cio.umh.es\/en\/2022\/12\/08\/towards-more-efficient-routing-in-dynamic-networks\/","title":{"rendered":"Towards more efficient routing in dynamic networks"},"content":{"rendered":"<div data-elementor-type=\"wp-post\" data-elementor-id=\"26428\" class=\"elementor elementor-26428\" data-elementor-settings=\"[]\">\n\t\t\t\t\t\t<div class=\"elementor-inner\">\n\t\t\t\t\t\t\t<div class=\"elementor-section-wrap\">\n\t\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-f67d99d elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"f67d99d\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-361d8a5\" data-id=\"361d8a5\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-de06483 elementor-widget elementor-widget-text-editor\" data-id=\"de06483\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-text-editor elementor-clearfix\">\n\t\t\t\t<p><span style=\"color: #000080\"><strong>T\u00edtulo:<\/strong> Towards more efficient routing in dynamic networks<\/span><\/p><p><span style=\"color: #000080\"><strong>Ponente:<\/strong> Yury Nikulin, de la Universidad de Turku (Finlandia)<\/span><\/p><p><span style=\"color: #000080\"><strong>Organizador:<\/strong> Juan Parra<\/span><\/p><p><span style=\"color: #000080\"><strong>Date:<\/strong> Martes 13 de diciembre de 2022 a las 12:30 horas<\/span><\/p><p><span style=\"color: #000080\"><strong>Lugar:<\/strong> Sala de seminarios CIO<\/span><\/p>\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-94f5067 elementor-widget elementor-widget-text-editor\" data-id=\"94f5067\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-text-editor elementor-clearfix\">\n\t\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-5517c56 elementor-widget elementor-widget-text-editor\" data-id=\"5517c56\" data-element_type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t<div class=\"elementor-text-editor elementor-clearfix\">\n\t\t\t\t<p><span style=\"color: #000080\"><strong>Abstract:<\/strong> This study proposes a customized genetic algorithm ( CGA ) to find the Pareto frontier for a bi-objective integer linear programming (ILP) model of routing in a dynamic network, where the number of nodes and edge weights varies over time. Utilizing a hybrid method, the CGA combines a genetic algorithm with dynamic programming (DP); it is a fast alternative to an ILP solver for finding efficient solutions, particularly for large dimensions. A non-dominated sorting genetic algorithm (NSGA-II) is used as a base multi-objective evolutionary algorithm. Real data are used for target trajectories, from a case study of the application of a surveillance boat to measure greenhouse-gas emissions of ships on the Baltic sea. The CGA&#8217;s performance is evaluated in comparison to ILP solutions in terms of accuracy and computation efficiency. Results over multiple runs indicate convergence to the efficient frontier, with a considerable computation speed-up relative to the ILP solver. The study stays as a model for hybridizing evolutionary optimization and DP methods together in solving complex real-world problems.<\/span><\/p>\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>T\u00edtulo: Towards more efficient routing in dynamic networks<br \/>\nPonente: Yury Nikulin, de la Universidad de Turku (Finlandia)<br \/>\nOrganizador: Juan Parra<br \/>\nFecha: Martes 13 de diciembre de 2022 a las 12:30 horas<br \/>\nLugar: Sala de seminarios CIO<br \/>\nAbstract: This study proposes a customized genetic algorithm ( CGA ) to find the Pareto frontier for a bi-objective integer linear programming (ILP) model [&#8230;]<\/p>","protected":false},"author":5675,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_links_to":"","_links_to_target":""},"categories":[873],"tags":[],"_links":{"self":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/26428"}],"collection":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/users\/5675"}],"replies":[{"embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/comments?post=26428"}],"version-history":[{"count":0,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/posts\/26428\/revisions"}],"wp:attachment":[{"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/media?parent=26428"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/categories?post=26428"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cio.umh.es\/en\/wp-json\/wp\/v2\/tags?post=26428"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}