About: Dynamic group transit scheme for corridor transit     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
rdfs:seeAlso
Description
  • Contemporary maritime piracy around the Horn of Africa presents a serious threat to the global shipping industry. A number of countermeasures were deployed to minimize the probability of a successful hijack, one of them being the establishment of the International Recommended Transit Corridor (IRTC). Currently, all ships transiting the Gulf of Aden are strongly recommended to follow the IRTC and take part in group transit schemes-prescribed schedules stating time of arrival to the beginning of the corridor and speed at which to sail through the corridor. These schedules are fixed in advance and do not take into account speeds and constraints of arriving ships. We propose dynamic grouping schemes, customized schedules for a group of arriving ships, which take into account speeds as well as positions of arriving ships. The problem of finding optimum grouping scheme for a group of arriving ships is formulated as a bi-objective mixed integer program, weighting the delay caused by the grouping scheme and the risk taken when sailing alone. We look for a set of Pareto optimal solutions and compare the dynamic grouping scheme with currently deployed fixed scheme. Results show an improvement over current grouping scheme with respect to the number of ships grouped as well as time saved.
  • Contemporary maritime piracy around the Horn of Africa presents a serious threat to the global shipping industry. A number of countermeasures were deployed to minimize the probability of a successful hijack, one of them being the establishment of the International Recommended Transit Corridor (IRTC). Currently, all ships transiting the Gulf of Aden are strongly recommended to follow the IRTC and take part in group transit schemes-prescribed schedules stating time of arrival to the beginning of the corridor and speed at which to sail through the corridor. These schedules are fixed in advance and do not take into account speeds and constraints of arriving ships. We propose dynamic grouping schemes, customized schedules for a group of arriving ships, which take into account speeds as well as positions of arriving ships. The problem of finding optimum grouping scheme for a group of arriving ships is formulated as a bi-objective mixed integer program, weighting the delay caused by the grouping scheme and the risk taken when sailing alone. We look for a set of Pareto optimal solutions and compare the dynamic grouping scheme with currently deployed fixed scheme. Results show an improvement over current grouping scheme with respect to the number of ships grouped as well as time saved. (en)
Title
  • Dynamic group transit scheme for corridor transit
  • Dynamic group transit scheme for corridor transit (en)
skos:prefLabel
  • Dynamic group transit scheme for corridor transit
  • Dynamic group transit scheme for corridor transit (en)
skos:notation
  • RIV/68407700:21230/13:00212967!RIV14-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(LH11051)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 70871
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/13:00212967
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Pareto optimisation; integer programming; marine safety; national security (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [E322EB026540]
http://linked.open...v/mistoKonaniAkce
  • Hammamet
http://linked.open...i/riv/mistoVydani
  • Piscataway
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 5th International Conference on Modeling, Simulation and Applied Optimization
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Pěchouček, Michal
  • Vaněk, Ondřej
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000326538300057
http://linked.open.../riv/zahajeniAkce
number of pages
http://bibframe.org/vocab/doi
  • 10.1109/ICMSAO.2013.6552597
http://purl.org/ne...btex#hasPublisher
  • IEEE
https://schema.org/isbn
  • 978-1-4673-5814-9
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software