A multi-objective resource allocation problem in PERT networks

2006 ◽  
Vol 172 (3) ◽  
pp. 838-854 ◽  
Author(s):  
Amir Azaron ◽  
Hideki Katagiri ◽  
Masatoshi Sakawa ◽  
Kosuke Kato ◽  
Azizollah Memariani
Keyword(s):  
Resource Allocation ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Multi Objective

scholarly journals ADAPTIVE HARMONY SEARCH FOR OPTIMIZING CONSTRAINED RESOURCE ALLOCATION PROBLEM

2018 ◽  
pp. 260-269
Author(s):  
Amol C. Adamuthe ◽  
Tushar R. Nitave
Keyword(s):  
Resource Allocation ◽  
Optimization Problems ◽  
Harmony Search ◽  
Population Diversity ◽  
Allocation Problem ◽  
Resource Allocation Problem ◽  
Multi Objective ◽  
Wide Range ◽  
Allocation Problems ◽  
Population Based Algorithm

Resource Allocation problem is finding the optimal assignment of finite available resources to tasks or users. Resource allocation problems refer to a wide range of applications such as production, supply chain management, transportation, ICT technologies, etc. Resource allocation problems are NP-hard in nature where the objective is to find the optimal allocations satisfying given constraints. Harmony search (HS) algorithm is a meta-heuristic population based algorithm found good for solving different optimization problems. This paper presents adaptive harmony search (AHS) for solving one-dimensional bin packing problem (BPP) and multi-objective virtual machine placement problem (VMP). The proposed real coded solution representation supports partial constraint satisfaction. Adaptive pitch adjustment rate (PAR) based on population diversity improves the performance of harmony search algorithm. Results show that proposed HS gives optimal solution for 50 BPP instances with 100 % success rate. The performance reduced for large instances of BPP. The proposed weighted AHS for multi objective VMP problem gives better results than genetic algorithm.

A Multi-Objective Decision and Analysis Approach for the Berth Scheduling Problem

2012 ◽  
pp. 1-20
Author(s):  
Mihalis M. Golias ◽  
Maria Boilé ◽  
Sotirios Theofanis ◽  
Heidi A. Taboada
Keyword(s):  
Resource Allocation ◽  
Container Terminal ◽  
Solution Space ◽  
Allocation Problem ◽  
Container Terminals ◽  
Analysis Approach ◽  
Scheduling Problem ◽  
Resource Allocation Problem ◽  
Multi Objective ◽  
Berth Scheduling

Berth scheduling can be described as the resource allocation problem of berth space to vessels in a container terminal. When defining the allocation of berths to vessels container terminal operators set several objectives which ideally need to be optimized simultaneously. These multiple objectives are often non-commensurable and gaining an improvement on one objective often causes degrading performance on the other objectives. In this paper, the authors present the application of a multi-objective decision and analysis approach to the berth scheduling problem, a resource allocation problem at container terminals. The proposed approach allows the port operator to efficiently select a subset of solutions over the entire solution space of berth schedules when multiple and conflicting objectives are involved. Results from extensive computational examples using real-world data show that the proposed approach is able to construct and select efficient berth schedules, is consistent, and can be used with confidence.

Sign in / Sign up

Export Citation Format

Share Document