Home
Author Guide
Editor Guide
Reviewer Guide
Published Issues
Special Issue
Introduction
Special Issues List
Sections and Topics
Sections
Topics
journal menu
Aims and Scope
Editorial Board
Indexing Service
Article Processing Charge
Open Access
Copyright and Licensing
Preservation and Repository Policy
Publication Ethics
Editorial Process
Contact Us
General Information
ISSN:
1798-2340 (Online)
Frequency:
Monthly
DOI:
10.12720/jait
Indexing:
ESCI (Web of Science)
,
Scopus
,
CNKI
,
etc
.
Acceptance Rate:
19%
APC:
500 USD
Average Days to Accept:
135 days
Journal Metrics:
Impact Factor 2022: 1.0
3.1
2022
CiteScore
49th percentile
Powered by
Editor-in-Chief
Prof. Kin C. Yow
University of Regina, Saskatchewan, Canada
I'm delighted to serve as the Editor-in-Chief of
Journal of Advances in Information Technology
.
JAIT
is intended to reflect new directions of research and report latest advances in information technology. I will do my best to increase the prestige of the journal.
What's New
2024-03-28
Vol. 15, No. 3 has been published online!
2024-02-26
The papers published in Vol. 15, Nos. 1&2 have been registered with Crossref.
2024-02-26
Vol. 15, No. 2 has been published online!
Home
>
Published Issues
>
2022
>
Volume 13, No. 4, August 2022
>
JAIT 2022 Vol.13(4): 306-311
doi: 10.12720/jait.13.4.306-311
A Hybrid Evolutionary Algorithm for the Sequencing m-Vector Bin Packing Problem
Méziane Aïder
1
, Amina N. Benahmed
1
, Isma Dahmani
1
, and Mhand Hifi
2
1. University of Sciences and Technology Houari Boumediene, Algeria
2. University of Picardy Jules Verne, France
Abstract
—In this paper, the product sequencing decisions in multiple-piece-flow assembly lines problem is approximately solved with a hybrid evolutionary algorithm. The product sequencing decisions in multiple-piece-flow assembly lines, known as the sequencing m-vector bin packing problem, occurs in manufacturing organization and because of its NP-hardness it is however computationally challenging. The designed method combines a population approach and both first fit bin packing procedure coupled with a repairing operator: the population approach tries to maintain the diversity of a series of populations reached throughout an iterative procedure while the added operators try to highlight the quality of the solutions throughout the search process. The performance of the proposed method is evaluated on a set of benchmark instances taken from the literature. The results provided by the method are compared to those reached by recent published methods and to those reached by the state-of-the-art Cplex solver. The preliminary experimental part showed that the designed method outperforms the other ones by discovering new bounds for most of considered instances.
Index Terms
—evolutionary, intensification, optimization, packing, sequencing
Cite: Méziane Aïder, Amina N. Benahmed, Isma Dahmani, and Mhand Hifi, "A Hybrid Evolutionary Algorithm for the Sequencing
m
-Vector Bin Packing Problem," Journal of Advances in Information Technology, Vol. 13, No. 4, pp. 306-311, August 2022.
Copyright © 2022 by the authors. This is an open access article distributed under the Creative Commons Attribution License (
CC BY-NC-ND 4.0
), which permits use, distribution and reproduction in any medium, provided that the article is properly cited, the use is non-commercial and no modifications or adaptations are made.
1-C043-Algeria+France
PREVIOUS PAPER
First page
NEXT PAPER
Development a Model of a Network Attack Detection in Information and Communication Systems