This paper examines a convex reformulation scheme for mixedinteger quadratic programs, which was recently developed in the literature. A modification to the scheme, based on a linear transformation, is presented. The...
详细信息
This paper examines a convex reformulation scheme for mixedinteger quadratic programs, which was recently developed in the literature. A modification to the scheme, based on a linear transformation, is presented. The modification improves performance for problems which have more continuous variables than integer variables. Numerical results are presented showing the effectiveness of the modification.
We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers ...
详细信息
We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a significant part of the operational costs. We develop a mixed integer programming model that incorporates the shuttle requirements at the beginning and end of the shifts into the agent-shift assignment decisions, while considering the skill sets of the agents, and other constraints due to workforce regulations and agent preferences. We analyze model solutions for a banking call center under various management priorities to understand the interactions among the conflicting objectives. We show that considering transportation costs as well as agent preferences in agent-shift assignments provides significant benefits in terms of both cost savings and employee satisfaction. (C) 2013 Elsevier Ltd. All rights reserved.
This paper presents a comprehensive decision-making framework for evaluating a portfolio of IT projects. A problem of IT project selection with and without project interdependencies is considered. The problem is subje...
详细信息
This paper presents a comprehensive decision-making framework for evaluating a portfolio of IT projects. A problem of IT project selection with and without project interdependencies is considered. The problem is subject to maximum project funding budget constraint. When IT project portfolio contains independent projects, a dynamic programming (DP) solution procedure is proposed to efficiently solve the portfolio of IT projects' problem. However, when IT project portfolio contains project interdependencies, a mixed integer programming (MIP) approach is needed to solve the problem optimally. Experiments and results using simulated data using Monte Carlo simulation are provided. The results indicate that a large set of project selection problems containing up to 60 projects can be solved easily using the proposed decision-making framework. (C) 2013 Elsevier Ltd. APM and IPMA. All rights reserved.
We address the Least Quantile of Squares (LQS) (and in particular the Least Median of Squares) regression problem using modern optimization methods. We propose a mixedinteger Optimization (MIO) formulation of the LQS...
详细信息
We address the Least Quantile of Squares (LQS) (and in particular the Least Median of Squares) regression problem using modern optimization methods. We propose a mixedinteger Optimization (MIO) formulation of the LQS problem which allows us to find a provably global optimal solution for the LQS problem. Our MIO framework has the appealing characteristic that if we terminate the algorithm early, we obtain a solution with a guarantee on its sub-optimality. We also propose continuous optimization methods based on first-order subdifferential methods, sequential linear optimization and hybrid combinations of them to obtain near optimal solutions to the LQS problem. The MIO algorithm is found to benefit significantly from high quality solutions delivered by our continuous optimization based methods. We further show that the MIO approach leads to (a) an optimal solution for any dataset, where the data-points (y(i), x(i))'s are not necessarily in general position, (b) a simple proof of the breakdown point of the LQS objective value that holds for any dataset and (c) an extension to situations where there are polyhedral constraints on the regression coefficient vector. We report computational results with both synthetic and real-world datasets showing that the MIO algorithm with warm starts from the continuous optimization methods solve small (n = 100) and medium (n = 500) size problems to provable optimality in under two hours, and outperform all publicly available methods for large-scale (n = 10,000) LQS problems.
In this paper we propose an adaptive genetic algorithm that produces good quality solutions to the time dependent inventory routing problem (TDIRP) in which inventory control and time dependent vehicle routing decisio...
详细信息
In this paper we propose an adaptive genetic algorithm that produces good quality solutions to the time dependent inventory routing problem (TDIRP) in which inventory control and time dependent vehicle routing decisions for a set of retailers are made simultaneously over a specific planning horizon. This work is motivated by the effect of dynamic traffic conditions in an urban context and the resulting inventory and transportation costs. We provide a mixed integer programming formulation for TDIRP. Since finding the optimal solutions for TDIRP is a NP-hard problem, an adaptive genetic algorithm is applied. We develop new genetic representation and design suitable crossover and mutation operators for the improvement phase. We use adaptive genetic operator proposed by Yun and Gen (Fuzzy Optim Decis Mak 2(2):161-175, 2003) for the automatic setting of the genetic parameter values. The comparison of results shows the significance of the designed AGA and demonstrates the capability of reaching solutions within 0.5 % of the optimum on sets of test problems.
A problem of personnel scheduling in a multiskilled environment is addressed. This problem is treated in an integrated manner, modelling shift scheduling and task assignment as one problem. Additionally, the integrate...
详细信息
A problem of personnel scheduling in a multiskilled environment is addressed. This problem is treated in an integrated manner, modelling shift scheduling and task assignment as one problem. Additionally, the integrated approach allows also to better model intraday breaks and days-off scheduling. Alternative MIP formulations are presented which lead to optimal shift schedulings and task assignments. Improved models are obtained by deriving new block indexed and position indexed variables. Computational results show the improvement obtained by extended formulations. (C) 2013 Elsevier B.V. All rights reserved.
Remote microgrids are a viable option for electrification where the main grid expansion is either impossible or not economical. Typically, remote microgrid consists of diesel generator as a primary source of energy wh...
详细信息
ISBN:
(纸本)9781479955510
Remote microgrids are a viable option for electrification where the main grid expansion is either impossible or not economical. Typically, remote microgrid consists of diesel generator as a primary source of energy which has a high fuel cost. Renewable energy sources can be used to reduce the fuel consumption with proper coordination and scheduling methods. Storage devices, usually battery, used in remote microgrid are expensive and toxic in nature;therefore battery lifetime is another important parameter to be considered during microgrid scheduling. In this paper, four test cases were developed for the study of fuel consumption. Problems were formulated as mixed integer programming (MIP) and solved using GAMS/CPLEX 12.6 solver. Furthermore, the battery lifetime model was included in the optimization model and fuel consumption was compared with other cases. Results show the slight increment in fuel consumption when the battery lifetime model was included.
Power system planning and operation offers multitudinous opportunities for optimization methods. In practice, these problems are generally large-scale, non-linear, subject to uncertainties, and combine both continuous...
详细信息
ISBN:
(纸本)9788393580132
Power system planning and operation offers multitudinous opportunities for optimization methods. In practice, these problems are generally large-scale, non-linear, subject to uncertainties, and combine both continuous and discrete variables. In the recent years, a number of complementary theoretical advances in addressing such problems have been obtained in the field of applied mathematics. The paper introduces a selection of these advances in the fields of non-convex optimization, in mixed-integerprogramming, and in optimization under uncertainty. The practical relevance of these developments for power systems planning and operation are discussed, and the opportunities for combining them, together with high-performance computing and big data infrastructures, as well as novel machine learning and randomized algorithms, are highlighted.
Efforts to reduce power consumption in telecommunication networks follow in two mutually related directions - design of a more efficient equipment and development of energy-aware network control strategies and protoco...
详细信息
ISBN:
(纸本)9780983628392
Efforts to reduce power consumption in telecommunication networks follow in two mutually related directions - design of a more efficient equipment and development of energy-aware network control strategies and protocols. The paper presents a formulation of two-criteria traffic engineering problem, which takes advantage of energy saving capabilities in software routers. The first optimization criterion is the energy consumption, and the second one is the quality of service and service sustainability. Models and traffic engineering strategy were verified in laboratory experiments.
The manufacturers nowadays are forced to respond very quickly to changes in the market conditions. To adopt flexible mixed model assembly lines (MMAL) is a preferred way for manufacturers to improve competitiveness. M...
详细信息
ISBN:
(纸本)9783038352884
The manufacturers nowadays are forced to respond very quickly to changes in the market conditions. To adopt flexible mixed model assembly lines (MMAL) is a preferred way for manufacturers to improve competitiveness. Managing a mixed model assembly line involves two problems: assigning assembly tasks to stations (balancing problem) and determining the sequence of products at each station (sequencing problem). In order to solve both balancing and sequencing problem in MMAL simultaneously, an integrated mathematical model based on mixed integer programming (MIP) is developed to describe the problem. In the model, general type precedence relations and task duplications are considered. Due to the NP-hardness of the balancing and sequencing problem of MMAL, GA is designed to search the optimal solution. The efficiency of the GA is demonstrated by a case study.
暂无评论