Solution of goal programming models using a basic taboo search algorithm

A Baykasoglu (), S Owen and N Gindy ()
Additional contact information
A Baykasoglu: University of Nottingham
S Owen: University of Nottingham
N Gindy: University of Nottingham

Journal of the Operational Research Society, 1999, vol. 50, issue 9, 960-973

Abstract: Abstract Goal programming is a very powerful technique for solving multiple objective optimisation problems. It has been successfully applied to numerous diverse real life problems. In this paper a Taboo search based method is developed to solve preemptive goal programming problems. The method can easily be applied to any kind of preemptive goal programming problems.

Keywords: preemptive goal programming; taboo search; multiple objective optimisation (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2600788 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:50:y:1999:i:9:d:10.1057_palgrave.jors.2600788

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2600788

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().