抄録
This paper presents a method to find some local minima by branching at local minimum, based on the Generalized Random Tunneling Algorithm (GRTA). We call this method as Branching GRTA( BGRTA). BGRTA also consists of three phases, that is, the minimization phase, the tunneling and branching phase, and constraint phase. In the minimization phase, local search technique is used. In the tunneling and branching phase, some local minima can be found by branching at local minimum obtained in the minimization phase. The next branching point is chosen from them. In the constraint phase, the feasibility is examined. We apply BGRTA to the traffic road design problem. Through numerical examples, we examine the validity of BGRTA.
