RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Programming Based Approaches for.

Slides:

Advertisements

Similar presentations

Review: Search problem formulation

Advertisements

Ali Husseinzadeh Kashan Spring 2010

Solving LP Models Improving Search Special Form of Improving Search

NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.

An Exact Algorithm for the Vehicle Routing Problem with Backhauls

The Variable Neighborhood Search Heuristic for the Containers Drayage Problem with Time Windows D. Popović, M. Vidović, M. Nikolić DEPARTMENT OF LOGISTICS.

Scenario Trees and Metaheuristics for Stochastic Inventory Routing Problems DOMinant Workshop, Molde, Norway, September , 2009 Lars Magnus Hvattum.

Artificial Intelligence Lecture No. 7 Dr. Asad Safi Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.

Solving the dispatching problem by MILP MIMIC (Mixed Integer Maurizio Igor Carlo) Carlo Mannino SINTEF ICT (Oslo), University of Rome Maurizio Boccia University.

Multi-scale Planning and Scheduling Under Uncertain and Varying Demand Conditions in the Pharmaceutical Industry Hierarchically Structured Integrated Multi-scale.

An Optimal Algorithm of Adjustable Delay Buffer Insertion for Solving Clock Skew Variation Problem Juyeon Kim, Deokjin Joo, Taehan Kim DAC’13.

Variable Neighborhood Search for the Orienteering Problem ISCIS’06 –The 21st International Symposium on Computer and Information Sciences F. Erdoğan SEVİLGEN.

2012 RAS Problem Solving Competition Movement Planner Algorithm Design for Dispatching On Multi-Track Territories 1 Phoenix October 2012.

THE SINGLE MACHINE EARLY/TARDY PROBLEM* PENG SI OW & THOMAS E. MORTON IE Paper Presentation A. İrfan Mahmutoğulları *Ow, P. S., & Morton, T. E. (1989).

1 Logic-Based Methods for Global Optimization J. N. Hooker Carnegie Mellon University, USA November 2003.

Maintenance Routing Gábor Maróti CWI, Amsterdam and NS Reizigers, Utrecht Models for Maintenance Routing 2nd AMORE Seminar, Partas, 30.

Computational Methods for Management and Economics Carla Gomes

Revisiting the Optimal Scheduling Problem Sastry Kompella 1, Jeffrey E. Wieselthier 2, Anthony Ephremides 3 1 Information Technology Division, Naval Research.

1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.

1 Planning and Scheduling to Minimize Tardiness John Hooker Carnegie Mellon University September 2005.

Airline Fleet Routing and Flight Scheduling under Market Competitions

Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results Speaker: Chen-Nien Tsai.

1 Target-Oriented Scheduling in Directional Sensor Networks Yanli Cai, Wei Lou, Minglu Li,and Xiang-Yang Li* The Hong Kong Polytechnic University, Hong.

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.

Package Transportation Scheduling Albert Lee Robert Z. Lee.

On parallelizing dual decomposition in stochastic integer programming

DEXA 2005 Quality-Aware Replication of Multimedia Data Yicheng Tu, Jingfeng Yan and Sunil Prabhakar Department of Computer Sciences, Purdue University.

Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.

Deniz Türsel Eliiyi, Assoc. Prof. Dr. Izmir University of Economics, Department of Industrial Systems Engineering To appear in: Engineering Optimization.

Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.

MILP Approach to the Axxom Case Study Sebastian Panek.

Part 4 Nonlinear Programming 4.3 Successive Linear Programming.

Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.

Quasi-static Channel Assignment Algorithms for Wireless Communications Networks Frank Yeong-Sung Lin Department of Information Management National Taiwan.

1 Exploring Custom Instruction Synthesis for Application-Specific Instruction Set Processors with Multiple Design Objectives Lin, Hai Fei, Yunsi ACM/IEEE.

MILP algorithms: branch-and-bound and branch-and-cut

Logical Topology Design

Minimax Open Shortest Path First (OSPF) Routing Algorithms in Networks Supporting the SMDS Service Frank Yeong-Sung Lin ( 林永松 ) Information Management.

Traffic Based Pathway Optimization Michael LeGore TJHSST CSL.

Tao Lin Chris Chu TPL-Aware Displacement- driven Detailed Placement Refinement with Coloring Constraints ISPD ‘15.

1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.

Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.

Linear Programming Implementation. Linear Programming

Optimal Fueling Strategies for Locomotive Fleets in Railroad Networks Seyed Mohammad Nourbakhsh Yanfeng Ouyang 1 William W. Hay Railroad Engineering Seminar.

15.053Tuesday, April 9 Branch and Bound Handouts: Lecture Notes.

1 Outline:  Optimization of Timed Systems  TA-Modeling of Scheduling Tasks  Transformation of TA into Mixed-Integer Programs  Tree Search for TA using.

V. Cacchiani, ATMOS 2007, Seville1 Solving a Real-World Train Unit Assignment Problem V. Cacchiani, A. Caprara, P. Toth University of Bologna (Italy) European.

“LOGISTICS MODELS” Andrés Weintraub P

TEMPLATE DESIGN © A high-order accurate and monotonic advection scheme is used as a local interpolator to redistribute.

1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.

Lagrangean Relaxation

Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.

September 28, 2000 Improved Simultaneous Data Reconciliation, Bias Detection and Identification Using Mixed Integer Optimization Methods Presented by:

Implementation: General Tree Search

Times are discretized and expressed as integers from 1 to 1440 (minutes in a day). set of stations set of trains set of stations visited by train j The.

Raunak Singh (ras2192) IEOR 4405: Production Scheduling 28 th April 2009.

1 Chapter 5 Branch-and-bound Framework and Its Applications.

Global topology optimization of truss structures Dmitrij Šešok Rimantas Belevičius Department of Engineering Mechanics. Vilnius Gediminas Technical University.

Part 4 Nonlinear Programming 4.3 Successive Linear Programming.

Mohammad Gh. Alfailakawi, Imtiaz Ahmad, Suha Hamdan

Dynamic Programming Copyright © 2007 Pearson Addison-Wesley. All rights reserved.

MIP Tools Branch and Cut with Callbacks Lazy Constraint Callback

1.206J/16.77J/ESD.215J Airline Schedule Planning

Branch and Bound.

Department of Information Management National Taiwan University

Chapter 6 Network Flow Models.

Part 4 Nonlinear Programming

Vehicle routing in Python

Presentation transcript:

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Programming Based Approaches for the Movement Planner Problem: Model, Heuristics and Decomposition RAS Problem Solving Competition 2012 Chiwei Yan Department of Civil & Environmental Engineering Massachusetts Institute of Technology Luyi Yang The University of Chicago Booth School of Business

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Problem Formulation: Definition of Segments A collection of tracks (main tracks, sidings, switches, crossovers) between two adjacent nodes A train must pass through every segment between its origin and destination and travel on one specific track within a given segment. 2

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Notation 3

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Linear Programming Model 4 train delay schedule deviance TWT deviance unpreferred track time

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Linear Programming Model 5

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Mixed-integer Linear Programming Model 6

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Solution Approaches 7

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Solution Approaches: Formulation Enhancement Dominance transitivity 8 = No delays at intermediate nodes Fixing MOW-related variables Fine-tuning big-M

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Solution Approaches: Heuristic Variable Fixing Imposing dominance for “distant” trains 9 If the lower bounds are too far apart, there is little chance for the later train to catch up Prohibiting unattractive overtakes ► Entry time is no later ► Type priority is no lower ► Origin is no farther Estimating what to be realized prior to the end of planning horizon …

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Solution Approaches: Decomposition Algorithm 10 End of Iteration 1 End of Iteration 2 End of Iteration 3 End of Planning Horizon Time Axis roll back ratio

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Computational Results Implementation: C++ and ILOG CPLEX 12.1 Platform: a PC with 2.40 GHz CPU and 4GB RAM Maximum computational time: 1 hour 11 DecompositionVariable FixingEnhanced ModelOriginal Model Data SetObj ($)Time (s)Obj ($)Time (s)Obj ($)Time (s)Obj ($)Time (s)

RAS Problem Solving Competition 2012 INFORMS Annual Meeting 2012, Phoenix, Oct. 14, 2012 Concluding Remarks Successfully formulate the Movement Planner Problem as MILP To solve the problem, we propose ► Formulation enhancement ► Heuristic variable fixing ► Decomposition algorithm Summary of computational results ► Expedite the search for optimal solutions by a factor of 400 for Data Set 1 ► Obtain satisficing solutions for larger instances Data Set 2: less than 30 seconds Data Set 3: less than 2.5 minutes 12