Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique
DOI10.1016/j.cam.2007.04.018zbMath1146.90511OpenAlexW2133407791MaRDI QIDQ2483337
Publication date: 28 April 2008
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2007.04.018
mathematical programminggenetic algorithmparticle swarm optimizationadaptive resource boundsmultiple-objective resource allocation problem
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Randomized algorithms (68W20)
Related Items (3)
Cites Work
- Optimization by Simulated Annealing
- A note on a general nonlinear knapsack problem
- Design of parallel algorithms for the single resource allocation problem
- A dynamic approach to multiple-objective resource allocation problem
- Resource allocation during tests for optimally reliable software
- A nonlinear knapsack problem
- Tabu Search—Part I
- Technical Note—Allocation of Effort Resources among Competing Activities
- An efficient algorithm for a task allocation problem
- The Nonlinear Resource Allocation Problem
- Optimal resource allocation with minimum activation levels and fixed costs
- A pegging algorithm for the nonlinear resource allocation problem
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique