Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

An improved artificial bee colony with perturbation operators in scout bees’ phase for solving vehicle routing problem with time windows

IAES International Journal of Artificial Intelligence · Vol. 12 No. 2 (2023) · hlm. 656–666

DOI
10.11591/ijai.v12.i2.pp656-666
ISSN
2252-8938, 2089-4872
Terbit
2023-06-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

An example of a combinatorial problem is the vehicle routing problem with time windows (VRPTW), which focuses on choosing routes for a limited number of vehicles to serve a group of customers in a restricted period. Meta-heuristics algorithms are successful techniques for VRPTW, and in this study, existing modified artificial bee colony (MABC) algorithm is revised to provide an improved solution. One of the drawbacks of the MABC algorithm is its inability to execute wide exploration. A new solution that is produced randomly and being swapped with best solution when the previous solution can no longer be improved is prone to be trapped in local optima. Hence, this study proposes a perturbed MABC known as pertubated (P-MABC) that addresses the problem of local optima. P-MABC deploys five types of perturbation operators where it improvises abandoned solutions by changing customers in the solution. Experimental results show that the proposed P-MABC algorithm requires fewer number of vehicles and least amount of travelled distance compared with MABC. The P-MABC algorithm can be used to improve the search process of other population algorithms and can be applied in solving VRPTW in domain applications such as food distribution.

Kata kunci

Jaringan kolaborasi para penulis

11 penulis · 19 tautan kepenulisan bersama · 4 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Shatt Al-Arab University College
  • Universiti Utara Malaysia
  • Al-Naji University
  • Universiti Malaysia Kelantan
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Hussein Fouad AlmaziniShatt Al-Arab University College2
Hassan Al-MaziniAfiliasi tidak diketahui1
Loai AlamroAl-Naji University1
Nooraini Binti YusoffUniversiti Malaysia Kelantan1
Hassan Fouad Abbas Al-MaziniAfiliasi tidak diketahui1
Hayder Naser Khraibet Al-BehadiliShatt Al-Arab University College1
Jawad AlkenaniShatt Al-Arab University College1
Nurul Atikah Mohd SharifUniversiti Utara Malaysia1
Nor Hazlyna HarunUniversiti Utara Malaysia1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (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">An improved artificial bee colony with perturbation operators in scout bees’ phase for solving vehicle routing problem with time windows</dc:title>
	<dc:creator>Mortada, Salah</dc:creator>
	<dc:creator>Yusof, Yuhanis</dc:creator>
	<dc:subject xml:lang="en-US">Artificial Bee Colony algorithm; vehicle routing problem with time windows</dc:subject>
	<dc:subject xml:lang="en-US">Artificial bee colony; Metaheuristic; Optimization; Swarm intelligence</dc:subject>
	<dc:description xml:lang="en-US">An example of a combinatorial problem is the vehicle routing problem with time windows (VRPTW), which focuses on choosing routes for a limited number of vehicles to serve a group of customers in a restricted period. Meta-heuristics algorithms are successful techniques for VRPTW, and in this study, existing modified artificial bee colony (MABC) algorithm is revised to provide an improved solution. One of the drawbacks of the MABC algorithm is its inability to execute wide exploration. A new solution that is produced randomly and being swapped with best solution when the previous solution can no longer be improved is prone to be trapped in local optima. Hence, this study proposes a perturbed MABC known as pertubated (P-MABC) that addresses the problem of local optima. P-MABC deploys five types of perturbation operators where it improvises abandoned solutions by changing customers in the solution. Experimental results show that the proposed P-MABC algorithm requires fewer number of vehicles and least amount of travelled distance compared with MABC. The P-MABC algorithm can be used to improve the search process of other population algorithms and can be applied in solving VRPTW in domain applications such as food distribution.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2023-06-01</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://ijai.iaescore.com/index.php/IJAI/article/view/21963</dc:identifier>
	<dc:identifier>10.11591/ijai.v12.i2.pp656-666</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 12, No 2: June 2023; 656-666</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v12.i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/21963/13632</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2022 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>