Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
The zero/one multiple knapsack problem and genetic algorithms
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
INFORMS Journal on Computing
Computers and Operations Research
Interactive Multiobjective Evolutionary Algorithms
Multiobjective Optimization
Extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Hi-index | 0.01 |
This paper presents an interactive method for solving general 0-1 multiobjective linear programs using Simulated Annealing and Tabu Search. The interactive protocol with the decision maker is based on the specification of reservation levels for the objective function values. These reservation levels narrow the scope of the search in each interaction in order to identify regions of major interest to the decision maker. Metaheuristic approaches are used to generate potentially nondominated solutions in the computational phases. Generic versions of Simulated Annealing and Tabu Search for 0-1 single objective linear problems were developed which include a general routine for repairing unfeasible solutions. This routine improves significantly the results of single objective problems and, consequently, the quality of the potentially nondominated solutions generated for the multiobjective problems. Computational results and examples are presented.