The Experts below are selected from a list of 951 Experts worldwide ranked by ideXlab platform
Alan W. Whisman - One of the best experts on this subject based on the ideXlab platform.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective programming. The Combined procedure is sensible because the Tchebycheff and Aspiration Criterion Vector methods possess complementary distinguishing characteristics, solve similar optimization problems to probe the nondominated set, and share a similar computer/user interface. In the early iterations, Tchebycheff probes of the nondominated set might be conducted to locate promising neighborhoods of search. In later iterations, Aspiration Criterion Vector probes might be used to pinpoint a final solution. Computational experience is reported showing the improved effectiveness of the Combined Procedure when employed in this fashion when compared against the Tchebycheff and Aspiration Criterion Vector methods run separately.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective pro...
Ralph E. Steuer - One of the best experts on this subject based on the ideXlab platform.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective programming. The Combined procedure is sensible because the Tchebycheff and Aspiration Criterion Vector methods possess complementary distinguishing characteristics, solve similar optimization problems to probe the nondominated set, and share a similar computer/user interface. In the early iterations, Tchebycheff probes of the nondominated set might be conducted to locate promising neighborhoods of search. In later iterations, Aspiration Criterion Vector probes might be used to pinpoint a final solution. Computational experience is reported showing the improved effectiveness of the Combined Procedure when employed in this fashion when compared against the Tchebycheff and Aspiration Criterion Vector methods run separately.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective pro...
Joe Silverman - One of the best experts on this subject based on the ideXlab platform.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective programming. The Combined procedure is sensible because the Tchebycheff and Aspiration Criterion Vector methods possess complementary distinguishing characteristics, solve similar optimization problems to probe the nondominated set, and share a similar computer/user interface. In the early iterations, Tchebycheff probes of the nondominated set might be conducted to locate promising neighborhoods of search. In later iterations, Aspiration Criterion Vector probes might be used to pinpoint a final solution. Computational experience is reported showing the improved effectiveness of the Combined Procedure when employed in this fashion when compared against the Tchebycheff and Aspiration Criterion Vector methods run separately.
-
a combined tchebycheff Aspiration Criterion vector interactive multiobjective programming procedure
Management Science, 1993Co-Authors: Ralph E. Steuer, Joe Silverman, Alan W. WhismanAbstract:In this paper we combine the Tchebycheff method of Steuer and Choo with Wierzbicki's Aspiration Criterion Vector method in order to form an improved procedure for interactive multiple objective pro...
Gómez Ramos, José Luis - One of the best experts on this subject based on the ideXlab platform.
-
Búsqueda tabú con criterio de aspiración probabilístico aplicada a la generación de horarios escolares
2015Co-Authors: Chávez Óscar, Pozos Parra Pilar, Gómez Ramos, José LuisAbstract:The Aspiration Criterion is an imperative element in the Tabu Search, with Aspiration-by-default and the Aspiration-by-objective the mainly used criteria in the literature. In this paper a new Aspiration Criterion is proposed in order to implement a probabilistic function when evaluating an element classified as tabu which improves the current solution, the proposal is called Tabu Search with Probabilistic Aspiration Criterion (BT- CAP). The test case used to evaluate the performance of the Probabilistic Aspiration Criterion proposed consists on the 20 instances of the problem described in the First International Timetabling Competition. The results are compared with 2 additional variants of the Tabu Search Algorithm: Tabu Search with Default Aspiration Criterion (BT-CAD) and Tabu Search with Objective Aspiration Criterion (BT-CAO). Wilcoxon test was applied to the generated results, and it was proved with 99 % confidence that BT-CAP algorithm gets better solutions than the two other variants of the Tabu Search algorithm.El criterio de aspiración es un elemento determinante en el funcionamiento del algoritmo de Búsqueda Tabú, siendo el criterio de aspiración por defecto y el criterio de aspiración por objetivo los dos utilizados mayormente en la literatura. En este artículo se propone una variante a estos criterios de aspiración, la cual implementa una función de probabilidad al momento de evaluar un elemento clasificado como tabú que mejore la solución actual: criterio de aspiración probabilístico. El caso de prueba utilizado para evaluar el desempeño del algoritmo de Búsqueda Tabú con Criterio de Aspiración Probabilístico (BT-CAP) propuesto lo constituyen las 20 instancias del problema descrito en the First International Timetabling Competition. Se compararon los resultados del BT-CAP contra 2 variantes adicionales del algoritmo de Búsqueda Tabú: Búsqueda Tabú con Criterio de Aspiración por Defecto (BT-CAD) y Búsqueda Tabú con Criterio de Aspiración por Objetivo (BT-CAO). Se aplicó una prueba de Wilcoxon con los resultados obtenidos, y se demostró con 99 % de confiabilidad que el algoritmo BT-CAP obtiene mejores soluciones que las otras dos variantes del algoritmo de Búsqueda Tabú
-
BÚSQUEDA TABÚ CON CRITERIO DE ASPIRACIÓN PROBABILÍSTICO APLICADA A LA GENERACIÓN DE HORARIOS ESCOLARES
'Universidad de Costa Rica', 2015Co-Authors: Chávez Bosquez Oscar, Pozos Parra Pilar, Gómez Ramos, José LuisAbstract:The Aspiration Criterion is an imperative element in the Tabu Search, with Aspiration-by-default and the Aspiration-by-objective the mainly used criteria in the literature. In this paper a new Aspiration Criterion is proposed in order to implement a probabilistic function when evaluating an element classified as tabu which improves the current solution, the proposal is called Tabu Search with Probabilistic Aspiration Criterion (BT- CAP). The test case used to evaluate the performance of the Probabilistic Aspiration Criterion proposed consists on the 20 instances of the problem described in the First International Timetabling Competition. The results are compared with 2 additional variants of the Tabu Search Algorithm: Tabu Search with Default Aspiration Criterion (BT-CAD) and Tabu Search with Objective Aspiration Criterion (BT-CAO). Wilcoxon test was applied to the generated results, and it was proved with 99 % confidence that BT-CAP algorithm gets better solutions than the two other variants of the Tabu Search algorithm.El criterio de aspiración es un elemento determinante en el funcionamiento del algoritmo de Búsqueda Tabú, siendo el criterio de aspiración por defecto y el criterio de aspiración por objetivo los dos utilizados mayormente en la literatura. En este artículo se propone una variante a estos criterios de aspiración, la cual implementa una función de probabilidad al momento de evaluar un elemento clasificado como tabú que mejore la solución actual: criterio de aspiración probabilístico. El caso de prueba utilizado para evaluar el desempeño del algoritmo de Búsqueda Tabú con Criterio de Aspiración Probabilístico (BT-CAP) propuesto lo constituyen las 20 instancias del problema descrito en the First International Timetabling Competition. Se compararon los resultados del BT-CAP contra 2 variantes adicionales del algoritmo de Búsqueda Tabú: Búsqueda Tabú con Criterio de Aspiración por Defecto (BT-CAD) y Búsqueda Tabú con Criterio de Aspiración por Objetivo (BT-CAO). Se aplicó una prueba de Wilcoxon con los resultados obtenidos, y se demostró con 99 % de confiabilidad que el algoritmo BT-CAP obtiene mejores soluciones que las otras dos variantes del algoritmo de Búsqueda Tabú
H K Buning - One of the best experts on this subject based on the ideXlab platform.
-
a mating strategy for multi parent genetic algorithms by integrating tabu search
Congress on Evolutionary Computation, 2003Co-Authors: Chuan-kang Ting, H K BuningAbstract:Multiparent crossovers have been validated their outperformance on several optimization problems. However, there are two issues to be considered - the number of parents and the disruptiveness caused by multiple parents. We present a tabu multiparent genetic algorithm (TMPGA) to address these two issues by integrating tabu search into the mating of multiparent genetic algorithms. TMPGA utilizes the tabu restriction and the Aspiration Criterion to sift selected parents in consideration of population diversity and selection pressure. Furthermore, the resulting mating validity further adjusts the number of parents participating in a mating. Experiments are conducted with four common test functions. The results indicate that TMPGA can achieve better performance than both two-parent GA and multiparent GA with the diagonal crossover.
