2017 18th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)

INTEGER PROGRAMMING MODEL TO

OPTIMIZE WASTE MANAGEMENT SYSTEM
(Case Study : Surakarta City Indonesia)
Yusuf Sutanto
Faculty of Informatics Management
STIE Adi Unggul Bhirawa (AUB)
Surakarta, Indonesia
Email: pixel cmp@yahoo.com
Siti Hayati Efi Friantin Sri Wulandari
Faculty of Banking Finance Faculty of Management
STIE Adi Unggul Bhirawa (AUB) STIE Adi Unggul Bhirawa (AUB)
Surakarta, Indonesia Surakarta, Indonesia
Email : efriantin@yahoo.com Email : oel and@yahoo.com

Abstract—This research develops binary integer programming
model for optimization of garbage transportation by arranging
the type of vehicle used to transport garbage at each garbage
disposal based on the distance travel by each vehicle, the
maximum carrying capacity of the vehicle, and the maximum
capacity of the landfill. This model is applied to the market
garbage transportation in Surakarta City. The result shows that
the fleet used only 6 trucks from 10 trucks, and from 6 trucks
only 3 trucks that do the ritual, so it is expected to minimize the
operational cost of the garbage transportation market.
Index Terms—binary integer programming, waste manage-
ment model.
I. I NTRODUCTION
One of the problems that is often faced in big cities is the
garbage problem. The volume of waste in big cities continues
to increase, in line with the rapidly growing population and
rapid economic growth, changes in consumption patterns, and
the lifestyles of people in big cities. The waste problem can be
handled properly if there is waste management. Garbage prob-
lem in Surakarta city is managed by three parties namely En-
vironment Agency, market office, and district office. Garbage
collected at the temporary dump, garbage from the street, and
garbage from activities is managed by Environment Agencies.
The Market Office manages the waste in the market, and
household waste is managed by district office. Garbage from
offices, hospital waste, and garbage from the business world
is discharged directly to landfills in accordance with local
regulation no 3 of 2010. Some researchers have provided mod-
els for waste management, An integer programming model to
determine the route of waste transport that can minimize the
total cost of transportation [1], A linear integer programming
model to minimize the total cost of waste transportation in
Surakarta City [2], An integer programming model for the
selection of the best urban waste disposal site in East Jakarta
[3]. This research will present a model for optimizing waste
transport by regulating the type of vehicle used to transport
garbage at each landfill based on the distance travel by each
vehicle, the maximum carrying capacity of the vehicle, and
the maximum capacity of the landfill. The problem of garbage
transportation investigated in this research is the market waste
that exist in Surakarta City
II. M ETODOLOGY
Preliminary research by conducting interviews to stakehold-
ers in Surakarta Market Office to find out the condition and
problems of garbage in Surakarta market. Direct observation
in some existing markets in Surakarta City and conducting
interviews with parties related to the market garbage transport.
The data used are as follows:
A. Data of existing market location in Surakarta City. (Market
Agency, 2017)
B. Market volume of market waste. (Market Agency, 2017)
C. Data on the number of vehicles / trucks carrying market
waste and the maximum transport capacity of each vehicle.
(Market Agency, 2017)
D. Market data per market (Google map, 2017)
E. The data is processed and analyzed by using binary in-
terger programming method.
Making this simulation model using MASIM (Material
Simulation) method, according to Blikstein and Wilensky
MASIM is a simulation that was built using simulation tool
for modeling the atom structure that make up an object or
material. MASIM allows one to model and observe the process
through simulation, the results of the simulation can improve
understanding of the concepts that want to be learned [4]. The
simulation tool used for this study uses anylogic program [5]
III. D EFINING RULES U SED IN T HE M ODEL
Vehicles / trucks that are in the depot will transport waste in
the market to landfill. If the load of garbage has fulfilled the
maximum capacity of vehicle carrying capacity, the vehicle
will go to the landfill to discharge the garbage, if the vehicle’s
loading capacity is not yet maximum then the vehicle will go
to another market to transport the garbage until it reaches its
maximum capacity then to the landfill. Market selection based
on market distance and waste volume.

0-7695-6330-9/17/31.00 ©2017 IEEE 495

DOI 10.1109/PDCAT.2017.00084
 In Fig. 1 shows 44 locations where the garbage collection, 4) Xij is a decision variable:
along with the truck that goes around to pick up the garbage.
Xij ∈ {0, 1} (6)
At the top left end there is a variable to calculate the distance
of each truck passing through the sieve, while the remaining  
variable is calculating the waste capacity of each truck carrying 1, if area i visit by truck j
X= (7)
the waste. 0, another
B. Model of vehicle / truck route
After obtaining the vehicles in charge in each region, then
determined the route of vehicles in each region. Objective
function:
n 
 m
M in Sk Yjk (8)
j=1 k=1

with constrain
1) vehicle / truck is only assigned to 1 market and there is
at least 1 relationship with other markets:
n

Yjk = 1, ∀k (9)
j=1
p

Yij ≥ 1, ∀j (10)
Fig. 1. Output Simulation Model Waste Management
k=1

2) The volume of garbage transported per market can not

The model of garbage transportation market in this research
exceed the capacity of the vehicle and every day only 2
there are two, that is model for the selection of vehicle /
rotations are done:
garbage truck and model for vehicle route which formulated
p
mathematically as follows:
Yjk bk ≤ 2aj , ∀j (11)
A. Model of vehicle / truck picking k=1

3) Terms of the amount of garbage transported is positive:

The existing market in Surakarta City is divided into four
areas (Market Agency, 2017), so that the trash transport vehicle
bk ≥ 0 (12)
is arranged for the four areas first. Objective function:
m 
n
4) Yjk is a decision variable :

M in xij (1) Yjk ∈ {0, 1} (13)
i=1 j=1

with constrain,  
1, if market k is visited by truck j
1) vehicle / truck only serves 1 area, and each area can Y = (14)
0, another
be visited by more than one truck:
n
Where

xij ≤, ∀i (2) i = area location number
j=1 j = vehicle / truck number
k = market location number
m
 m = total area
xij ≥, ∀j (3)
n = number of vehicles / trucks
i=1
p = number of markets
2) The volume of waste transported per region should not Sk = distance of market in k
exceed the capacity of the vehicle: Qi = the volume of jurisdiction i
m
 aj = truckload capacity in j
xij Qi ≤ Aj , ∀i (4) bk = junk volume in k
j=1
IV. R ESEARCH S IMULATION AND R ESEARCH F INDINGS
3) Terms of the amount of garbage transported is positive: The data formulated in the above model is then processed
using Any Logic software from XJ Technologies [6] and
Qi ≥ 0 (5) obtained the following results:

496
A. Selection of trucks
The existing market in Surakarta City amounts to 44 markets
which are divided into 4 regions. The Market Office has 10
fleets to transport garbage in 44 markets, consisting of 4
container trucks (4 tonnes / truck carrying capacity), 4 dump
trucks (10 ton / truck load capacity), and 2 tailgate (8 ton /
truck) . The results of data processing obtained the result that
to transport garbage in 44 markets only need 7 trucks only.
garbage as much as 9,729kg, truck 5 transporting garbage
as much as 933kg, 6 carrying 285kg of garbage. While the
distance in the truck 1 is 5.75km, truck 2 journey distance
46.75km, truck 3 34.5km distance, truck 4 0.5km distance,
truck 5 39km distance, truck 6 distance 33.5km distance.

TABLE I
P ROPOSED A RRANGEMENT OF T RUCKS U TILIZING M ARKET RUBBISH

Wilayah Total Jenis Truk Pengangkut Truk yang Digu-

Sampah Sampah nakan
(kg)/hari
I 15.800 1 Kontainer, 2 Bak truk 2 Bak Truk
II 22.500 2 Dump Truck 2 Dump Truck
III 10.300 1 Dump Truck 1 Dump Truck
IV 10.000 1 Dump Truck 1 Dump Truck

In the area I truck type of container is not used because

with 2 truck can already carry all garbage in region I, so total
truck which used is 6 trucks, that is 2 type of truck and 4
dump truck type. Fig. 2. Final Output Simulation Model Waste Management
B. Determination of truck route
After obtaining the vehicles in charge in each region, then V. C ONCLUSION
determined the route of vehicles in each region, the results as The model developed for the market waste disposal problem
follows: in Surakarta by using binary integer programming can min-
imize the operating costs of transporting market waste. This
TABLE II
P ROPOSED T RUCK ROUTING ROUTE FOR M ARKET T RASH
can be seen from the use of trucks and ritual trucks. Aramada
is 10 and can be used only 6 trucks only, while for ritual,
Wilayah Jenis Truk Pasar Ritasi not all trucks do the ritual. Trucks carrying garbage in Pasar
I Bak Truk Tanggul, Rejosari, Ledoksari, 2x
Jebres, Mojosongo/Debegan,
Gede, Pasar Legi, and in region IV do not need to do the
Mebel, Panggung-rejo, ritual, because for once transport in one day can carry the
Tunggulsari, Buah Jurug, entire garbage in the place.
Ngemplak, Sangkrah, Sibela,
Pucang Sawit ACKNOWLEDGMENT
Bak Truk Gede 1x
II Dump Truk Nusukan, Depok, Nongko, Ayu 2x The author wish to thank A. Borshchev for providing The
Balapan, Elpabes, Bangunharjo, Big Book of Simulation Modeling Anylogic.
Sidomulyo, Joglo, Bambu, Ngum-
bul, Ngudi Rejeki Gilingan R EFERENCES
Dump Truk Legi 1x
III Dump Truk Singosaren, Jongke, Ngarsopuro, 2x [1] S. Das, B. K. Bhattacharyya, Optimation of Municipal Solid Waste
Triwindu, Kembang, Kadipolo, Ka- Collection and Transportation Routes, Waste Management, 2015, 43: 9-
bangan, Penumping, Purwosari, 18.
Sidodadi [2] I. W. Suletra, E. Liquiddanu, & S. B. Pamungkas, Optimasi Pengalokasian
IV Dump Truk Klewer, Hardjodaksino, Notoharjo, 1x Sampah Wilayah ke Tempat Pembuangan Sementara dengan Model Inte-
Kliwon, Ayam, Cinderamata, Gad- ger Linear Programming (Studi Kasus Kota Surakarta), Performa,2009,
ing, Besi 8(1), pp. 14-22.
[3] Y. V. Usman, A. H. Ismail, N. Y. Hidayah, & L. Chairani, Pengembangan
Model Pemilihan Lokasi Pembuangan Akhir Sampah Perkotaan (Studi
Trash at Pasar Gede, Legi Market and the markets in region Kasus: Kota Jakarta Timur), Ilmiah Teknik Industri Journal, 2013 12(1),
IV, garbage trucks can carry trash just once a day. This is pp. 45-52.
[4] P. Blikstein, U. Wilensky, An Atom is Known by the Company it Keeps : A
because the truck that is assigned to the place is able to constructionist Learning Environtment for Material Science Using Agent-
transport the garbage as a whole, so there is no need to do the Based Modelling. International Journal of Computer Math Learning,
ritual. Garbage collection can be done in the afternoon after Springer Science+Business Media, Vol 11, 2009, pp.81-119.
[5] Y. Sutanto, R. Sarno, Inventory Management Optimization Model with
the market activity ends, because the garbage has collected all. Database Synchronization through Internet Network (A simulation Study),
Fig 2 is the final result of the experiment using the sim- International Conference on Electrical Engineering and Informatics
ulation program, Truck 1 transporting garbage as much as (ICEEI), 21(5), 2015, pp.115-120.
[6] XJ Technologies, Anylogic software. Saint Petersburg, Russia, 2004
8.000kg, truck 2 carrying garbage as much as 194.599kg, truck
3 transporting garbage as much as 619,778kg, truck 4 hauling

497