Informs Annual Meeting 2017

SA46

INFORMS Houston – 2017

tabu search method, and propose a cluster-first-route-second approach to find heuristic solutions. In particular, the greedy algorithm and k-means algorithm are used to group the client nodes and their respective results, along with non- clustering case outcomes, are compared.

4 - An Interdiction Model for Delaying Adversarial Attacks in Information Technology Supply Chains Kaiyue Zheng, University of Wisconsin-Madison, 5002 Sheboygan Avenue, Apt 202, Madison, WI, 53705, United States, kzheng23@wisc.edu IT supply chain risks from adversarial attacks are sophisticated, hard to detect, and likely to have severe consequences. We propose an interdiction model that prioritizes cost-effective security mitigations to maximally delay adversarial attacks in IT supply chains. We consider attacks originated from multiple adversaries with different capacities and perceptions of supply chain vulnerabilities, each of which aims to find a ‘’critical path’’ through the attack surface to complete attack goals. We address uncertainty regarding mitigation effectiveness by incorporating random delaying times. A Lagrangian heuristic is proposed that identifies near-optimal solutions efficiently. 5 - Designing Intervention Scheme for Electric Vehicle Market Ece Zeliha Demirci, Eindhoven University of Technology, De Lismortel 42-250, Rektorluk Binasi EA325, Eindhoven, 5612AR, Netherlands, edemirci@bilkent.edu.tr, Nesim K. Erkip Real life examples indicate that a central authority needs to intervene to the supply chain of electric vehicle so that their adoption level is increased towards socially desirable levels. In this study, we consider an intervention scheme composed of investing in demand-increasing strategies and rebates. We introduce a model that determines a utility maximizing intervention scheme and further investigate the model. Also, we conduct a numerical study based on the available electric vehicle market data from California. 360C Urban Transportation and Logistics in Public Sector OR Sponsored: Public Sector OR Sponsored Session Chair: Sung Hoon Chung, Binghamton University, Binghamton, NY, 13902, United States, schung@binghamton.edu 1 - Congestion Reduction through Efficient Empty Container Movement Santiago Carvajal, University of Southern California, 731 W. 30th Street, Apt 6, Los Angeles, CA, 90007, United States, scarvaja@usc.edu, Maged M.Dessouky The optimization problem for efficiently routing multi-container trucks to better reposition both loaded and empty containers is studied. Our formulation adds the multi-container truck to the empty container reuse problem. Our aim is to efficiently route trucks by reducing the number of truck trips, thus decreasing transportation costs, and reducing the natural environmental impact of transporting goods. 2 - Vehicle Routing Problem for Smart Street Sweeping using GIS EunSu Lee, New Jersey City University, 160 Harborside Plaza 2, #234H, Jersey City, NJ, 07311, United States, elee3@njcu.edu Every city faces unique budget situation and public policy on the activities of street sweeping. This study assess the effectiveness of current system in Jersey City, NJ and proposes a smart street sweeping system using geographic information systems (GIS). The method minimizes citywide total operating costs while improving public services. 3 - Code Assignment for Parcel Distribution Network Byung-In Kim, POSTECH, Industrial & Management Engineering, 77 Cheongam-Ro, Nam-Gu, Pohang, Kyungbuk, 37673, Korea, Republic of, bkim@postech.ac.kr, JaeSang Park We consider a parcel distribution network consisting of multiple hubs and hundreds of spokes, in which the category code for each spoke is important. Parcels are collected at spokes, sorted based on their category codes, sent to hubs and sorted, and sent to their destination spokes. Parcels may go through multiple hubs. A spoke can send parcels to a given number of hubs and each hub has the sorting capacity and the limited number of connecting spokes. We propose a mathematical formulation and develop an algorithm of category code assignment to spokes and corresponding network flow design. 4 - Robust Ride-Sharing with Client Clustering under Travel Time Uncertainty Sung Hoon Chung, Binghamton University, P.O. Box 6000, Binghamton, NY, 13902, United States, schung@binghamton.edu, Yinglei Li We consider a ride-sharing system in which information on riders (clients) and drivers (servers) is updated and drivers’ routes need to be calculated quickly. We assume travel times between pick-up locations are subject to uncertainty, and propose a robust optimization approach to handle it properly. To achieve computational tractability, we employ the insertion algorithm in conjunction with SA44

SA45

360D JFIG Panel Discussion: Tips for Successful Publication from Journal Editors Sponsored: Junior Faculty JFIG Sponsored Session Chair: Anahita Khojandi, University of Tennessee, UTK, Knoxville, TN, 1, United States, anahitakhojandi@gmail.com 1 - JFIG Panel Discussion: Tips for Successful Publication from Journal Editors Anahita Khojandi, University of Tennessee, Knoxville, TN, United States, anahitakhojandi@gmail.com The panelists consist of past and current editors from top journals, including Manufacturing & Service Operations Management (MSOM), Service Science, and IISE Transactions. The editors will share tips on how to get your paper successfully published, from selecting the right journal and preparing the manuscript, to revising the paper and responding to reviewers’ comments. They will also answer questions pertaining to writing and publication. 2 - Panelist Sheldon H. Jacobson, University of Illinois, Dept of Computer Science, 201 N.Goodwin Avenue MC258, Urbana, IL, 61801-2302, United States, shj@illinois.edu 3 - Panelist Maria Esther Mayorga, North Carolina State University, 400 Daniels Hall, Dept. of Industrial & Systems Engineering, Raleigh, NC, 27695, United States, memayorg@ncsu.edu 4 - Panelist Christopher S. Tang, University of California-Los Angeles, UCLA Anderson School of Management, Operations and Technology Management, Los Angeles, CA, 90095-1481, United States, chris.tang@anderson.ucla.edu 5 - Panelist Alan Scheller-Wolf, Tepper School of Business, GSIA, 5000 Forbes Avenue, Pittsburgh, PA, 15213, United States, awolf@andrew.cmu.edu 360E Scheduling in Practice Invited: Project Management and Scheduling Invited Session Chair: Emrah Cimren, Nike, 1 SW Bowerman Dr, Beaverton, OR, 97005, United States, Emrah.Cimren@nike.com 1 - Stable Matching and Sustainable Cost Allocation for Real-time Ride-sharing System Pengyu Yan, University of Electrolic Sicence and Technology of Chnia, No.2006, Xiyuan Ave, West Hi-Tech Zone, 611731, Chengdu, 611731, China, yanpy@uestc.edu.cn, Cynthia Chen, Zhiqin Luo, Chengbin Chu Ride-sharing, a sustainable transportation mode, allows drivers to flexibly share idle seats in their vehicles with others. This paper addresses a stable matching solution conception in a real-time ride-sharing system with considering the benefits of the self-interested users. We first formulate a stable matching model that generates an acceptable matching solution for most of the users. The loss of the system efficiency of four existing cost allocation methods are investigated. We propose a sustainable cost allocation method that guarantee the optimal system efficiency of a stable matching solution. The numerical experiment indicate the effectiveness of our proposed method. SA46

17