Production Scheduling Delivery Service - Restaurants Benoît Lagarde – bl2506 Soufiane Ahallal– sa3103 Malek Ben Sliman– mab2343.

Slides:



Advertisements
Similar presentations
Sampling Distributions
Advertisements

Green Network Project Contract
ArcLogistics Routing Software for Special Needs, Maintenance and Delivery.
Acoustic design by simulated annealing algorithm
1 February 2009 Analysis of capacity on double-track railway lines Olov Lindfeldt February 2008.
BSAD 102 Mike’s Bikes Business Simulation
Graduate School of Information Sciences, Tohoku University
Aims: - evaluate typical properties in controlled model situations - gain general insights into machine learning problems - compare algorithms in controlled.
Probabilistic Aggregation in Distributed Networks Ling Huang, Ben Zhao, Anthony Joseph and John Kubiatowicz {hling, ravenben, adj,
I welcome you all to this presentation On: Neural Network Applications Systems Engineering Dept. KFUPM Imran Nadeem & Naveed R. Butt &
Modeling OFDM Radio Channel Sachin Adlakha EE206A Spring 2001.
M. Stemick, S. Olonbayar, H. Rohling Hamburg University of Technology Institute of Telecommunications PHY-Mode Selection and Multi User Diversity in OFDM.
The many-core architecture 1. The System One clock Scheduler (ideal) distributes tasks to the Cores according to a task map Cores 256 simple RISC Cores,
Song and Such Restaurant Analysis of New Employees.
Grid Load Balancing Scheduling Algorithm Based on Statistics Thinking The 9th International Conference for Young Computer Scientists Bin Lu, Hongbin Zhang.
The moment generating function of random variable X is given by Moment generating function.
Color Aware Switch algorithm implementation The Computer Communication Lab (236340) Spring 2008.
A S CENARIO A GGREGATION –B ASED A PPROACH FOR D ETERMINING A R OBUST A IRLINE F LEET C OMPOSITION FOR D YNAMIC C APACITY A LLOCATION Ovidiu Listes, Rommert.
Wind Power Scheduling With External Battery. Pinhus Dashevsky Anuj Bansal.
* Power distribution becomes an important issue when power demand exceeds power supply. * As electric vehicles get more popular, for a period of time,
Review of Basic Statistics. Definitions Population - The set of all items of interest in a statistical problem e.g. - Houses in Sacramento Parameter -
High Impact Global Product Engineering Solutions ® ©2007 Symphony Service Corp. All Rights Reserved. Symphony Services is a registered trademark of Symphony.
Client: North Texas Food Bank Senior Design 2010 Nafees Ahmed Prajyot Bangera Shahrzad Rahimian Pablo De Santiago May 10, 2010 “Passionately pursuing a.
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Ann Melissa Campbell, Jan Fabian Ehmke 2013 Service Management and Science Forum Decision.
1 DATA DESCRIPTION. 2 Units l Unit: entity we are studying, subject if human being l Each unit/subject has certain parameters, e.g., a student (subject)
Statistics for Engineer Week II and Week III: Random Variables and Probability Distribution.
A spinner from a board game randomly indicates a real number between 0 and 50. The spinner is fair in the sense that it indicates a number in a given interval.
1 Local search and optimization Local search= use single current state and move to neighboring states. Advantages: –Use very little memory –Find often.
MBA 513 Applied Business Models. MBA 513 Applied Business Models Operations Management.
The Case for Addressing the Limiting Impact of Interference on Wireless Scheduling Xin Che, Xi Ju, Hongwei Zhang {chexin, xiju,
STATISTICAL INFERENCE PART VIII HYPOTHESIS TESTING - APPLICATIONS – TWO POPULATION TESTS 1.
0 K. Salah 2. Review of Probability and Statistics Refs: Law & Kelton, Chapter 4.
Multi-Agent Modeling of Societal Development and Cultural Evolution Yidan Chen, 2006 Computer Systems Research Lab.
1 Robust Statistical Methods for Securing Wireless Localization in Sensor Networks (IPSN ’05) Zang Li, Wade Trappe Yanyong Zhang, Badri Nath Rutgers University.
Hybrid Simulation with Qualitative and Quantitative Integrated Model under Uncertainty Business Environment Masanori Akiyoshi (Osaka University) Masaki.
Computer Science 112 Fundamentals of Programming II Modeling and Simulation.
Designing Routing Protocol For Mobile Ad Hoc Networks Navid NIKAEIN Christian BONNET EURECOM Institute Sophia-Antipolis France.
Machine interference problem: introduction
1 CMPSCI 187 Computer Science 187 Introduction to Introduction to Programming with Data Structures Lecture 13: Queues Announcements.
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
1 ICC 2013, 9-13 June, Budapest, Hungary Localization packet scheduling for an underwater acoustic sensor network By Hamid Ramezani & Geert Leus.
1 1 1-to-Many Distribution Vehicle Routing Part 2 John H. Vande Vate Spring, 2005.
Modeling Geographic Dispersion in an Urban Area ©2001 Nathan B. Forrester and Matthew S. Forrester.
- Review the concepts of speed and average speed - Investigate acceleration and non- uniform motion - Learn how different types of motion relate to velocity.
 What is Groupware  Why organization use Groupware  Categories of Groupware  Barriers of Groupware  Getting Groupware to work in your organization.
Wireless Cache Invalidation Schemes with Link Adaptation and Downlink Traffic Presented by Ying Jin.
OPSM 301: Operations Management Session 13-14: Queue management Koç University Graduate School of Business MBA Program Zeynep Aksin
A stochastic scheduling algorithm for precedence constrained tasks on Grid Future Generation Computer Systems (2011) Xiaoyong Tang, Kenli Li, Guiping Liao,
Zeta: Scheduling Interactive Services with Partial Execution Yuxiong He, Sameh Elnikety, James Larus, Chenyu Yan Microsoft Research and Microsoft Bing.
Urban Planning Group Implementation of a Model of Dynamic Activity- Travel Rescheduling Decisions: An Agent-Based Micro-Simulation Framework Theo Arentze,
1 1 Vehicle Routing Part 2 John H. Vande Vate Fall, 2002.
Simulation Modelling A Tool to Inform and Support Decisions In Iron Ore Mining Dr Steven Richardson.
Traffic Simulation Home assignment Ing. Ondřej Přibyl, Ph.D.
Analysis of capacity on double-track railway lines
Essentials of Modern Business Statistics (7e)
Overview of Supervised Learning
بسم الله الرحمن الرحيم.
Navigation In Dynamic Environment
Lecture 2 – Monte Carlo method in finance
Quantifying the Impact of Deployment Practices on Interplant Freight Volatility Kurn Ma Manish Kumar.
Native simulation of different scheduling policies
   Storage Space Allocation at Marine Container Terminals Using Ant-based Control by Omor Sharif and Nathan Huynh Session 677: Innovations in intermodal.
ELC 310 Day 15 ©2006 Prentice Hall.
Statistical Inference
Benchmarking Topic Best Practices Executive Roundtable Presentation
Stochastic Simulations
Wednesday After Lunch: Add randomness to the Flowers Model
1/2555 สมศักดิ์ ศิวดำรงพงศ์
ECE 449/549 Homework #1 Create a taxi company model and run experiments in DEVSJAVA environment. Submit a short report on the model assumptions, model.
HRT Workshop: Transit Strategic Plan and Aug-Dec working items
Presentation transcript:

Production Scheduling Delivery Service - Restaurants Benoît Lagarde – bl2506 Soufiane Ahallal– sa3103 Malek Ben Sliman– mab2343

Agenda I- Background II- Algorithm III- Simulation & Results 2

I- Background Questions: - How can we decrease customers’ waiting time? - How can we decrease costs of delivery? Current situation: - A restaurant owner owns N restaurants - Each restaurant has its own fleet of delivery men and each faces problems with their delivery service. The idea: Centralize delivery by only having a unique fleet of deliverymen that would work for the whole network of restaurants 1) The problem 3

I- Background Average Restaurant: - Frequency: 50 orders/lunch (Normal Distribution over lunch) - Nb of delivery men: 3 delivery men - Cooking time: 18 minutes Distances from a restaurant to its customers 2) Inputs 4

II- Algorithm Input: N umber of restaurants, number of simulations, number of delivery men for each case (centralized and decentralized), restaurant locations Process: How it works 5 Generate Orders Model 1: Decentralized Model 2: Centralized Outputs -rj: time of order -(xi, yi): customers’ coordonates -rj: time of order -Cj= rj+CT+ travel time

II- Algorithm Models: At each unit of time t How it works 6 Order at t? Assign a delivery man Update delivery men positions Outputs YES NO Update delivery men positions Update Customers List (rj, Cj)

III- Simulation & Results Scenarios: - Same number of delivery men: How does it impact the waiting time? - Fewer delivery men: How much can we decrease the number of delivery men while keeping the same average waiting time? Parameters - Different restaurant densities: 1 restaurant/ 0.1 mile, 0.3 mile and 0.5 mile - Different number of restaurants: 4, 9, 16 and 25 restaurants (on a square 3x3…) - Average on 3000 simulations 1) Simulation 7

III- Simulation & Results Same # drivers – Mean(Lj) 2) Results – Delivery ONLY 8 55%

III- Simulation & Results Same # drivers – Variance(Lj) 2) Results – Delivery ONLY 9 87%

III- Simulation & Results Lower # drivers - Still 33% improvement of the variance 2) Results – Delivery ONLY 10 19%

Conclusion 11 It works pretty well: To go further: Have a more complex model: - More than 1 order/ delivery man - Possibility to take orders from different restaurants at the same time - When a delivery man is free, where to go (not to the closest restaurant) - Stochastic Parameters: cooking time, travel time, number of orders ImprovementComments Average delivery time (travel) 55% More deliveries possible & better service Variance85% Lower number of angry customers Fewer delivery men20% Cut costs with a better variance Same number of delivery men Lower number of delivery men

Thank you! 12