An overview of heuristic solution methods

Journal of the Operational Research Society

Volumn 55, Issue 9, 2004, Pages 936-956

  Silver, E A ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Heuristics; Methodology; OR education

Indexed keywords

DECISION MAKING; HEURISTIC METHODS; MANAGEMENT SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING;

DECISION PROBLEMS; HEURISTIC SOLUTION METHODS; LARGE SCALE PROBLEMS;

OPERATIONS RESEARCH;

EID: 4344570205     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601758     Document Type: Review

References (162)

1. Ackoff RL (1977). Optimization + objectivity = opt out. Eur J Opl Res 1: 1-7.
2. Müller-Merbach H (1981). Heuristics and their design: a survey. Eur J Opl Res 8: 1-23.
3. Clayson J (1984). Micro-operational research: a simple modeling tool for managers. In: Richardson J (ed). Models of Reality. Lomond, Mt Airy, MD, Chapter 16.
4. Lenat DB (1982). The nature of heuristics. Artif Intell 19: 189-249.
5. Foulds LR (1983). The heuristic problem-solving approach. J Opl Res Soc 34: 927-934.
6. Zanakis SH, Evans JR and Vazacopoulos AA (1989). Heuristic methods and applications: a categorized survey. Eur J Oper Res 43: 88-110.
7. Michalewicz Z and Fogel DB (2000). How to Solve It: Modern Heuristics. Springer-Verlag: Berlin.
8. Morton TE and Pentico DW (1993). Heuristic Scheduling Systems. Wiley-Interscience: New York.
9. Reeves CR (ed) (1993). Modern Heuristic Techniques for Combinatorial Problems. Halsted Press: New York.
10. Ignizio JP (1980). Solving large-scale problems: a venture into a new dimension. J Opl Res Soc 31: 217-225.
11. Muller-Malek H, Matthys D and Nelis E (1997). Heuristics and expert-like systems. Belg J Oper Res Statist Comput Sci 27: 25-63.
12. Pinedo M and Simchi-Levi D (1996). Heuristic methods, In: Avreil M and Golany B (eds). Mathematical Programming for Industrial Engineers. Marcel Dekker, New York, pp 575-617.
13. Silver EA, Vidal RVV and de Werra D (1980). A tutorial on heuristic methods. Eur J Opl Res 5: 153-162.
14. White DJ (1990). Heuristic programming. IMA J Math Appl Business Ind 2; 173-188.
15. Zanakis SH and Evans JR (1981). Heuristic 'optimization': why, when, and how to use it. Interfaces 11(5): 84-91.
16. Churchman CW (1970). Operations research as a profession. Management Sci 17: B37-B53.
17. Eilon S (1977). More against optimization. Omega 5: 627-633.
18. Glover F (1977). Heuristics for integer programming using surrogate constraints. Decision Sci 8: 156-166.
19. Woolsey RED and Swanson HS (1975). Operations Research for Immediate Applications. Harper and Row: New York, p. 68.
20. Haessler RW (1983). Developing an industrial-grade heuristic problem-solving procedure. Interfaces 13(3): 62-71.
21. Bartholdi III JJ and Platzman LK (1988). Heuristics based on spacefilling curves for combinatorial problems in Euclidean space. Management Sci 34: 291-305.
22. Fisher ML (1980). Worst-case analysis of heuristic algorithms. Management Sci 26: 1-17.
23. Mason A, Ryan D and Panton D (1998). Integrated simulation, heuristic and optimization approaches to staff scheduling. Oper Res 46: 161-175.
24. Garey MR and Johnson DS (1979). Computers and Intractability: A Guide to the Theory of N.P. Completeness. Freeman: New York.
25. Lawler E (1976). Combinatorial Optimization. Holt Rinehart and Winston: New York.
26. Hall L (2000). Computational complexity. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer, Boston, pp 119-122.
27. Tovey CA (2002). Tutorial on computational complexity. Interfaces 32(3): 30-61.
28. Huffman KL and Padberg M (2000). Traveling salesman problem. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer, Boston, pp 849-853.
29. Kaku B (2000). Facilities layout. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer, Boston, pp 279-282.
30. Kolisch R (1999). Resource allocation capabilities of commercial project management software packages. Interfaces 29(4): 19-31.
31. Magnanti TL (2000). Network optimization. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston/Dordrecht/London, pp 555-561.
32. Bodin L (2000). Vehicle routing. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston, pp 865-870.
33. Cordeau JK, Gendreau.M, Laporte G, Potvin JY and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
34. Lustig I and Puget J-F (2000). Constraint programming. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston, pp 136-141.
35. White GM (2000). Constrained satisfaction, not so constrained satisfaction and the timetabling problem. In: Burke E and Erben W (eds). PATAT 2000: Proceedings of the Third International Conference on the Practice and Theory of Automated Timetabling, Konstanz, Germany, pp 32-47. ISBN 3-00-003866-3.
36. Jönsson H and Silver EA (1989). Common component inventory problems with a budget constraint: heuristics and upper bounds. Engrg Costs Production Econom 18: 71-81.
37. Yano CA and Lee HL (1995). Lot sizing with random yields: a review. Oper Res 43: 311-334.
38. McGill JI and van Ryzin GJ (1999). Revenue management: research overview and perspectives. Transportation Sci 33: 233-256.
39. Weatherford LR and Belobaba PP (2002). Revenue impacts of fare input and demand forecast accuracy in airline yield management. J Opl Res Soc 53: 811-821.
40. Silver EA, Pyke DF and Peterson R (1998). Inventory Management and Production Planning and Scheduling, 3rd edn. Wiley: New York.
41. Ruggiero VR (1995). The Art of Thinking, 4th edn. Harper-Collins College Publishers: New York, p. 75.
42. Baum S and Carlson R (1979). On solutions that are better than most. Omega 7: 249-255.
43. Mabert VA and Whybark DC (1977). Sampling as a solution methodology. Decision Sci 8: 167-180.
44. Bollapragada S and Morton TE (1999). Myopic heuristics for the random yield problem. Oper Res 47: 713-722.
45. Bertsekas D (2001). Dynamic Programming and Optimal Control, Vol. 2. Athena Scientific: Belmont, MA.
46. Agrawal N, Smith SA and Tsay AA (2002). Multi-vendor sourcing in a retail supply chain. Production Oper Management 11: 157-182.
47. Klassen KJ and Rohleder TR (2002). Planning for urgent clients in a dynamic, rolling horizon environment. Decision Sciences Institute 2002 Annual Meeting Proceedings, Decisions Sciences Institute, Atlanta, Georgia, pp. 2161-2166.
48. McAllister CD and Ryan SM (2000). Relative risk characteristics of rolling horizon hedging heuristics for capacity expansion. Eng Economist 45: 115-128.
49. Federgruen A and Tzur M (1999). Time-partitioning heuristics: application to one warehouse, multi-item, multi-retailer lot-sizing problems. Naval Res Logistics 46: 463-486.
50. Karp RM (1977). Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math Oper Res 2: 209-224.
51. Hax AC and Meal HC (1975). Hierarchical integration of production planning and scheduling. In: Geisler MA (ed). Logistics, Vol. 1. North-Holland, Amsterdam, pp 53-69.
52. Bitran GR and Tirupati D (1993). Hierarchical production planning. In: Graves SC, Rinnooy Kay AHG, and Zipkin PH (eds.). Logistics of Production and Inventory, Vol. 4. North Holland, Amsterdam, Chapter 10.
53. Fry TD, Cox JF and Blackstone Jr JH (1992). An analysis and discussion of the optimized production technology software and its use. Production Oper Management 1: 229-242.
54. Dixon PS and Silver EA (1981). A heuristic solution procedure for the multi-item, single-level, limited capacity, lot-sizing problem. J Oper Management 2: 23-40.
55. Polya G (1957). How to Solve It: A New Aspect of Mathematical Method. Doubleday Anchor: New York.
56. Bilde O and Vidal RVV (1973). On the connections between locations and scheduling problems. In: Johnson M and Ashour S (eds). Simulation Councils Proceedings Series, Vol. 3, No. 2. Society for Computer Simulation Internal, San Diego, CA.
57. Zufferey N (2002). Heuristiques pour les problèmes de coloration des sommets d'un graphe et d'affectation de fréquences avec polarités. Unpublished Doctoral Thesis, Institut de Mathématiques, Ecole Polytechnique Fédérale de Lausanne, Switzerland, pp 121-126.
58. Ehrhardt R (1979). The power approximation for computing (s,S) inventory policies. Management Sci 25: 777-786.
59. Ignizio JP and Burke LI (2000). Neural networks. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston, pp 569-571.
60. Cunningham P and Smyth B (1997). Case-based reasoning and scheduling: reusing solution components. Int J Production Res 35: 2947-2961.
61. Rosing KE, ReVelle CS, Rolland E, Schilling DA and Current JR (1998). Heuristic concentration and tabu search: a head to head comparison. Eur J Opl Res 104: 93-99.
62. Evans JR. (1983). A network decomposition/aggregation procedure for a class of multicommodity transportation problems. Networks 13: 197-205.
63. Geoffrion AM (1977). A priori error bounds for procurement commodity aggregation in logistics planning models. Naval Res Logistics Quart 24: 201-212.
64. Pentico DW (1994). Multistage production systems with random yield: heuristics and optimality. Int J Production Res 32: 2455-2462.
65. Rajagopalan S (2002). Make to order or make to stock: model and application. Management Sci 48: 241-256.
66. Van Roy B, Bertsekas DP, Lee Y and Tsitsiklis JN (1998). A neuro-dynamic programming approach to retailer inventory management. IEEE Trans Control 16: 1-33.
67. Silver EA and Meal HC (1973). A heuristic for selecting lot size quantities for the case of a deterministic time-varying demand rate and discrete opportunities for replenishment. Production Inventory Management J 14: 64-74.
68. Bitran GR and Yanasse HH (1984). Deterministic approximations to stochastic production problems. Oper Res 32: 999-1018.
69. Tijms HC (1986). Stochastic Modelling and Analysis: A Computational Approach. Wiley: Chichester.
70. van Houtum GJ and Zijm WHM (1991). Computational procedures for stochastic multi-echelon production systems. Int J Production Econom 23: 223-237.
71. Shore H (1999). A general solution of the preventive maintenance problem when data are right-censored. Ann Oper Res 91: 251-261.
72. Shore H (1999). Optimal solutions for stochastic inventory models when the lead-time demand distribution is partially specified, Int J Production Econom 59: 477-485.
73. Zaino Jr N and D'Errico J (1989). Optimal discrete approximations for continuous outcomes with applications in decision and risk analysis. J Opl Res Soc 40: 379-388.
74. Grossman TA, Rohleder TR and Silver EA (2000). A negotiation aid for fixed quantity contracts with stochastic demand and production. Int J Production Econom 66: 67-76.
75. Jönsson H and Silver EA (1996). Some insights regarding selecting sets of scenarios in combinatorial stochastic problems. Int J Production Econom 45: 463-472.
76. Kim K-J and Diwekar UM (2002). Hammersley stochastic annealing: efficiency improvement for combinatorial optimization under uncertainty. IIE Trans 34: 761-777.
77. Consigli G and Dempster MAH (1998). The CALM stochastic programming model for dynamic asset-liability management. Ann Oper Res 81: 131-161.
78. Agrawal A, Smith SA and Tsay AA (2002). Multi-vendor sourcing in a retail supply chain. Production Oper Management 11: 157-182.
79. Feller W (1966). An Introduction to Probability Theory and Its Applications, Vol. II. Wiley: New York, p. 355.
80. Silver EA (1974). A control system for coordinated inventory replenishment. Int J Production Res 12: 647-671.
81. Whitt W (1993). Approximations for the GI/G/m queue. J Production Oper Management 2: 114-161.
82. Suri R and de Treville S (1991). Full speed ahead. OR/MS Today 18(3): 34-42.
83. Silver EA (1976). A simple method of determining order quantities in joint replenishments under deterministic demand. Management Sci 22: 1351-1361.
84. Fisher ML and Jaikumar R (1981). A generalized assignment heuristic for vehicle routing. Networks 11: 109-124.
85. Bertsimas D and Demir R (2002). An approximate dynamic programming approach to multidimensional knapsack problems. Management Sci 48: 550-565.
86. Patterson R and Rolland E (2003). The cardinality constrained covering traveling salesman problem. Comput Oper Res 30: 97-116.
87. Dominguez-Ballesteras B, Mitra G, Lucas C and Koutsoukis N-S (2002). Modelling and solving environments for mathematical programming (MP): a status review and new directions. J Oper Res Soc 53: 1072-1092.
88. Beasley JE (1993). Lagrangian relaxation. In: Reeves CR (ed). Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, New York, Chapter 9.
89. Fisher ML (1985). An applications oriented guide to lagrangian relaxation. Interfaces 15(2): 10-21.
90. Golden B, Bodin L, Doyle T and Stewart Jr W (1980). Approximate traveling salesman algorithms. Oper Res 28: 694-711.
91. Atkinson JB (1994). A greedy look-ahead heuristic for combinatorial optimization: an application to vehicle scheduling with time windows. J Oper Res Soc 45: 673-684.
92. Armour GC and Buffa ES (1963). A heuristic algorithm and simulation approach to relative location of facilities. Management Sci 9: 294-300.
93. Lin S and Kernighan BW (1973). An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21: 498-516.
94. Box GEP and Voule PV (1955). The exploration and exploitation of response surfaces: an example of the link between the fitted surface and the basic mechanism of the system. Biometric 11: 287-323.
95. Glover F (1990). Tabu search: a tutorial. Interfaces 20(4): 74-94.
96. Osman IH (2002). Preface: focussed issue on applied metaheuristics. Comput Indust Eng 44: 205-207.
97. Taillard ED, Gambardella LM, Gendreau M and Potvin JY (2001). Adaptive memory programming: a unified view of metaheuristics. Ever J Opl Res 135: 1-16.
98. Hertz A and Widmer M (2003). Guidelines for the use of metaheuristics in combinatorial optimization. Eur J Opl Res 151: 247-252.
99. Brandt A (1977). Multi-level adaptive solutions to boundary value problems. Math Comput 31: 333-390.
100. Teng SA (1999). Coarsening, sampling and smoothing: elements of the multilevel method. In: Heath MT, Ranade A and Schreiber RS (eds). Algorithms for Parallel Processing. IMA Volumes in Mathematics and its Applications, Vol. 105, Springer Publishing Co. Inc., New York, pp 247-276.
101. Walshaw C (To appear). Multilevel refinement for combinatorial optimization problems. Ann Oper Res.
102. Mitten LG (1970). Branch and bound methods: general formulations and properties. Oper Res 18: 24-34.
103. Ow PS and Morton TE (1988). Filtered beam search in scheduling. Int J Production Res 26: 35-62.
104. Delle Croce F and T'kindt V (2002). A recovering beam search algorithm for the one-machine dynamic total completion time scheduling problem. J Opl Res Soc 53: 1275-1280.
105. Glover F (2000). Tabu search. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston, pp 821-827.
106. Glover F, Taillard E and de Werra D (1993). A user's guide to tabu search. Ann Oper Res 41: 3-28.
107. Hertz A, Taillard ED and de Werra D (1997). A tutorial on tabu search. In: Aarts E and Lenstra JK (eds). Local Search in Combinatorial Optimization. Wiley, New York, pp 121-136.
108. Glover F and Laguna M (1997). Tabu Search. Kluwer Academic Publishers: London.
109. Costa D and Silver EA (1998). Tabu search when noise is present: an illustration in the context of cause and effect analysis. J Heuristics 4: 5-23.
110. Costa D (1995). An evolutionary tabu search algorithm and the NHL scheduling problem. INFOR 33: 161-177.
111. Taillard ED (1991). Robust tabu search for the quadratic assignment problem. Parallel Computing 17: 443-455.
112. Hasegawa M, Ikeguchi T, Aihara K and Itoh K (2002). A novel chaotic search for quadratic assignment problems. Eur J Oper Res 139: 543-556.
113. Glover F (1989). Tabu search - part I. ORSA J Computing 1: 190-206.
114. Nanobe K and Ibaraki T (1998). A tabu search approach to the constraint satisfaction problem as a general problem solver. Eur J Opl Res 106: 599-623.
115. Chelouah R and Siarry P (2000). Tabu search applied to global optimization. Eur J Opl Res 123: 256-270.
116. Anandalingam G (2000). Simulated annealing. In: Gass SI and Harris CM (eds). Encyclopedia of Operations Research and Management Science, 2nd edn. Kluwer Academic Publishers, Boston, pp 748-751.
117. Dowsland KA (1993). Simulated annealing. In: Reeves CR (ed). Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, New York, Chapter 2.
118. Vidai RVV (1993). Applied Simulated Annealing. Springer-Verlag: Berlin.
119. Osman IH (1993). Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41: 421-451.
120. Dueck G (1993). New optimization heuristics: the great deluge algorithm and the record-to-record travel. J Comput Phys 104: 86-92.
121. Mladenović N and Hansen P (1997). Variable neighbourhood search. Comput Oper Res 24: 1097-1100.
122. Hansen P and Mladenović N (2002). Variable neighbourhood search. In: Pardalos PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 221-234.
123. Voudouris C and Tsang E (1999). Guided local search and its application to the travelling salesman problem. Eur J Opl Res 113: 469-499.
124. Tsubakitani S and Evans JR (1998). An empirical study of a new metaheuristic for the traveling salesman problem. Eur J Opl Res 104: 113-128.
125. Feo TA and Resende MGC (1995). Greedy randomized adaptive search procedures. J Global Optim 6: 109-133.
126. Pitsoulis LS and Resende MGC (2002). Greedy randomized adaptive search procedures. In: Pardalas PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 168-183.
127. Patterson R, Rolland E and Pirkul H (1999). A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. J Heuristics 5: 159-180.
128. Fleurent C and Glover F (1999). Improved constructive multi-start strategies for the quadratic assignment problem using adaptive memory. INFORMS J Computing 11: 198-204.
129. Dorigo M, Maniezzo V and Colorni A (1996). The ant system: optimization by a colony of cooperating agents. IEEE Trans Systems Man Cybernet - Part B 26: 29-41.
130. Dorigo M and Di Caro G (1999). The ant colony optimization meta-heuristic. In: Corne D, Dorigo M and Glover F (eds). New Ideas in Optimization. McGraw-Hill, New York, pp 11-32.
131. Gambardella LM, Taillard ED and Dorigo M (1999). Ant colonies for the quadratic assignment problem. J Opl Res Soc 50: 167-176.
132. Reeves CR (1993). Genetic algorithms. In: Reeves CR (ed) Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, New York, Chapter 4.
133. Beasley JE (2002). Population heuristics. In: Pardalas PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 138-156.
134. Goldberg DE (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley: Reading, MA.
135. Moon I, Silver EA and Choi S (2002). A hybrid genetic algorithm for the economic lot scheduling problem. Int J Production Res 40: 809-824.
136. Rochat Y (1998). A genetic approach for solving a scheduling problem in a robotized analytical system. J Heuristics 4: 245-261.
137. Armony M, Klincewicz JG, Luss H and Rosenwein MB (2000). Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6: 85-105.
138. Yagiura M and Ibaraki T (1996). The use of dynamic programming in genetic algorithms for permutation problems. Eur J Opl Res 92:387-401.
139. Chelouah R and Siarry P (2000). A continuous genetic algorithm designed for the global optimization of multimodal functions. J Heuristics 6: 191-213.
140. Glover F (1995). Scatter search and star path: beyond the genetic metaphor. OR Spektrum 17: 125-137.
141. Laguna M. Scatter search. In Pardalos PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 183-194.
142. Rochat Y and Taillard E (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147-167.
143. Golden BL, Laporte G and Taillard E (1997). An adaptive memory heuristic for a class of vehicle routing problems with minimax objective. Comput Oper Res 24: 445-452.
144. Moscato P (2002). Memetic Algorithms. In; Pardalos PM and Resende MGC (eds). Handbook of Applied Optimization. Oxford University Press, New York, pp 157-168.
145. Bell PC (1991). Visual interactive modelling: the past, the present, and the prospects. Eur J Opl Res 54: 274-286.
146. Bright JG and Johnston KJ (1991). Whither VIM? a developer's view. Eur J Opl Res 54: 357-362.
147. Chau P and Bell PC (1994). Decision support for the design of a new production plant using visual interactive simulation. J Opl Res Soc 45: 1273-1284.
148. Fisher ML (1985/86). Interactive optimization. Ann Oper Res 5: 541-556.
149. Segal M and Weinberger D (1977). Turfing. Oper Res 25: 367-386.
150. Pirkul H, Gupta R and Rolland E (1999). VisOpt: a visual interactive optimization tool for P-median problems. Decision Support Syst 26: 209-223.
151. Cornuejols G, Fisher ML and Nemhauser GL (1977). Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Management Sci 23: 789-810.
152. Barr R, Golden B, Kelly J, Resende M and Stewart Jr W (1995). Designing and reporting on computational experiments with heuristic methods. J Heuristics 1: 9-32.
153. Rardin RL and Uzsoy R (2001). Experimental evaluation of heuristic optimization algorithms: a tutorial. J Heuristics 7: 261-304.
154. Hooker JN (1995). Testing heuristics: we have it all wrong. J Heuristics 1: 33-42.
155. Montgomery DC (1991). Design and Analysis of Experiments, 3rd edn. Wiley: New York.
156. Kuehl RO (2000). Design of Experiments: Statistical Principles of Design and Analysis, 2nd edn. Duxbury Press: Pacific Grove, CA.
157. Evans JR and Hall RA (1984). Probabilistic analysis of assignment ranking: the traveling salesman problem. Amer J Math Management Sci 4: 71-88.
158. Marin A and Salmeron S (1996). Tactical design of rail freight networks. Part II: local search methods with statistical analysis. Eur J Opl Res 94: 43-53.
159. McRoberts KL (1971). A search model for evaluating combinatorially explosive problems. Oper Res 19: 1331-1349.
160. Hillier MS (2002). The costs and benefits of commonality in assemble-to-order systems with a (Q,r) - policy for component replenishment. Eur J Opl Res 141: 570-586.
161. Klein R and Scholl A (1999). Computing lower bounds by destructive improvement: an application to resource-constrained project scheduling. Eur J Opl Res 112: 322-346.
162. Gupta JND, Sexton RS and Tune EA (2000). Selecting scheduling heuristics using neural networks. INFORMS J Computing 12: 150-162.