RYERSON UNIVERSITY

The Chang School- Ryerson University Continuing Education

CCPS311 W2015
Assignment 3 C++

Baggage Carousel
Name:

Student ID:

Marking Scheme
Design

Code
Correctness

Object-oriented design (implemented in C++)

Contains variant of Person class, variant of Bag class, and some sort of
class to represent the simulation, with member functions to reset a
simulation run, etc.
Provided design info (e.g. UML) where design cant be clearly determined
from the code
Everything compiles
Code is easy to understand, simple, and readable
Properly matching people with bags
Shuffling the orders of passengers and bags
Simulating the carousel, not dropping any bags when full
When the carousel is full, letting the person entering pick up any bags
first to give a chance for another bag to drop
Tracking times to answer the questions (first time full, total time full, last
time full, number of times full, total simulation time)
Running multiple runs of the simulation with different orderings per
simulation, computing averages of results
Using non real-time simulation
Output is actually from program

Total

/3
/2

/5
/10

Objective
For this assignment, you are to simulate the behaviour of a baggage claim system in an airport.
The goal of your program is to answer a few questions about the behaviour of this system.
Problem Specifications
This assignment involves two hundred passengers and two hundred bags (each passenger has
exactly one bag). The bags arrive at the baggage claim area at time t=0 and they are fed onto the
conveyor belt to the carousel at the rate 20 bags per minute (one bag every 3 seconds starting at

time t=0). The arrival time of a passenger at the baggage claim area is also uniformly distributed
over the time 0 to 10 minutes (i.e. a passenger arrives every 3 seconds starting at time t=0). The
arrival time of a bag to the carousel and the arrival time of the owner are assumed to be
statistically independent (i.e. "completely random").
The carousel can hold only 32 bags. When bags are removed from a full carousel, the conveyor
belt can supply more bags at a maximum rate of 20 bags per minute, so as to maintain 32 bags on
the carousel.
Because of the random stochastic nature of each simulation run, you will need to average the
results of a number of runs in order to answer the following questions. This approach will give
you the "expected value" of each.
The questions to answer are as follows:

At what time would you expect the carousel to become full?

For how long would you expect the carousel to stay full?
When would you expect all bags to have been claimed from the carousel?

Submission Details
The Administrative Report
A critical part of your assignment is the Administrative Report. This report should tell me about
your experience in the development of this code: e.g. what did you learn? What worked and what
didn't? What did you like? What did you not like? One page or less is fine.
Due Date and Submission Details
This is an individual assignment. It is worth 10% of your final grade and is due by 6:30 in class
on April 6, 2015. Late assignments will not be accepted. Your submission should be a printout of
your code and the admin report. Please also email your code to me.
You are expected to be familiar with and follow the Ryerson Student Academic Code of
Conduct.