Locating Locomotive Refueling Stations Problem Description Kamalesh Somani, on behalf of RAS 2010 Problem Solving Competition Committee November 06, 2010.

Slides:



Advertisements
Similar presentations
Green Network Project Contract
Advertisements

CPAIOR02 School on OptimizationC. Le Pape1 Integrating Operations Research Algorithms in Constraint Programming Claude Le Pape ILOG S.A.
OR Modeling in Intermodal: Intermodal Railcar Management Dharma Acharya, Jagadish Jampani, Aihong Wen.
IEOR 4004: Introduction to Operations Research Deterministic Models January 22, 2014.
1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
Chapter 3 Workforce scheduling.
OPSM 301 Operations Management
Linear Programming Models & Case Studies
1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
Transportation, Assignment, and Transshipment Problems
Transportation, Transshipment and Assignment Models and Assignment Models.
Model RailRoad Manager Quick Start: Automated Traffic Generation.
MARITIME TRANSPORTATION MANAGEMENT
ICT 1 A heuristic for maritime inventory routing Oddvar Kloster, Truls Flatberg Molde,
Alexei A.Gaivoronski June 2001 Universita’ degli Studi di Bergamo Corso di dottorato di ricerca 1 Telecommunications: Introduction of new service Service:
Transportation in a Supply Chain
Finding Optimal Refueling Policies Shieu-Hong Lin Biola University.
1 A construction and improvement heuristic for a large scale liquefied natural gas inventory routing problem Magnus Stålhane, Jørgen Glomvik Rakke, Christian.
1The Logistic Institute – Asia Pacific Cargo Selecting Problem Abstract  The work describes a mathematical programming model for a cargo selection problem,
Pseudo-polynomial time algorithm (The concept and the terminology are important) Partition Problem: Input: Finite set A=(a1, a2, …, an} and a size s(a)
An Inventory-Location Model: Formulation, Solution Algorithm and Computational Results Mark S. Daskin, Collete R. Coullard and Zuo-Jun Max Shen presented.
Growth in international trade Caused greater reliance on intermodal connections, ports, and air terminals.
Decision for the location of Intermodal terminals in a rail-road network Anupam Kulshreshtha IIM - Lucknow.
Dynamic Freight Train Rerouting Alborz Parcham-Kashani Dr. Alan Erera Georgia Institute of Technology H. Milton Stewart School of Industrial & Systems.
FLEXIBLE MANUFACTURING SYSTEMS. FLEXIBLE MANUFACTURING SYSTEMS MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS.
Metro Scheduling By Philip Anderson & Liza John. Metro Scheduling Case Study Real world Practice.
Logistics Cost Professor Goodchild Spring 11. Initial gains from deregulation (restructuring of networks), stalling in the mid-90s dropping off again.
Route Planning and Evaluation
1 Network Optimization in Transportation Scheduling Ravindra K. Ahuja Supply Chain and Logistics Engineering (SCALE) Center Industrial & Systems Engineering.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Shortest Route, Minimal Spanning Tree and Maximal Flow Models
Chapter 12 Inventory Models
Classifying optimization problems By the independent variables: –Integer optimization --- integer variables –Continuous optimization – real variables By.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
FRFC TRANSPORT Vehicle loading from a practical case to a Bin-Packing approach.
A mathematical modeling approach to improving locomotive utilization at a freight railroad Kuo and Nicholls.
A Generic Model of Motor- Carrier Fuel Optimization Yoshinori Suzuki.
ICUAS 2014 Towards Real Time Scheduling for Persistent UAV Service: A Rolling Horizon MILP Approach, RHTA and the STAH Heuristic Byung Duk Song, Jonghoe.
Industrial Project (236504) Transportation task planning algorithms ClickSoftware Project Requirements Students: Noam Lavie, Ori Shalev Supervisors: Israel.
Train timetables Time real life problems – Year 4/5.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Constraint management Constraint Something that limits the performance of a process or system in achieving its goals. Categories: Market (demand side)
Optimal Fueling Strategies for Locomotive Fleets in Railroad Networks Seyed Mohammad Nourbakhsh Yanfeng Ouyang 1 William W. Hay Railroad Engineering Seminar.
© J. Christopher Beck Lecture 25: Workforce Scheduling 3.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Transportation Logistics CEE 498B/599I Professor Goodchild 4/18/07.
Professor Goodchild Spring 08
Network Flow Problems Example of Network Flow problems:
Raising Fuel cost. We will discuss…..  Problem size and implications  What carriers can and are doing  Fuel optimizer – exercise  Fuel contract –
Review Group -140 Thoughts on additional information requirements.
Management Science 461 Lecture 7 – Routing (TSP) October 28, 2008.
ARE 495: Introduction to Commodity Futures Markets Lecture 19: Devising a Real-World Hedging Strategy: Optimal Hedge Ratio (Part 2) Nick Piggott & Wally.
Rough-Cut Capacity Planning in SCM Theories & Concepts
ICT 1 A heuristic for maritime inventory routing Oddvar Kloster, Truls Flatberg Jyväskylä,
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
ASIA-MEMPHIS EXPRESS.
Rough-Cut Capacity Planning in SCM Theories & Concepts
CHAPTER 8 Operations Scheduling
MGT 3059 Competitive Success-- snaptutorial.com
MGT 3059 Enthusiastic Studysnaptutorial.com
MGT 3059 Education for Service-- snaptutorial.com
MGT 3059 Education for Service/tutorialrank.com
TransCAD Vehicle Routing 2018/11/29.
Chapter 6 Network Flow Models.
Slides by John Loucks St. Edward’s University.
Presentation transcript:

Locating Locomotive Refueling Stations Problem Description Kamalesh Somani, on behalf of RAS 2010 Problem Solving Competition Committee November 06, 2010

Operational Definitions Fuel trucks – Trucks which are used to fuel locomotives at a given railroad yard Train schedule - A train schedule defines — the sequence of yards in which a train stops on its route from origin to destination — the departure and arrival time and day — days of operation Train-start – Same train operated on different days of operation. If a train operates 3 days per week, say Monday, Wednesday and Friday, then the train-starts for that train at its origination yard are Monday, Wednesday and Friday

Background Every day, locomotives are assigned to trains, and along the way they are fueled at one or more of many fueling locations Fuel expenses are a significant part of any railroad's operating costs Fuel delivery costs differ from location to location because of the differences in distribution, marketing costs and other factors A railroad faces the problem of identifying a cost effective plan to fuel the locomotives that power its trains

Assumptions: Fuel Location All the fueling needs to be at a railroad yard. A yard may not have any fueling facility at all. The fueling locations can have one or more fuel trucks Individual fuel truck only serve one yard and available on 24/7 schedule The trucks have capacity constraints, A truck can fuel gallons of fuel per day The price of fuel per gallon is given for each railroad yard Fueling is instantaneous Truck weekly contracting cost is $4000

Assumptions: Trains The train schedule is fixed and known – it is repeated every week The locomotive requirement on each train is fixed and known (on locomotive id to train id level) and route is given as a cycle We consider a single locomotive type. The locomotive fuel tank capacity is 4500 gallons Fuel consumption rate is 3.5 miles/gallon Fixed cost of waiting for fueling and refueling (includes origin of the train, fueling is not allowed at destination) per stop is $250. Maximum Number of fueling and refueling during a train-start (not including origin) is 2. The planning horizon is 2 weeks

Problem Details Objective — Minimize the total fueling cost (contract cost of truck, fuel cost per gallon) Decision variables — Number of fuel trucks (0 or more) to position at each railroad yard — Number of gallons of fuel to add to individual locomotive at a railroad yard on its route Constraints — Fuel truck capacity (max gallons of fuel per day) — No locomotive can run out of fuel on line-of-road — Each train-start can stop at most 2 times for refueling (it does not include origin and fueling is not allowed at destination)

Problem Instance Partial train network taken from a real railroad 214 trains 214 locomotives 73 railroad yards