Multiple strings planing problem in maritime service network: hyper-heuristic approach

Kassem Danach, Wissam Khalil, Shahin Gelareh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The service network design problems arising in liner shipping industry are very intractable problems. Several exact method are proposed for such problems where almost all of them are limited by the instance size that can be resolved. In this article, we consider the problem of designing multiple strings among a set of ports, in order to maximize the industry profit. In this work, we develop hyper-heuristics by proposing different low level heuristics categorized as constructive, improvement, perturbation etc. The low level heuristics are guided by a meta-heuristic algorithm that is supported by data mining techniques to attain balancing between intensification and diversification strategies in choosing the best heuristics series to be applied.

Original languageEnglish
Title of host publication2015 3rd International Conference on Technological Advances in Electrical, Electronics and Computer Engineering, TAEECE 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages85-88
Number of pages4
ISBN (Electronic)978-1479956807
DOIs
Publication statusPublished - 1 Jun 2015
Externally publishedYes
Event2015 3rd International Conference on Technological Advances in Electrical, Electronics and Computer Engineering - Beirut, Lebanon
Duration: 29 Apr 20151 May 2015

Conference

Conference2015 3rd International Conference on Technological Advances in Electrical, Electronics and Computer Engineering
Abbreviated titleTAEECE 2015
Country/TerritoryLebanon
CityBeirut
Period29/04/151/05/15

Keywords

  • transportation
  • ports (computers)
  • planning
  • heuritic algorithms
  • delays
  • containers
  • economics

Fingerprint

Dive into the research topics of 'Multiple strings planing problem in maritime service network: hyper-heuristic approach'. Together they form a unique fingerprint.

Cite this