Open AccessApplication of Pigeon Inspired Optimization for Multidimensional Knapsack Problem
Author(s) -
Fran Setiawan,
A. Sadiyoko,
C. Setiardjo
Publication year - 2020
Publication title -
international journal of industrial engineering and engineering management
Language(s) - English
Resource type - Journals
ISSN - 2685-4090
DOI - 10.24002/ijieem.v2i1.3841
Subject(s) - knapsack problem , mathematical optimization , continuous knapsack problem , cutting stock problem , metaheuristic , particle swarm optimization , generalization , computation , mathematics , combinatorial optimization , optimization problem , computer science , algorithm , mathematical analysis
The multidimensional knapsack problem (MKP) is a generalization of the classical knapsack problem, a problem for allocating a resource by selecting a subset of objects that seek for the highest profit while satisfying the capacity of knapsack constraint. The MKP have many practical applications in different areas and classified as a NP-hard problem. An exact method like branch and bound and dynamic programming can solve the problem, but its time computation increases exponentially with the size of the problem. Whereas some approximation method has been developed to produce a near-optimal solution within reasonable computational times. In this paper a pigeon inspired optimization (PIO) is proposed for solving MKP. PIO is one of the metaheuristic algorithms that is classified in population-based swarm intelligent that is developed based on the behavior of the pigeon to find its home although it had gone far away from it home. In this paper, PIO implementation to solve MKP is applied to two different characteristic cases in total 10 cases. The result of the implementation of the two-best combination of parameter values for 10 cases compared to particle swarm optimization, intelligent water drop algorithm and the genetic algorithm gives satisfactory results.