Informs 2015

282 / 552

INFORMS Philadelphia – 2015
280
TA66
66-Room 113C, CC
Airline/Airport Operations Management
Sponsor: Aviation Applications
Sponsored Session
Chair: Ahmed Ghoniem, Isenberg School of Management, UMass
Amherst, 121 Presidents Dr., Amherst, MA, 01002, United States of
America,
1 - A Simulation-optimization Approach for Robust Aircraft Routing
and Flight Retiming
Mohamed Haouari, Professor, Qatar University, BP 2713, Doha,
Qatar, Mohamed Ben Ahmed,
Farah Zeghal Mansour
We propose a novel simulation-optimization approach for solving the robust
aircraft routing and flight retiming problem. The approach requires iteratively
solving a mixed-integer quadratic programming problem that aims at optimally
inserting buffer times between consecutive flights, and invoking a Monte-Carlo
procedure for assessing the robustness of the generated schedules. We present the
results of extensive computational experiments that were carried out on a real
data.
2 - Airlines’ Hedging Policies: An Empirical Approach to the U.S.
Domestic Market
Soheil Sibdari, Associate Professor, UMass Dartmouth,
285 Old Westport Rd, North Dartmouth, MA, Dartmouth,
United States of America,
We study airlines’s hedging policies during years 2002-2015 according to their
corporate’s yearly report. An empirical study examines airlines’ policy and
determine the impact of airline size, market share, and the airlines’ aircraft sizes
on the hedging effectiveness.
3 - Meta-heuristic Algorithm for the Multiple Runway Aircraft
Scheduling Problem
Bulent Soykan, Old Dominion University, Dep. of Eng. Mngt.
and Systems Eng., Norfolk, VA, United States of America,
, Ghaith Rabadi
Multiple Runway Aircraft Scheduling Problem involves assigning both landing
and taking-off aircrafts to runways, sequencing them on each runway and
assigning each aircraft a landing or take-off time while considering predetermined
time windows for each aircraft to land or take-off. This research aims to develop a
tabu search/path relinking algorithm for the static case of the problem, where all
information of aircraft is known in advance.
4 - A Two-Stage Airport Surface 4D Taxiing Trajectory Scheduling
Strategy Considering Runway Exit Select
Xiang Zou, Tsinghua University, Room 430, Main Building,
Tsinghua Univ., Beijing, China, ,
Bang An
This paper proposes a two-stage airport taxing scheduling policy. In the first stage,
all of the interested aircrafts are assigned initial routes. Then, aircrafts unavailable
to fulfill their initially assigned routes are rescheduled. We do not fix the runway
exits of landing aircrafts. Instead, we introduce Runway Exit Availability and a
MIP model to assign 4D taxiing trajectories. Test in the environment of Beijing
Capital Airport shows the effectivity and efficiency of the approach.
TA67
67-Room 201A, CC
Advanced Routing Models
Sponsor: TSL/Freight Transportation & Logistics
Sponsored Session
Chair: Qie He, University of Minnesota, 111 Church Street SE,
Minneapolis, United States of America,
1 - Pollution-routing Problems with Speed and Departure
Time Optimization
Raphael Kramer, PhD Student, Universita degli Studi di Modena
e Reggio Emilia, Via Amendola 2, 42122, Reggio Emilia, Italy,
Thibaut Vidal, Anand Subramanian,
Nelson Maculan
We consider the Pollution-Routing Problem with possible departure time
optimization. This enables to better allocate human resources to time periods with
higher delivery needs. An algorithm for speed and departure time optimization is
introduced for any fixed route. Its optimality is proven. Integrating this algorithm
into a classical metaheuristic generates high-quality routing solutions.
Experimental analyses show the impact of departure time on speeds decision,
emissions and labor costs.
2 - Exact Formulations and Algorithms for the Pollution
Routing Problem
Yongjia Song, Virginia Commonwealth University,
821 W Franklin Street, Richmond, VA, United States of America,
Ricardo Fukasawa, Qie He
We propose for the first time exact formulations of the pollution routing problem.
These formulations are all mixed integer convex programs, with one being a
mixed integer second-order cone program. The lower bounds provided by the
continuous relaxations of these formulations are compared theoretically. Based
on our formulations, instances with up to 25 customers in the literature are
solved to optimality for the first time.
3 - A Column Generation Algorithm to Solve the Pollution
Routing Problem
Fernando Santos, PhD, University of Waterloo, 200 University
Avenue West, Waterloo, Canada,
Qie He, Ricardo Fukasawa, Yongjia Song
We introduced a set partitioning formulation and a column generation algorithm
to solve the Pollution Routing Problem (PRP). To price out negative reduced cost
routes we proposed a labelling algorithm that derives novel dominance rules in
order to prune out unpromising labels and perform faster.
4 - The Deterministic Dispatch Waves Problem
Mathias Klapp, PhD Student, Georgia Tech, 755 Ferst Drive NW,
Main Building #326, Atlanta, GA, 30332-0205, United States of
America, , Alan Erera, Alejandro Toriello
We study last-mile delivery systems by formulating the deterministic dispatch
waves problem (DWP) that models a distribution center where geographically
positioned orders arrive at known action periods (waves) throughout the day. At
each wave, the decision maker chooses whether to dispatch a single vehicle or
not and the subset of open orders to serve in the vehicle’s route, with the
objective of minimizing operational costs and penalties for unserved requests.
TA68
68-Room 201B, CC
Joint Session TSL/Public Sector: Resilience in
Interdependent Infrastructure System
Sponsor: Transportation, Science and Logistics
Sponsored Session
Chair: Mohammad Khodayar, Southern Methodist University, 6251
Airline Rd, Junkins Bldg, suite 334, Dallas, TX, 75275, United States of
America,
1 - Interdiction Analysis of Coupled Electricity and Natural
Gas Networks
Bowen Hua, The University of Texas at Austin,
1616 Guadalupe St, Austin, TX, 78701, United States of America,
, Ross Baldick
We present a bilevel optimization model to identify the critical components of the
coupled power and natural gas pipeline system. The upper-level problem involves
the interdiction decisions and the lower-level problem represents the operation of
the coupled system. We model the system operation as an MILP to include the
nonlinear flow-pressure relations. Some theoretical properties of this bilevel
program are analyzed. A decomposition algorithm is proposed to solve the
problem.
2 - Quantifying the Resilience of an Urban Traffic – Electric Power
Coupled System
Elise Miller-Hooks, Professor, University of Maryland, College
Park, MD, , Seksun Moryadee, Steven Gabriel,
Hossein Fotouhi
A nonlinear, stochastic, mixed integer program is presented for quantifying the
resilience of the coupled traffic-power network to a disruption. The model
captures interdependencies in this system, and seeks an optimal allocation of
limited mitigation, preparedness and response resources to obtain an efficient
resource allocation plan and maximum resilience estimate.
3 - Improving the Resilience of Multiple Energy Carrier Microgrids
Against Deliberate Disruptions
Saeed Dehghan Manshadi, Southern Methodist University,
6251 Airline Rd, Junkins Bldg, Dallas, TX, 75275,
United States of America, ,
Mohammad Khodayar
This paper proposes a framework to identify the vulnerable components in the
coordinated natural gas and electricity distribution networks in microgrids and to
ensure the resilient operation of such interdependent networks. The proposed
framework addresses deliberate actions to disrupt the energy flow in the
microgrids and proposes reinforcement strategies to increase the resilience of the
energy supply.
TA66