Filters








2,545 Hits in 5.8 sec

Maritime Cargo Prioritisation during a Prolonged Pandemic Lockdown Using an Integrated TOPSIS-Knapsack Technique: A Case Study on Small Island Developing States—The Rodrigues Island

Christos A. Kontovas, Krishna Sooprayen
2020 Sustainability  
We propose a decision-aid tool that integrates two methods: (a) the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) and (b) the knapsack problem.  ...  Containers are prioritised based on attributes such as their importance and their economic value.  ...  The opinions expressed and the input parameters are those of the authors and the experts and do not necessarily reflect the opinion of the relevant stakeholder.  ... 
doi:10.3390/su12197992 fatcat:dgilpfi7x5gqrpm73wslg5i7ym

A Hybrid Parallel Multi-Objective Genetic Algorithm for 0/1 Knapsack Problem

Sudhir B. Jagtap, Subhendu Kumar Pani, Ganeshchandra Shinde
2011 Journal of Software Engineering and Applications  
In this paper a hybrid parallel multi-objective genetic algorithm is proposed for solving 0/1 knapsack problem.  ...  Hence, the classical multi-objective genetic algorithms (MOGAs) (i.e., non-Parallel MOGAs) may fail to solve such intractable problem in a reasonable amount of time.  ...  In this paper, we proposed a new hybrid model to parallelize multi-objective genetic algorithms and implemented it on 0/1 knapsack problem.  ... 
doi:10.4236/jsea.2011.45035 fatcat:iwchgv5gbfaj7hcpsaqvqzeldy

Smart Agents for the Multidimensional Multi-choice Knapsack Problem

Skander Htiouech, Ameur Alzaidi
2017 International Journal of Computer Applications  
It is considered as a combination of two other variants such as: the multi-choice knapsack problem (MCKP) and the multidimensional knapsack problem (MDKP).  ...  General Terms Metaheuristic, knapsack problem  ...  To do this, the authors apply an efficient parallel implementation of the branch and bound algorithm developed by Hifi and Sbihi et al. [17] on a CPU-GPU.  ... 
doi:10.5120/ijca2017915404 fatcat:k43sgcdyzvaxnp7jvz3fza3pti

Parallelization of the Knapsack Problem as an Introductory Experience in Parallel Computing

David Toth, Michael Crawford
2013 The Journal of Computational Science Education  
algorithm and two versions of a parallel algorithm to solve the knapsack problem.  ...  As part of a parallel computing course where undergraduate students learned parallel computing techniques and got to run their programs on a supercomputer, one student designed and implemented a sequential  ...  Students developed their programs using a multi-core server on campus and on their own systems and lab systems using the Bootable Cluster CD software [2] .  ... 
doi:10.22369/issn.2153-4136/4/1/6 fatcat:i5mv7fashnc5rjtkzrt2rpdk6a

Approximating the 0–1 Multiple Knapsack Problem with Agent Decomposition and Market Negotiation [chapter]

Brent A. Smolinski
2000 Lecture Notes in Computer Science  
This paper introduces a market model based on agent decomposition and market auctions for approximating the 0-1 multiple knapsack problem, and an algorithm that implements the model (M(x)).  ...  The results suggest that M(x) is a good algorithm for approximating the 0-1 Multiple Knapsack problem.  ...  Acknowledgements I would like to thank the following for their time and suggestions: Dr. Lois Brady, Dr. Hisham Assal, Dr. Terence Critchlow, Dr. Scott Kohn, Nathan Dykman, Dr.  ... 
doi:10.1007/3-540-45049-1_36 fatcat:yv5u5itggndxji5ybvih2di5ly

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

Shanu Verma, Millie Pant, Vaclav Snasel
2021 IEEE Access  
salesman problem, vehicle routing problem, scheduling problem, and knapsack problem.  ...  It is identified that based on the manner in which NSGA-II has been implemented for solving the aforementioned group of problems, there can be three categories: Conventional NSGA-II, where the authors  ...  The proposed approach performed better than the two single-objective algorithms, K-Y and R-M algorithms, on the parallel-series system' benchmark problems.  ... 
doi:10.1109/access.2021.3070634 fatcat:fci76lcuw5gdjb4wr6wfn7ruqi

Experiments with parallel algorithms for combinatorial problems

G.A.P. Kindervater, H.W.J.M. Trienekens
1988 European Journal of Operational Research  
In this paper we present computational results concerning the solution of knapsack, shortest paths and change-making problems by branch and bound, dynamic programming, and divide and conquer algorithms  ...  In these types of algorithms all the processors always execute the same instruction on data residing at the same place in their local memories and all the data travel the same way.  ...  Acknowledgements We would like to thank the DAP Support Unit of Queen Mary College, London, and the Manchester Dataflow Group for their assistance and for making their equipment available to us, and J.K  ... 
doi:10.1016/0377-2217(88)90255-x fatcat:t5pnjtlhmfd6hbj5mz63zg2xoq

Algorithm portfolio based scheme for dynamic optimization problems

Jenny Fajardo Calderín, Antonio D. Masegosa, David A. Pelta
2015 International Journal of Computational Intelligence Systems  
This method was tested over 5 binary-coded problems (dynamic variants of OneMax, Plateau, RoyalRoad, Deceptive and Knapsack) and compared versus two reference algorithms for these problems (Adaptive Hill  ...  Since their first appearance in 1997 in the prestigious journal Science, algorithm portfolios have become a popular approach to solve static problems.  ...  The selection of low-level heuristics is done through a scoring system and reinforcement learning. They tested two variants of their proposal on dynamic binary functions with successful results.  ... 
doi:10.1080/18756891.2015.1046327 fatcat:uciqouorbbg53lbeap4c4obnfm

Mapping of Real World Problems to Nature Inspired Algorithm using Goal based Classification and TRIZ [article]

Palak Sukharamwala, Manojkumar Parmar
2020 arXiv   pre-print
However, the trending methods and approaches are facing multiple challenges on various fronts of data, algorithms, software, computational complexities, and energy efficiencies.  ...  The technologies and algorithms are growing at an exponential rate. The technologies are capable enough to solve technically challenging and complex problems which seemed impossible task.  ...  SI systems consist typically of a population of simple agents or boids interacting locally with one another and with their environment.  ... 
arXiv:2010.03795v1 fatcat:jdqak4mdnffgvbznv4dfpwvzsi

The College Application Problem [article]

Max Kapur, Sung-Pil Hong
2022 arXiv   pre-print
When colleges differ in their application fees, we show that the problem is NP-complete.  ...  Numerical experiments demonstrate the algorithms' accuracy and efficiency.  ...  Implementation notes We chose to implement our algorithms in the Julia language (v1.8.0b1) because its system of parametric data types allows the compiler to optimize for differential cases such as when  ... 
arXiv:2205.01869v2 fatcat:xrj4djg4lbelfhv3kdphbndwx4

A Multi-objective Binary Cuckoo Search for Bi-criteria Knapsack Problem

Abdesslem Layeb, Nesrine Lahouesna, Bouchra Kireche
2013 International Journal of Information Engineering and Electronic Business  
Computational results on some bi-criteria knapsack instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions.  ...  The Binary Cuckoo Search algorithm (BCS) is new discrete version used to solve binary optimization problem based on sigmoid function.  ...  The ultimate goal is to develop systems that have ability to learn incrementally, to be adaptable to their environment and to be tolerant to noise.  ... 
doi:10.5815/ijieeb.2013.04.02 fatcat:yumjz3jrgnfgjncw7gv7v2jz5i

Knapsack Problem variants of QAOA for battery revenue optimisation [article]

Pierre Dupuy de la Grand'rive, Jean-Francois Hullo
2019 arXiv   pre-print
We implement two Quantum Approximate Optimisation Algorithm (QAOA) variants for a battery revenue optimisation problem, equivalent to the weakly NP-hard Knapsack Problem.  ...  A first 'constrained' approach introduces a quadratic penalty to enforce the constraint to be respected strictly and reformulates the problem into an Ising Problem.  ...  Ashley Montanaro for his insightful answers during the development of this algorithm.  ... 
arXiv:1908.02210v2 fatcat:vktyjw34ivhdvmyqumjf4c5ogi

Models and algorithms for network design problems

Michael Poss
2011 4OR  
When capacity is allowed to be fractional (y is a continuous variable) Sen et al. (1994) devise a Monte-Carlo based decomposition algorithm for the problem and Lisser et al. (1999) implement a parallelized  ...  Part II Stochastic models 5 The stochastic knapsack problem with simple recourse Introduction One of the diculties of network design problems comes from their capacity constraints.  ... 
doi:10.1007/s10288-011-0174-8 fatcat:j4iuucjoqvcuxccma5wkfxmkom

Solving 0-1 knapsack problems by a discrete binary version of cuckoo search algorithm

Amira Gherboudj, Abdesslem Layeb, Salim Chikhi
2012 International Journal of Bio-Inspired Computation (IJBIC)  
Computational results on some knapsack problem instances and multidimensional knapsack problem instances show the effectiveness of the proposed algorithm and its ability to achieve good quality solutions  ...  Cuckoo search (CS) is one of the most recent population-based meta-heuristics. CS algorithm is based on the cuckoo's behaviour and the mechanism of Lévy flights.  ...  To validate and prove the performance and the effectiveness of our BCS algorithm, we have tested it on some knapsack problem (KP) instances and multidimensional knapsack problem (MKP) instances.  ... 
doi:10.1504/ijbic.2012.048063 fatcat:itdsusbro5e3fo4bg3cm4avcgq

An empirical analysis of exact algorithms for the unbounded knapsack problem

Henrique Becker, Luciana S. Buriol
2019 European Journal of Operational Research  
The threshold and collective dominances are properties of the unbounded knapsack problem first discussed in 1998, and exploited by the current state-of-the-art algorithms.  ...  This work presents an empirical analysis of exact algorithms for the unbounded knapsack problem, which includes seven algorithms from the literature, two commercial solvers, and more than ten thousand  ...  The UKP is similar to the Bounded Knapsack Problem (BKP) and the 0-1 Knapsack Problem (0-1 KP).  ... 
doi:10.1016/j.ejor.2019.02.011 fatcat:hk3hwsbvdzdilgncjc76igqfty
« Previous Showing results 1 — 15 out of 2,545 results