A combined Tchebycheff/Aspiration Criterion Vector interactive multiobjective programming procedure

In this paper the authors 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.