2015 Informs Annual Meeting

TC68

INFORMS Philadelphia – 2015

TC67 67-Room 201A, CC Consolidation in Transport Sponsor: TSL/Freight Transportation & Logistics Sponsored Session Chair: Wentao Zhang, University of Southern California, Los Angeles, CA, United States of America, United States of America, wentao@usc.edu 1 - Frequency-Location Clustering for Efficient Inbound Routes to Consolidation Centers Zhijie Dong, Cornell University, United States of America, zd57@cornell.edu, Mark A. Turnquist An optimization model addresses joint decisions of frequency of pickup from individual suppliers and grouping suppliers into collection routes by clustering in both time and space. The objective is to minimize total logistics (transportation plus inventory) cost. The optimization problem is equivalent to a single-source fixed charge facility location problem, and near-optimal solutions are found using a very efficient heuristic algorithm. Results of numerical experiments show the effectiveness of both the model formulation and the heuristic solution method. A case study demonstrates that substantial total cost savings can be achieved in realistic applications using the combined frequency-location clustering method. 2 - A Lagrangian-based Strategy to Consolidate Freight of Perishable Products Christine Nguyen, Northern Illinois University, DeKalb, IL, United States of America, United States of America, cnguyen@niu.edu, Alejandro Toriello, Maged Dessouky Our research focuses on a supply chain of suppliers with low demand for perishable products, where consolidating their product would take advantage of better shipping FTL rates versus LTL or courier rates. We consider a Lagrangian Relaxation formulation that includes a capacity constraint for a shared consolidation center. We develop an LR-based heuristic that aims to balance the consolidated economical shipping cost and the inventory cost at the consolidation center. 3 - Cost Sharing Mechanism Design for Supply Chain Consolidation and Cooperation in Agriculture Industry Wentao Zhang, University of Southern California, Los Angeles, We design cost sharing mechanisms for a consolidation center where suppliers who need to ship products to a common destination can consolidate their shipments and save transportation costs. Using the Moulin mechanism framework, we propose cost sharing mechanisms that are group strategyproof and budget-balanced. By studying the efficiency of these mechanisms empirically and analytically, we show that the outcome of these mechanisms often closely resembles an optimal solution of a central planner. 4 - Temporal Shipment Consolidation under Stochastic Dynamic Demand Sila Cetinkaya, SMU, EMIS and ITOM Departments, Dallas, TX, United States of America, sila@smu.edu, Liqing Zhang We consider stochastic dynamic shipment consolidation problems with general demands and characterize the structural properties of optimal shipment release policies under general cost structures with scale economies and quantity discounts. TC68 68-Room 201B, CC TSL Prize Session Sponsor: Transportation, Science and Logistics Sponsored Session Chair: Barrett Thomas, Associate Professor, The University of Iowa, W272 Pappajohn Business Building, Iowa City, IA, 52242, United States of America, barrett-thomas@uiowa.edu 1 - TSL Prize Winners Barrett Thomas, Associate Professor, The University of Iowa, W272 Pappajohn Business Building, Iowa City, IA, 52242, United States of America, barrett-thomas@uiowa.edu The TSL 2015 Prize Session finalists will present their award-winning work in this session. Prize committee chairs will say a few words about the winning selections. CA, United States of America, United States of America, wentao@usc.edu, Nelson Uhan, Alejandro Toriello, Maged Dessouky

4 - Strategic Security Screening Queue with Abandonments Ali Pala, PhD Student, University at Buffalo, 441 Delta Rd, Apt. 2, Amherst, NY, 14226, United States of America, alipala@buffalo.edu, Jun Zhuang Risk of threats and congestion are the major problems in security screening procedures. Strict security screening policies help detect or deter the adversary applicants, but also lead to congestion which may discourage good applicants from applying or cause unnecessary abandonment from the screening queue. This research focuses on a novel strategic queueing system and proposes a data supported game-theoretical model to study this problem. 5 - When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing Fei Fang, University of Southern California, 941 Bloom Walk, SAL 300, Los Angeles, CA, United States of America, feifang@usc.edu, Milind Tambe, Peter Stone Building on the successful applications of Stackelberg Security Games (SSGs) to protect infrastructure, researchers have begun focusing on applying game theory to green security domains such as protection of endangered animals and fish stocks. We introduce Green Security Games (GSGs), a novel game model for green security domains and provide algorithms to plan effective sequential defender strategies and to learn adversary models that further improves defender performance. Chair: John-Paul Clarke, Georgia Tech, 270 Ferst Drive, N.W., Atlanta, GA, United States of America, johnpaul@gatech.edu 1 - Combining Control by CTA and Enroute Speed Adjustment to Improve Ground Delay Program Performance James Jones, University of Maryland, 3117 A.V Williams, College Park, MD, 20742, United States of America, jonesjc1@umd.edu, Michael Ball, David Lovell Over the past several years there have been proposals and discussions regarding a move from the use of controlled times of departure (CTDs) to controlled times of arrival (CTAs) for ground delay programs (GDPs) in the U.S. In this talk we show that, by combining control by CTA with the judicious use of en route speed control, significant improvements to GDP performance can be achieved. 2 - Robust Airport Gate Planning – First Order Stability Concept Bruno Santos, Assistant Professor, TU Delft, Faculty of Aerospace We present a novel approach to the airport gate assignment problem entitled “First Order Stability”(FOS). The FOS has the goal of increasing gate plans robustness and uses two key concepts to achieve this: it postpones the gate scheduling to a moment when uncertainty is reduced significantly; and it stabilizes the order of flights, minimizing the risk on disturbances. A real case study application showed that FOS provides more stable solutions that can make equal or higher usage of the capacity. 3 - Heuristic Gate Assignment Model for Airports with Multiple Parallel Concourses Parth Shah, Graduate Research Assistant, Georgia Tech, 401 17th Street, Apt. 5205, Atlanta, GA, 30363, United States of America, parth.shah1053@gmail.com, John-Paul Clarke Ramp operation model of Atlanta International airport is simulated to understand the characteristic of aircraft movement on ramp. A new heuristic approach is adopted in which aircraft are assigned gates based on their direction of ramp entry and exit points. The model is calibrated using ASPM traffic data. The results show that the proposed new method achieves 23% reduction in total ground delay by significantly reducing the gate wait, taxi blocking and pushback blocking time. Engineering, Delft, Netherlands, B.F.Santos@tudelft.nl, Dennis Buitendijk, Joris De Kaey, John-Paul Clarke TC66 66-Room 113C, CC Managing Airport Arrival Flows Sponsor: Aviation Applications Sponsored Session

341