2015 Informs Annual Meeting

MC67

INFORMS Philadelphia – 2015

MC67 67-Room 201A, CC

various conditions and provide insights. 2 - Hierarchical Emergency Shelter Location Optimization Brett Decker, University of Connecticut, 261 Glenbrook Rd, Unit 3037, Storrs, CT, 06269, United States of America, brett.decker@uconn.edu, Nicholas Lownes Many jurisdictions use only qualitative methods of locating emergency shelters and supply hubs. A hierarchical capacitated emergency shelter location problem is presented. The tradeoffs between local access and economies of scale are investigated. The model is applied to a case study along the southern shore of Connecticut. 3 - Reliable Supply Chain Design with Expedited Shipment Service Meng Zhao, Harbin Institute of Technology, Harbin Institute of Technology, Harbin, China, 14b332001@hit.edu.cn, Xiaopeng Li, Jianxun Cui, Mohsen Parsafard This study proposes a reliable location-inventory model that considers expedited shipments under probabilistic supplier disruptions. This model allows a facility to be reassigned to backup suppliers when its primary supplier disrupts. A customized algorithm is developed and numerical examples are conducted to test the algorithm and draw managerial insights. 4 - Humanitarian Facility Location and Supply Prepositioning Considering Road Vulnerability Melih Celik, Middle East Technical University, ODTÜ Kampüsü Endüstri Mühendisligi, Oda 219 Cankaya, Ankara, 06800, Turkey, cmelih@metu.edu.tr, Ece Aslan An important challenge in relief item and service delivery in the aftermath of a disaster is that roads may become unusable. In this study, we consider the problem of locating distribution centers and prepositioning supplies in the pre- disaster stage, and routing of deliveries in the aftermath. Given the uncertainty of various aspects of the disaster, we develop a two-stage stochastic programming model and propose heuristics, which we test on real-life disaster scenarios for Istanbul, Turkey. Mahmut Tutam, PhD Student, University of Arkansas, 1617 N. Evening Shade Dr., Fayetteville AR 72703, United States of America, mtutam@uark.edu 1 - Performance Analysis of Vehicle-based Order-pick Systems with Dual-command Cycles Kaveh Azadeh, PhD Candidate, Rotterdam School of Management Erasmus University, Burgemeester Oudlaan 50, Mandeville Building T09-41, Rotterdam, 3062PA, Netherlands, azadeh@rsm.nl, Debjit Roy, Rene De Koster In the new generation of vehicle-based order-pick systems, vehicles travel in both horizontal and vertical direction using the racking structure to access all storage positions within an aisle. We develop queuing models to evaluate the performance measures and analyze the performance trade-offs with other vehicle-based goods-to-picker systems. 2 - A Conceptual Model for Operational Control in Discrete Event Logistics Systems (DELS) Timothy Sprock, Georgia Tech, 755 Ferst Dr NW, Atlanta, GA, 30332, United States of America, tsprock3@gatech.edu, Leon Mcginnis To support design of smart operational controllers, this paper proposes a conceptual model capable of integrating a description of the control activities with a description of the physical system and an explicit interface to optimal-control analyses. These smart operational control mechanisms must not only integrate real-time data from system operations, but also formulate and solve a wide variety of optimal-control analyses efficiently and then translate the results into executable commands. 3 - Effects of Multiple Docks on Expected Distance Traveled in a Unit Load Warehouse with a Cross-aisle Mahmut Tutam, PhD Student, University of Arkansas, 1617 N. Evening Shade Dr., Fayetteville, AR, 72703, United States of America, mtutam@uark.edu, John A. White The warehouse configuration that minimizes expected travel distance is obtained for a unit load warehouse with a cross-aisle and multiple docks. Single- and dual- command operations are considered. Continuous and discrete formulations are employed. Considering multiple docks and their locations yields more general formulations than found in the research literature. Cases treated include receiving from an adjacent production area and external suppliers and the use of multiple docks for shipping. MC69 69-Room 201C, CC Facility Logistics V Sponsor: TSL/Facility Logistics Sponsored Session

Integrated Vehicle Routing Problems I Sponsor: TSL/Freight Transportation & Logistics Sponsored Session Chair: Bhupesh Shetty, University of Iowa, Iowa City, IA, United States of America, bhupesh-shetty@uiowa.edu 1 - Vehicle Routing with Mileage Bands Maciek Nowak, Loyola University Chicago, Chicago, IL, United States of America, mnowak4@luc.edu, Michael Hewitt A gap in vehicle routing research is the use of mileage bands as a basis for determining travel costs. While the trucking industry regularly uses mileage bands to price routes, research has widely ignored this pricing structure. In this research, we develop a methodology for shippers to create routes that minimize cost based on mileage bands and for carriers to create bands that maximize profits. 2 - Solving the Fleet Size and Mix Vehicle Routing Problem with Backhauls: A Successive Approximation Approach Javier Belloso, Spain, javier.belloso@unavarra.es, Javier Faulin, Adrian Serrano, Angel A. Juan The Fleet Mixed Vehicle Routing Problem with Backhauls (FSMVRPB) is a variant of the vehicle routing problems where delivery and pick-up customers are served from a central depot and the fleet of vehicles is unlimited and heterogeneous. The proposed algorithm utilizes a successive approximation approach that obtains a heterogeneous solution by iteratively solving homogeneous problems. The method combines three randomized criteria to improve the greedy behavior of the base heuristic applied to solve each particular problem. An ILP is presented for the FSMVRPB considering both fix and variable costs. Benchmark instances for the FSMVRPB have been selected in order to assess the efficiency of our approach, and results show that our approach is able to provide promising solutions by improving some of the best solutions reported in the literature. 3 - Inventory Routing in a Two-Echelon Supply Chain with Cross-Docks Forough Pourhossein, University of Waterloo, Waterloo, ON, Canada, fpourhossein@uwaterloo.ca, Hossein Abouee Mehrizi, James Bookbinder Consider a supply chain whose suppliers serve multiple customers, each ordering several product types. Products are shipped to cross-docks from the suppliers, and several customers are served by each route from a cross-dock; multiple routes can originate from a single cross-dock. We design optimal routes considering the total transportation, inventory carrying, and pipeline inventory costs. We restructure the model as a set-covering problem and develop a column generation algorithm to solve it. 4 - Periodic Vehicle Routing with Inventory Considerations manufacturing plant to minimize transportation and inventory costs. We consider a routing plan that is periodic and supports pickup amounts that are proportional to the amount of time between visits. We develop a heuristic and present computational results to demonstrate the effect of inventory holding costs on the routing plans. MC68 68-Room 201B, CC Logistics and Supply Chain under Disruption and Disasters Sponsor: Transportation, Science and Logistics Sponsored Session Chair: Xiaopeng Li, Assistant Professor, Mississippi State University, Bhupesh Shetty, University of Iowa, Iowa City, IA, United States of America, bhupesh-shetty@uiowa.edu, Jeffrey Ohlmann We study the problem of designing the inbound supply routes for a

Mississippi State University, Starkville, MS, 39762, United States of America, xli@cee.msstate.edu 1 - G-Network Models for Relief Activity Coordination at Disaster Sites Merve Ozen, University of Wisconsin, Madison, WI, United States of America, mozen@wisc.edu, Ananth Krishnamurthy

We use generalized queuing networks (G-network) to model relief item distribution and activity coordination following a major disaster. The models capture key aspects of victim behavior including changing needs for relief items and variability in staffing. We investigate the existence of product form solution for the queuing network models and develop theoretical approximations to estimate performance measures. We analyze the developed networks under

228