Bicriteria Multiresource Generalized Assignment Problem

Download

index.pdf

Date

2014-12-01

Author

Karsu, Ozlem
Azizoğlu, Meral

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

185
views

0
downloads

In this study, we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective vectors and the corresponding efficient solutions. We propose several lower and upper bounds and use them in our optimization and heuristic algorithms. The computational results have shown the satisfactory behaviors of our approaches. (c) 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 621-636, 2014

Subject Keywords

Generalized assignment problem, Linear programming relaxation, Branch and bound, Heuristics

URI

https://hdl.handle.net/11511/39231

Journal

NAVAL RESEARCH LOGISTICS

DOI

https://doi.org/10.1002/nav.21607

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An exact algorithm for the minimum squared load assignment problem Karsu, Özlem; Azizoğlu, Meral (Elsevier BV, 2019-06) In this study, we consider an assignment problem with the objective to minimize the sum of squared loads over all agents. We provide mixed integer nonlinear and linear programming formulations of the problem and present a branch and bound algorithm for their solution. The results of our computational experiment have shown the satisfactory behavior of our branch and bound algorithm.
LP relaxation-based solution algorithms for the multi-mode project scheduling with a non-renewable resource Azizoğlu, Meral; Pamir, Selin Kirbiyik (2015-01-01) In this study, we consider a multi-mode resource allocation problem with a single non-renewable resource. We assume the resource is released at defined time points and at defined quantities. We also assume that the activity costs are charged once they are completed. Our aim is to minimise the project completion time. We formulate the problem as a pure integer programming model and show that it is strongly NP-hard. We find lower bounds by pure and mixed integer linear programming relaxations of the model and...
The multi-resource agent bottleneck generalised assignment problem Karsu, Ozlem; Azizoğlu, Meral (Informa UK Limited, 2012-01-01) In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heating, ventilating and air conditioning sector. We study the linear programming (LP) relaxation of the problem. We use the optimal LP relaxation solutions in our branch and bound algorithm while defining bounding and branching schemes. We find that our branch and bound algorithm returns optimal sol...
ON FOUNDATIONS OF PARAMETER ESTIMATION FOR GENERALIZED PARTIAL LINEAR MODELS WITH B-SPLINES AND CONTINUOUS OPTIMIZATION TAYLAN, PAKİZE; Weber, Gerhard Wilhelm; Liu, Lian (2010-02-04) Generalized linear models are widely-used statistical techniques. As an extension, generalized partial linear models utilize semiparametric methods and augment the usual parametric terms by a single nonparametric component of a continuous covariate. In this paper, after a short introduction, we present our model in the generalized additive context with a focus on penalized maximum likelihood and on the penalized iteratively reweighted least squares (P-IRLS) problem based on B-splines which is attractive for...
Finite-Difference Sensitivity Calculation in Iteratively Solved Problems Eyi, Sinan (2011-01-01) In this study, the accuracy of the finite-difference sensitivities is examined in iteratively solved problems. The aim of this research is to reduce the error in the finite difference sensitivity calculations. The norm value of the finite-difference sensitivity error in the state variables is minimized with respect to the finite-difference step size. The optimum finitedifference step size is formulated as a function of the norm values of both convergence error and higher order sensitivities. In order to cal...

Citation Formats

O. Karsu and M. Azizoğlu, “Bicriteria Multiresource Generalized Assignment Problem,” NAVAL RESEARCH LOGISTICS, pp. 621–636, 2014, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39231.