Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).


Please click here to visit our current website, and also to submit your paper
:
 
www.ijsom.com 


 Thanks for your patience during relocation.

Feel free to contact us via info@ijsom.com and ijsom.info@gmail.com

   [Home ] [Archive]    
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Contact us::
Site Facilities::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Indexing Databases

AWT IMAGE
AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

AWT IMAGE

..
:: Volume 1, Issue 3 (11-2014) ::
2014, 1(3): 328-346 Back to browse issues page
A New Approach for Sequencing Loading and Unloading Operations in the Seaside Area of a Container Terminal
Azza Lajjam * 1, Mohamed El merouani2 , Yassine Tabaa2 , Abdellatif Medouri2
1- Ablmalek Essadi University, Tétouan, Morocco , azza.lajjam@gmail.com
2- College of Sciences, Abdelmallek Essaadi University, Tetuan, Morocco
Abstract:   (11874 Views)
Due to the considerable growth in the worldwide container transportation, optimization of container terminal operations is becoming highly needed to rationalize the use of logistics resources. For this reason, we focus our study on the Quay Crane Scheduling Problem (QCSP), which is a core task of managing maritime container terminals. From this planning problem arise two decisions to be made: The first one concerns tasks assignment to quay crane and the second one consists of finding the handling sequence of tasks such that the turnaround time of cargo vessels is minimized. In this paper, we provide a mixed-integer programming (MIP) model that takes into account non-crossing constraints, safety margin constraints and precedence constraints. The QCSP has been shown NP-complete, thus, we used the Ant Colony Optimization (ACO), a probabilistic technique inspired from ants’ behaviour, to find a feasible solution of such problem. The results obtained from the computational experiments indicate that the proposed method is able to produce good results while reducing the computational time.
Keywords: Quay Crane, Scheduling loading and unloading operations, Ant colony optimisation, Mathematical Formulation, Container terminal
     
Type of Study: مقاله پژوهشی |
ePublished: 2017/09/28
Send email to the article author

Add your comments about this article
Your username or Email:

CAPTCHA


XML     Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Lajjam A, El merouani M, Tabaa Y, Medouri A. A New Approach for Sequencing Loading and Unloading Operations in the Seaside Area of a Container Terminal. Journal title 2014; 1 (3) :328-346
URL: http://system.khu.ac.ir/ijsom/article-1-2159-en.html


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Volume 1, Issue 3 (11-2014) Back to browse issues page
International Journal of Supply and Operations Management International Journal of Supply and Operations Management
Persian site map - English site map - Created in 0.09 seconds with 41 queries by YEKTAWEB 4666