Analysis of baseline evolutionary algorithms for the packing while travelling problem

DOI10.1145/3299904.3340313zbMath1433.68650arXiv1902.04692OpenAlexW2911580966MaRDI QIDQ5215486

Frank Neumann, Vahid Roostapour, Mojgan Pourhassan

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.04692

zbMATH Keywords

evolutionary algorithmsruntime analysis(1+1) EApacking-while-travelling problem

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs

This page was built for publication: Analysis of baseline evolutionary algorithms for the packing while travelling problem