Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems

DOI10.1016/j.ejor.2023.07.021MaRDI QIDQ6087523

Igor M. Coelho, Daniel Cosmin Porumbel, El-Ghazali Talbi

Publication date: 15 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationpermutation problembi-objective exact decodervi-objective EA

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The fleet size and mix problem for capacitated arc routing
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
• A genetic algorithm for a bi-objective capacitated arc routing problem
• Context-Independent Scatter and Tabu Search for Permutation Problems
• Unnamed Item

This page was built for publication: Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems