Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization

Journal of Multi-Criteria Decision Analysis

Volumn 7, Issue 1, 1998, Pages 34-47

  Czyzżak, Piotr ^a   Jaszkiewicz, Adrezej ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Metaheuristic procedures; Multiple objective combinatorial optimization

Indexed keywords

EID: 85018104842     PISSN: 10579214     EISSN: 10991360     Source Type: Journal    
DOI: 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6     Document Type: Article

References (30)

1. Assad, A. A., ‘Modelling and implementation issues in vehicle routing’, inGolden, B. L. andAssad, A. A. (eds.), Vehicle Routing: Methods and Studies, Amsterdam:North-Holland, 1988, pp. 7-46.
2. Cerny, V., ‘A thermodynamical approach to the travelling salesman problem: an efficient simulation algorithm’, J. Opt. Theory Appl., 45, 41-51(1985).
3. Charnes, A., and Cooper, W. W., ‘Goal programming and multiple objective optimizations, Part 1', Eur. J. Oper. Res., 1, 39-54(1977).
4. Corner, J. L., and Buchanan, J. T., ‘Experimental consideration of references in decision making under certainty: further evidence, ‘Proc. XIth Int. Conf. on Multiple Criteria Decision Making, University of Coimbra, Portugal, August 1994.
5. Current, J., and Marsh, M., ‘Multi objective transportation network design and routing problems: taxonomy and annotation’, Eur. J. Oper. Res., 65, 1-15(1993).
6. Finkel, R. A., and Bentley, J. L., ‘Quad trees, a data structure for retrieval on composite keys’, Acta Info., 4, 1-9(1974).
7. Fonseca, C. M., and Fleming, P. J., ‘An overview of evolutionary algorithms in multi objective optimization’, Evolut. Comput., 3, 1-16(1995).
8. Fortemps, P., Teghem, J., and Ulungu, B., ‘Heuristics for multiobjective combinatorial optimization by simulated annealing’, Proc. XIth Int. Conf. on Multiple Criteria Decision Making, University of Coimbra, Portugal, August 1994.
9. Garey, M., and Johnson, D., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco, CA:Freeman, 1979.
10. Glover, F., ‘Tabu search-Part I’, ORSA J. Comput., 1, 190-206(1989).
11. Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, Reading, MA:Addison-Wesley, 1988.
12. Habenicht, W., ‘Quad trees, a datastructure for discrete vector optimization problems’, Lect. Notes Econ. Math. Syst., 209, 136-145(1982).
13. Keeney, R. L., and Raiffa, H., Decisions with Multiple Objectives: Preferences and Value Tradeoffs, New York:Wiley, 1976.
14. Kirkpatrick, S., Gelatt, C. D., and Vecchi, M. P., ‘Optimization by simulated annealing’, Science, 220, 671-680(1983).
15. Laarhoven, P. J. M., and Aarts, E. H. L., Simulated Annealing: Theory and Applications, Dordrecht:Reidel, 1987.
16. Nemhauser, D. L., and Wolsey, L. H., Integer and Combinatorial Optimization, Chichester:Wiley, 1988.
17. Pirlot, M., ‘General local search heuristics in combinatorial optimization: a tutorial’, Belg. J. Oper. Res., Stat. Comput. Sci, 32, 7-67(1993).
18. Rosenthal, R. E., ‘Principles of multi objective optimization’, Decis. Sci., 16, 133-152(1985).
19. Roy, B., and Bouyssou, D., Aide Multicritere a la Decision: Methodes et Cas, Paris:Economica, 1993.
20. Schaffer, J. D., ‘Some experiments in machine learning using vector evaluated genetic algorithms’, Doctoral Dissertation, Vanderbilt University, 1984.
21. Serafini, P., ‘Simulated annealing for multiple objective optimization problems’, inTzeng, G. H., Wang, H. F., Wen, V. P. andYu, P. L. (eds), Multiple Criteria Decision Making. Expand and Enrich the Domains of Thinking and Application, New York:Springer, 1992, pp. 283-292.
22. Slowiski, R., ‘Multiobjective network scheduling with efficient use of renewable and non renewable resources’, Eur. J. Oper. Res., 7, 265-273(1981).
23. Slowiski, R., ‘Multiobjective project scheduling under multiple-category resource constraint’, inSlowiski, R. andWeglarz, J. (eds), Advances in Project Scheduling, Amsterdam:Elsevier, 1989, pp. 151-167.
24. Srinivas, N., and Deb, K., ‘Multiobjective optimization using nondominated sorting in genetic algorithms’, Evolut. Comput., 2, 221-248(1994).
25. Steuer, R. E., Multiple Criteria Optimization-Theory, Computation and Application, New York:Wiley, 1986.
26. Ulungu, E. L., and Teghem, J., ‘The multi-objective shortest path problem: a survey’, inČern, M., Gluckaufová, D. andLoula, D. (eds), Proc. Int. Workshop ‘Multicriteria Decision Making Methods-Algorithms-Applications’, Liblice, 1991, pp. 176-188.
27. Ulungu, E. L., and Teghem, J., ‘Multi-objective combinatorial optimization problems: a survey’, J. Multi-Crit. Beds. Anal., 3, 83-101(1994).
28. Ulungu, E. L., and Teghem, J., ‘The two phases method: an efficient procedure to solve bi-objective combinatorial optimization problems’, Found. Comput. Decis. Sci, 20, 149-165(1995).
29. White, D. J., ‘A bibliography on the applications of mathematical programming multiple-objective methods’, J. Oper. Res. Soc., 41, 669-691(1990).
30. Wierzbicki, A. P., ‘On the completeness and constructiveness of parametric characterization to vector optimization problems’, OR Spectrum, 8, 73-87(1986).