Optimization through Iterative Smooth Morphological Transformations
Pages 241 - 248
Abstract
In this paper, we introduce SMorph, a new methodology for combinatorial optimization that works in the instance space of the problem at hand. Indeed, given the problem instance to solve, SMorph builds a simplified instance whose optimum is easy to locate, then it iteratively evolves this instance towards the target one by alternating two steps: optimization and smooth transformation of the current instance. The knowledge acquired in each iteration is transferred to next one, while the entire process is designed with the aim of improving the last optimization step. Although the abstract search scheme of SMorph is general enough to be instantiated for a variety of combinatorial optimization problems, here we present an implementation for the well-known Linear Optimization Problem (LOP). Experiments have been conducted on a set of commonly adopted benchmark instances of the LOP, and the results validate the proposed approach.
References
[1]
Tameem Albash and Daniel A Lidar. 2018. Adiabatic quantum computation. Reviews of Modern Physics 90, 1 (2018), 015002.
[2]
Abdelkamel Ben Ali. 2024. Comprehensive learning TLBO with recursive precedence-based solution construction and multilevel local search for the linear ordering problem. Expert Systems with Applications 238 (2024), 122315.
[3]
Christian Blum, Pedro Pinacho, Manuel López-Ibáñez, and José A Lozano. 2016. Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Computers & Operations Research 68 (2016), 75--88.
[4]
Josu Ceberio, Alexander Mendiburu, and Jose A Lozano. 2015. The linear ordering problem revisited. European Journal of Operational Research 241, 3 (2015), 686--696.
[5]
Josu Ceberio and Valentino Santucci. 2023. Model-based Gradient Search for Permutation Problems. ACM Transactions on Evolutionary Learning and Optimization 3, 4 (2023), 1--35.
[6]
Bastien Chopard and Marco Tomassini. 2018. An introduction to metaheuristics for optimization. Springer.
[7]
Maria da Conceição Cunha and Joaquim Sousa. 1999. Water distribution network design optimization: simulated annealing approach. Journal of water resources planning and management 125, 4 (1999), 215--221.
[8]
Lawrence Davis. 2014. Job shop scheduling with genetic algorithms. In Proceedings of the first International Conference on Genetic Algorithms and their Applications. Psychology Press, 136--140.
[9]
Marco Dorigo, Mauro Birattari, and Thomas Stutzle. 2006. Ant colony optimization. IEEE computational intelligence magazine 1, 4 (2006), 28--39.
[10]
Burak Eksioglu, Arif Volkan Vural, and Arnold Reisman. 2009. The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering 57, 4 (2009), 1472--1483.
[11]
M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) (first edition ed.). W. H. Freeman.
[12]
Fred Glover and Manuel Laguna. 1998. Tabu search. Springer.
[13]
David S Johnson. 1990. Local optimization and the traveling salesman problem. In International colloquium on automata, languages, and programming. Springer, 446--461.
[14]
Allen Kim and Steven Skiena. 2022. Chapter Ordering in Novels. In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing. 3838--3848.
[15]
Eliane Maria Loiola, Nair Maria Maia De Abreu, Paulo Oswaldo Boaventura-Netto, Peter Hahn, and Tania Querido. 2007. A survey for the quadratic assignment problem. European journal of operational research 176, 2 (2007), 657--690.
[16]
Helena R Lourenço, Olivier C Martin, and Thomas Stützle. 2003. Iterated local search. In Handbook of metaheuristics. Springer, 320--353.
[17]
Lázaro Lugo, Carlos Segura, and Gara Miranda. 2022. A diversity-aware memetic algorithm for the linear ordering Problem. Memetic Computing 14, 4 (2022), 395--409.
[18]
Rafael Marti and Gerhard Reinelt. 2022. Exact and Heuristic Methods in Combinatorial Optimization. Vol. 175. Springer.
[19]
Nitin Kumar Mishra and Pramod Kumar Singh. 2022. Linear ordering problem based classifier chain using genetic algorithm for multi-label classification. Applied Soft Computing 117 (2022), 108395.
[20]
Yuichi Nagata and Shigenobu Kobayashi. 2013. A powerful genetic algorithm using edge assembly crossover for the traveling salesman problem. INFORMS Journal on Computing 25, 2 (2013), 346--363.
[21]
Yann Ollivier, Ludovic Arnold, Anne Auger, and N. Hansen. 2017. Information-geometric optimization algorithms: A unifying picture via invariance principles. Journal of Machine Learning Research 18, 18 (2017), 1--65.
[22]
Christos H Papadimitriou and Kenneth Steiglitz. 1998. Combinatorial optimization: algorithms and complexity. Courier Corporation.
[23]
Valentino Santucci, Marco Baioletti, and Gabriele Di Bari. 2021. An improved memetic algebraic differential evolution for solving the multidimensional two-way number partitioning problem. Expert Systems with Applications 178 (2021). 114938.
[24]
Valentino Santucci, Marco Baioletti, and A. Milani. 2019. Tackling permutation-based optimization problems with an algebraic particle swarm optimization algorithm. Fundamenta Informaticae 167, 1-2 (2019), 133--158.
[25]
Valentino Santucci and Josu Ceberio. 2020. Using pairwise precedences for solving the linear ordering problem. Applied Soft Computing 87 (2020), 105998.
[26]
Tommaso Schiavinotto and Thomas Stützle. 2004. The linear ordering problem: Instances, search space analysis and algorithms. Journal of Mathematical Modelling and Algorithms 3 (2004), 367--402.
[27]
Roy Tromble and Jason Eisner. 2009. Learning linear ordering problems for better translation. In Proceedings of the 2009 conference on empirical methods in natural language processing. 1007--1016.
[28]
Vesselin K Vassilev, Terence C Fogarty, and Julian F Miller. 2003. Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. Advances in evolutionary computing: theory and applications (2003), 3--44.
Index Terms
- Optimization through Iterative Smooth Morphological Transformations
Recommendations
A discrete gravitational search algorithm for solving combinatorial optimization problems
Metaheuristics are general search strategies that, at the exploitation stage, intensively exploit areas of the solution space with high quality solutions and, at the exploration stage, move to unexplored areas of the solution space when necessary. The ...
Penguins Search Optimization Algorithm to Solve Quadratic Assignment Problem
BDCA'17: Proceedings of the 2nd international Conference on Big Data, Cloud and ApplicationsThis paper presents an application of new metaheuristics, based on the penguins hunting strategy, Penguins search optimization algorithm (PeSOA) for solving one of the most difficult NP-hard combinatorial optimization problems in discret case the ...
Self-adaptive check and repair operator-based particle swarm optimization for the multidimensional knapsack problem
Flowchart of the SACRO along with PSO. We propose a novel self-adaptive check and repair operator (SACRO).Particle swarm optimization (PSO) is utilized to cooperate with the idea of SACRO.The SACRO based algorithms were tested using 137 benchmarks from ...
Comments
Information & Contributors
Information
Published In
July 2024
1657 pages
Copyright © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 July 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '24
Sponsor:
GECCO '24: Genetic and Evolutionary Computation Conference
July 14 - 18, 2024
VIC, Melbourne, Australia
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 46Total Downloads
- Downloads (Last 12 months)46
- Downloads (Last 6 weeks)7
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in