162 KKU Science Journal Volume 37KKU Sci. J.

37 (Supplement) 162-171
(Supplement) (2009)
Research

Applied Mathematical Model for Napkin Planning in Restaurant

Sirirat Wongprakornkul 1

Abstract

The objectives of this study were to present the mathematical model for solving the optimum solution
which meets the lowest cost of napkin plan and to perform the action plan of napkin-management problem.
For generating the mathematical model of napkin-planning problem, network flow analysis was applied to
display all flows occurred in the problem which eases to formulate a mathematical model or an integer linear
programming model. The objective function of this model was to find out the minimum cost for napkin management
with in constrains of known number of customers per day and known number of ways of napkin laundry.
The solutions were shown the amount of all napkins and how to manage napkins in each day. In this study, one
week napkin planning problem was solved. We found that there are 973 needed napkins per week. First 500 napkins
had been bought, so now 473 new napkins were bought more for this week. The minimum napkin cost was
24,465.75 Baht. To comparison with solving with manual by using regular mathematics, the numbers of bought
napkins and new napkins were the same, 973 napkins. Furthermore, the napkin cost was 25,231.75 Baht.
Obviously, the napkin cost solving with Operations research technique was lower to 766 Baht.

Keywords : Network Flow Analysis, Integer linear Programming, Napkin Planning

1
Department of Statistics, Faculty of Science, Khon Kaen University, Muang, Khon Kaen, 40002. THAILAND
E-mail: sirwon@kku.ac.th
Research KKU Science Journal Volume 37 (Supplement) 163

Introduction 1) Collecting napkin consumption in each

System perspective is one of critical values day by observing number of customers in 3 periods for
to be high performance organizations. The systematic seven days then calculating all customers by conducting
operating begins with action planning for performing probability weighted average of number of customer
efficiently and effectively. Linear programming and in each period.
integer linear programming are well known techniques 2) Applying integer linear programming to
lead into mathematical model formulation of real find out quantity of sent napkin for cleaning in each
world problems; such as production planning problem, day and quantity of purchasing for fulfill service by
network flow problem, transportation problem, the least of napkin-management cost.
assignment problem, plant layout problem and etc.
These techniques could solve problems within limited Literature reviews
resources or constraints like raw materials, men, labors, Nonlinear programming problems with linear
machines, times, and/or energy. The quest for optimal constraints were formulated for planning an advertising
solution, mathematical model is created with all campaign of goods and services. In this paper said
relations constraints and objective function. that a generalization of the mathematical model and
In this paper raised mathematical tools; operations research problems were presented as the
network flow analysis and integer linear programming, framework of an approach for planning (Belenky and
which were applied to do action planning in Belenkii, 2002).
napkin-planning problem. The purposes of this action A multicommodity circulation minimum cost
plan were to reach the minimum napkin-management network flow model with side constraints was claimed
cost, to meet customer needs every day, and to know to increase productivity. It has long been recognized
the plan to manage napkins to laundry. There were four that productivity in manufacturing plants can often be
steps for solving the problem as mentioned before. First, increased by producing similar products in cells. This
network flow diagram was created. This step was useful involves (i) assigning parts to individual machines, and
to understand how napkins move in each day. Second, (ii) forming machines into cells. These two activities
the mathematical model was presented by imitating the have traditionally been carried out separately. However,
network flow diagram in step 1. Third, the model was most solution procedures for (i) above utilize a solution
solved for the optimal solution. And the last one, the to (ii), and vice versa. Here we present a unified
solution was managed the napkin plan. approach that deals with (i) and (ii) simultaneously
(Foulds and Neumann, 2003).
Objectives Dynamic programming techniques were
1) To present the mathematical model for proposed that problems of efficiently responding to a
solving the optimum solution or meeting the least of situation in a Command, Control, Communications,
napkin-management cost. and Intelligence (C3I) network can be investigated.
2) To perform the action plan of napkin- An initial mode1 in the form of an integer linear
management problem. program was decomposed to reveal a recurrence
relation, which could then be solved using a method
Limitation of successive approximations. Because the recurrence
This research composes of 2 processes as relation could not be directly realized as an algorithm,
following: a modified problem was proposed that considers
164 KKU Science Journal Volume 37 (Supplement)
only those candidate solutions having at most some cutting stock-transportation problem (1DCSP&TP) was
prescribed number of transmission and transform computed by decomposition principle. A 1DCSP&TP
operations. Solving this for successively increasing
numbers of acceptable transforms eventually yields the
optimum for the original model. With the understanding
that the set of all possible allocations of information
to nodes of the network may be infinite, some way
of ensuring eventual termination of the algorithm is
required. Two possibilities for limiting the state space
were explored in this paper; the modified problem can
be solved for some suitably large maximal number of
operations, or a known upper bound on the optimal cost
can be assumed (Reid, 1999).
Mathematical modeling was presented as a
theoretical investigation of the influence of blood flow
through a tumour-induced capillary network, whereby
the vascular architecture adapts as it grows to the In this study, one restaurant was a case study
associated haemodynamic forces resulting in what
we describe as adaptive tumour-induced angiogenesis
(ATIA). The network is generated in response to tumour
angiogenic factors (TAFs), which are released from
hypoxic cells within a solid tumour. First, a refined
model was described for tumour-induced angiogenesis,
which aims to describe the capillary growth process
at the cellular level by explicitly taking into account
the effects of matrix degrading enzymes and the local
properties of the host tissue during endothelial cell
migration. Then, blood rheological properties were
incorporated into the formulation and investigate the
influence of wall shear stress induced by the blood flow
during dynamic vascular growth. After that a number
of feedback mechanisms affecting vascular resistance
and network architecture were gone on to examine. The
results clearly demonstrate that the combined effects
of network architecture and vessel compliance should
be included in future models of angiogenesis if therapy
protocols and treatment efficacy are to be adequately
assessed (Stéphanou et al., 2006).
The optimization based heuristic approaches
that suggested for solving an integrated one-dimensional
Research
was formed into a mathematical model. Due to a
one-dimensional cutting stock problem is a classical
NP-hard problem which cannot be solved with the
polynomial computation time. Therefore, 1DCSP&TP is
an application of large scale problem. Column-Generation
Technique and Bender decomposition were applied
for creating all possible essential cutting patterns.
After that, the proposed heuristic method was raised
to solve the problem. The solution of 1D-CSP&TP is
necessary for planning production and transportation
strategies in the lowest cost (Wongprakornkul and
Charnsethikul, 2007).
Results
for napkin planning. It was found that network analysis
could conduct the napkin-management problem as a
network flow diagram. The relationship and movement
of napkins were shown in the diagram. Furthermore,
network and flow of napkin management could be
analyzed for specifying parameters to perform integer
linear programming. The parameters are detailed below:
1. Daily napkin consumption
2. Napkin laundry method
3. Costs consist of napkin price and cleaning
cost.
Data Collecting
Napkin consumption was assumed by number
of customers in each day. Data were allowed by the
restaurant manager to observe in every 30 minutes
for the whole operating period of day, 10:30 to 20:30,
totally 10 hours as shown in table 1. On November 28,
2007, there were four periods of the large number of
customers in 12:01-12:30, 12:31-13:00, 17:01-17:30,
and 17:31-18:00. Other periods, numbers of customers
were in low and medium as shown in Figure 1.
e 1. On November 28, 2007, there were four periods of the large number of customers in 12:01-12:30, 12:31-13:00
17:30, and 17:31-18:00. Other periods, numbers of customers were in low and medium as shown in figure 1.
Research KKU Science Journal Volume 37 (Supplement) 165

Table 1. Number of customers in every 30 minutes

Table 1. Number of customers in every 30 minutes
Period Customers Period Customers
Period
10:30-11:00 Customers
5 Period
15:31-16:00 Customers5
10:30-11:00
11:01-11:30 56 15:31-16:00
16:01-16:30 5 13
11:01-11:30
11:31-12:00 6 14 16:01-16:30
16:31-17:00 13 9
11:31-12:00
12:01-12:30 1426 16:31-17:00
17:01-17:30 9 18
12:01-12:30
12:31-13:00 2615 17:01-17:30
17:31-18:00 18 17
12:31-13:00
13:01-13:30 156 17:31-18:00
18:01-18:30 17 11
13:01-13:30
13:31-14:00 67 18:01-18:30
18:31-19:00 11 14
13:31-14:00
14:01-14:30 7 12 18:31-19:00
19:01-19:30 14 6
14:01-14:30
14:31-15:00 126 19:01-19:30
19:31-20:00 6 9
14:31-15:00
15:01-15:30 6 11 19:31-20:00
20:01-20:30 9 4
15:01-15:30 11 20:01-20:30 4

Figure 1. Number of customers

Figure 1. Number of customers
 166 KKU Science Journal Volume 37 (Supplement) Research

Figure 2 shows periods that are high and low to medium for number of customers. Because of the observations
Figure
was undertaken 2 shows
in every periods that
30 minutes, therearewere
high20anddurations
low to fromduration
10:30 toof each
20:30.period (either
Hence, high orduration
dividing low to medium)
of each
medium for number of customers. Because of the by 20 yielded probability of number of customers for
period (either high or low
observations to medium)inbyevery
was undertaken 20 30
yielded probability
minutes, there ofeach
number
periodofascustomers
shown in for each3.period as shown in
Figure
figure 3. were 20 durations from 10:30 to 20:30. Hence, dividing

12:01-13:00 17:01-18:00
10:30-12:00 13:01-17:00 18:01-20:30
10:30-12:00 13:01-17:00
be a peak period which number of18:01-20:30
customers is
greater than or equal to 15 persons.
be a peak period which number of customers is
greater than or equal to 15 persons.
be a moderate period which number of customers is
less than 15 persons.

FigureFigure 2. Number
2. Number of customers
of customers in eachin period
each period

be a peak period which number of customers is

greater than or equal to 15 persons.
be a peak period which number of customers is
be a moderate
greater than or period which
equal to number of customers
15 persons.
is less than 15 persons.
be a moderate period which number of customers
is less than 15 persons.
Figure 3. Empirical distribution of number of customers
Figure 3. Empirical distribution of number of customers
The probability of high number of customers was each period. In this study, the collected data for 7 days
0.2. Whereas, the probability of low to medium number from November 30 to December 6, 2007 were divided
The probabilitywasof0.8.
of customers highTherefore,
number ofnumber
customers wascus-
of total 0.2. Whereas, the probability
into 6 periods; of low
12:01-12:30, to medium14:31-15:00,
12:31-13:00, number of
customers tomers
was 0.8.in Therefore,
each day was number of totalbycustomers
calculated multiplyingin the
each day15:01-15.30,
was calculated by multiplying
17:01-17-30, the probability
and 17:31-18:00 with
as shown
probability
the observed number with the observed
of customers number
in each of customers
period. in the
In this study, in table 2. data for 7 days from November 30 to
collected
DecemberTable
6, 20072. Number
were divided into 6 periods;
of customers 12:01-12:30,
categorized 12:31-13:00, 14:31-15:00, 15:01-15.30, 17:01-17-30, and
into 6 periods
17:31-18:00 as shown in table 2. Number of customers
Date 12:01-12:30 12:31-13:00 13:31-15:00 15:01-15:30 17:01-17.30 17:31-18:00 Total
Nov.30 17 Table 2. Number
10 of customers
8 categorized 5 into 6 periods
15 8 63
Dec. 1 21 12 4 2 10 16 65
Dec. 2 38 24 27 of customers
Number 18 13 24 144
DateDec. 3 12:01-12:30
30 12:31-13:00 36 16
13:31-15:00 19
15:01-15:30 19
17:01-17.30 27
17:31-18:00 147
Total
Nov. 30Dec. 4 1715 1014 810 57 159 815 6370
Dec. Dec.
1 5 2142 1254 431 248 1023 1633 65231
Dec. Dec.
2 6 3813 24 7 276 189 135 249 14449
Dec. 3 30 36 16 19 19 27 147
Dec. 4 15 14 10 7 9 15 70
Dec. 5 42 54 31 48 23 33 231
 Research KKU Science Journal Volume 37 (Supplement) 167

Calculating the number

Calculating of total customers
the number in each indayeach
of total customers wasdayconducted by the
sample weighted average
of calculation technique.onTheNovember
of total customers sample of
wasofconducted
calculation by the weighted
total customers on Novemberaverage
30,technique.
2007 was The 30, 2007 was shown below:
shown below:

 17  10  15  8  85 
Total customers =  4
 0.2     0.8   20  154
   2 

Total customers from November

Total customers 30 to December
from November 6 calculated
30 to December as aboveaswere
6 calculated shown
above wereinshown
table 3.in table 3.

Table 3. Number of customers per day

Table 3. Number of customers per day

Date Total customers

Date Total customers
Nov.Nov.
30 30 154154
Dec.Dec.
1 1 107107
Dec.Dec.
2 2 459459
Dec. 3 392
Dec. 3 392
Dec. 4 189
Dec.Dec.
5* 4 784189
Dec.Dec.
6 5* 154784
Note: *The Father’s Day (Dec. 5)
Dec. 6 154

To show how efficient of the mathematical Note: model

*The Father’s Dayplanning,
for napkin (Dec. 5) any kind of data can be employed as the
input to the model. Thus, the unusual data of the customers on the Father’s day, which were obviously higher than the
could To
other days, show how
be used. efficientthe
In addition, of input
the mathematical
data were used toForevaluate
example,thenapkins
cost ofused for the
napkin first andbysecond
planning day
comparison
between model for napkin model
the mathematical planning,
and any kindcalculation.
manual of data can be were come from 2 sources; the existing and purchasing.
employed as the input to the model. Thus, the unusual Napkins used in the third day were come from the
data of the customers on the Father’s day, which were existing, purchasing and fast cleaning of the first day
Integer Linear
obviously higher Programming
than the other days, could be used. used napkin and the fourth day were the existing,
InForaddition, the input integer
easy generating data were used
linear to evaluate model,
programming the network
purchasing, fast cleaning
flow diagram was doneof the
to seesecond day and
the network and
cost of napkin planning by comparison between the normal cleaning from the first day.
flow of napkin as shown in figure 4. For example, napkins used for the first and second day were come from 2 sources;
mathematical model and manual calculation.
the existing and purchasing. Napkins used in the third day were come from the existing, purchasing and fast cleaning of
the first day used Integer
napkin and the Programming
Linear fourth day were the existing, purchasing, fast cleaning of the second day and normal
cleaning from the For firsteasy
day.generating integer linear programming
model, network flow diagram was done to see the
network and flow of napkin as shown in figure 4.
 Parameters of integer linear programming model for this study wer
168 KKU Science Journal Volumethe37following steps:
(Supplement) Research
1. Specify decision variables:
xi Number of existing napkins used in each day i; i = 1, 2,…,7
yi Number of purchased napkins used in each day i; i = 1, 2,…,7
Existing napkins New napkins
ri Number of fast cleaning napkins (within one day return) used
pi Number of normal cleaning napkins (within two day return) u
2. Establish objective function:
Z Cost of napkin management (Baht per week)
3. Constraints:
di Napkin demand or number of customers in each day i; i = 1,2,
k Total number of existing napkins
4. Coefficients of decision variables:
a Fast cleaning cost (Baht/piece)
b Normal cleaning cost (Baht/piece)
Figure 4. Network flow diagram of napkin planning
Figure 4. Network flow diagram ofcnapkin
Napkinplanning
price (Baht/piece)
Parameters
Parameters of integer
of integer linear
linear programming
programming modelmodel for studyModel
for this wereofspecified
integer linear
by theprogramming, as shown
help of the network below,
flow diagram as
this study were specified by the help of the network wasModel generated by thelinear
of integer network flow diagram
programming, as shownand allbelow, was genera
theflow
following
diagramsteps:
as the following steps: gathered
whichdata waswhich wasthe
specified specified
existingthenapkin
existingas napkin
500 pieces.
1. Specify
1. Specifydecision variables:
decision variables: as 500 pieces. 7 5 4

x i Number
xi Number of existing
of existing napkins
napkins used used in day
in each i = 1, 2,…,7Min Z  35.75 yi  7 ri  5 pi
eachi;day
y i Number
i; i =of1,purchased
2,…,7 napkins used in each day i; i = 1, 2,…,7 i 1 i 1 i 1

yi Number of purchased napkins used in each day Subject to

r i Number of fast
i; i = 1, 2,…,7 cleaning napkins (within one day return) used in each day toi; i = 1, 2,…, 5
Subject
x1  y1
pi Number
ri Numberof normal
of fastcleaning
cleaningnapkins
napkins(within
(withintwoone used in each day i; i = 1,154
day return) 2,…, 4
x2  y 2  107
dayobjective
2. Establish return) used in each day i; i = 1, 2,…, 5
function:
x  y r  459
pi Number of normal cleaning napkins (within two 3 3 1
Z Cost of napkin management (Baht per week) x  y  r  p  392
day return) used in each day i; i = 1, 2,…, 4 4 4 2 1

3. Constraints: x5  y 5  r3  p 2  189
2. Establish objective function: x  y 6  r4  p3  784
d i Napkin
Z Costdemand
of napkin management
or number (Baht perin week)
of customers each day i; i =x61,2,…,7
7  y 7  r5  p 3  154
3. Constraints:
k Total number of existing napkins x1  y1  r1  p1  0
di Napkin demand or number of customers in each x  y  r  p  0
4. Coefficients
day i;ofi =decision
1,2,…,7variables:
2 2 2 2

x3  y 3  r1  r3  p3  0
a Fast cleaning
k Total cost (Baht/piece)
number of existing napkins x 4  y 4  r2  p1  r4  p 4  0
4. Coefficients
b Normal cleaningof decision variables:
cost (Baht/piece) x5  y5  r3  p 2  r5  0
a Fast cleaning cost (Baht/piece)
c Napkin price (Baht/piece) x1  x 2    x 7  500
b Normal cleaning cost (Baht/piece) xi , y i , ri , pi  0 are integer ; i  1,2, ,7
c Napkin price (Baht/piece)
Model of integer linear programming, as shown below, was generated by the network flow diagram and all gathered data
which was specified the existing napkin as 500 pieces. 5.3 Processing
7 5 4 By Excel Solver of Microsoft Excel, data for assessing were prepared a
Min Z  35.75 yi  7 ri  5 pi
i 1 i 1 i 1

Subject to
Research KKU Science Journal Volume 37 (Supplement) 169

5.3 Processing
By Excel Solver of Microsoft Excel, data for assessing were prepared as shown in figure 5.

Figure 5. Input window for processing

The lowest cost of the management was 24,465.75 Baht per week as shown in table 3 and its flow diagram was
demonstrated in figure 6.
Table 4. Results of the integer linear programming for napkin planning.
Results
Variable amount (napkins) Variable amount (napkins)
x1 0 y6 0
x2 0 y7 0
x3 247 r1 0
x4 238 r2 0
x5 15 r3 67
x6 0 r4 392
x7 0 r5 154
y1 154 p1 154
y2 107 p2 107
y3 212 p3 392
y4 0 p4 0
y5 0 Total cost = 24,465.75 Baht
 y2 107 p2 107
y3 212 p3 392
y4 0 p 0
170 KKU Science Journal Volume4 37 (Supplement) Research
y5 0 Total cost = 24,465.75 Baht

Existingnapkins
Existing napkins New napkins

Figure 6. Network flow diagram of napkin-management plan for one week with 500 existing napkins.
AfterFigure 6. Network
the model flow diagram
was computed, resultsofcould
napkin-management
clearly napkins plan need
for oneto week withwere
use first, 500 existing
shown innapkins.
table 5 and
interpret to napkin-management plan for one week as 6. It was found that the cost of napkin planning with
Aftershown in table
the model was5.computed,
Moreover,results
the efficiency comparison
could clearly interpret toapplied mathematical model
napkin-management wasone
plan for cheaper
weekthan one with
as shown in table
between processing with integer linear programming calculator computing.
5. Moreover,
model and thecomputing
efficiency comparison
by calculator, between
under processing
existed with integer linear programming model and computing by
calculator, under existed napkins need to use first, were shown in table 5 and 6. It was found that the cost of napkin
Table 5. Napkin planning for one week processing through integer linear programming model
planning with applied mathematical model was cheaper than one with calculator computing.
Napkins Exist New Extra Laundry Normal Laundry
Total cost (Baht)
Cost (Baht) 0 35.75 7 5
Nov. 30 0 154 0 154 6,275.50
Dec. 1 0 107 0 107 4,360.25
Dec. 2 247 212 67 392 10,008.00
Dec. 3 238 0 392 0 2,744.00
Dec. 4 15 0 154 0 1,078.00
Dec. 5 0 0 0 0 0
Dec. 6 0 0 0 0 0
Total 500 473 613 653 24,465.75
Research KKU Science Journal Volume 37 (Supplement) 171

Table 6. Napkin planning for one week computing by calculator

Napkins Exist New Extra Laundry Normal Laundry

Total cost (Baht)
Cost (Baht) 0 35.75 7 5
Nov. 30 154 0 154 0 1,078
Dec. 1 107 0 107 0 749
Dec. 2 239 66 189 270 5,032.5
Dec. 3 0 285 392 0 12,932.75
Dec. 4 0 0 154 0 1,078
Dec. 5 0 122 0 0 4,361.5
Dec. 6 0 0 0 0 0
Total 500 473 996 270 25,231.75

Conclusions Foulds, L. R. and Neumann, K. (2003). A network f

This study could find out the optimum of low model of group technology. Mathematical
napkin management for restaurant by creating network and Computer Modeling. 38(5-6): 96-123.
flow diagram to facilitate generating linear programming Reid, D. J. (1999). Optimizing the Flow of Information
model. Excel Solver was then used for optimum within a C3I Network. Mathematical and
calculation. Computer Modeling. 30(5-6). 225-243.
The optimum point that delivers the minimum Stéphanou, A., McDougall, S. R., Anderson, A. R. A.
cost of napkin management is 24,465.75 Baht per week. and Chaplain, M. A. J. (2006). Mathematical
The current expense is 25,231.75 Baht per week that is modeling of the influence of blood rheological
766 Baht per week higher than the application. Linear properties upon adaptative tumour-induced
programming could be applied to increase effectiveness angiogenesis. Mathematical and Computer
and efficiency of the napkin management. Modeling. 44 (1-2): 96-123.
Wongprakornkul, S. and Charnsethikul, P. (2007).
References Optimization Based Heuristic Approaches
Belenky, A. S. and Belenkii, I. (2002). Optimization of for Solving an Integrated One-dimensional
planning an advertising campaign of goods Cutting Stock-Transportation Problem.
and services. Mathematical and Computer Journal of Mathematics and Statistics. 3(3):
Modeling. 35(13): 1391-1403. 142-150.