Next Article in Journal
On a New Discrete SEIADR Model with Mixed Controls: Study of Its Properties
Next Article in Special Issue
Search Acceleration of Evolutionary Multi-Objective Optimization Using an Estimated Convergence Point
Previous Article in Journal
An Application of Multicriteria Decision-making for the Evaluation of Alternative Monorail Routes
Previous Article in Special Issue
A Novel Simple Particle Swarm Optimization Algorithm for Global Optimization
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle

The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm

1,2,3, 1,2,* and 1,2
1
School of Economics and Management, China University of Geosciences, Beijing 100083, China
2
Key Laboratory of Carrying Capacity Assessment for Resource and Environment, Ministry of Natural Resources, Beijing 100083, China
3
School of Information Engineering, Hebei GEO University, Shijiazhuang 050031, China
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 17; https://doi.org/10.3390/math7010017
Received: 1 September 2018 / Revised: 10 December 2018 / Accepted: 10 December 2018 / Published: 24 December 2018
(This article belongs to the Special Issue Evolutionary Computation)
  |  
PDF [4527 KB, uploaded 11 January 2019]
  |  

Abstract

Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems. One of the most common and efficient ways to discretize MS is to use a transfer function, which is in charge of mapping a continuous search space to a discrete search space. In this paper, twelve transfer functions divided into three families, S-shaped (named S1, S2, S3, and S4), V-shaped (named V1, V2, V3, and V4), and other shapes (named O1, O2, O3, and O4), are combined with MS, and then twelve discrete versions MS algorithms are proposed for solving set-union knapsack problem (SUKP). Three groups of fifteen SUKP instances are employed to evaluate the importance of these transfer functions. The results show that O4 is the best transfer function when combined with MS to solve SUKP. Meanwhile, the importance of the transfer function in terms of improving the quality of solutions and convergence rate is demonstrated as well. View Full-Text
Keywords: set-union knapsack problem; moth search algorithm; transfer function; discrete algorithm set-union knapsack problem; moth search algorithm; transfer function; discrete algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Feng, Y.; An, H.; Gao, X. The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm. Mathematics 2019, 7, 17.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Mathematics EISSN 2227-7390 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top