Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 2

Fast Non-dominated Sorting in Multi Objective Genetic Algorithm for Bin Packing Problem

IJCCS (Indonesian Journal of Computing and Cybernetics Systems) · Vol. 16 No. 1 (2022) · pp. 55–66

DOI
10.22146/ijccs.70677
ISSN
2460-7258, 1978-1520
Published
2022-01-31
Publisher
IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The bin packing problem is a problem where goods with different volumes and dimensions are put into a container so that the volume of goods inserted is maximized. The problem of multi-objective bin packing is a problem that is more commonly found in everyday life, because what is considered in packing is usually not only volume.In this research, a multi-objective genetic algorithm is proposed to solve the multi-objective bin packing problem. The proposed genetic algorithm uses non-dominated sorting and crowding distance methods to get the best solution for each objective and to avoid bias. The algorithm is then tested with several test classes that represent different combinations of item and container sizes.From the results of the tests carried out, it was found that the proposed algorithm can find several solutions which are the best candidate solutions for each objective. Also found how the correlation of each objective in the population.

Keywords

Collaboration network of the authors

28 authors · 46 co-authorship links · 8 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universitas Gadjah Mada
  • Politeknik Negeri Ketapang
  • National Central University
  • Muria Kudus University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Retantyo WardoyoUniversitas Gadjah Mada4
Anny Kartika SariUniversitas Gadjah Mada3
Sri T. HartatiUniversitas Gadjah Mada2
Rahmat BudiarsaUniversitas Gadjah Mada2
Fajar Ibnu TufeilAffiliation unknown1
Mujiono MujionoAffiliation unknown1
Annisa MaulianiUniversitas Gadjah Mada1
Ria AstriratmaUniversitas Gadjah Mada1
Agus HarjokoUniversitas Gadjah Mada1
Nelson RumuiPoliteknik Negeri Ketapang1
Maulida Ayu FitrianiUniversitas Gadjah Mada1
Damar RiyadiUniversitas Gadjah Mada1
Ilham UnggaraUniversitas Gadjah Mada1
Yessi YunitasariUniversitas Gadjah Mada1
Dias Aziz PramuditaUniversitas Gadjah Mada1
Abidah ElcholiqiUniversitas Gadjah Mada1
Wahyu SrimulyaniUniversitas Gadjah Mada1
Hans Satria KusumaUniversitas Gadjah Mada1
Yunita SariUniversitas Gadjah Mada1
Rayhan Naufal RamadhanUniversitas Gadjah Mada1
Faisal RamadhanUniversitas Gadjah Mada1
Muhammad Fawwaz MaydaUniversitas Gadjah Mada1
Aditya PermanaUniversitas Gadjah Mada1
Timothy K. ShihNational Central University1
Anastasya LatubessyMuria Kudus University1
Sri KusrohmaniahUniversitas Gadjah Mada1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://journal.ugm.ac.id/ijccs/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc) 
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Fast Non-dominated Sorting in Multi Objective Genetic Algorithm for Bin Packing Problem</dc:title>
	<dc:creator>Bahy, Muhammad Bintang</dc:creator>
	<dc:creator>Musdholifah, Aina</dc:creator>
	<dc:subject xml:lang="en-US">Computer Science</dc:subject>
	<dc:subject xml:lang="en-US">Genetic algorithm; bin packing problem; multi objective; multi solution; non-dominated sorting</dc:subject>
	<dc:description xml:lang="en-US">The bin packing problem is a problem where goods with different volumes and dimensions are put into a container so that the volume of goods inserted is maximized. The problem of multi-objective bin packing is a problem that is more commonly found in everyday life, because what is considered in packing is usually not only volume.In this research, a multi-objective genetic algorithm is proposed to solve the multi-objective bin packing problem. The proposed genetic algorithm uses non-dominated sorting and crowding distance methods to get the best solution for each objective and to avoid bias. The algorithm is then tested with several test classes that represent different combinations of item and container sizes.From the results of the tests carried out, it was found that the proposed algorithm can find several solutions which are the best candidate solutions for each objective. Also found how the correlation of each objective in the population.</dc:description>
	<dc:publisher xml:lang="en-US">IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2022-01-31</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.ugm.ac.id/ijccs/article/view/70677</dc:identifier>
	<dc:identifier>10.22146/ijccs.70677</dc:identifier>
	<dc:source xml:lang="en-US">IJCCS (Indonesian Journal of Computing and Cybernetics Systems); Vol 16, No 1 (2022): January; 55-66</dc:source>
	<dc:source>2460-7258</dc:source>
	<dc:source>1978-1520</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://journal.ugm.ac.id/ijccs/article/view/70677/33163</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>