S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – 5.12.2007/ 1 Elevator Group Control Problem – Stochastic and.

Slides:



Advertisements
Similar presentations
IGLS/1 © P. Pongcharoen Using Genetic Algorithms for Scheduling the Production of Capital Goods P. Pongcharoen, C. Hicks, P.M. Braiden, A.V. Metcalfe,
Advertisements

Dynamic Task Assignment Load Index for Geographically Distributed Web Services PhD Research Proposal By: Dhiah Al-Shammary Supervised.
A Logit-based Transit Assignment Using Gradient Projection with the Priority of Boarding on a Transit Schedule Network Hyunsoo Noh and Mark Hickman 2011.
Aalto University Department of Mathematics and Systems Analysis SAL – May Systems Analysis and Decision Support Prof. Raimo P. Hämäläinen M.Sc. students.
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
The 2 Period Travelling Salesman Problem Applied to Milk Collection in Ireland By Professor H P Williams,London School of Economics Dr Martin Butler, University.
Modeling Rich Vehicle Routing Problems TIEJ601 Postgraduate Seminar Tuukka Puranen October 19 th 2009.
Vehicle Routing & Scheduling: Part 1
Genetic Algorithms for multiple resource constraints Production Scheduling with multiple levels of product structure By : Pupong Pongcharoen (Ph.D. Research.
Approximation Algorithms
Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)
Vehicle Routing & Scheduling
Travelling Salesman Problem an unfinished story...
Solution methods for NP-hard Discrete Optimization Problems.
EAs for Combinatorial Optimization Problems BLG 602E.
Ant Colony Optimization Optimisation Methods. Overview.
Better Ants, Better Life? Hybridization of Constraint Programming and Ant Colony Optimization Supervisors: Dr. Bernd Meyer, Dr. Andreas Ernst Martin Held.
Transportation Logistics Professor Goodchild Spring 2009.
On the convergence of SDDP and related algorithms Speaker: Ziming Guan Supervisor: A. B. Philpott Sponsor: Fonterra New Zealand.
1 Research Topics Group: Professor Harri Ehtamo Graduate School Seminar University of Jyväskylä.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Two Discrete Optimization Problems Problem: The Transportation Problem.
Models Physical: Scale, Analog Symbolic: Drawings Computer Programs Mathematical: Analytical (Deduction) Experimental (Induction)
Distributed control and Smart Grids
Optimized Search Heuristics: a Survey Susana Fernandes Universidade do Algarve Faro, Portugal Helena Ramalhinho Lourenço Universitat Pompeu.
Regional Traffic Simulation/Assignment Model for Evaluation of Transit Performance and Asset Utilization April 22, 2003 Athanasios Ziliaskopoulos Elaine.
1 S ystems Analysis Laboratory Helsinki University of Technology A New Concept for Passenger Traffic in Elevators Juha-Matti Kuusinen, Harri Ehtamo Helsinki.
The Optimization of Solid Waste Collection (SWC) in Nablus City Supervisor: Dr. Ramiz Assaf Co. Supervisor: Dr. Yahya Saleh An-Najah National University.
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
The Application of The Improved Hybrid Ant Colony Algorithm in Vehicle Routing Optimization Problem International Conference on Future Computer and Communication,
Bekkjarvik, A Heuristic Solution Method for a Stochastic Vehicle Routing Problem Lars Magnus Hvattum.
K. Panchamgam, Y. Xiong, B. Golden*, and E. Wasil Presented at INFORMS Annual Meeting Charlotte, NC, November 2011 *R.H. Smith School of Business University.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Applications of Dynamic Programming and Heuristics to the Traveling Salesman Problem ERIC SALMON & JOSEPH SEWELL.
Exact and heuristics algorithms
CSE 589 Part VI. Reading Skiena, Sections 5.5 and 6.8 CLR, chapter 37.
“LOGISTICS MODELS” Andrés Weintraub P
L. Bertazzi, B. Golden, and X. Wang Route 2014 Denmark June
Traveling Salesman Problem (TSP)
Transportation Logistics Professor Goodchild Spring 2011.
1 Inventory Control with Time-Varying Demand. 2  Week 1Introduction to Production Planning and Inventory Control  Week 2Inventory Control – Deterministic.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Vehicle Routing & Scheduling Cluster Algorithms Improvement Heuristics Time Windows.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Vehicle Routing Problem
An Exact Algorithm for Difficult Detailed Routing Problems Kolja Sulimma Wolfgang Kunz J. W.-Goethe Universität Frankfurt.
Genetic Algorithms and TSP Thomas Jefferson Computer Research Project by Karl Leswing.
Retail Distribution Inside a City or small Region.
Approximation Algorithms for the Traveling Salesman Problem Shayan Oveis Gharan.
A Warehouse Location Routing Problem Jirawan Niemsakul (Jossef Perl: University of Maryland Presentation By: Mark S.Daskin: Northwestern University) &
Multi-robot
Online Routing Optimization at a Very Large Scale
Data Structures Lab Algorithm Animation.
CHAPTER 8 Operations Scheduling
Insert your company logo here OVERVIEW
Genetic Algorithms and TSP
Solving the Vehicle Routing Problem with Multiple Multi-Capacity Vehicles Michael Sanders.
Integer Programming (정수계획법)
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
The Hierarchical Traveling Salesman Problem
View Planning with Traveling Cost (Traveling VPP):
Optimization and Game Theory Models and Algorithms
Dept. of MMME, University of Newcastle upon Tyne
Dept. of MMME, University of Newcastle upon Tyne
Optimization of a Mixed-Model Assembly Sequencing Problem
Dept. of MMME, University of Newcastle upon Tyne
Solution methods for NP-hard Discrete Optimization Problems
Variational Inequalities
A Neural Network for Car-Passenger matching in Ride Hailing Services.
Research director: Marko Mäkelä ▪ Supervisor: Yury Nikulin
Presentation transcript:

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 1 Elevator Group Control Problem – Stochastic and Dynamic Vehicle Routing Problem Janne Sorsa, Supervisors: Prof. Harri Ehtamo (HUT) Dr. Marja-Liisa Siikonen (KONE)

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 2 Background EGCP: Integer programming based methods not found in literature Multi-deck control methods not available in literature Contribution: Complete formulation and solution method ready for implementation for multi-deck elevators SVRP: Modeling framework and terminology Typically optimal policies solved with heuristics Contribution: practical way to solve SVRP to optimality for an on-line optimization

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 3 Modeling and Analysis Formulate VRP as Generalized Assignment Problem as Integer Programming Problem Traveling Salesman Problem for an elevator as stochastic optimal control problem Solve GAP with Genetic Algorihm Solve TSP as a Certainty Equivalent Controller (CEC) Simulation of several case studies: Measure computation time Compare service level to other algorithms

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 4 Results Method realized for on-line optimization Linear growth of computation time with respect to problem size Optimization based method beats heuristics in passenger service level Objective affects directly to the corresponding service level statistic Objective of optimization not straightforward for double-deck elevators

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 5 Conclusions and the way forward Practical approach, which works in reality! Future research: Pickup and Delivery Problem formulation (partly done by Ruokokoski, 2007) Integer Programming solution Theoretical properties (lower bounds for WT etc à la Bertsimas and van Ryzin) Effect and reliability of forecasting accuracy (HUT 2008?)

S ysteemianalyysin Laboratorio Teknillinen korkeakoulu Janne Sorsa Graduate School Seminar – / 6 References Closs, The Computer Control of Passenger Traffic in Large Lift Systems. PhD Thesis Google Scholar: 7 Scopus: 4 Bertsimas, van Ryzin, A stochastic and dynamic vehicle routing problem in the Euclidean plane Google Scholar: 117 Scopus: 49 (Transp. Sc., EJOR, OR)