An Interactive Heuristic Approach for Multi-Objective Integer-Programming Problems

An interactive approach to solve the multi-objective integer-programming problem heuristically is described. The approach consists of two main parts. The first is an algorithm to guide the search for a set of weights to the objective functions which would produce the solution most preferred by the d...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of the Operational Research Society Ročník 37; číslo 3; s. 285 - 291
Hlavní autori: Gabbani, Diaa, Magazine, Michael
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London Taylor & Francis 01.03.1986
Pergamon Press
Palgrave Macmillan UK
Palgrave
Taylor & Francis Ltd
Predmet:
Algorithms
Applied sciences
Business and Management
Efficiency decisions
Efficient point
Exact sciences and technology
Heuristic
Heuristics
Integer programming
Integers
Interactive
Iterative solutions
Management
Mathematical programming
Multiple
multiple-criteria optimization
Objective functions
Objectives
Operational research and scientific management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Social interaction
Theoretical Paper
Theoretical Papers
Utility functions
heuristics
integer programming
multiple-criteria optimization
Integer programming
Multicriteria analysis
Decision theory
Interactive mode
Heuristic method
Multiobjective programming
Mathematical programming
ISSN:0160-5682, 1476-9360
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:An interactive approach to solve the multi-objective integer-programming problem heuristically is described. The approach consists of two main parts. The first is an algorithm to guide the search for a set of weights to the objective functions which would produce the solution most preferred by the decision-maker given a linear utility function. The search area is successively decreased through an interaction process, with the decision-maker using a selection and contraction method. During each stage of this algorithm, a number of single integer-programming problems are solved heuristically. The motivation for this approach, along with some computational experimentation, is provided.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0160-5682
1476-9360
DOI:10.1057/jors.1986.46