A Heuristic Algorithm for Resource Allocation/Reallocation Problem
This paper presents a 1-opt heuristic approach to solve resource allocation/reallocation problem which is known as 0/1 multichoice multidimensional knapsack problem (MMKP). The intercept matrix of the constraints is employed to find optimal or near-optimal solution of the MMKP. This heuristic appro...
Saved in:
Main Authors: | S. Raja Balachandar, K. Kannan |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2011-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2011/218078 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Increasing Robustness by Reallocating the Margins in the Timetable
by: Lingyun Meng, et al.
Published: (2019-01-01) -
A Heuristic Algorithm for Solving Triangle Packing Problem
by: Ruimin Wang, et al.
Published: (2013-01-01) -
Algorithm Selection for Allocating Pods Within Robotic Mobile Fulfillment Systems: A Hyper-Heuristic Approach
by: Maria Torcoroma Benavides-Robles, et al.
Published: (2025-01-01) -
Two-Stage Heuristic Algorithm for Aircraft Recovery Problem
by: Cheng Zhang
Published: (2017-01-01) -
A heuristic method based on LP relexation to solve the multiple allocation modular hub location problem
by: Zahra Arabzadeh Nosrat Abad, et al.
Published: (2024-12-01)