Abstract
The paper presents a multiple objective metaheuristic procedure -Pareto Simulated Annealing. The goal of the procedure is to find in a relatively short time a “good” approximation of the set of efficient solutions of a multiple objective combinatorial optimization problem. The procedure uses a sample of generating solutions. Each of the solutions explores its neighborhood in a way similar to that of classical simulated annealing. Weights of the objectives are set in each iteration in order to assure a tendency to approach the efficient solutions set while maintaining a uniform distribution of the generating solutions over this set.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Assad, A.A.: “Modelling and implementation issues in vehicle routing”. In: B.L. Golden, A.A. Assad (eds.): Vehicle routing: Methods and Studies, North-Holland, Amsterdam 1988, pp. 7–46.
Cerny V.: A thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm, Report, Comenius University, Bratislava, Czechoslovakia 1982.
Charnes A. and Cooper W.W. (1977), Goal programming and multiple objective optimizations, part 1. Eur. J. Opl Res. 1 (1977).
Corner J.L., J.T. Buchanan: Experimental consideration of references in decision making under certainty: further evidence. XIth International Conference on Multiple Criteria Decision Making, Coimbra, Portugal, 1-6.08.1994, Coimbra 1994.
Current J., M. Marsh: Multiobjective transportation network design and routing problems: taxonomy and annotation. Eur. J. Opl Res. 65 (1993) 1–15.
Finkel R.A., J.L. Bentley: Quad Trees, A data structure for retrieval on composite keys. Acta Informatica 4 (1974) 1–9.
Fortemps P., J. Teghem, B. Ulungu: Heuristics for multiobjective combinatorial optimization by simulated annealing, XI-th International Conference on Multiple Criteria Decision Making, Coimbra, Portugal, 1-6.08.1994, Coimbra 1994.
Garey M., D. Johnson: Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco 1979.
Glover F.: Tabu Search — Part I, ORSA J. Comput. 1 (1989) 190–206.
Goldberg D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachuset etc. 1988.
Habenicht W.: Quad Trees, A datastructure for discrete vector optimization problems. In: P Hansen (ed.): Essays and Surveys on Multiple Criteria Decision Making. Proc. of the Fifth International Conference on MCDM, Mons, Belgium, August 9-13, 1982, Lecture Notes in Economics and Mathematical Systems, 209, Springer-Verlag, Berlin etc. 1982, pp. 136–145.
Hwang C.-L., S.R. Paidy, K. Yoon, A.S.M. Masud: Mathematical programming with multiple objectives: A tutorial. Comput. Oper. Res. 7 (1980) 5–31.
Ignizio J.P.: Goal programming and Extensions. Lexington Books, Massachusetts 1976.
Keeney R.L., H. Raiffa: Decisions with Multiple Objectives: Preferences and Value Tradeoffs, John Wiley & Sons, New York 1976.
Kirkpatrick S., C.D. Gelatt, M.P. Vecchi: Optimization by simulated annealing, Science 220 (1983) 671–680.
Laarhoven P.J.M., E.H.L. Aarts: Simulated Annealing: Theory and Applications, Reidel, Dordrecht 1987.
Lee S.M.: Goal programming for decision analysis. Auerbach Publishers, Philadelphia, Pennsylvania 1972.
Nemhauser D.L., L.H. Wolsey: Integer and Combinatorial Optimization, Wiley, Chichester 1988.
Rosenthal R.E.: Principles of multiobjective optimization. Decision Sciences 16(1985) 133–152.
Roy B., D. Bouyssou: Aide Multicritčre ŕ la Décision: Méthodes et Cas. Economica, Paris 1993.
Schaffer J.D.: Some experiments in machine learning using vector evaluated genetic algorithms. Doctoral dissertation, Vanderbilt University, Electrical Engineering, Tenessee 1984.
Słowiński R.: Multiobjective network scheduling with efficient use of renewable and non renewable resources. Eur. J. Opl Res. 7 (1981) 265–273.
Słowiński R.: Overview of multiple objective mathematical programming methods. Part I (In Polish). Przegląd Statystyczny XXXI (1984) 47–63.
Słowiński R.: “Multiobjective project scheduling under multiple-category resource constraint”. In: R. Słowiński, J. Węglarz (eds.): Advances in Project Scheduling, Elsevier, Amsterdam 1989, pp. 151–167.
Srinivas R, K. Deb: Multiobjective optimization using nondominated sorting in genetic algorithms. Proceedings of IEEE World Congress on Computational Intelligence, 26.06-02.07.1994, Orlando, Orlando 1994.
Steuer R.E.: Multiple Criteria Optimization — Theory, Computation and Application, Wiley, New York 1986.
Ulungu EX., J. Teghem: Multi-ojective Combinatorial Optimization Problems: A Survey. Journal of Multi-Criteria Decision Analysis 3 (1994) 83–101.
White DJ.: A bibliography on the applications of mathematical programming multiple-objective methods. J. Opl Res. Soc. 41 (1990) 669–691.
Wierzbicki A.P.: On the completeness and constructiveness of parametric characterization to vector optimization problems. OR Spectrum 8 (1986) 73–87.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czyżak, P., Jaszkiewicz, A. (1997). Pareto Simulated Annealing. In: Fandel, G., Gal, T. (eds) Multiple Criteria Decision Making. Lecture Notes in Economics and Mathematical Systems, vol 448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59132-7_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-59132-7_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62097-6
Online ISBN: 978-3-642-59132-7
eBook Packages: Springer Book Archive