A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm

Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Yanfei Zhang [verfasserIn] Yiyan Wen [verfasserIn] Haiyang Tu [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2023

Schlagwörter:	AIS data ant colony algorithm A* search algorithm route planning Bézier curve

Übergeordnetes Werk:	In: IEEE Access - IEEE, 2014, 11(2023), Seite 15109-15118
Übergeordnetes Werk:	volume:11 ; year:2023 ; pages:15109-15118

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1109/ACCESS.2023.3243810

Katalog-ID:	DOAJ080102808

Internformat


LEADER	01000naa a22002652 4500
001	DOAJ080102808
003	DE-627
005	20230310174903.0
007	cr uuu---uuuuu
008	230310s2023 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1109/ACCESS.2023.3243810 \|2 doi
035			\|a (DE-627)DOAJ080102808
035			\|a (DE-599)DOAJ03608384c37843f7b197063c217f0570
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK1-9971
100	0		\|a Yanfei Zhang \|e verfasserin \|4 aut
245	1	2	\|a A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
264		1	\|c 2023
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.
650		4	\|a AIS data
650		4	\|a ant colony algorithm
650		4	\|a A* search algorithm
650		4	\|a route planning
650		4	\|a Bézier curve
653		0	\|a Electrical engineering. Electronics. Nuclear engineering
700	0		\|a Yiyan Wen \|e verfasserin \|4 aut
700	0		\|a Haiyang Tu \|e verfasserin \|4 aut
773	0	8	\|i In \|t IEEE Access \|d IEEE, 2014 \|g 11(2023), Seite 15109-15118 \|w (DE-627)728440385 \|w (DE-600)2687964-5 \|x 21693536 \|7 nnns
773	1	8	\|g volume:11 \|g year:2023 \|g pages:15109-15118
856	4	0	\|u https://doi.org/10.1109/ACCESS.2023.3243810 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/03608384c37843f7b197063c217f0570 \|z kostenfrei
856	4	0	\|u https://ieeexplore.ieee.org/document/10041130/ \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2169-3536 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 11 \|j 2023 \|h 15109-15118

Indexfelder

author_variant	y z yz y w yw h t ht
matchkey_str	article:21693536:2023----::mtofrhpotpannfsntenclnagrtmn
hierarchy_sort_str	2023
callnumber-subject-code	TK
publishDate	2023
allfields	10.1109/ACCESS.2023.3243810 doi (DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570 DE-627 ger DE-627 rakwb eng TK1-9971 Yanfei Zhang verfasserin aut A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed. AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering Yiyan Wen verfasserin aut Haiyang Tu verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 15109-15118 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:15109-15118 https://doi.org/10.1109/ACCESS.2023.3243810 kostenfrei https://doaj.org/article/03608384c37843f7b197063c217f0570 kostenfrei https://ieeexplore.ieee.org/document/10041130/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 15109-15118
spelling	10.1109/ACCESS.2023.3243810 doi (DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570 DE-627 ger DE-627 rakwb eng TK1-9971 Yanfei Zhang verfasserin aut A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed. AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering Yiyan Wen verfasserin aut Haiyang Tu verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 15109-15118 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:15109-15118 https://doi.org/10.1109/ACCESS.2023.3243810 kostenfrei https://doaj.org/article/03608384c37843f7b197063c217f0570 kostenfrei https://ieeexplore.ieee.org/document/10041130/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 15109-15118
allfields_unstemmed	10.1109/ACCESS.2023.3243810 doi (DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570 DE-627 ger DE-627 rakwb eng TK1-9971 Yanfei Zhang verfasserin aut A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed. AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering Yiyan Wen verfasserin aut Haiyang Tu verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 15109-15118 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:15109-15118 https://doi.org/10.1109/ACCESS.2023.3243810 kostenfrei https://doaj.org/article/03608384c37843f7b197063c217f0570 kostenfrei https://ieeexplore.ieee.org/document/10041130/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 15109-15118
allfieldsGer	10.1109/ACCESS.2023.3243810 doi (DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570 DE-627 ger DE-627 rakwb eng TK1-9971 Yanfei Zhang verfasserin aut A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed. AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering Yiyan Wen verfasserin aut Haiyang Tu verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 15109-15118 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:15109-15118 https://doi.org/10.1109/ACCESS.2023.3243810 kostenfrei https://doaj.org/article/03608384c37843f7b197063c217f0570 kostenfrei https://ieeexplore.ieee.org/document/10041130/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 15109-15118
allfieldsSound	10.1109/ACCESS.2023.3243810 doi (DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570 DE-627 ger DE-627 rakwb eng TK1-9971 Yanfei Zhang verfasserin aut A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm 2023 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed. AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering Yiyan Wen verfasserin aut Haiyang Tu verfasserin aut In IEEE Access IEEE, 2014 11(2023), Seite 15109-15118 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:11 year:2023 pages:15109-15118 https://doi.org/10.1109/ACCESS.2023.3243810 kostenfrei https://doaj.org/article/03608384c37843f7b197063c217f0570 kostenfrei https://ieeexplore.ieee.org/document/10041130/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 11 2023 15109-15118
language	English
source	In IEEE Access 11(2023), Seite 15109-15118 volume:11 year:2023 pages:15109-15118
sourceStr	In IEEE Access 11(2023), Seite 15109-15118 volume:11 year:2023 pages:15109-15118
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	AIS data ant colony algorithm A* search algorithm route planning Bézier curve Electrical engineering. Electronics. Nuclear engineering
isfreeaccess_bool	true
container_title	IEEE Access
authorswithroles_txt_mv	Yanfei Zhang @@aut@@ Yiyan Wen @@aut@@ Haiyang Tu @@aut@@
publishDateDaySort_date	2023-01-01T00:00:00Z
hierarchy_top_id	728440385
id	DOAJ080102808
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ080102808</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310174903.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230310s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2023.3243810</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ080102808</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ03608384c37843f7b197063c217f0570</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yanfei Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">AIS data</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ant colony algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">A* search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">route planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bézier curve</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yiyan Wen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Haiyang Tu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">11(2023), Seite 15109-15118</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2023</subfield><subfield code="g">pages:15109-15118</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2023.3243810</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/03608384c37843f7b197063c217f0570</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/10041130/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2023</subfield><subfield code="h">15109-15118</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Yanfei Zhang
spellingShingle	Yanfei Zhang misc TK1-9971 misc AIS data misc ant colony algorithm misc A* search algorithm misc route planning misc Bézier curve misc Electrical engineering. Electronics. Nuclear engineering A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
authorStr	Yanfei Zhang
ppnlink_with_tag_str_mv	@@773@@(DE-627)728440385
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK1-9971
illustrated	Not Illustrated
issn	21693536
topic_title	TK1-9971 A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm AIS data ant colony algorithm A* search algorithm route planning Bézier curve
topic	misc TK1-9971 misc AIS data misc ant colony algorithm misc A* search algorithm misc route planning misc Bézier curve misc Electrical engineering. Electronics. Nuclear engineering
topic_unstemmed	misc TK1-9971 misc AIS data misc ant colony algorithm misc A* search algorithm misc route planning misc Bézier curve misc Electrical engineering. Electronics. Nuclear engineering
topic_browse	misc TK1-9971 misc AIS data misc ant colony algorithm misc A* search algorithm misc route planning misc Bézier curve misc Electrical engineering. Electronics. Nuclear engineering
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	IEEE Access
hierarchy_parent_id	728440385
hierarchy_top_title	IEEE Access
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)728440385 (DE-600)2687964-5
title	A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
ctrlnum	(DE-627)DOAJ080102808 (DE-599)DOAJ03608384c37843f7b197063c217f0570
title_full	A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
author_sort	Yanfei Zhang
journal	IEEE Access
journalStr	IEEE Access
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2023
contenttype_str_mv	txt
container_start_page	15109
author_browse	Yanfei Zhang Yiyan Wen Haiyang Tu
container_volume	11
class	TK1-9971
format_se	Elektronische Aufsätze
author-letter	Yanfei Zhang
doi_str_mv	10.1109/ACCESS.2023.3243810
author2-role	verfasserin
title_sort	method for ship route planning fusing the ant colony algorithm and the a* search algorithm
callnumber	TK1-9971
title_auth	A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
abstract	Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.
abstractGer	Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.
abstract_unstemmed	Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm
url	https://doi.org/10.1109/ACCESS.2023.3243810 https://doaj.org/article/03608384c37843f7b197063c217f0570 https://ieeexplore.ieee.org/document/10041130/ https://doaj.org/toc/2169-3536
remote_bool	true
author2	Yiyan Wen Haiyang Tu
author2Str	Yiyan Wen Haiyang Tu
ppnlink	728440385
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1109/ACCESS.2023.3243810
callnumber-a	TK1-9971
up_date	2024-07-04T02:03:34.118Z
_version_	1803612181359493120
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">DOAJ080102808</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310174903.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230310s2023 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2023.3243810</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ080102808</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ03608384c37843f7b197063c217f0570</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Yanfei Zhang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2023</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Route planning has always been an essential issue in navigation research and an important manifestation of ship intelligence. In order to get the shortest route that meets the actual navigation requirements, this paper proposes a shortest path planning method based on Automatic Identification System (AIS) data, which establishes a high-precision environment model and combines ant colony algorithm (ACA) and <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm. We extract the key points from the initial route obtained by the <inline-formula< <tex-math notation="LaTeX"<$\text{A}^{\ast} $ </tex-math<</inline-formula< search algorithm and then introduce the Bézier curve method to smooth the route to obtain the planned route. This strategy assures that the planned route satisfies the global optimal and actual navigation needs. A bulk carrier is selected for experimental validation, and the experimental results verify the effectiveness of the method proposed in this paper. Compared with the other algorithm, the algorithm proposed in this paper can obtain shorter paths faster and more efficiently when performed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">AIS data</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ant colony algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">A* search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">route planning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Bézier curve</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Yiyan Wen</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Haiyang Tu</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">11(2023), Seite 15109-15118</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2023</subfield><subfield code="g">pages:15109-15118</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2023.3243810</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/03608384c37843f7b197063c217f0570</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/10041130/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2023</subfield><subfield code="h">15109-15118</subfield></datafield></record></collection>
score	7.402793

Nicht das Richtige dabei?

Schreiben Sie uns!

A Method for Ship Route Planning Fusing the Ant Colony Algorithm and the A* Search Algorithm

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?