An Improved A * Algorithm Based on Hesitant Fuzzy Set Theory for Multi-Criteria Arctic Route Planning

This paper presents a new route planning system for the purpose of evaluating the strategic prospects for future Arctic routes. The route planning problem can be regarded as a multi criteria decision making problem with large uncertainties originating from multi-climate models and experts’ knowledge and can be solved by a modified A* algorithm where the hesitant fuzzy set theory is incorporated. Compared to the traditional A* algorithm, the navigability of the Arctic route is firstly analyzed as a measure to determine the obstacle nodes and three key factors to the vessel navigation including sailing time, economic cost and risk are overall considered in the HFS-A* algorithm. A numerical experiment is presented to test the performance of the proposed algorithm.


Introduction
The dramatic variation of sea ice in the Arctic region, due to global warming, has attracted many researchers in science and engineering, where shipping in the Arctic water is one of the hottest issues.Compared to the traditional shipping routes, the Arctic routes have shorter distances linking Asia and North America, as well as linking Asia and Europe, and are a more open navigation environment, more access to the abundant oil and gas resources and lower piracy risk [1].Therefore, navigation through Arctic routes is considered to be a money-making opportunity for shipping and oil gas companies.
Compared to the traditional ship path planning problem [2][3][4][5][6], sea ice condition becomes a key factor to the route planning in the Arctic region due to its impact on travel time and fuel consumption, as well as the risk of being stuck in the ice [7].
Reference [7] introduced a system for route optimization in ice-covered water, which consisted of an ice model, a ship transit model, and an end-user system.The system was operated on commercial vessels in the Baltic Sea, and its performance was tested.Reference [8] developed an ice navigation system combined with a sea ice model, transit model and a model for route planning which simulated the whole Arctic area.The system employed a modified transit model devised by [9], which integrated various parameters such as ice-breaking fee, port charge, capital cost, etc. Reference [10] developed another ice navigation system where the uncertainty of sea ice prediction and the extremely severe conditions were taken into consideration.The route optimization problem in ice-covered water was regarded as a dynamic stochastic path planning problem, and a heuristic route optimization model was proposed to solve it.Reference [11] devised an automatic ice navigation support system to find the safest-and-shortest routes in the Arctic area for different types of vessels with a geographic information system.However, unlike the real-time path planning system, the model in this paper is mainly devised to evaluate the strategic prospects for future Arctic routes.Therefore, most data are incorporated for future prediction, where large uncertainties arise from the bias of current multi-climate models and the inconsistency of experts' cognition.Additionally, for commercial navigating in the Arctic routes, sailing safety, as well as economic benefits, should be guaranteed according to the harsh weather conditions in the Arctic area.Therefore, sailing time, economic cost, and navigation safety are all key factors to influence the route planning, which makes the problem a multi-criteria decision making (MCDM) problem.
Owing to the MCDM problem with large uncertainties in the route optimization model, information on each grid has variation so that a new path planning method is required for the model to handle this uncertain decision problem.Many studies have examined that the hesitant fuzzy sets theory is a powerful tool to solve the mentioned kind of problem [12][13][14][15][16][17].Therefore, this paper develops a new ice navigation system with a modified A* path planning algorithm called HFS-A* algorithm, where the hesitant fuzzy set theory is incorporated to improve the traditional A* algorithm.Three key factors, including sailing time, economic benefits, and navigation safety, are considered to the final decision-making in this system where multi-models of sea ice prediction and multiple experts' knowledge are used as input.More details related to hesitant fuzzy set theory and A* algorithm can be seen in Section 2. Section 3 introduces the establishment of the HFS-A* algorithm.A numerical experiment has been used to examine the proposed model in Section 4, and the conclusion can be seen in Section 5.

Basic Concepts
A* algorithm is a heuristic algorithm widely used for finding an optimal path in static road network presented by [18], which is derived from the Dijkstra algorithm [19] and the Greedy algorithm [20].The Dijkstra algorithm can find the shortest path, but has to traverse the entire network with low efficiency, and the Greedy algorithm has fast search speed but cannot guarantee to find the best path.The A* algorithm can balance both search speed and global optimality by using the specific utility function f (n), which consists of a kind of cost function g(n) and a kind of cost function q(n): where g(n) represents the actual cost from initial node to the current node, and q(n) is the estimated cost from the current node to the end node.When q(n) = 0, only q(n) works, then the A* algorithm degenerates to the Dijkstra algorithm, which can only guarantee finding the optimal route.When h(n) ≤ q(n), then the A* algorithm can maintain the search speed and the global optimality, and the search speed will be slower when the value of q(n) becomes smaller.When h(n) q(n), then the A* algorithm degenerates to the Greedy algorithm, which can run faster but may fall into local optimum.

Work Flow
The flow of the algorithm can be seen in Figure 1.
Step 1 Initiate two ordered lists called "OPEN" list and "CLOSE" list and generate two nodes called "START" node and "END" node.
Step 2 The utility function f (n) is calculated by Equation (1) at "START" node and put the "START" node into "OPEN" list.Where, f (n) is the estimated value from the "START" node to the "END" node through the current node n; g(n) is the actual value from the "START" node to the current node n; g(n) is the estimated value from the current node n to the "END" node.
Step 3 Take out the node of minimum utility from "OPEN" list and mark it as the current node n.This node will be saved in "CLOSE" list.
Step 4 If and only if the node n is not the "END" node, continue the algorithm.
Step 5 Evaluate each adjacent node of node n and skip the one which has already existed in "CLOSE" list.Then, compute the utility of this node if it is not in "OPEN" list and save it in "OPEN" list.
If the node has already existed in "OPEN" list, recalculate the utility of this node and choose the smaller value by comparing the utility with the previous one.Finally, node n is assigned as the parent node of the node.Step 6 If "OPEN" list is not empty, back to Step 3. Otherwise, exit and report the failure of route search.Step 1 Initiate two ordered lists called "OPEN" list and "CLOSE" list and generate two nodes called "START" node and "END" node.
Step 2 The utility function () is calculated by Equation (1) at "START" node and put the "START" node into "OPEN" list.
Where, () is the estimated value from the "START" node to the "END" node through the current node ; () is the actual value from the "START" node to the current node ; () is the estimated value from the current node  to the "END" node.
Step 3 Take out the node of minimum utility from "OPEN" list and mark it as the current node .This node will be saved in "CLOSE" list.
Step 4 If and only if the node  is not the "END" node, continue the algorithm.
Step 5 Evaluate each adjacent node of node  and skip the one which has already existed in "CLOSE" list.Then, compute the utility of this node if it is not in "OPEN" list and save it in "OPEN" list.If the node has already existed in "OPEN" list, recalculate the utility of this node and choose the smaller value by comparing the utility with the previous one.Finally, node  is assigned as the parent node of the node.
Step 6 If "OPEN" list is not empty, back to Step 3. Otherwise, exit and report the failure of route search.

Hesitant Fuzzy Set
Hesitant fuzzy set, proposed by [21], is a more general fuzzy set.An HFS is defined in terms of a function that returns a set of membership values for each element in the domain [21].

Definition 1 ([21]
).A hesitant fuzzy set A on X is a function h A that when applied to X returns a finite subset of [0,1], which can be represented as the following mathematical symbol: where h A (x) is a set of some values in [0,1], denoting the possible membership degrees of the element x ∈ X to the set A. For convenience, h A (x) is named a hesitant fuzzy element (HFE) [22].
(3) Definition 3 ([22]).For an HFE h, Sc(h) = 1 l h ∑ γ∈h γ, is called the score function of h, where l h is the number of elements in h and Sc(h) ∈ [0, 1].For two HFEs h 1 and h 2 , if Sc(h 1 ) Some operations on the HFEs (h, h 1 and h 2 ) and the scalar number λ are defined by [22]:

Decision Making Based on Hesitant Fuzzy Information
The decision method based on the above definitions can be derived as follows: Step 1 The possible alternative X i of the attribute A i provided by decision makers or other sources are denoted by the hesitant fuzzy elements h i (i = 1, 2, . . ., n).
Step 4 Choose the optimal alternative X * by the comparison of Sc(h i ).
Example 1.The vessel, which includes four directions X i (i = 1, 2, 3, 4) to navigate, is planed to determine the optimal Arctic route for the following year.Suppose there are three factors A i (i = 1, 2, 3) that affect the decision making-A 1 : navigation time; A 2 : economic cost; A 3 : navigation risk.It should be noted that all of them are of the minimization type.The weight vector of the attributes is w = (0.3, 0.4, 0.3) T .
Then, the optimal route can be determined by using the mentioned method.
Step 3 The score values Sc(h i ), i = 1, 2, 3, 4 are calculated by Definition 3, which can be seen in Table 2.
Step 4 From Table 2, X 4 will be chosen as the optimal direction based on both the GHFWA operator and GHFWG operator where λ is set as 2.

An Improved A* Algorithm (HFS-A*)
In light of the harsh weather conditions in the Arctic region, the primary task for route planning is to identify the obstacles (e.g., sea ice).The Coupled Model Intercomparison Project, phase 5 (CMIP5) provided 39 Global Climate Models (GCMs) to predict sea ice data, from history to 21st century, under different representative concentration pathways (RCPs) [23,24].Unlike the route planning in other regions, for the current sea ice forecasts in the Arctic region, there exists large uncertainty among these GCMs [25,26], which leads to the uncertainty of the length of the navigation season and the economic risk of exploiting the Arctic routes [27].Therefore, only treating the shortest distance as the optimal route in the Arctic region is not reasonable; more factors, including the navigation risk, the navigation time, and the economic cost during navigation should be considered.Compared to the traditional A* algorithm, the HFS-A* algorithm is used to tackle the multi-criteria decision-making (MCDM) problem with large uncertainty derived from multi-model outputs and expert knowledge.The improved parts mainly focus on t, the identification of obstacles, and the construction of utility function.

Navigability of the Arctic Routes
With the impact of global warming, the extent of Arctic sea ice continues to decline [27].Human's enthusiasm to explore and develop the Arctic routes are aroused by shorter sailing distance, longer navigation season and increased access to natural resources.There are three criteria related to sea ice conditions for evaluating the navigability in the Arctic area.
Criterion 1 (navigation uncertainty).Sea ice concentration is considered only for no ice-breaking or ice-strengthening ships, and it is navigable when sea ice concentration is less than 15% [28-31].
Criterion 2 (navigation time).Sea ice thickness derived from an empirical regression model is considered and for no ice-breaking or ice-strengthening ships, it is navigable when sea ice thickness is no more than 1.2 m [32,33].

Criterion 3 (navigation economic cost).
Both sea ice concentration and thickness are considered by computing the Ice Numeral (IN) index from the Arctic Ice Regime Shipping System (AIRSS) provided by the Canada Transport [34][35][36][37].The Ice Numeral is given by where C n is the concentration in tenths of ice type n, and I M n is the Ice Multiplier for ice type n.Ice type describes the specific stage of development of ice, which is closely related to the ice age.Ice Multipliers, determined by ship class and ice type, are a series of integers, which are used to reflect the impact of sea ice type to the specific vessel.A negative I M represents the obstacle effect of vessel sailing.Ice types are determined by [34,38], which are presented in Appendix A. For no ice-breaking or ice-strengthening ships, it is navigable when the IN index is larger than zero.Details about vessel type and IM can also be seen in Appendix A.
Additionally, geographical environment, including water depth and channel width, is also a key factor for ships to navigate, which is related to the vessel type and dimension.
Overall, various evaluation criteria will add to the uncertainty of the sea ice navigability projection.In this paper, we take all three criteria into consideration with geographical restriction to make sure the navigability of the Arctic region, in another words, for one region, can be defined as navigable if and only if the criteria mentioned above are all reached.

Route Planning Criterion 1: Uncertainty of Sea Ice Condition
In this paper, a series of GCMs have been chosen based on their reasonable projections for future sea ice conditions evaluated by literature studies [39][40][41][42] (see Appendix B).In order to obtain the uncertainty of each model, these model outputs were compared with the Pan-Arctic Ice Ocean Modeling and Assimilation System (PIOMAS) estimate data set, which is a reanalysis with good spatial and temporal consistency constrained by the quality of the assimilated observations [43][44][45][46].
Suppose we have M GCMs, let each model data-set be X i , i = 1, 2, . . ., M, the PIOMAS data set be X, then the uncertainty of each model can be obtained as follows: where, is called cosine similarity, which is a measure of similarity between two non-zero vectors introduced by [47].h i1 , i = 1, 2, . . ., M represents the bias from the model to the "real state", which can also be regarded as model uncertainty.When h i1 is equal to zero, it represents that the model data sets can well reflect the "real state", while when h i1 is equal to one, the model uncertainty reaches its maximum.

Route Planning Criterion 2: Time for Navigation on the Arctic Routes
The navigation time for each grid can be depicted as follows: where, S i is the distance of each grid, and v i is the velocity of the vessel on each grid.h i2 is the normalization of T i .
On the Northern Sea Route (NSR), the vessel speed is mainly impacted by sea ice conditions.A h-v curve presented by [48] can reflect, well, the relationship between sea ice thickness and vessel speed.In this h-v curve, the ice resistance and the net thrust of the engine to overcome the ice resistance should both be considered.
Step 1 The ice resistance can be presented as follows: 3 where µ B = 0.5 represents the ice porosity factor, ρ ∆ = 0.8 is the density difference between ice and water.In this model, these two factors are considered to be constant for simple situations, e.g., when the temperature changes.Variables include the waterline area of the foreship A WF , the Froude number F n , the length L, the parallel midbody length at waterline L par , the width B, the friction coefficient µ h and the vessel draft T. K P and K 0 are mechanical factors of ice found by [49].The thickness of the brash ice H F can be determined as follows: Both γ and δ represent the slope angles of the brash ice.
The formula can be simplified by an approximation when B > 10 m and H M > 4 m [39]: The flare angle ψ mentioned above can be obtained with the bow angles φ and α: Step 2 The net thrust can be calculated by the following formula: where T tot is the total thrust, (1 − t) represents the thrust deduction factor, and R i (v) and R ow (v) are the resistance in ice and in open water respectively.
The effect of vessel speed is approximated by a quadratic factor called bollard pull T B [50], with the maximum open water speed v ow , and the net thrust can be rewritten as where v is the vessel speed in the ice, K e is the bollard pull quality factor, D P is the propeller diameter and P D is the actual power delivered.

Route Planning Criterion 3: Economic Cost for Navigation on the Arctic Routes
The economic cost of navigation on the Arctic routes are consist of four parts, which are capital cost, fuel cost, operation cost, and transit cost:

Model for Capital Cost
Capital cost is related to the price of new ship building or the cost of a ship with loans and depreciations [51].Generally, the annual capital cost can be computed as follows [52]: where P is a new ship price, eq is the equity, r is the interest rate, and y is the term of loan.The former item is called annual interests, while the latter item is called cash price.

Model for Fuel Cost
Fuel cost is often depicted as the major cost on the marine transportation, which is the largest single cost factor to most related simulations, ranging from 36.7% to 61% [53].
Fuel cost is impacted by the rate of fuel consumption and the price of fuel, which can be descripted as follows: The fuel consumption of a vessel can be influenced by ship dimensions (e.g., the ship size, hull design, engine profile, speed) and external factors (e.g., sea ice, wind, wave, current, foggy) [51].The fuel consumption for a specific type of vessel is basically computed by multiplying SFOC (specific fuel oil consumption) (g/kWh), engine power (kw) and sailing hours (h) [54].
Most authors consider speed as the key factor impacting the fuel consumption when the type of a vessel is determined and a simple exponential law based on empirical data are derived: the fuel consumption per unit distance is proportional to the square of the speed [55][56][57], which can be presented as where F 1 and F 2 are the fuel consumption rate under the velocity V 1 and V 2 , respectively.Fuel price is affected by the fluctuation of the global economic market.Low fuel price indicates the depression of global economy, while high fuel price reflects the booming global market.

Model for Operation Cost
Operation cost mainly includes crew cost, insurance cost and maintenance fee which is presented as follows:

Crew cost
Crew cost is determined by the vessel type, automation level and numerous other factors [51].Compared to the open water, the crews in the Arctic region require additional ice navigation experience and the ability to cope with hash weather conditions, which may increase the crew cost [53].The increased crew cost may come from the higher wage [58] for each member or the larger size of members [59].

Maintenance cost
For the purpose of preventing the occurrence of breakdowns and following the scheduled maintenance program, the cost of regular maintenance is needed for vessels.

Insurance cost
In face of the risk of Arctic navigation (e.g., collision, engine damage, propeller damage, local hull damage, grounding, etc.) analyzed IN some studies [60,61], maritime insurance is a good tool to mitigate the associated risks, which can be approximately separated into three major components: protection and indemnity (P&I), hull and machinery (H&M), and cargo insurance.The third-party liabilities encountered during the commercial operation of a ship are charged by P&I.H&M covers the cost of damage done to the ship or its equipment.Cargo insurance provides the payment for the damage to the cargo itself [62].

Model for Transit Cost
On the NSR, the transit fee based on vessel type and ice conditions mainly includes ice pilot fee and ice breaking fee and can be given as These services are mainly provided by the Russian icebreaking service provider, Atomflot, and are compulsively charged subject to the law of the Russian Federation, which is dependent on the vessel type (e.g., the size and the ice-class of a vessel), and the navigation length and pilotage distance [62].In general, higher ice-classed vessels are charged with lower icebreaking fees.

Work Flow of HFS-A* Algorithm
In this HFS-A* algorithm, the work flow can be seen in Figure 2. The method of obstacle identification has been discussed in Section 3.1 while the modified utility function can be described as follows: When the current node i is determined, the actual cost g * (i) is equal to the score value Sc(h i ), which can be computed by Definition 3.
More specifically, we assume each selected node has three criteria C j (j = 1, 2, 3) that affect the decision making-C 1 : uncertainty of sea ice condition;

Study Area and Data Description
This experiment is to find the optimal route on the Northern Sea Route (NSR) based on the proposed method from Shanghai to Bergen port for an IB-classed 3800TEU container vessel.
Data related to water depth is derived from a product called ETOPO1 provided by the National Geophysical Data Center (NGDC), with a resolution of 1 arc-minute [64].Data related to AIRSS system can be seen in Appendix A. Data related to sea ice conditions (both sea ice thickness and sea ice concentration) can be seen in Appendix B. Data related to vessel information can be seen in Appendix C. Data related to economic cost can be seen in Appendix D. All the climate model outputs and data related to water depth are interpolated to the grid size of 360 × 120 for the comparison with PIOMAS estimate data set, which the spatial coverage is 45° N to 90° N and the temporal resolution is monthly.

Navigability of the NSR
The numerical simulation firstly examines the navigability of the IB-classed 3800 TEU container vessels on the NSR for each month in the year of 2050 (see Figure 3).According to the ensemble model predictions, the open time of the NSR for that vessel to access may last for 3 to 5 months in the year of 2050.Most model outputs show the navigable time starts from August to the October, while merely 2 to 4 models extend the navigable time (from July to November).The heuristic estimated cost function can be approximately evaluated: where, D is the heuristic distance (Manhattan, Euclidean or Chebyshev) from the evaluated node to the END node [63].
Step 1 Map initialization

•
Initialize map grid and interpolate the mentioned data into grid.

•
Find the obstacle nodes in terms of the constrain conditions mentioned in Section 3.1.
Step 2 The construction of utility function

•
Each time, compare all the adjacent nodes i of the current node n by where, ), h i1 is the HFEs of navigation uncertainty (see Section 3.2), h i2 is the HFEs of navigation time (see Section 3.3), and h i3 is the HFEs of navigation economic cost (see Appendix ??).
Step 3-6 The same as the traditional A* algorithm.

Study Area and Data Description
This experiment is to find the optimal route on the Northern Sea Route (NSR) based on the proposed method from Shanghai to Bergen port for an IB-classed 3800TEU container vessel.(The color of orange in the map reflects the geographic information, the white color represents the area that cannot access during that month, different blue colors reflect different amount of the models that give the navigable prediction for each grid during that month.).

Selection of the Aggregation Operators and Route Optimization
Secondly, route planning criteria (uncertainty, time and economic cost) have been calculated based on the models mentioned in Section 3.2-3.4,and the results can be seen in Appendix D. These factors can be normalized respectively between 0 and 1, which can be described as: Thirdly, the optimal routes for IB-classed 3800 TEU container vessels from Shanghai to Bergen port on the NSR in September of 2050 can be found by two kinds of the aggregation operators (GHFHA ,  = 1, 2, 6 and GHFHG ,  = 1, 2, 6), which are used to aggregate the normalized results mentioned above.The detailed results can be seen in Table 3.Compared these two kinds of aggregation operators, the performance of the GHFHG ,  = 1, 2, 6 operators in the route optimization is better than the GHFHA ,  = 1, 2, 6 operators from the view of total sailing distance, sailing time, economic cost and average uncertainty.In the light of the comparison of different  for each operator, the performance of the GHFHG becomes better with the  increase, while the performance of the GHFHG becomes better when  decreases.Therefore, the GHFHG operator has been examined as the best aggregation operator in this numerical study (The weights vectors for this experiment are assigned as 0.4, 0.3, and 0.3 for three criteria).

Selection of the Aggregation Operators and Route Optimization
Secondly, route planning criteria (uncertainty, time and economic cost) have been calculated based on the models mentioned in Sections 3.2-3.4,and the results can be seen in Appendix D. These factors can be normalized respectively between 0 and 1, which can be described as: Thirdly, the optimal routes for IB-classed 3800 TEU container vessels from Shanghai to Bergen port on the NSR in September of 2050 can be found by two kinds of the aggregation operators (GHFHA λ , λ = 1, 2, 6 and GHFHG λ , λ = 1, 2, 6), which are used to aggregate the normalized results mentioned above.The detailed results can be seen in Table 3.Compared these two kinds of aggregation operators, the performance of the GHFHG λ , λ = 1, 2, 6 operators in the route optimization is better than the GHFHA λ , λ = 1, 2, 6 operators from the view of total sailing distance, sailing time, economic cost and average uncertainty.In the light of the comparison of different λ for each operator, the performance of the GHFHG λ becomes better with the λ increase, while the performance of the GHFHG λ becomes better when λ decreases.Therefore, the GHFHG 1 operator has been examined as the best aggregation operator in this numerical study (The weights vectors for this experiment are assigned as 0.4, 0.3, and 0.3 for three criteria).Finally, the optimal route determined by HFS-A* algorithm with the GHFHG 1 operator can be seen in Figure 4. Three other routes according to simple single criterion (uncertainty, time, or economic cost) are also drawn in Figure 4.The detailed results can be seen in Table 4, where it can be found that path planning based on a single factor shows a slight advantage in its related aspect, but shows significant disadvantage in any other aspect compared with the optimal route.In other words, the optimal route can better balance these three key factors and show more realistic performance of the proposed route planning algorithm than the other three single factor route planning.Finally, the optimal route determined by HFS-A* algorithm with the GHFHG operator can be seen in Figure 4. Three other routes according to simple single criterion (uncertainty, time, or economic cost) are also drawn in Figure 4.The detailed results can be seen in Table 4, where it can be found that path planning based on a single factor shows a slight advantage in its related aspect, but shows significant disadvantage in any other aspect compared with the optimal route.In other words, the optimal route can better balance these three key factors and show more realistic performance of the proposed route planning algorithm than the other three single factor route planning.

Conclusions
The opening of Arctic routes will be no longer a dream in the coming future with climate change; route planning is necessary for vessels to navigation on the Arctic region from different points of view (safe, economic cost, time etc.).This paper presents a modified A* algorithm where the hesitant fuzzy set theory is incorporated for the purpose of solving the MCDM problem in Arctic route planning with large uncertainties originating from multi-climate models and experts' knowledge.Compared to the traditional A* algorithm, the navigability of the Arctic route is firstly analyzed as a

Conclusions
The opening of Arctic routes will be no longer a dream in the coming future with climate change; route planning is necessary for vessels to navigation on the Arctic region from different points of view (safe, economic cost, time etc.).This paper presents a modified A* algorithm where the hesitant fuzzy set theory is incorporated for the purpose of solving the MCDM problem in Arctic route planning with large uncertainties originating from multi-climate models and experts' knowledge.Compared to the traditional A* algorithm, the navigability of the Arctic route is firstly analyzed as a measure to determine the obstacle nodes, and three key factors to vessel navigation, including sailing time, economic cost and risk are overall considered in the HFS-A* algorithm.
A numerical experiment, which is to find the optimal route between Bergen port and Shanghai port on the NSR, is presented to test the performance of the proposed algorithm.Multi-model ensemble forecast displays that the IB-class 3800 TEU container vessels can navigate on the NSR lasting for 3 to 5 months in the year of 2050.Most model outputs show the navigable time starts from August to October, while merely 2 to 4 models extend the navigable time (from July to November).The sensitivity analysis for the aggregation operators examines that the GHFHG 1 operator has an advantage over other aggregation operators in route optimization, and its performance of integrating the three key factors in route planning is better than the performance of any other single factor.
In this paper, the improvement effects for this new approach have been evaluated theoretically and practically.Theoretically speaking, the simple A* algorithm cannot handle the Arctic path planning problem which has multi-criteria attribution with large uncertainties.Even if we can synthesize the time, economic and uncertainty factors by addition and multiplication, the uncertainties existing in climate model prediction and expert knowledge cannot be portrayed by a simple A* algorithm.Practically speaking, we compared the route planning result of HFS-A* algorithm and single factor route planning result (see Figure 4).It can be found that there is a more realistic performance of the HFS-A* route planning algorithm than compared with the simple A* route planning algorithm.Overall, this new HFS-A* algorithm can be well-applied to the Arctic region and to evaluate the strategic prospects for future Arctic routes.

Figure 1 .
Figure 1.Work flow of the traditional A* algorithm.

21 Figure 2 .
Figure 2. Work flow of the HFS-A* algorithm.

Figure 2 .
Figure 2. Work flow of the HFS-A* algorithm.

Figure 3 .
Figure 3.The navigability of IB-classed 3800 TEU container vessels on the NSR for each month in the year of 2050 based on multi-models.(The color of orange in the map reflects the geographic information, the white color represents the area that cannot access during that month, different blue colors reflect different amount of the models that give the navigable prediction for each grid during that month.).

Figure 3 .
Figure 3.The navigability of IB-classed 3800 TEU container vessels on the NSR for each month in the year of 2050 based on multi-models.(The color of orange in the map reflects the geographic information, the white color represents the area that cannot access during that month, different blue colors reflect different amount of the models that give the navigable prediction for each grid during that month.).

Table 4 .
Results of route optimization for IB-classed 3800 TEU container vessels on the NSR from Shanghai to Bergen port in September of 2050 based on HFS-A* algorithm and simple A* algorithm (The percentages in brackets are compared with the values in GHFHG1).

Table 4 .
Results of route optimization for IB-classed 3800 TEU container vessels on the NSR from Shanghai to Bergen port in September of 2050 based on HFS-A* algorithm and simple A* algorithm (The percentages in brackets are compared with the values in GHFHG1).

Figure 4 .
Figure 4. Route optimization for IB-classed 3800 TEU container vessels on the NSR from Shanghai to Bergen port in September of 2050 by HFS-A* algorithm.(The red line represents the route planning based on navigation uncertainty, the blue line based on the navigation time, the yellow line based on navigation economic cost, the dark line represents the optimal route integrated of these three criteria by the GHFHA operator.)

Figure 4 .
Figure 4. Route optimization for IB-classed 3800 TEU container vessels on the NSR from Shanghai to Bergen port in September of 2050 by HFS-A* algorithm.(The red line represents the route planning based on navigation uncertainty, the blue line based on the navigation time, the yellow line based on navigation economic cost, the dark line represents the optimal route integrated of these three criteria by the GHFHA 1 operator.)

Table 3 .
Results of route optimization for IB-classed 3800 TEU container vessels on the NSR from

Table 3 .
Results of route optimization for IB-classed 3800 TEU container vessels on the NSR from Shanghai to Bergen port in September of 2050 with different aggregation operators based on HFS-A* algorithm.

Table A1 .
Cont.Thick first yearOne year ice has a thickness of 120-220 cm Second year Adult ice, which has gone through at least one summer's melting, has a thickness of 220-250 cm Multiyear Multiyear ice, which has gone through at least two summers' melting, has a thickness beyond 250 cm