Scribd
Upload
124 views

Assignment For Burrito Optimization Game

Uploaded by

avinwiriandari61198
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
124 views

Assignment For Burrito Optimization Game

Uploaded by

avinwiriandari61198
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assignment for Burrito Optimization Game

Gurobi Burrito Optimization Game originates from the formulation of an integer programming (IP) problem to represent
the player's task in finding truck locations strategically to maximize profits. An IP problem is a mathematical construct that
describes a decision, its benefits or costs, and its constraints. Each game day features a unique IP, which is solved using
Gurobi's advanced algorithms. These algorithms efficiently determine optimal decisions by mathematically eliminating a large
number of suboptimal solutions without evaluating each solution one by one.

What is Gurobi’s IP? Here is the detail of the IP in mathematical model.


Let :
i = Customer
j = Potential Truck Locations

The IP uses the following notation for the parameters of the model. (These are the inputs, or data, for the model.)
di = Demand for customer
r = Revenue per burrito sold
k = Ingredient cost per burrito sold
𝛼ij = The demand multiplier for customer (i) and truck (j) This multiplier
depends on the distance: the further a customer i is from a truck
location j, the less willing the customer is to walk to the truck
Fj = fixed cost that has to pay for placing a truck at a potential location
yij = 1 if the closest truck to customer (i) is at location (j)
(if i is assigned to j), and 0 otherwise
xj = 1 if we locate a truck at location j, and = 0 otherwise, for each j
Both xj and yij are binary decision variables. They must equal integers (thus, this is an integer program), and in particular
they can only equal the integers 0 or 1.

Optimization Formula
⬚ ⬚ ⬚

𝑴𝒂𝒙𝒊𝒎𝒊𝒛𝒆 = ∑ ⬚∑(𝑟 − 𝑘) 𝛼𝑖𝑗 𝑑𝑖 𝑦𝑖𝑗 − ∑ ⬚ 𝑓𝑗 𝑥𝑗


𝑖 𝑗 𝑗

Subject to : (Constrains)
⬚

∑ 𝑌𝑖𝑗 ≤ 1
𝑗
All that at most one truck can be located or can serve each customer.

𝑌𝑖𝑗 ≤ Xj
a truck must be open in order to serve a customer (a customer i can only be served by a truck j
(yij=1) if there is a truck positioned at location j (xj=1))

Xj , Yij ∈ (0,1)
integrality constraints
In this Burrito Optimization Game, we aim to maximize the number of customers served by strategically placing burrito
trucks, here are some effective strategies we can apply:

1. Identify High-Demand Areas


Focus on Buildings with High Demand Markers: Start by identifying buildings with the highest circled
numbers, as they represent the maximum number of customers we can potentially win.
Cluster Analysis: Look for clusters of high-demand buildings that are close to each other. Placing a truck near
such clusters can maximize the number of customers served.

2. Optimize Truck Placement (Picture 1. below)


Central Positioning: Place trucks in central locations relative to clusters of high-demand buildings. This
reduces the average walking distance for customers and increases the percentage of customers served.
Balance Coverage: Ensure that no high-demand building is too far from any truck. If a building is too far, we
won’t gain any customers from it.

3. Evaluate and Adjust


Hover and Check: After placing a truck, use the hover feature to see the exact number of customers served
from each building. This allows you to fine-tune your placements.
Adjust Locations: If a truck is not serving as many customers as possible, try moving it slightly to a different
highlighted spot to see if the number improves.

4. Incremental Placement
Place Incrementally: Start with one truck and place it in the most strategic location based on the above points.
Observe the customer flow and then decide on the next truck’s placement.
Minimize Overlap: Ensure trucks are not too close to each other such that they overlap in serving the same
buildings excessively. Spread them out to cover more high-demand buildings.

5. Use of Animation Feedback


Analyze Customer Paths: Watch the animation of customers walking to the trucks. This visual feedback can
help you understand if there are areas with high potential demand that are not being adequately covered.

6. Trash and Relocate


Remove Ineffective Trucks: If a truck is in a location where it is not serving enough customers, don't hesitate
to move it. Drag it to the trashcan and reallocate it to a more strategic spot.

7. Trial and Error


Experiment: Sometimes the best strategy comes from experimenting with different placements. Use a trial-
and-error approach to find the optimal spots for the trucks.

By applying these strategies, we can maximize the number of customers served in Burrito Optimization Game
and improve overall game performance as the Picture 2 attached below. The key is to continuously assess and
adjust the truck placements based on the feedback and data provided in the game.

Picture 1. The Truck Placement


Picture 2. The Optimal Solution of Burrito Game.

Picture 3. The data of optimal solution of Burrito Game

You might also like