INFORMS Philadelphia – 2015
500
5 - Movement Planner Algorithm for Dispatching Trains
Bahar Zarin, PhD Candidate, University of Maryland, College
Park, MD, United States of America,
bzarin@umd.edu,
Seshadri Srinivasa Raghavan, Golnush Amoli, Arezoo Samimi,
Ali Asadabadi
Train Dispatching Problem (TDP) is an important and crucial optimization
problem in the railway industry. The objective of our study is to develop a new
optimization formulation to solve the problem more efficiently with less
computational time. A Genetic Algorithm (GA) based heuristic is also developed
to solve the formulated problem and the performance of the algorithm is
evaluated using a TOY problem data set.
WE66
66-Room 113C, CC
Aviation Revenue Management
Sponsor: Aviation Applications
Sponsored Session
Chair: Dirk Sierag, CWI, Science Park 123 1098 XG, Amsterdam,
Netherlands,
dirk@cwi.nl1 - Dynamic Channel Control in Revenue Management
Weidi Wang, Tongji University, No.1239 Siping Road
Yangpu District, Shanghai, 200092, China,
wangweidi.dunelm@gmail.comIn the study of revenue management, channel effect is always ignored in
inventory control. However in the reality, selling the same flight ticket in different
channels will make different profits for airline company. In our study, we develop
a DP model which integrated inventory control and channel control in single leg.
2 - Robust Solution Method for Single-leg Choice-based
Revenue Management
Dirk Sierag, CWI, Science Park 123 1098 XG,
Amsterdam, Netherlands,
dirk@cwi.nlThis talk provides a robust solution method for revenue management models
with general choice-models. The robust solution method optimises the worst-case
scenario, providing a trade-off between risk and average reward. The uncertain
parameters of a choice model (e.g., from estimation errors) are modelled using f-
divergence uncertainty sets. Numerical results for a single-leg problem show that
the robust solution method outperforms the nominal solution by up to 2% when
using estimated parameters.
WE67
67-Room 201A, CC
Topics in Transport II
Sponsor: TSL/Freight Transportation & Logistics
Sponsored Session
Chair: Mohammad Ghane-Ezabadi, Oregon State University,
Corvallis, WA, United States of America, United States of America,
ghaneezm@onid.oregonstate.edu1 - A 3D Container Loading Problem for Very Large Tires
John Ye, JDA,
John.Ye@jda.com,Phillippe Grangier,
Louis-Martin Rousseau, Michel Gendreau, Fabian Le Huede
Tire manufacturers are currently spending a lot of time and effort on manually
planning the load of delivery trucks. The problem we are dealing with is a 3D
container loading problem for agricultural tires. Such tires are much bigger and
heavier than tires for passenger cars. As such, there exist many rules to ensure
that the loading will remain stable. We have developed a approach that relies on a
custom algorithm to locate those tires.
2 - The Load Planning Problem for Double Stacked Intermodal Trains
Nitish Umang, GE Global Research, Schenectady, NY,
United States of America,
nitishumang86@gmail.com,
Emma Frejinger, Teodor Gabriel Crainic
In this research, we study the load planning problem considering several new
constraints including dimensional restrictions, technical constraints, weight
capacities and center of gravity restrictions for double stacked platforms. We
propose an ILP formulation with the objective to minimize the number of cars
required to load a given set of containers. The results based on a set of artificial
instances inspired from real data suggest that the proposed methodology can lead
to significant savings in the operating cost of loading trains.
3 - Integrated Intermodal Transportation Network Design using a
Decomposition Approach
Mohammad Ghane-Ezabadi, Oregon State University,
Corvallis, WA, United States of America, United States of
America,
ghaneezm@onid.oregonstate.edu,Hector A. Vergara
The expected growth of intermodal transportation demand increases the
importance of strategically designing intermodal logistics networks. In this
research, load route and transportation mode selection problems are integrated
with the hub location problem in a mathematical formulation. A composite
variable formulation was developed in which the complete route for a load from
origin to destination was considered as a single composite variable. A
decomposition approach was applied to find solution for the proposed
mathematical formulation. Computational experiments were completed to
evaluate the performance of the proposed mathematical model and solution
approach.
4 - Distribution, Routing and Fleet Design Strategy for an
E-commerce Provider in Santiago Chile
Cristian Cortés, Universidad de Chile, Associate Professor,
Department of Civil, Chile,
ccortes@ing.uchile.cl,Jaime Miranda, Pablo Rey, Pablo Saintard
A simulation approach is proposed to analyze and quantify the cost of different
configurations and operational schemes of a e-commerce provider in the city of
Santiago, Chile. Strategies involve delivery of products within promised time
windows and a potential implementation of a new depot location. A routing
strategy is also proposed to simulate new strategies of unobserved distribution
policies.
WE68
68-Room 201B, CC
Routing Problems with Uncertainty II
Sponsor: Transportation, Science and Logistics
Sponsored Session
Chair: Stacy Voccia, FedEx Express, 3610 Hacks Cross Rd, Bldg. H, 2nd
Floor, Memphis, United States of America,
stacy.voccia@fedex.com1 - A Dynamic Load-dependent Vehicle Routing Schedule for
Minimizing Risk in Medical Waste Collection
Masoumeh Taslimi, University at Buffalo (SUNY), 342 Bell Hall,
Buffalo, NY, United States of America,
masoumeh@buffalo.edu,Rajan Batta, Changhyun Kwon
Medical waste service companies aim to create safe, responsible, and customized
programs to collect medical waste from medical centers. Thus, the companies and
customers agree on a schedule for collection services. In order to find a mutually
less risky and more beneficial schedule, we propose a dynamic load-dependent
capacitated vehicle routing problem that captures minimization of both
occupational and transportation risks. A column generation heuristic approach is
developed to handle the computational difficulties in solving real world problems.
2 - A Probabilistic Model for Vehicle Scheduling based on Stochastic
Trip Times
Yindong Shen, Professor, School of Automation, Huazhong
University of Science and Technology, 1037 Luoyu Road,
Wuhan, 430074, China,
yindong@hust.edu.cnWe study the vehicle scheduling problem in public transport based on stochastic
trip times instead of fixed ones. A novel probabilistic model and its enhanced
model featuring delay propagation are proposed, while a solution method is
developed. Experiments show the models can considerably enhance the on-time
performance of resulting schedules.
3 - Same-Day Delivery for Online Purchases
Stacy Voccia, FedEx Express, 3610 Hacks Cross Rd, Bldg. H,
2nd Floor, Memphis, United States of America,
stacy.voccia@fedex.com, Barrett Thomas, Ann Campbell
Same-day delivery for online purchases is a recent trend in online retail. We
introduce a dynamic pick-up and delivery problem with time windows that
incorporates key features associated with same-day delivery logistics. In order to
make better-informed decisions, our solution approach incorporates information
about future orders into routing decisions. We present results that demonstrate
the value of the approach.
.
WE66