Abran Steele-Feldman

Learn More
Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the " neighborhood " of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is " very large " with respect to the size of the input data. For large problem(More)
Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the " neighborhood " of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is " very large " with respect to the size of the input data. For large problem(More)
The choice titration procedure presents a subject with a repeated choice between a standard option that always provides the same reward and an adjusting option for which the reward schedule is adjusted based on the subject's previous choices. The procedure is designed to determine the point of indifference between the two schedules which is then used to(More)
This paper discusses neighborhood search algorithms where the size of the neighborhood is " very large " with respect to the size of the input data. We concentrate on such a very large scale neighborhood (VLSN) search technique based on compounding independent moves (CIM) such as 2-opts, swaps, and insertions. We present a systematic way of creating and(More)
  • 1