MOSA method: A tool for solving multiobjective combinatorial optimization problems

Journal of Multi-Criteria Decision Analysis

Volumn 8, Issue 4, 1999, Pages 221-236

  Ulungu, E L ^a   Teghem, J ^a   Fortemps, P H ^a   Tuyttens, D ^a  

^a FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

Author keywords

Combinatorial; Knapsack; Multiobjective; Simulated annealing (SA)

Indexed keywords

EID: 0001131837     PISSN: 10579214     EISSN: 10991360     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1360(199907)8:4<221::AID-MCDA247>3.0.CO;2-O     Document Type: Article

References (14)

1. Czyzak, P., Hapke, M., and Jaszkiewicz, A., ‘Application of the pareto-simulated annealing to the multiple criteria shortest path problem’, Technical report, Politechnika Poznanska Instytut informatyki, 1994.
2. Czyzak, P., and Jaszkiewicz, A., ‘Pareto simulated annealing-a meta-heuristic technique for multiple objective combinatorial optimization’, J. Multi-Criteria Decision Anal., 7, 34-47 (1998).
3. Fonseca., C., and Fleming, P., ‘An overview of evolutionary algorithms in multiobjective optimization’, Evol. Comput., 3, 1-16 (1995).
4. Martello, S., and Toth, P., Algorithms for knapsack problems, in Martello, S., Laporte, G., Minoux, M. and Ribeiro, C. (eds), Surveys in Combinatorial Optimization, Vol. 31 of Annals of Discrete Mathematics, North-Holland, 1987, pp. 213-257.
5. Martello, S., and Toth, P., Knapsack Problems: Algorithms and Computer implementations, John Wiley and Sons, Chichester, 1990.
6. Pirlot, M., ‘General local search methods’, Eur. J. Oper. Res., 92, 493-511 (1996).
7. Serafini, P., Mathematics of Multiobjective Optimization, Vol. 289 of CISM Courses and Lectures, Springer-Verlag, Berlin, 1985.
8. Ulungu, E.L., ‘Optimisation Combinatoire Multicritère: Détermination de l’ensemble des solutions efficaces et méthodes interaetives’, PhD thesis, Université de Mons-Hainaut., 1993.
9. Ulungu, E.L., and Teghem, J., ‘Multiobjective combinatorial optimization problems: A survey’, J. Multicriteria Decision Anal., 3, 83-104 (1994).
10. Ulungu, E.L., and Teghem, J., ‘The two phase method: An efficient procedure to solve bi-objective combinatorial optimization problems’, Found. Comput. Decis. Sci., 20, 149-165 (1995a).
11. Ulungu, E.L., Teghem, J., and Fortemps, P., ‘Heuristic for multiobjective combinatorial optimization problems by simulated annealing’, in Gu, J., Chen, G., Wei, Q. and Wang, S. (eds), MCDM: Theory and Applications 1995, Sci-Tech, Windsor, 1995b, pp. 229-238.
12. Ulungu, E.L., and Teghem, J., ‘Solving multiobjective knapsack problem by a branch-and-bound procedure’, in Climaco, J. (ed), Multicriteria Analysis, Berlin: Springer-Verlag, 1997, pp. 269-278.
13. Ulungu, E.L., Teghem, J., and Ost, C., ‘Interactive simulated annealing in a multiobjective framework: application to an industrial problem’, J. Oper. Res. Soc., 49, 1044-1050 (1998).
14. Visée, M., Teghem, J., Pirlot, M., and Ulungu, E.L., ‘Two-phases method and branch and bound to solve bi-objective knapsack problem’, J. Glob. Optim., 12, 139-155 (1998).