Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

John Sylva; Alejandro Crema

RAIRO - Operations Research (2008)

  • Volume: 42, Issue: 3, page 371-387
  • ISSN: 0399-0559

Abstract

top
An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.

How to cite

top

Sylva, John, and Crema, Alejandro. "Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming." RAIRO - Operations Research 42.3 (2008): 371-387. <http://eudml.org/doc/250398>.

@article{Sylva2008,
abstract = { An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance. },
author = {Sylva, John, Crema, Alejandro},
journal = {RAIRO - Operations Research},
keywords = {Integer Programming; Multiple Objective Programming; Parametric Programming.; integer programming; multiple objective programming; parametric programming},
language = {eng},
month = {8},
number = {3},
pages = {371-387},
publisher = {EDP Sciences},
title = {Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming},
url = {http://eudml.org/doc/250398},
volume = {42},
year = {2008},
}

TY - JOUR
AU - Sylva, John
AU - Crema, Alejandro
TI - Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming
JO - RAIRO - Operations Research
DA - 2008/8//
PB - EDP Sciences
VL - 42
IS - 3
SP - 371
EP - 387
AB - An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
LA - eng
KW - Integer Programming; Multiple Objective Programming; Parametric Programming.; integer programming; multiple objective programming; parametric programming
UR - http://eudml.org/doc/250398
ER -

References

top
  1. M.J. Alves and J.o Clímaco, An interactive reference point approach for multiobjective mixed-integer programming using branch and bound. Eur. J. Oper. Res.124 (2000) 478–494.  
  2. G.R. Bitran, Linear multiple objective programs with zero-one variables. Math. Program.13 (1977) 121–139.  
  3. J. Climaco, C. Ferreira and M.E. Captivo, Multicriteria integer programming: An overview of different algorithmic approaches, in Multicriteria Analysis, edited by J. Climaco, Springer-Verlag, Berlin, 1997, pp. 248–258.  
  4. COIN-OR, Computational infrastructure for operations research home page, , Acceso 26/03/2006.  URIhttp://www.coin-or.org/
  5. J. Karaivanova, S. Narula and V. Vassilev, An interactive algorithm for integer programming. Eur. J. Oper. Res.68 (1993) 344–351.  
  6. M. Laumanns, L. Thiele and E. Zitzler, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method. Eur. J. Oper. Res.169 (2006) 932–942.  
  7. L.M. Rasmussen, Zero-one programming with multiple criteria. Eur. J. Oper. Res.26 (1986) 83–95.  
  8. R.M. Soland, The design of multiactivity multifacility systems. Eur. J. Oper. Res.12 (1983) 95–104.  
  9. R.E. Steuer, Multiple criteria optimization-theory, computation and application, John Wiley and Sons, (1986).  
  10. J. Sylva and A. Crema, A method for finding the set of nondominated vectors for multiple objective integer linear programs. Asia-Pacific J. Oper. Res.158 (2004) 46–55.  
  11. J. Sylva and A. Crema, A method for finding well-dispersed subsets of nondominated vectors for multiple objective mixed integer linear programs. Eur. J. Oper. Res.180 (2007) 1011–1027.  
  12. J. Teghem and P.L. Kunsch, A survey of techniques for finding efficient solutions to multi-objective integer linear programming. Asia-Pacific J. Oper. Res.3 (1986) 95–108.  
  13. D. Tenfelde-Podehl, A recursive algorithm for multiobjective combinatorial optimization problems with q criteria. Tech. report, Institut für Mathematik, Technische Universität Graz, (2003).  
  14. E.L. Ulungu and J. Teghem, Multi-objective combinatorial optimization problems: A survey. J. Multi-Criteria Decision Anal.3 (1994), 83–104.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.