Browsing College of Engineering by Publisher "INFORMS Inst.for Operations Res.and the Management Sciences"
Now showing items 1-7 of 7
-
A lifted compact formulation for the daily aircraft maintenance routing problem
( INFORMS Inst.for Operations Res.and the Management Sciences , 2013 , Article)Given a set of flights for a specific fleet type the aircraft routing problem (ARP) determines the flying sequence for each individual aircraft while incorporating specific considerations of minimum turn time maintenance ... -
A new compact formulation for the daily crew pairing problem
( INFORMS Inst.for Operations Res.and the Management Sciences , 2019 , Article)The daily crew pairing problem (DCPP) seeks to generate a set of minimal-cost pairings that covers all the planned daily flights while complying with a variety of labor regulations, safety rules, and policies of the airline. ... -
A novel model and decomposition approach for the integrated airline fleet assignment, aircraft routing, and crew pairing problem
( INFORMS Inst.for Operations Res.and the Management Sciences , 2017 , Article)Given a daily flight schedule and a set of aircraft fleets, the airline scheduling problem assigns individual aircraft and groups of crew to each flight based on specific considerations of aircraft maintenance requirements ... -
An integrated approach for airline flight selection and timing, fleet assignment, and aircraft routing
( INFORMS Inst.for Operations Res.and the Management Sciences , 2013 , Article)Airline profits critically depend on the nature and efficiency of service they provide and accrue from a complex planning process involving schedule design fleet assignment aircraft routing and crew scheduling which are ... -
Combinatorial benders decomposition for the two-dimensional bin packing problem
( INFORMS Inst.for Operations Res.and the Management Sciences , 2021 , Article)The two-dimensional bin packing problem calls for packing a set of rectangular items into a minimal set of larger rectangular bins. Items must be packed with their edges parallel to the borders of the bins, cannot be ... -
Exact solution methods for a generalized assignment problem with location/allocation considerations
( INFORMS Inst.for Operations Res.and the Management Sciences , 2016 , Article)We investigate modeling approaches and exact solution methods for a generalized assignment problem with location/allocation (GAPLA) considerations. In contrast with classical generalized assignment problems, each knapsack ... -
Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations
( INFORMS Inst.for Operations Res.and the Management Sciences , 2016 , Article)This paper introduces a novel class of generalized assignment problems with location/allocation considerations that arises in several applications including retail shelf space allocation. We consider a set of items where ...