A Customized Genetic Algorithm for Bi-objective Routing in a Dynamic Network

Alaleh Maskooki, Kalyanmoy Deb, Markku Kallio

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The article presents a proposed 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 vary 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 application of a surveillance boat to measure greenhouse-gas emissions of ships on the Baltic sea. The CGA’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.
Original languageEnglish
JournalEuropean Journal of Operational Research
DOIs
Publication statusE-pub ahead of print - 2021
MoE publication typeA1 Journal article-refereed

Keywords

  • Genetic algorithms
  • Moving-target traveling salesman problem
  • Dynamic network
  • Dynamic programming

Fingerprint Dive into the research topics of 'A Customized Genetic Algorithm for Bi-objective Routing in a Dynamic Network'. Together they form a unique fingerprint.

Cite this