Optimization of Ship’s Route Scheduling Using Genetic Algorithm

Route scheduling is a quite complicated process because it involves some determinant factors. Several methods have been used to help resolve the NP-hard problems. This research uses genetic algorithm to assist in optimizing ship scheduling, that where there are several ports to be visited by some sh...

Full description

Saved in:
Bibliographic Details
Published inIndonesian Journal of Electrical Engineering and Computer Science Vol. 2; no. 1; p. 180
Main Authors Wijayaningrum, Vivi Nur, Mahmudy, Wayan Firdaus
Format Journal Article
LanguageEnglish
Published 01.04.2016
Online AccessGet full text

Cover

Abstract Route scheduling is a quite complicated process because it involves some determinant factors. Several methods have been used to help resolve the NP-hard problems. This research uses genetic algorithm to assist in optimizing ship scheduling, that where there are several ports to be visited by some ships. The goal is to divide the ship to go to a specific port so that each port is only visited by one ship to minimize the total distance of all ships. The computational experiment produces optimal parameters such as the number of popsize is 30, the number of generations is 100, crossover rate value is 0.3 and mutation rate values is 0.7. The final results is an optimal ship route by minimizing the distance of each ship.
AbstractList Route scheduling is a quite complicated process because it involves some determinant factors. Several methods have been used to help resolve the NP-hard problems. This research uses genetic algorithm to assist in optimizing ship scheduling, that where there are several ports to be visited by some ships. The goal is to divide the ship to go to a specific port so that each port is only visited by one ship to minimize the total distance of all ships. The computational experiment produces optimal parameters such as the number of popsize is 30, the number of generations is 100, crossover rate value is 0.3 and mutation rate values is 0.7. The final results is an optimal ship route by minimizing the distance of each ship.
Author Wijayaningrum, Vivi Nur
Mahmudy, Wayan Firdaus
Author_xml – sequence: 1
  givenname: Vivi Nur
  surname: Wijayaningrum
  fullname: Wijayaningrum, Vivi Nur
– sequence: 2
  givenname: Wayan Firdaus
  surname: Mahmudy
  fullname: Mahmudy, Wayan Firdaus
BookMark eNo9kFFKw0AYhBepYK09g7lA4v7_ZrPZx1K0FgoFa5-XdPtvs9ImIZsW9MlreD1PYmzFl5mBgWH4btmgqiti7B54AiA1PPg3IhuSEyYekqaBnMeQZ1dsiJJjnKqMD_6zxBs2DsFvuOCg-04M2WTZdP7gP4rO11VUu2hV-ub78ytEL_Wxo2hlS9oe977aRevwqzOqqPM2mux3deu78nDHrl2xDzT-8xFbPz2-Tp_jxXI2n04WsQWFXbxNN2BTpP6LThEUbZ1E5TIpnZCCtMAMe6GNFlBYp5ByTcIJoZEr6VIxYuqya9s6hJacaVp_KNp3A9ycYZgLDHNC48GcYZgehvgBt45YVQ
CitedBy_id crossref_primary_10_1017_S0373463318000814
crossref_primary_10_1088_1742_6596_1569_2_022074
crossref_primary_10_1016_j_measurement_2019_05_022
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.11591/ijeecs.v2.i1.pp180-186
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2502-4760
ExternalDocumentID 10_11591_ijeecs_v2_i1_pp180_186
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
ID FETCH-LOGICAL-c172t-d4b1c42e25094217edf527f655f353e93262932eb931acf72e89e3f3392075f43
ISSN 2502-4752
IngestDate Fri Aug 23 00:46:55 EDT 2024
IsPeerReviewed false
IsScholarly false
Issue 1
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c172t-d4b1c42e25094217edf527f655f353e93262932eb931acf72e89e3f3392075f43
ParticipantIDs crossref_primary_10_11591_ijeecs_v2_i1_pp180_186
PublicationCentury 2000
PublicationDate 2016-04-01
PublicationDateYYYYMMDD 2016-04-01
PublicationDate_xml – month: 04
  year: 2016
  text: 2016-04-01
  day: 01
PublicationDecade 2010
PublicationTitle Indonesian Journal of Electrical Engineering and Computer Science
PublicationYear 2016
SSID ssib030194763
ssib044739472
ssib052605909
Score 1.769092
Snippet Route scheduling is a quite complicated process because it involves some determinant factors. Several methods have been used to help resolve the NP-hard...
SourceID crossref
SourceType Aggregation Database
StartPage 180
Title Optimization of Ship’s Route Scheduling Using Genetic Algorithm
Volume 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9swGLY6uHCZhsa0jQ_5wA2l1I6dxMdqKgIktgtftyhxbBq0QtWGSuOAxs_g7_FLeG0nqRmVgF2iyErcRO_Tx8_rvB8IbYteQTPCk6DHc3BQMpkE4EZEARNJISnRCbN1Zo9-Rvsn7PCcn3c69352SZV35e3CvJL_sSqMgV1Nluw7LNtOCgNwDvaFI1gYjm-y8S_4v4_qREqbfTIsx030gpjumGgfW2cTlhObde7iA0ylaVOmtf_74npSVsORL1APTHcPZTMrPa06sM1yrD29Aob2w0PTFqJhiflGzmX2JzO7LhPXSvm0nJVmc2K-Bz4c3TiKPzNX7uyVkyJ7vg9BIi98xdIVaCkasNjVo-0qf8x1DGj4lr6AleNO4lo6veR0Lgypl5dKyWl3RrslrC5juDogi6po_7O6tTGH1tuBqVI3UTqjaUlSO1EKE31AyxS4ykQFHt0NGkoC-hPw_C2FMRaHwiu4z407KGwgUfv-dRSh-a3dxQ_taSBPzBx_Qh9ry-K-g9Qq6qirz6jvwwlfa2zg9Pj3YYotkPAcSNgCCddAwi2Q1tDJ3uD4x35Qd9gIJAjXKihYTiSjipoyiuCcqkJzGuuIcx3yUBltD3KQqlyEJJM6pioRKtQhiGqQmpqFX9DSFaDyK8LaaCEOznvBBMujTORxImRPqhCc0oTwb6jXvHM6doVU0ldM8v39t6yjlTk2N9BSNblRm6Aaq3zL2vUJ3cBr4g
link.rule.ids 315,783,787,27938,27939
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimization+of+Ship%E2%80%99s+Route+Scheduling+Using+Genetic+Algorithm&rft.jtitle=Indonesian+Journal+of+Electrical+Engineering+and+Computer+Science&rft.au=Wijayaningrum%2C+Vivi+Nur&rft.au=Mahmudy%2C+Wayan+Firdaus&rft.date=2016-04-01&rft.issn=2502-4752&rft.eissn=2502-4760&rft.volume=2&rft.issue=1&rft.spage=180&rft_id=info:doi/10.11591%2Fijeecs.v2.i1.pp180-186&rft.externalDBID=n%2Fa&rft.externalDocID=10_11591_ijeecs_v2_i1_pp180_186
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2502-4752&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2502-4752&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2502-4752&client=summon