Exploiting Tabu Search Memory in Constrained Problems

References

• Armour G. C., Buffa E. S. A heuristic algorithm and simulation approach to relative location of facilities. Management Sci. (1963) 9:294–309Link, Google Scholar
• Avriel M.Nonlinear Programming: Analysis and Methods (1976) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Bazaraa M. S. Computerized layout design: A branch and bound approach. AIIE Trans. (1975) 7:432–438Crossref, Google Scholar
• Bellman R. E.Dynamic Programming (1957) (Princeton University Press, Princeton, NJ) Google Scholar
• Bellman R. E., Dreyfus S. E. Dynamic programming and reliability of multicomponent devices. Oper. Res. (1958) 6:200–206Link, Google Scholar
• Bellman R. E., Dreyfus S. E.Applied Dynamic Programming (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Bulfin R. L., Liu C. Y. Optimal allocation of redundant components for large systems. IEEE Trans. Reliability (1985) R-34:241–247Crossref, Google Scholar
• Chao I-M., Golden B. L., Wasil E. A. A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. (1996a) 88:475–489Crossref, Google Scholar
• Chao I-M., Golden B. L., Wasil E. A. The orienteering problem. Eur. J. Oper. Res. (1996b) 88:464–474Crossref, Google Scholar
• Chern M. S. On the computational complexity of reliability redundancy allocation in a series system. Oper. Res. Lett. (1992) 11:309–315Crossref, Google Scholar
• Coit D. W., Smith A. E. Penalty guided genetic search for reliability design optimization. Comput. Indust. Engrg. (1996a) 30:895–904Crossref, Google Scholar
• Coit D. W., Smith A. E. Reliability optimization of series-parallel systems using a genetic algorithm. IEEE Trans. Reliability (1996b) 45:254–260Crossref, Google Scholar
• Coit D. W., Smith A. E., Tate D. M. Adaptive penalty methods for genetic optimization of constrained combinatorial problems. INFORMS J. Comput. (1996) 8:173–182Link, Google Scholar
• Committee on the Next Decade of Operations Research (Condor)Operations research: The next decadeOper. Res. (1988) 36:619–637Link, Google Scholar
• Costa D. A tabu search algorithm for computing an operational time table. (1990) . Working paper, Département de Mathématiques, École Polytechnique Fédérale de Lausanne, Lausanne, SwitzerlandGoogle Scholar
• Dammeyer F., Forst P., Voss S. On the cancellation sequence method of tabu search. ORSA J. Comput. (1991) 3:262–265Link, Google Scholar
• Dammeyer F., Voss S. Dynamic tabu list management using the reverse elimination method. Ann. Oper. Res. (1993) 41:31–46Crossref, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27:1–18Link, Google Scholar
• Fyffe D. E., Hines W. W., Lee N. K. System reliability allocations and a computational algorithm. IEEE Trans. Reliability (1968) R-17:74–79Crossref, Google Scholar
• Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem. Management Sci. (1994) 40:1276–1290Link, Google Scholar
• Ghare M., Taylor R. E. Optimal redundancy for reliability in series system. Oper. Res. (1969) 17:838–847Link, Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13:533–549Crossref, Google Scholar
• Glover F. Tabu search—Part I. ORSA J. Comput. (1989) 1:190–206Link, Google Scholar
• Glover F. Tabu search—Part II. ORSA J. Comput. (1990) 2:4–32Link, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer Academic Publishers, London, U.K) Crossref, Google Scholar
• Glover F., Taillard E., de Werra D. A user's guide to tabu search. Ann. Oper. Res. (1993) 41:3–28Crossref, Google Scholar
• Golden B. L., Levy L., Vohra R. The orienteering problem. Naval Res. Logist. (1987) 34:307–318Crossref, Google Scholar
• Golden B. L., Wang Q., Liu L. A multifacet heuristic for the orienteering problem. Naval Res. Logist. (1988) 35:359–366Crossref, Google Scholar
• Hertz A. Finding a feasible course schedule using tabu search. Discrete Appl. Math. (1992) 35:255–270Crossref, Google Scholar
• Hertz A., de Werra D. Informatique et horaires scolaires. Output (1989) 12:53–56Google Scholar
• Joines J. A., Houck C. R. On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's. Proc. First IEEE Conf. Evolutionary Comput. (1994) IEEE, Piscataway, NJ:569–573Crossref, Google Scholar
• Kantor M. G., Rosenwein M. B. The orienteering problem with time windows. J. Oper. Res. Soc. (1992) 43:629–635Crossref, Google Scholar
• Keller C. P. Algorithms to solve the orienteering problem: A comparison. Eur. J. Oper. Res. (1989) 41:224–231Crossref, Google Scholar
• Liang Y-C., Smith A. E. An ant system approach to redundancy allocation. Proc. 1999 Congress Evolutionary Comput. (1999) IEEE, Piscataway, NJ:1478–1484Google Scholar
• Misra K. B., Sharma U. An efficient algorithm to solve integer programming problems arising in system reliability design. IEEE Trans. Reliability (1991) 40:81–91Crossref, Google Scholar
• Mittenthal J., Noon C. E. An insert/delete heuristic for the travelling salesman subset-tour problem with one additional constraint. J. Oper. Res. Soc. (1992) 43:277–283Crossref, Google Scholar
• Nakagawa Y., Miyazaki S. Surrogate constraints algorithm for reliability optimization problems with two constraints. IEEE Trans. Reliability (1981) R-30:175–180Crossref, Google Scholar
• Nonobe K., Ibaraki T. A tabu search approach to the constraint satisfaction problem as a general problem solver. Eur. J. Oper. Res. (1998) 106:599–623Crossref, Google Scholar
• Osman I. H., Christofides N. Capacitated clustering problems by hybrid simulated annealing and tabu search. Internat. Trans. Oper. Res. (1994) 1:317–336Crossref, Google Scholar
• Painton L., Campbell J. Genetic algorithms in optimization of system reliability. IEEE Trans. Reliability (1995) 44:172–179Crossref, Google Scholar
• Ramesh R., Brown K. M. An efficient four-phase heuristic for the generalized orienteering problem. Comput. Oper. Res (1991) 18:151–165Crossref, Google Scholar
• Reeves C. R.Modern Heuristic Techniques for Combinatorial Problems (1993) (John Wiley and Sons, New York) Google Scholar
• Scholl A., Voss S. Simple assembly line balancing—Heuristic approaches. J. Heuristics (1996) 2:217–244Crossref, Google Scholar
• Schwefel H-P.Evolution and Optimum Seeking (1995) (John Wiley and Sons, New York) Google Scholar
• Smith A. E., Coit D. W., Baeck T., Fogel D., Michalewicz Z. Penalty functions. Handbook of Evolutionary Computation (1995) (Oxford University Press and Institute of Physics Publishing, Bristol, U.K.) . Chap. C5.2Google Scholar
• Smith A. E., Tate D. M. Genetic optimization using a penalty function. Proc. Fifth Internat Conf. Genetic Algorithms (1993) (>Morgan Kaufmann, San Francisco, CA) 499–505Google Scholar
• Taillard E., Badeau P., Gendreau M., Guertin F., Potvin J-Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Sci. (1997) 31:170–186Link, Google Scholar
• Tate D. M., Smith A. E. Unequal area facility layout using genetic search. IIE Trans. (1995) 27:465–472Crossref, Google Scholar
• Thomas P. R., Salhi S. A tabu search approach for the resource constrained project scheduling problem. J. Heuristics (1998) 4:123–139Crossref, Google Scholar
• Tsiligirides T. Heuristic methods applied to orienteering. J. Oper. Res. Soc. (1984) 35:797–809Crossref, Google Scholar
• Wang Q., Sun X., Golden B. L., Jia J. Using artificial neural networks to solve the orienteering problem. Ann. Oper. Res. (1995) 61:111–120Crossref, Google Scholar