This paper tackles a generalization of the weight constrained shortest path problem in a directed network (WCSPP) in which replenishment arcs, that reset the accumulated weight along the path to zero, appear in the network. Such situations arise, for example, in airline crew pairing applications, where the weight represents duty hours, and replenishment arcs represent crew overnight rests, and also in aircraft routing, where the weight represents time elapsed, or flight time, and replenishment arcs represent maintenance events. In this paper, we introduce the weight constrained shortest path problem with replenishment (WCSPP-R), develop preprocessing methods, extend existing WCSPP algorithms, and present new algorithms that exploit the inter-replenishment path structure. We provide the results of computational experiments investigating the benefits of preprocessing and comparing several variants of each algorithm, on both randomly generated data, and data derived from airline crew scheduling applications.
We consider the problem of characterizing the convex hull of the graph of a bilinear function f on the n-dimensional unit cube [0, 1] n . Extended formulations for this convex hull are obtained by taking subsets of the facets of the Boolean Quadric Polytope (BQP). Extending existing results, we propose a systematic study of properties of f that guarantee that certain classes of BQP facets are sufficient for an extended formulation. We use a modification of Zuckerberg's geometric method for proving convex hull characterizations [Geometric proofs for convex hull defining formulations, Operations Research Letters 44 (2016), 625-629] to prove some initial results in this direction. In particular, we provide small-sized extended formulations for bilinear functions whose corresponding graph is either a cycle with arbitrary edge weights or a clique or an almost clique with unit edge weights.
This paper applies recently developed mixed-integer programming (MIP) tools to the problem of optimal siting and sizing of distributed generators in a distribution network. We investigate the merits of three MIP approaches for finding good installation plans: a full AC power flow approach, a linear DC power flow approximation, and a nonlinear DC power flow approximation with quadratic loss terms, each augmented with integer generator placement variables. A genetic algorithm based approach serves as a baseline for the comparison. A simple knapsack problem method involving generator selection is presented for determining lower bounds on the optimal design objective. Solution methods are outlined, and computational results show that the MIP methods, while lacking the speed of the genetic algorithm, can find improved solutions within conservative time requirements and provide useful information on optimality.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations –citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.