Heuristic algorithms for solving a class of multiobjective zero one programming problems

Heuristic Algorithms for Solving a Class of Multiobjective Zero-One Programming Problems ZHANG CAIWEN (B.Eng.; M.Eng., Civil Eng.) A THESIS SUBMITTED FOR THE DEGREE OF MASTER OF ENGINEERING DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING NATIONAL UNIVERSITY OF SINGAPORE 2003 Acknowledgements I would like to express my profound gratitude to my supervisor, Associated Professor Ong Hoon Liong, for his invaluable advice, support, guidance and patience throughout my study and research My sincere thanks are conveyed to the National University of Singapore for offering me a Research Scholarship and the Department of Industrial and Systems Engineering for the use of its facilities, without any of which it would be impossible for me to complete this work I want to give special thanks to my research colleagues, Teng Suyan and Liu Shubin, who have helped me a lot in my research work I also want to take this opportunity to thank Ms Ow Lai Chun from the Department Office for her very nice and patient assistance Special thanks also go out to all my colleagues and friends at the Department of Industrial and Systems Engineering, the National University of Singapore, who made my stay at NUS an experience I will not forget Last but certainly not least, thanks to my family and my wife for their continuous concern, moral support and encouragement in this endeavor I Table of Contents Acknowledgements I Table of Contents II Nomenclature IV List of Illustrations .V Summary VIII Chapter Introduction Chapter A Literature Review 2.1 Approaches aiming to generate a good approximation of the set of nondominated solutions 10 2.2 Approaches aiming to generate the set of all nondominated solutions 12 2.3 Approaches aiming to generate one or several “best compromise” solutions for the decision maker 13 2.4 Real world applications of multiobjective optimization techniques 16 2.5 Methods for solving the two classes of problems under study 18 Chapter Basic Concepts and Methodologies 22 3.1 Some basic concepts and definitions 23 3.2 Problem formulations 27 3.3 A simple approach for solving biobjective integer programming problems 31 3.3.1 A simple procedure to generate all nondominated solutions .32 3.3.2 A simple approach to generate nondominated solutions of interest .35 3.4 Computational experiments and results 40 3.5 Summary and conclusions 49 Chapter Solving the Multiobjective 0-1 Knapsack Problem 51 II 4.1 Evaluation of an approximation to the nondominated set 52 4.2 A simple approach for solving biobjective integer programming problems 53 4.2.1 An LP-based heuristic for solving 0-1 integer linear programming problems 55 4.2.2 Evaluation of an ε-NS solution .63 4.3 Computational experiments and results for biobjective problems 65 4.4 Solving the 3-objective 0-1 knapsack problem 70 4.4.1 Property of nondominated solutions to a 3-objective integer programming problem .70 4.4.2 An interactive solution approach based on LPH 75 4.4.3 Computational experiments 78 4.5 Summary and conclusions 81 Chapter 5.1 Solving the Multiobjective Generalized Assignment Problem 82 An efficient approach for solving the biobjective generalized assignment problem 83 5.1.1 Property of the generalized assignment problem 86 5.1.2 An LP-based heuristic for solving the biobjective generalized assignment problem 89 5.1.3 Size of subproblem P(5.3) 92 5.1.4 Evaluation of an ε-NS solution .96 5.1.5 Solution strategies 96 5.2 Computational experiments and results 102 5.3 Summary and conclusions 110 Chapter Conclusions 111 References 117 III Nomenclature R The set of real numbers X Feasible region Z Feasible outcome region CKP Continuous knapsack problem DM Decision maker ENS Extreme nondominated solution LP Linear programming LPH LP-based heuristic CV Cardinality of the expanded FreeSet MT Maximum number of trials T Turning point ε-NS solution ε-Nondominated solution δ-NS solution δ-representative nondominated solution f i (x) i-th objective function ε, δ A small positive value q A positive value or equal to ∞ λ A positive vector with component λi cj Attribute value of item j wj Weight of item j W Capacity of the knapsack c kj The k-th attribute value of item j p ijk The k-th attribute value of item j if it is assigned to knapsack i wij Weight of item j if it is assigned to knapsack i ci Capacity of knapsack i zk The k-th objective Z LP Optimal solution to a linear programming problem FreeSet The set containing all free variables OneSet The set containing all the variables having value ZeroSet The set containing all the variables having value IV List of Illustrations • Figures Figure 3.1 An illustration of the two ENS’s to a biobjective integer programming problem Figure 3.2 Flowchart of the procedure in Section 3.3.1 Figure 3.3 Flowchart of the approach described in Section 3.3.2 Figure 3.4 Number of variables versus average number of nondominated solutions Figure 3.5 Number of variables versus time taken to generate all nondominated solutions Figure 3.6 Number of variables versus average time used to generate each nondominated solution Figure 3.7 A plot of nondominated solutions to a typical problem instance with 150 variables Figure 3.8 A plot of the 101 0.01-NS solutions (100 intervals) to a typical problem instance with 10000 variables Figure 3.9 A plot of the 51 0.01-NS solutions (50 intervals) to a typical problem instance with 50000 variables Figure 4.1 An illustration of the LP-based heuristic Figure 4.2 Comparison of the performances of the LPH and CPLEX Figure 4.3 Performances of the 101 0.01-NS solutions generated by the LPH and CPLEX for a typical problem instance of size 100 Figure 4.4 Performances of the 101 0.01-NS solutions generated by the LPH and CPLEX for a typical problem instance of size 500 Figure 4.5 Performances of the 101 0.01-NS solutions generated by the LPH and CPLEX for a typical problem instance of size 50000 Figure 4.6 An illustration of the first typical case of the distribution of the ENS’s Figure 4.7 An illustration of the second typical case of the distribution of the ENS’s V Figure 4.8 An illustration of the first category nondominated solutions for the first typical case Figure 4.9 An illustration of the first category nondominated solutions for the second typical case Figure 4.10 An illustration of the small squares in the interactive approach Figure 4.11a Generated approximate nondominated frontier to a 3-objective problem instance of size 1000 Figure 4.11b Generated approximate nondominated frontier to a 3-objective problem instance of size 1000 Figure 4.12a Generated approximate nondominated frontier to the LP relaxation of a 3-objective problem instance of size 1000 Figure 4.12b Generated approximate nondominated frontier to the LP relaxation of a 3-objective problem instance of size 1000 Figure 5.1 ε-NS solutions generated by LPH with the first strategy Figure 5.2 An illustration of the searching process of the first strategy Figure 5.3 An illustration of the searching process of the second strategy Figure 5.4 ε-NS solutions generated by LPH with the second strategy Figure 5.5 An illustration of the searching process of the third strategy Figure 5.6 ε-NS solutions generated by LPH with the third strategy Figure 5.7 Relationship between problem size and ε value Figure 5.8 Relationship between problem size and time use Figure 5.9 Relationship between the ratio of n to m and the ε value Figure 5.10 Generated approximate nondominated frontier for a typical problem instance of size (200×50) Figure 5.11 Generated approximate nondominated frontier for a typical problem instance of size (400×50) Figure 5.12 Generated approximate nondominated frontier for a typical problem instance of size (600×50) VI Figure 5.13 Generated approximate nondominated frontier for a typical problem instance of size (800×50) Figure 5.14 Generated approximate nondominated frontier for a typical problem instance of size (1000ì50) ã Tables Table 3.1 Computational results of generating exact nondominated solutions Table 3.2 Computational results of generating ε-NS solutions Table 3.3 Time taken to generate 101 0.01-NS solutions (100 intervals) Table 4.1 Time taken by the LPH and CPLEX to generate 101 0.01-NS solutions (100 intervals) Table 5.1a Relationship between the number of split items n2 and problem size (for problem instances of data set 1) Table 5.1b Relationship between the number of split items and problem size (for problem instances of data set 2) Table 5.1c Relationship between the number of split items and problem size (for problem instances of data set 3) Table 5.2 Summary of the computational results VII Summary This thesis is devoted to solving multiobjective zero-one integer linear programming problems Although this class of problems has been studied for many years, relative few effective solution methods have been developed in this field This study is particularly concerned with the design and development of heuristics for solving this class of problems We present some useful concepts and propose some heuristic methods for finding the ε-nondominated solutions The proposed solution method is quite simple and useful This method decomposes a multiobjective zero-one programming problem into a series of single objective problems Efficient LP-based heuristics, which capitalize on the similarity between the optimal solution of a zeroone integer linear programming problem and that of its corresponding LP problem, are employed to solve these single objective problems In particular, the proposed methods are applied to two classes of multiobjective zero-one programming problems, i.e the multiobjective zero-one knapsack problem and the multiobjective generalized assignment problem, in this study Extensive computational experiments have demonstrated that the methods we proposed are very effective for solving these classes of problems These methods can also be extended to other multiobjective zero-one programming problems, especially the other members from the family of the knapsack problems VIII Chapter Introduction ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– Chapter Introduction ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– Chapter Solving the Multiobjective Generalized Assignment Problem ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– GAP400x50_LP 39000 GAP400x50_MIP Objective2 34000 29000 24000 19000 180000 230000 280000 330000 380000 Objective1 Figure 5.11 Generated approximate nondominated frontier for a typical problem instance of size (400×50) 59000 GAP600x50_LP GAP600x50_MIP 54000 Objective2 49000 44000 39000 34000 29000 295000 345000 395000 445000 495000 545000 595000 Objective1 Figure 5.12 Generated approximate nondominated frontier for a typical problem instance of size (600×50) ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 108 Chapter Solving the Multiobjective Generalized Assignment Problem ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– GAP800x50_LP GAP800x50_MIP 76000 71000 Objective2 66000 61000 56000 51000 46000 41000 400000 450000 500000 550000 600000 650000 700000 750000 Objective1 Figure 5.13 Generated approximate nondominated frontier for a typical problem instance of size (800×50) GAP1000x50_LP 95000 GAP1000x50_MIP 90000 85000 Objective2 80000 75000 70000 65000 60000 55000 50000 490000 540000 590000 640000 690000 740000 790000 840000 890000 940000 990000 Objective1 Figure 5.14 Generated approximate nondominated frontier for a typical problem instance of size (1000×50) ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 109 Chapter Solving the Multiobjective Generalized Assignment Problem ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 5.3 Summary and conclusions In this chapter, we propose an efficient approach based on an LPH algorithm to solve the biobjective generalized assignment problem It is shown that this approach is able to generate a good approximation of the nondominated frontier to a large biobjective generalized assignment problem in a short time The successful computational results demonstrate the high efficiency of the proposed approach and the LPH algorithm The method looks simple, but it is able to provide very efficient and helpful results for the DM ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 110 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 111 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– In this thesis, we attempt to tackle the multiobjective zero-one programming problems, which imply linear constraints, linear objective functions, and binary decision variables Although the study of this class of problems occurred in the 1970s, not too many effective techniques or methods have been developed to solve them In view of this, we aim to contribute some new ideas and techniques to this field in this study Firstly, we introduced three concepts of ε-Nondominated Solution, Extreme Nondominated Solution and δ-representative Nondominated Solution for solving multiobjective integer programming problems These concepts have proved to be very helpful for the solution of these problems The concept of ε-Nondominated Solution is a natural extension of the ε-optimality concept within the single objective optimization context The concept of Extreme Nondominated Solution helps to effectively restrict the searching region and facilitate the solution of multiobjective integer programming problems The concept of δ-representative Nondominated Solution reflects the characteristic of the generated nondominated solutions We also proposed a simple and useful approach for generating a good approximation to the nondominated set of multiobjective integer programming problems The basic idea underlying this approach is to divide the feasible outcome region into some smaller sub-regions and focus on one of them at a time In this way, a multiobjective integer programming problem can be converted into a series of single objective problems, which makes the solution process much easier Therefore, we don’t have to ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 112 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– tackle a multiobjective integer programming problem directly, but rather we can solve it through solving a series of single objective integer programming problems This research is particularly concerned with the two multiobjective 0-1 programming problems: the multiobjective 0-1 knapsack problem and the multiobjective generalized assignment problem They are the multiobjective versions of the two classical NP-hard problems: the 0-1 knapsack problem and the generalized assignment problem, respectively We proposed an efficient LP-based heuristic to solve each of them These LPH algorithms are based on the particular properties exhibited by these two classes of problems, i.e the strong similarity between the optimal solution of a 0-1 integer linear programming problem and that of its LP relaxation problem Although we did not prove this similarity from a theoretical point of view in this study, it does seem to imply some underlying theoretical necessity As a result, one of the further extensions of this work is to verify this empirically observed property For the multiobjective 0-1 knapsack problem, we have tackled both the biobjective case and 3-objective case But for the multiobjective generalized assignment problem, only the biobjective case has been addressed However, the proposed approach is easily extended to the 3-objective case in the same manner as the 0-1 knapsack problem Although we have only addressed two classes of problems with the approaches developed in this study, according to our experience they are applicable or extendable to the other members of the family of knapsack problems, including the bounded knapsack problem, the subset-sum problem, the change-making problem, the 0-1 multiple knapsack problem, and the bin-packing problem For more detailed ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 113 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– information of the family of knapsack problem, readers are referred to Martello and Toth (1990) The high efficiency of the proposed approach and the LP-based heuristic algorithms is demonstrated through extensive computational experiments The results of our computational experiments are superior to those reported in the open literature, either in terms of the time consumption or the quality of the generated solutions or even both Furthermore, this research is the first attempt to extend the classical generalized assignment problem to the multiobjective context and propose efficient and effective solution to solve it, to our knowledge This research, among other things, also proposes the three criteria proximity, uniformity and coverage to evaluate the quality of the generated approximation to the nondominated frontier to a multiobjective integer programming problem They reflect the quality information in three different respects Consequently, the integration of them is able to reflect the comprehensive information regarding the quality of the approximation For a method to be used it should be not only easy to use, but meaningful and provide helpful results (Zionts, 1992) Our methods live up to these requirements They are characterized by the ease to use and understand, requiring little input from the DM, and providing very efficient and helpful results These properties are greatly desired in practice As a result, they provide the practitioners with a good way to tackle the multiobjective integer programming problems ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 114 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– Certainly, every approach has its limitations The approaches proposed in this study are not exceptional One of the limitations of the LPH algorithm for solving multiobjective 0-1 knapsack problem is that the determination of some parameters such as CV has to be based on experience Likewise, one of the limitations of proposed approaches lies in the fact that the position of the turning point T and the positions of the overlap T1 and T2 have to be determined empirically as well As a result, further studies on these issues could be worthwhile In addition, three further extensions to this work are possible The first one is to verify the empirically observed property of close similarity between the optimal solution to the 0-1 knapsack problem, generalized assignment problem and other knapsack problems and the optimal solution to their respective LP relaxation problem from a theoretical point of view The second one is to extend the proposed methods to some other multiobjective integer programming and combinatorial optimization problems The third one is to develop some other heuristic or exact approaches to solve the subproblem P(5.3), in place of relying on CPLEX, and compare the performances The contributions of this study are briefly summarized as follows: We have proposed three concepts of ε-Nondominated Solution, Extreme Nondominated Solution and δ-representative Nondominated Solution that have proven very useful for solving multiobjective integer programming problems ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 115 Chapter Conclusions ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– We have developed a methodological framework to solve multiobjective integer programming and combinatorial optimization problems, which converts a multiobjective problem into a series of single-objective problems according to the necessity of the decision maker We have proposed an efficient and effective method for solving multiobjective 0-1 knapsack problems We have proposed an efficient and effective method for solving biobjective generalized assignment problems We also have proposed the three criteria proximity, uniformity and coverage to evaluate the quality of the generated approximation to the nondominated frontier to a multiobjective integer programming problem ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 116 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– References Aksoy Y (1990) An Interactive Branch-and-Bound Algorithm for Bicriteria Nonconvex/Mixed Integer Programming, Naval Research Logistics 37, 403417 Alves M.J., Climaco J (1999) Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems European Journal of Operational Research 117, 565-577 Alves M.J., Climaco J (2000a) An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound European Journal of Operational Research 124, 478-494 Alves M.J., Climaco J (2000b) An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search Journal of Heuristics 6, 385-403 Amini M.M., Racer M (1995) A hybrid heuristic for the generalized assignment problem European Journal of Operational Research 87, 343-348 Cattrysse D., Degraeve A., Tistaert J (1998) Solving the generalized assignment problem using polyhedral results European Journal of Operational Research 108, 618-628 Chu P.C., Beasley J.E (1997) A genetic algorithm for the generalized assignment problem Computers & Operations Research 24 (1), 17-23 Czyzak P., Jaszkiewicz A (1998) Pareto Simulated Annealing A Metaheuristic Technique for Multiple-Objective Combinatorial Optimization Journal of Multi-Criteria Decision Analysis 7, 34-47 Deckro R.F., Winkofsky E.P (1983) Solving zero-one multiple objective programs through implicit enumeration European Journal of Operational Research 12, 362-374 10 Diaz J.A., Fernandez E (2001) A tabu search heuristic for the generalized assignment problem European Journal of Operational Research 132, 22-38 11 Ehrgott M., Gandibleux X (2000) A survey and annotated bibliography of multiobjective combinatorial optimization OR Spektrum 22, 425-460 ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 117 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 12 El-Gayar O.F., Leung P.S (2001) A multiple criteria decision making framework for regional aquaculture development European Journal of Operational Research 133, 462-482 13 Erlebach T., Kellerer H., Pferschy U (2001) Approximating multiobjective knapsack problems in: F Dehne, J.R Sack, and R Tamassia (eds.): Algorithms and data structures : 7th International Workshop proceedings, WADS 2001, Providence, RI, USA 14 Evans G.W (1984) An Overview of Techniques for Solving Multiobjective Mathematical Programs Management Science 30(1), 1268-1282 15 Gabbani D., Magazine M (1986) An Interactive Heuristic Approach for MultiObjective Integer-Programming Problems The Journal of the Operational Research Society 37(3), 285-291 16 Gandibleux X., Freville A (2000) Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objective case Journal of Heuristics 6, 361-383 17 Gavish B., Pirkul H (1991) Algorithms for the multi-resource generalized assignment problem Management Science 37 (6), 695-713 18 Hapke M., Jaszkiewicz A., Slowinski R (1998) Interactive analysis of multiple-criteria project scheduling problems European Journal of Operational Research 107, 315-324 19 Higgins A.J (2001) A dynamic tabu search for large-scale generalized assignment problems Computers & Operations Research 28, 1039-1048 20 Isermann H (1974) Proper efficiency and the linear vector maximum problem Operations Research 22(1), 189-191 21 Jaikumar R., Fisheries B (1973) “A heuristic 0-1 algorithm with multiple objectives and constraints”, in: J.L Cochrane and M Zeleny (eds.), Multiple Criteria Decision Making, University of South Carolina Press, 745-748 22 Jones D.F., Mirrazavi S.K., Tamiz M (2002) Multiobjective metaheuristics: An overview of the current state-of-the-art European Journal of Operational Research 137, 1-9 23 Karasakal E.K., Koksalan M (2000) A simulated annealing approach to bicriteria scheduling problems on a single machine Journal of Heuristics 6, 311-327 24 Kiziltan G., Yucaoglu E (1983) An algorithm for multiobjective zero-one linear programming Management Science 29 (12), 1444-1453 ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 118 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 25 Klein D., Hannan E (1982) An algorithm for the multiple objective integer linear programming problem European Journal of Operational Research 9, 378-385 26 Laguna M., Kelly J.P., Gonzalez-Velarde J.L., Glover F (1995) Tabu search for the multilevel generalized assignment problem European Journal of Operational Research 82, 176-189 27 LeBlanc L.J., Shtub A., Anandalingam G (1999) Formulating and solving production planning problems European Journal of Operational Research 112, 54-80 28 Lee H., Shi Y., Nazem S.M., Kang S.Y., Park T.H., Sohn M.H (2001) Multicriteria hub decision making for rural area telecommunication networks European Journal of Operational Research 133, 483-495 29 Li J., Shi Y (2001) An integer linear programming problem with multi-criteria and multi-constraint levels: a branch-and-partition algorithm International Transactions in Operational Research 8, 497-509 30 Lourenco H.R., Paixao J.P., Portugal R (2001) Multiobjective metaheuristics for the bus driver scheduling problem Transportation Science 35 (3), 331-343 31 Lova A., Maroto C., Tormos P (2000) A multicriteria heuristic method to improve resource allocation in multiproject scheduling European Journal of Operational Research 127, 408-424 32 Marcotte O., Soland R.M (1986) An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization Management Science 32(1), 61-75 33 Marett R., Wright M (1996) A comparison of neighborhood search techniques for multi-objective combinatorial problems Computers & Operations Research 23 (5), 465-483 34 Martello S., Toth P (1990) Knapsack Problems: Algorithm and Computer Implementations, New-York: John Wiley & Sons 35 Metev B.S., Yordanova-Markova I.T (1997) Multiobjective optimization over convex disjunctive feasible sets using reference points European Journal of Operational Research 98, 124-137 36 Narciso M.G., Lorena L.A (1999) Lagrangean/surrogate relaxation for generalized assignment problems European Journal of Operational Research 114, 165-177 ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 119 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 37 Nowakovski J., Schwarzler W., Triesch E (1999) Using the generalized assignment problem in scheduling the ROSAT space telescope European Journal of Operational Research 112, 531-541 38 Pasternak H., Passy U (1973) “Bicriterion mathematical programs with boolean variables”, in: J.L Cochrane and M Zeleny (eds.), Multiple Criteria Decision Making, University of South Carolina Press, 327-348 39 Pirkul H (1986) An integer programming model for the allocation of databases in a distributed computer system European Journal of Operational Research 26 (3), 401-411 40 Ramesh R., Zionts S., Karwan M.H (1986) A class of practical interactive branch and bound algorithms for multicriteria integer programming European Journal of Operational Research 26, 161-172 41 Ramesh R., Karwan M.H., Zionts S (1989) Preference structure representation using convex cones in multicriteria integer programming Management Science 35(9), 1092-1105 42 Ramesh R., Karwan M.H., Zionts S (1990) An interactive method for bicriteria integer programming IEEE Transaction on Systems, Man, and Cybernetics 20(2), 395-403 43 Rasmussen L.M (1986) Zero-one programming with multiple criteria European Journal of Operational Research 26, 83-95 44 Reeves C (1995) Modern Heuristic Techniques for Combinatorial Problems McGraw-Hill, New York, 1995 45 Romeijn H.E., Morales D.R (2000) A class of greedy algorithms for the generalized assignment problem Discrete Applied Mathematics 103, 209-235 46 Ross G.T., Soland R.M (1977) Modeling facility location problems as generalized assignment problems Management Science 24, 345-357 47 Shtub A., Kogan K (1998) Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP) European Journal of Operational Research 105, 91-99 48 Steuer R.E (1986) Multiple Criteria Optimization: Theory, Computation, and Application John Wiley & Sons 49 Tamura H., Shibata T., Tomiyama S., Hatono I (1999) A metaheuristic satisficing tradeoff method for solving multiobjective combinatorial optimization problems Systems, Man, and Cybernetics, 1999 IEEE SMC '99 Conference Proceedings, 539 -544 ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 120 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 50 Teghem J., Kunsch P.L (1986a) A survey of techniques for finding efficient solutions to multiobjective integer linear programming Asia-Pacific Journal of Operational Research 3, 95-108 51 Teghem J., Kunsch P.L (1986b) “Interactive methods for multi-objective integer linear programming”, in: Fandel, G., Graver, M., Kurzhanski, Wierzbicki (eds.), Lecture Notes in Economics and Mathematical Systems, Vol 273, Berlin: Springer, 75-86 52 Teghem J., Tuyttens D., Ulungu E.L (2000) An interactive heuristic method for multiobjective combinatorial optimization Computers & Operations Research 27, 621-634 53 Teng J.Y., Tzeng G.H (1996) A multiobjective programming approach for selecting non-independent transportation investment alternatives Transportation Research Part B 30 (4), 291-307 54 Tuyttens D., Teghem J., Fortemps P.H., Nieuwenhuyze K.V (2000) Performance of the MOSA method for the bicriteria assignment problem Journal of Heuristics 6, 295-310 55 Ulungu E.L., Teghem J (1994) Solving multi-objective knapsack problem by a branch-and-bound procedure, in: Climaco Joao (ed), Multicriteria Analysis., 11th Inter Conf MCDM 1994: Coimbra, Portugal, 269-278 56 Ulungu E.L., Teghem J (1995) The two-phases method: An efficient procedure to solve biobjective combinatorial optimization problems Foundations of Computing and Decision Sciences 20 (2), 149-165 57 Ulungu E.L., Teghem J., Fortemps P.H., Tuyttens D (1999) MOSA method: A tool for solving multiobjective combinatorial optimization problems Journal of Multi-Criteria Decision Analysis 8, 221-236 58 Vassilev V., Narula S.C (1993) A reference direction algorithm for solving multiple objective integer linear programming problems The Journal of the Operational Research Society 44(12), 1201-1209 59 Vassilev V.S., Narula S.C., Gouljashki V.G (2001) An interactive reference direction algorithm for solving multiobjective convex nonlinear integer programming problems International Transactions in Operational Research 8, 367-380 60 Viana A., Sousa J.P (2000) Using metaheuristics in multiobjective resource constrained project scheduling European Journal of Operational Research 120, 359-374 ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 121 References ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 61 Visee M., Teghem J., Pirlot M., Ulungu E.L (1998) Two-phase method and branch and bound procedures to solve the bi-objective knapsack problem Journal of Global Optimization 12, 139-155 62 White D.J (1985) A multiple objective interactive Lagrangean relaxation approach European Journal of Operational Research 19, 82-90 63 White D.J (1990) A bibliography on the applications of mathematical programming multiple-objective methods The Journal of the Operational Research Society 41 (8), 669-691 64 Yan S., Huo C.M (2001) Optimization of multiple objective gate assignments Transportation Research Part A 35, 413-432 65 Yu Po-Lung (1985) Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions Plenum Press: New York 66 Zhang C.W., Ong H.L (2003) Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic, to appear in European Journal of Operational Research 67 Zhang C.W., Ong H.L (2003) Solving the biobjective generalized assignment problem by an efficient LP-based heuristic, to appear in Naval Research Logistics 68 Zionts Stanley (1979) A survey of multiple criteria integer programming methods Annals of Discrete Mathematics 5, 389-398 69 Zionts Stanley (1992) Multiple Criteria Decision Making: The challenge that lies ahead, Proceedings of the 10th International Conference on Multiple Criteria Decision Making, 1992: Taipei, Taiwan ––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––––– 122 ... usual Lagrangean and surrogate relaxations The Lagrangean/surrogate relaxation relaxes first a set of constraints in a surrogate way; and then the Lagrangean relaxation of the surrogate constraint... competitive and thus can not be attained optimally at the same time As a result, the concept of Nondominated Solution is adopted in the area of multiobjective mathematically programming Usually a multiobjective. .. the research in the area of multiobjective combinatorial optimization and presented an extensive annotated bibliography of it Jones, Mirrazavi and Tamiz (2002) gave an overview of the articles