IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i9d10.1057_palgrave.jors.2600788.html
   My bibliography  Save this article

Solution of goal programming models using a basic taboo search algorithm

Author

Listed:
  • A Baykasoglu

    (University of Nottingham
    University of Gaziantep)

  • S Owen

    (University of Nottingham)

  • N Gindy

    (University of Nottingham)

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.

Suggested Citation

  • A Baykasoglu & S Owen & N Gindy, 1999. "Solution of goal programming models using a basic taboo search algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(9), pages 960-973, September.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:9:d:10.1057_palgrave.jors.2600788
    DOI: 10.1057/palgrave.jors.2600788
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600788
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600788?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. S Dhouib & A Kharrat & H Chabchoub, 2011. "Goal programming using multiple objective hybrid metaheuristic algorithm," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 677-689, April.
    2. Jones, D. F. & Mirrazavi, S. K. & Tamiz, M., 2002. "Multi-objective meta-heuristics: An overview of the current state-of-the-art," European Journal of Operational Research, Elsevier, vol. 137(1), pages 1-9, February.
    3. V M Miori, 2011. "A multiple objective goal programming approach to the truckload routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(8), pages 1524-1532, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:50:y:1999:i:9:d:10.1057_palgrave.jors.2600788. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.