DOI:10.20894/IJCOA.
Periodicity: Bi Annual.
Impact Factor:
SJIF:5.079 & GIF:0.416
Submission:Any Time
Publisher: IIR Groups
Language: English
Review Process:
Double Blinded

News and Updates

Author can submit their paper through online submission. Click here

Paper Submission -> Blind Peer Review Process -> Acceptance -> Publication.

On an average time is 3 to 5 days from submission to first decision of manuscripts.

Double blind review and Plagiarism report ensure the originality

IJCOA provides online manuscript tracking system.

Every issue of Journal of IJCOA is available online from volume 1 issue 1 to the latest published issue with month and year.

Paper Submission:
Any Time
Review process:
One to Two week
Journal Publication:
June / December

IJCOA special issue invites the papers from the NATIONAL CONFERENCE, INTERNATIONAL CONFERENCE, SEMINAR conducted by colleges, university, etc. The Group of paper will accept with some concession and will publish in IJCOA website. For complete procedure, contact us at admin@iirgroups.org

Paper Template
Copyright Form
Subscription Form
web counter
web counter
Published in:   Vol. 3 Issue 1 Date of Publication:   June 2014

Heuristic Algorithm for Constrained 3D Container Loading Problem: A Genetic Approach

S. Jegadeshwari,D. Jaisree

Page(s):   93-96 ISSN:   2278-2397
DOI:   10.20894/IJCOA.101.003.001.025 Publisher:   Integrated Intelligent Research (IIR)

This paper presents an heuristic Genetic Algorithm for solving 3-Dimensional Single container packing optimization problem. The 3D container loading problem consists of n number of boxes being to be packed in to a container of standard dimension in such a way to maximize the volume utilization and inturn profit. Furthermore, various practical constraints like box orientation, stack priority, container stability, etc also applied. Boxes to be packed are of various sizes and of heterogeneous shapes. In this research work, several heuristic improvements were proposed over Genetic Algorithm (GA) to solve the container loading problem that significantly improves the search efficiency and to load most of heterogeneous boxes into a container along with the optimal position of loaded boxes, box orientation and boxes to be loaded by satisfying practical constraints. In this module, both the guillotine and non-guillotine moves were allowed. In general, these heuristic GA solutions being substantially better and satisfactory than those obtained by applying heuristics to the bin packing directly.