An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems
From MaRDI portal
Publication:5140142
DOI10.3233/FI-2020-1940zbMath1496.68383MaRDI QIDQ5140142
Marco Baioletti, Gabriele di Bari, Valentino Santucci, Alfredo Milani
Publication date: 14 December 2020
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Selection hyper-heuristics for the multi and many-objective quadratic assignment problem ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating longest increasing subsequences and patience sorting
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A review of metrics on permutations for search landscape analysis
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- Tuning metaheuristics. A machine learning Perspective
- QAPLIB - a quadratic assignment problem library
- The linear ordering problem: instances, search space analysis and algorithms
- Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs
- Lattice Theory: Special Topics and Applications
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Scheduling countermeasures to contamination events by genetic algorithms
- Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm
- MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem
This page was built for publication: An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems
