In this paper, we will describe how the hill-climbing algorithm is being employed for the determination of the flow paths.
2 FLOW PATH APPROXIMATION USING HILL-CLIMBING METHOD
Hill-climbing is well known in optimization theory and comes from a family of search methods used to find a goal state in a solution space.
The method of hill-climbing is known to suffer from certain limitations, the most critical of which is posed by bad terrain, for example the terrain shown in Fig.
If the hill-climbing algorithm is used to find the global maximum in an unknown search space, then it is unavoidable that every solution found needs to be tested and verified,
As such, the hill-climbing algorithm can easily get bogged down in this region since there are more than one direction in which the next best step can be taken.
Thus, it is apparent that the hill-climbing algorithm is not a reliable method in locating the global maximum if the search space contains the characteristics described above.
To explain how a flow path can be located using the hill-climbing algorithm, let us consider the fill time contours of a single gated cavity shown in Fig.
For the present application, the objective of using the hill-climbing strategy is not for locating the global minimum, which is at the gate.
These days, Josh rides a Yamaha bike, and his father competes with a Kawasaki, both modified for hill-climbing competition.
The duo began the motocross hill-climbing season in Monson in April and raced on several tracks throughout the summer into the fall, including hill tracks in Greenfield; Gunstock, N.H.; Caroga Lake, N.Y.; and Canaan, N.H.
In hill-climbing competition, rather than speeding with other riders around a track, the Kobels face steep hills and earn points based on finish times or the vertical incline.