Nicolas my PhD student has just finished his defense of his thesis titled “Solution algorithms for multi-objective integer linear programming models“. I would like to congratulate Nicolas with his PhD title and for a good presentation at the defense.
The research paper “Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs” have been published in European Journal of Operational Research. Abstract: In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems. In the recent literature, competitive frameworks has been proposed for bi-objective 0–1 problems, and many of these frameworks rely on the use of the linear relaxation to obtain lower bound sets. When increasing the number of objective functions, however, the polyhedral structure of the linear relaxation becomes more complex, and consequently requires more computational effort to obtain. In this paper we overcome this obstacle by speeding up the computations. To do so, in each branching node we use information available from its father node to warm-start a Bensons-like algorithm. We show that the proposed algorithm significantly reduces the CPU time of the framework on several different problem […]
The research paper “Optimizing pig marketing decisions under price fluctuations” have been published in Annals of Operations Research. Abstract: In the manufacturing of fattening pigs, pig marketing refers to a sequence of culling decisions until the production unit is empty. The profit of a production unit is highly dependent on the price of pork, the cost of feeding and the cost of buying piglets. Price fluctuations in the market consequently influence the profit, and the optimal marketing decisions may change under different price conditions. Most studies have considered pig marketing under constant price conditions. However, because price fluctuations have an influence on profit and optimal marketing decisions it is relevant to consider pig marketing under price fluctuations. In this paper we formulate a hierarchical Markov decision process with two levels which model sequential marketing decisions under price fluctuations in a pig pen. The state of the system is based on […]
The research paper “Biobjective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets” have been published in Informs Journal on Computing Abstract: Most real-world optimization problems are of a multi-objective nature, involving objectives which are conflicting and incomparable. Solving a multi-objective optimization problem requires a method which can generate the set of rational compromises between the objectives. In this paper, we propose two distinct bound set based branch-and-cut algorithms for bi-objective combinatorial optimization problems, based on implicitly and explicitly stated lower bound sets, respectively. The algorithm based on explicitly given lower bound sets computes for each branching node a lower bound set and compares it to an upper bound set. The implicit bound set based algorithm, on the other hand, fathoms branching nodes by generating a single point on the lower bound set for each local nadir point. We outline several approaches for fathoming branching nodes and we propose an […]
The research paper “An improved cut-and-solve algorithm for the single-source capacitated facility location problem” have been published in EURO Journal on Computational Optimization. Abstract: In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two-level local branching heuristic to find an upper bound, and if optimality has not yet been established, the third phase uses the cut-and-solve framework to close the optimality gap. Extensive computational results are reported, showing that the proposed algorithm runs 10–80 times faster on average compared to state-of-the-art problem-specific algorithms.
The past weeks we have created Multi-Objective Optimization Repository (MOrepo) which is a response to the needs of researchers from the MCDM society to access multi-objective (MO) optimization instances. The repository contains instances, results, generators etc. for different MO problems and is continuously updated. The repository can be used as a test set for testing new algorithms, validating existing results and for reproducibility. All researchers within MO optimization are welcome to contribute. For more information see https://github.com/MCDMSociety/MOrepo.
The research paper “A bi-objective approach to discrete cost-bottleneck location problems” have been published in Annals of Operations Research. Abstract: This paper considers a family of bi-objective discrete facility location problems with a cost objective and a bottleneck objective. A special case is, for instance, a bi-objective version of the (vertex) p-centdian problem. We show that bi-objective facility location problems of this type can be solved efficiently by means of an epsilon-constraint method that solves at most (n-1)m minisum problems, where n is the number of customer points and m the number of potential facility sites. Additionally, we compare the approach to a lexicographic epsilon-constrained method that only returns efficient solutions and to a two-phase method relying on the perpendicular search method. We report extensive computational results obtained from several classes of facility location problems. The proposed algorithm compares very favorably to both the lexicographic epsilon-constrained method and to the two […]
Sune one of my PhD students has just finished his defense of his thesis titled “Discrete Location Problems – Theory, Algorithms, and Extensions to Multiple Objectives“. I would like to congratulate Sune with his PhD title and for a good presentation at the defense. I have included the thesis summary below. Summary This PhD–dissertation proposes a number of solution procedures for discrete facility location problems. In the literature of operations research, location problems are mathematical models describing optimization problems where one or more facilities need to be placed in relation to a given set of customers or demand points. An example is the location of hospitals which needs to be performed in such a way as to take into account capacity limits and the sizes of nearby towns and cities.
Reza one of my PhD students has just finished his defense of his thesis titled “Optimization Methods in a Stochastic Production Environment“. I would like to congratulate Reza with his PhD title and for a good presentation at the defense. I have included the thesis summary below. Summary This dissertation with an interdisciplinary approach applies techniques from Operations Research and Statistics in order to develop models that support decisions regarding feeding and marketing of growing/finishing pigs. Stochastic dynamic programming is used as the main optimization tool to model decisions, and state space models are used as the primary statistical technique to describe the stochastic nature of the system. Based on data streams from online farm sensors and market prices, the state space model transforms data into information which is embedded into the decision models using Bayesian updating.
The research paper “A hierarchical Markov decision process modeling feeding and marketing decisions of growing pigs” have been published in European Journal of Operational Research. Abstract: Feeding is the most important cost in the production of growing pigs and has a direct impact on the marketing decisions, growth and the final quality of the meat. In this paper, we address the sequential decision problem of when to change the feed-mix within a finisher pig pen and when to pick pigs for marketing. We formulate a hierarchical Markov decision process with three levels representing the decision process. The model considers decisions related to feeding and marketing and finds the optimal decision given the current state of the pen. The state of the system is based on information from on-line repeated measurements of pig weights and feeding and is updated using a Bayesian approach. Numerical examples are given to illustrate the features […]