z-logo
open-access-imgOpen Access
HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Based Encoding
Author(s) -
Ahmed Lahjouji El Idrissi,
Chakir Tajani,
Mohamed Sabbane
Publication year - 2018
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v8i6.pp5351-5358
Subject(s) - crossover , operator (biology) , genetic algorithm , encoding (memory) , mathematical optimization , computer science , mutation , evolutionary algorithm , mathematics , artificial intelligence , biochemistry , chemistry , repressor , transcription factor , gene
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here