Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Hybrid Genetic Algorithms and Simulated Annealing for Multi-trip Vehicle Routing Problem with Time Windows

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 8 No. 6 (2018)

DOI
10.11591/ijece.v8i6.pp4713-4723
ISSN
2088-8708, 2088-8708
Published
2018-12-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-nc/4.0

Abstract

Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach to solve the VRPTW that looking trip scheduling for gets best result. Even though there are various algorithms for the problem, there is opportunity to improve the existing algorithms in order gaining a better result. In this research, genetic algoritm is hybridized with simulated annealing algoritm to solve the problem. Genetic algoritm is employed to explore global search area and simulated annealing is employed to exploit local search area. Four combination types of genetic algorithm and simulated annealing (GA-SA) are tested to get the best solution. The computational experiment shows that GA-SA1 and GA-SA4 can produced the most optimal fitness average values with each value was 1.0888 and 1.0887. However GA-SA4 can found the best fitness chromosome faster than GA-SA1.

Collaboration network of the authors

40 authors · 69 co-authorship links · 5 across different organisations · showing the 40 most connected

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

  • University of Brawijaya
  • State University of Malang
  • Universitas Merdeka Malang
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Adyan Nur AlfiyatinUniversity of Brawijaya3
Asyrofa RahmiUniversity of Brawijaya2
Syaiful AnamUniversity of Brawijaya2
Aprilia Nur FauziyahUniversity of Brawijaya2
Candra Fajri AnandaUniversity of Brawijaya2
Firnanda Al Islama Achyunda PutraUniversity of Brawijaya1
Fitri UtaminingrumUniversity of Brawijaya1
Ida WahyuniUniversity of Brawijaya1
Ervin YohannesUniversity of Brawijaya1
Hilman Nuril HadiUniversity of Brawijaya1
Rizal Setya PerdanaUniversity of Brawijaya1
Ghenniy RachmansyahUniversity of Brawijaya1
Ria FebriyanaUniversity of Brawijaya1
Vitara Nindya Putri HasanUniversity of Brawijaya1
Mohammad Zoqi SarwaniUniversity of Brawijaya1
Luthfi HidayatUniversity of Brawijaya1
Rifki Setya ArmandaUniversity of Brawijaya1
Garsinia Ely RianiUniversity of Brawijaya1
Fita Lathifatul Mu’asyarohAffiliation unknown1
Agus Wahyu WidodoUniversity of Brawijaya1
Diva KurnianingtyasUniversity of Brawijaya1
Muchammad Chandra Cahyo UtomoUniversity of Brawijaya1
Imam CholissodinUniversity of Brawijaya1
Winda CahyaningrumUniversity of Brawijaya1
Irma Lailatul KhoiriyahUniversity of Brawijaya1
Oktavianis KartikasariUniversity of Brawijaya1
Farhanna Mar’iUniversity of Brawijaya1
Cleoputri YusainyUniversity of Brawijaya1
Qoirul KotimahUniversity of Brawijaya1
Vivi Nur WijayaningrumUniversity of Brawijaya1
Gayatri Dwi SantikaUniversity of Brawijaya1
Agus NabaUniversity of Brawijaya1
Aji Prasetya WibawaState University of Malang1
Nadia Roosmalita SariUniversity of Brawijaya1
Elta SonalithaUniversitas Merdeka Malang1
Gusti Ahmad Fanshuri AlfarisyUniversity of Brawijaya1
Muhammad Halim NatsirUniversity of Brawijaya1

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.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Hybrid Genetic Algorithms and Simulated Annealing for Multi-trip Vehicle Routing Problem with Time Windows</dc:title><dc:creator>Ariyani, Amalia Kartika</dc:creator><dc:creator>Mahmudy, Wayan Firdaus</dc:creator><dc:creator>Anggodo, Yusuf Priyo</dc:creator><dc:description>&lt;jats:p&gt;Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach to solve the VRPTW that looking trip scheduling for gets best result. Even though there are various algorithms for the problem, there is opportunity to improve the existing algorithms in order gaining a better result. In this research, genetic algoritm is hybridized with simulated annealing algoritm to solve the problem. Genetic algoritm is employed to explore global search area and simulated annealing is employed to exploit local search area. Four combination types of genetic algorithm and simulated annealing (GA-SA) are tested to get the best solution. The computational experiment shows that GA-SA1 and GA-SA4 can produced the most optimal fitness average values with each value was 1.0888 and 1.0887. However GA-SA4 can found the best fitness chromosome faster than GA-SA1.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2018-12-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v8i6.pp4713-4723</dc:identifier><dc:identifier>10.11591/ijece.v8i6.pp4713-4723</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 8 No 6 (2018); 4713</dc:source><dc:source>2088-8708</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/12441/11370</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>