Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem

DOI10.1007/s10898-023-01285-warXiv2112.11849MaRDI QIDQ6200378

Eduardo L. Pasiliao, Alla R. Kammerdiner, Alexander Semenov

Publication date: 22 March 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationmetaheuristicsvariable neighborhood search (VNS)fitness landscapesthe multidimensional assignment problem (MAP)very large-scale neighborhood search (VLNS)

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (1)

Preface

Cites Work

• Unnamed Item
• Unnamed Item
• In and out forests on combinatorial landscapes
• Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
• A review of metrics on permutations for search landscape analysis
• Variable neighbourhood search: methods and applications
• On the spectra of nonsymmetric Laplacian matrices
• Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem
• Coupled map lattices as spatio-temporal fitness functions: Landscape measures and evolutionary optimization
• Combinatorial Landscapes
• Letter to the Editor—The Multidimensional Assignment Problem
• The landscape of the traveling salesman problem

This page was built for publication: Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem