Future paths for integer programming and links to artificial intelligence
Citations
14,054 citations
Cites methods from "Future paths for integer programmin..."
...Tabu search [Glover 1986], like SA, is a method designed to cross boundaries of feasibility or local optimality and to systematically impose and release constraints to permit exploration of otherwise forbidden regions....
[...]
9,057 citations
8,432 citations
8,285 citations
[...]
6,373 citations
Cites background or methods from "Future paths for integer programmin..."
...Jacobs (1988) suggested a different modification called the 'delta-bar-delta rule' which introduces a separate learning rate for each weight....
[...]
...Path Relinking, as a strategy of creating trajectories of moves passing through high quality solutions was first proposed in connection with tabu search in Glover (1989). The approach was then elaborated in greater detail as a means of integrating TS intensification and diversification strategies, and given the name path relinking (PR), in Glover and Laguna (1993)....
[...]
...The inclusion of longer term considerations effectively removes the risk of duplicating a previous neighborhood upon revisiting a solution and more generally of making choices that repeatedly visit only a limited subset of X An extensive description of the TS methodology can be found in Glover and Laguna (1997) and the integration of evolutionary methods with tabu search memory is treated in Laguna and Marti (2003)....
[...]
...The basic form of Tabu Search (TS) is founded on ideas proposed by Fred Glover (1986). The method is based on procedures designed to cross boundaries of feasibility or local optimality, instead of treating them as barriers....
[...]
...Path Relinking, as a strategy of creating trajectories of moves passing through high quality solutions was first proposed in connection with tabu search in Glover (1989). The approach was then elaborated in greater detail as a means of integrating TS intensification and diversification strategies, and given the name path relinking (PR), in Glover and Laguna (1993). PR generally operates by starting from an initiating solution, selected from a subset of high quality solutions, and generating a path in the neighborhood space that leads toward the other solutions in the subset, which are called guiding solutions....
[...]
References
41,772 citations
35,161 citations
"Future paths for integer programmin..." refers background in this paper
...The form of the process for the purpose of simulation may be specified as follows [37,38]....
[...]
11,845 citations
7,221 citations
6,911 citations