Showing 1 - 7 of 7
We present node-arc and arc-path formulations, and develop a branch-and-price approach for the directed network design problem with relays (DNDR). The DNDR problem can be used to model many network design problems in transportation, service, and telecommunication system, where relay points are...
Persistent link: https://www.econbiz.de/10010870971
This paper presents a strategic analysis of the network design problem faced by pickup and delivery companies operating in metropolitan areas and serving two or more classes of customers. The focus is on a division that treats commercial and residential customers separately, a situation...
Persistent link: https://www.econbiz.de/10010594892
We consider a real world generalization of the 2-Dimensional Guillotine Cutting Stock Problem arising in the wooden … board cutting industry. A set of rectangular items has to be cut from rectangular stock boards, available in multiple … cutting equipment productivity, which can be obtained by cutting identical boards in parallel. We present several heuristic …
Persistent link: https://www.econbiz.de/10011051801
Supply chain network design (SCND) models and methods have been the subject of several recent literature review surveys, but none of them explicitly includes sustainable development as a main characteristic of the problem considered. The aim of this review is to bridge this gap. The paper...
Persistent link: https://www.econbiz.de/10011264268
In this paper we study a class of selective newsvendor problems, where a decision maker has a set of raw materials each of which can be customized shortly before satisfying demand. The goal is then to select which subset of customizations maximizes expected profit. We show that certain...
Persistent link: https://www.econbiz.de/10010580793
In the maximum dispersion problem, a given set of objects has to be partitioned into a number of groups. Each object has a non-negative weight and each group has a target weight, which may be different for each group. In addition to meeting the target weight of each group, all objects assigned...
Persistent link: https://www.econbiz.de/10011051807
Multi-objective combinatorial optimization (MOCO) problems, apart from being notoriously difficult and complex to solve in reasonable computational time, they also exhibit high levels of instability in their results in case of uncertainty, which often deviate far from optimality. In this work we...
Persistent link: https://www.econbiz.de/10011190643