Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Based Encoding

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

DOI
10.11591/ijece.v8i6.pp5351-5358
ISSN
2088-8708, 2088-8708
Terbit
2018-12-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-nc/4.0

Abstrak

In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Position-based crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.

Jaringan kolaborasi para penulis

4 penulis · 5 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Université Moulay Ismail de Meknes
  • Abdelmalek Essaâdi University
  • 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
Zakariyae TajaniUniversité Moulay Ismail de Meknes2

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.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari 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>HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Based Encoding</dc:title><dc:creator>Idrissi, Ahmed Lahjouji El</dc:creator><dc:creator>Tajani, Chakir</dc:creator><dc:creator>Sabbane, Mohamed</dc:creator><dc:description>&lt;jats:p&gt;In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Position-based crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.&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.pp5351-5358</dc:identifier><dc:identifier>10.11591/ijece.v8i6.pp5351-5358</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 8 No 6 (2018); 5351</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/12250/11407</dc:relation><dc:rights>http://creativecommons.org/licenses/by-nc/4.0</dc:rights></oai_dc:dc>