Metaheuristics in logistics and supply chain management

Journal of Business Logistics

Volumn 33, Issue 2, 2012, Pages 90-106

  Griffis, Stanley E ^a   Bell, John E ^b   Closs, David J ^a  

^a MICHIGAN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Ant colony optimization; Genetic algorithm; Heuristics; Logistics system design; Metaheuristics; Optimization; Simulated annealing; Simulation; Supply chain network design; Tabu search

Indexed keywords

EID: 84864617053     PISSN: 07353766     EISSN: 21581592     Source Type: Journal    
DOI: 10.1111/j.0000-0000.2012.01042.x     Document Type: Article

References (136)

1. Aarts, E., Korst, J., and Michiels, W. 2005. "Simulated Annealing." In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, edited by E.K. Burke and G. Kendall, 187-210. New York: Springer Science and Business Media.
2. Aarts, E., and Lenstra, J.K. 1997. Local Search in Combinatorial Optimization. Chichester, England: John Wiley & Sons.
3. Abdinnour-Helm, S. 2001. "Using Simulated Annealing to Solve the p-Hub Median Problem." International Journal of Physical Distribution and LogisticsManagement 31(3):203-20.
4. Ahire, S., Greenwood, G., Gupta, A., and Terwilliger, M. 2000. "Workforce-Constrained Preventive Maintenance Scheduling Using Evolution Strategies." Decision Sciences 31(4):833-59.
5. Albritton, M.D., and McMullen, P.R. 2007. "Optimal Product Design Using a Colony of Virtual Ants." European Journal of Operational Research 176(1):498-513.
6. Archetti, C., Savelsbergh, M.W.P., and Speranza, M.G. 2008. "To Split or Not to Split: That is the Question." Transportation Research: Part E: Logistics and Transportation Review 44(1):114-23. (Pubitemid 47528125)
7. Azencott, R. 1992. Simulated Annealing. New York: John Wiley & Sons.
8. Ballou, R.H. 1989. "Heuristics: Rules of Thumb for Logistics Decision Making." Journal of Business Logistics 10(1):122-32.
9. Ballou, R.H., and Agarwal, Y.K. 1988. "A Performance Comparison of Several Popular Algorithms for Vehicle Routing and Scheduling." Journal of Business Logistics 9(1):51-65.
10. Battiti, R., and Tecchiolli, G. 1994. "The Reactive Tabu Search." ORSA Journal on Computing 6(2):126-40.
11. Bautista, J., and Pereira, J. 2007. "Ant Algorithms for a Time and Space Constrained Assembly Line Balancing Problem." European Journal of Operational Research 177(3):2016-33.
12. Bean, N., and Costa, A. 2005. "An Analytic Modelling Approach for Network Routing Algorithms That Use "Ant-Like" Mobile Agents." Computer Networks 49(2):243-68. (Pubitemid 41042474)
13. Bell, J.E. 2003. A Simulated Annealing Approach for the Composite Facility Location and Resource Allocation Problem: A Study of the Strategic Positioning of US Air Force Munitions. Dissertation, Management, Auburn University, Auburn, Alabama.
14. Bell, J.E., and Griffis, S.E. 2010. "Swarm Intelligence: Application of the Ant Colony Optimization Algorithm to Logistics-Oriented Vehicle Routing Problems." Journal of Business Logistics 31(2):157-75.
15. Berry, L.M., Murtagh, B.A., McMahon, G.B., Sugden, S.J., and Welling, L.D. 1998. "Genetic Algorithms in the Design of Complex Distribution Networks." International Journal of Physical Distribution and Logistics Management 28(5):377-81.
16. Bland, J.A. 1999. "Space-Planning by Ant Colony Optimisation." International Journal of Computer Applications in Technology 12(6):320-28.
17. Bloom, B.S. (Ed.), Engelhart, M.D., Furst, E.J., Hill, W.H., and Krathwohl, D.R. 1956. Taxonomy of Educational Objectives: The Classification of Educational Goals. Handbook 1: Cognitive Domain. New York: David McKay.
18. Bontoux, B., Artigues, C., and Feillet, D. 2010. "A Memetic Algorithm With a Large Neighborhood Crossover Operator for the Generalized Traveling Salesman Problem." Computers and Operations Research 37(11):1844-52.
19. Borwein, J.M., and Crandall, R.E. 2010. "Closed Forms: What They Are and Why We Care." University of Newcastle, Centre for Computer Assisted Research Mathematics and its Applications (CARMA), Callaghan, NSW, Australia.
20. Bowersox, D.J., and Closs, D.J. 1989. "Simulation in Logistics: A Review of Present Practice and a Look to the Future." Journal of Business Logistics 10(1):133-48.
21. Bräysy, O. 2003. "A Threshold Accepting Metaheuristic for the Vehicle Routing Problem With Time Windows." Central European Journal of Operations Research 11(4): 369-87.
22. Bräysy, O., and Gendreau, M. 2005. "Vehicle Routing Problem With Time Windows, Part II: Metaheuristics." Transportation Science 39(1):119-39. (Pubitemid 40453880)
23. Briant, O., Naddef, D., and Mounie, G. 2008. "Greedy Approach and Multi-Criteria Simulated Annealing for the Car Sequencing Problem." European Journal of Operational Research 191(3):993-1003. (Pubitemid 351778627)
24. Caballero, R., Gonzalez, M., Guerrero, A., Molina, J., and Paralera, C. 2007. "Solving a Multiobjective Location Routing Problem With a Metaheuristic Based on Tabu Search. Application to a Real Case in Andalusia." European Journal of Operational Research 177(3):1751- 63. (Pubitemid 44709438)
25. Cerny, V. 1985. "Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm." Journal of Optimization Theory and Applications 45(1):41-51. (Pubitemid 15462741)
26. Chan, K.Y., Fogarty, T.C., Aydin, M.E., Ling, S.H., and Iu, H.H.C. 2008. "Genetic Algorithms With Dynamic Mutation Rates and Their Industrial Applications." International Journal of Computational Intelligence and Applications 7(2):103-28.
27. Chiang, W.C., and Russell, R.A. 2004. "Integrating Purchasing and Routing in a Propane Gas Supply Chain." European Journal of Operational Research 154(3):710-29.
28. Christiansen, M., Fagerholt, K., Flatberg, T., Haugen, O., Kloster, O., and Lund, E.H. 2011. "Maritime Inventory Routing With Multiple Products: A Case Study From the Cement Industry." European Journal of Operational Research 208(1):86-94.
29. Clarke, G., and Wright, J.W. 1964. "Scheduling of Vehicles From a Central Depot to a Number of Delivery Points." Operations Research 12:568-81.
30. Coppin, B. 2004. Artificial Intelligence Illuminated, Jones Bartlett Illuminated Series. Sudbury, MA: Jones Bartlett Publishers.
31. Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., and Semet, F. 2002. "A Guide to Vehicle Routing Heuristics." Journal of the Operational Research Society 53: 512-22. (Pubitemid 34550664)
32. Cordeau, J.-F., and Laporte, G. 2005. "Tabu Search Heuristics for the Vehicle Routing Problem." In Metaheuristic Optimization vis Memory and Evolution, Operations Research /Computer Science Interfaces Series, Vol. 30, Part II, edited by C. Rego and B. Alidaee, 145-63. Boston: Kluwer Academic Publishers.
33. Croxton, K.L., and Zinn, W. 2005. "Inventory Considerations in Network Design." Journal of Business Logistics 26(1):149-68. (Pubitemid 40447123)
34. Daskin, M.S. 1995. Network and Discrete Location: Models, Algorithms, and Applications. New York: John Wiley & Sons Inc, 80-91.
35. Daskin, M.S. 2008. "What You Should Know About Location Modeling." Naval Research Logistics 55(4):283-94. (Pubitemid 351702824)
36. Defee, C.C., Stank, T.P., Esper, T.L., and Mentzer, J.T. 2009. "The Role of Followers in Supply Chains." Journal of Business Logistics 30(2):65-73.
37. De Jong, K.A. 1975. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ann Arbor, Michigan: University of Michigan.
38. De Rosa, B., Improta, G., Ghiani, G., and Musmanno, R. 2002. "The Arc Routing and Scheduling Problem With Transshipment." Transportation Science 36(3):301-13. (Pubitemid 34963893)
39. Dorigo, M. 1992. Optimization, Learning and Natural Algorithms. Milan, Italy: Politecnico di Milano.
40. Dorigo, M., Birattari, M., and Stutzle, T. 2006. Ant Colony Optimization: Artifical Ants as a Computational Intelligence Technique. Piscataway, NJ: IEEE Computational Intelligence Magazine, November 2006.
41. Dorigo, M., DiCarlo, G., and Gamberdella, L.M. 1999. "Ant Algorithms for Discrete Optimization." Artificial Life 5:137-72.
42. Dorigo, M., and Gamberdella, L.M. 1997. "Ant Colonies for the Travelling Salesman Problem." Biosystem 43(1):73-81. (Pubitemid 27332279)
43. Dorigo, M., and Stutzle, T. 2003. "The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances." In Handbook of Metaheuristics, edited by F. Glover and G.A. Kochenberger, 251-86. Boston: Kluwer Academic Publishers.
44. Dreo, J., Petrowski, A., Siarry, P., and Taillard, E. 2006. Metaheuristics for Hard Optimization. Berlin, Germany: Springer-Verlag.
45. Duhamel, C., Potvin, J.-Y., and Rosseau, J.-M. 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem With Backhauls and Time Windows." Transportation Science 31(1):49-59. (Pubitemid 127623156)
46. Eglese, R.W. 1990. "Simulated Annealing: A Tool for Operational Research." European Journal of Operational Research 46:271-81. (Pubitemid 20720808)
47. Feo, T., and Resende, M. 1989. "A Probabilistic Heuristic for a Computationally Difficult Set Coving Problem." Operations Research Letters 8:67-71.
48. Feo, T., and Resende, M. 1995. "Greedy Randomized Adaptive Search Procedure." Journal of Global Optimization 42:860-78.
49. Feo, T.A., and González-Verlarde, J.L. 1995. "The Intermodal Trailer Assignment Problem." Transportation Science 29(4):330-41.
50. Fogel, L.J., Owens, A.J., and Walsh, M.J. 1966. Artificial Intelligence through Simulated Evolution. New York: John Wiley & Sons.
51. Galbreth, M.R., Hill, J.A., and Handley, S. 2008. "An Investigation of the Value of Cross-Docking for Supply Chain Management." Journal of Business Logistics 29(1):225-39.
52. Geem, Z.W., Kim, J.H., and Loganathan, G.V. 2001. "A New Heuristics Optimization Algorithm: Harmony Search." Simulation 76(2):60-68. (Pubitemid 32543074)
53. Gendreau, M. 2003. "An Introduction to Tabu Search." In Handbook of Metaheuristics, edited by F. Glover and G.A. Kochenberger, 37-54. Boston: Kluwer Academic Publishers.
54. Gillett, B.E., and Miller, L.R. 1974. "A Heuristics Algorithm for the Vehicle-Dispatch Problem." Operations Research 22(2):340-49.
55. Glover, F. 1977. "Heuristics for Integer Programming Using Surrogate Constraints." Decision Sciences 8:156-66.
56. Glover, F. 1986. "Future Paths for Integer Programming and Links to Artificial Intelligence." Computers and Operations Research 13:533-49. (Pubitemid 17480188)
57. Glover, F., and Kochenberger, G.A. (eds.) 2003. Handbook of Metaheuristics. Boston: Kluwer Academic Publishers, xi-xii.
58. Glover, F., and Laguna, M. 1997. Tabu Search. Norwell, MA: Kluwer Academic Publishers.
59. Goldberg, D.E. 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison- Wesley.
60. Goldsby, T.J., Griffis, S.E., and Roath, A.S. 2006. "Modeling Lean, Agile, and Leagile Supply Chain Strategies." Journal of Business Logistics 27(1):57-80.
61. Golias, M.M., Boile, M., and Theofanis, S. 2009. "Berth Scheduling by Customer Service Differentiation: A Multi- Objective Approach." Transportation Research Part E: Logistics and Transportation Review 45(6):878-92.
62. Gonzalez, E.L., and Fernandez, R. 2000. "Genetic Optimisation of a Fuzzy Distribution Model." International Journal of Physical Distribution and Logistics Management 30(7 /8):681-96.
63. Goodson, J.C., Ohlmann, J.W., and Thomas, B.W. 2012. "Cyclic-Order Neighborhoods With Application to the Vehicle Routing Problem With Stochastic Demand." European Journal of Operational Research 217(2):312-23.
64. Hahn, K.H., Hwang, H., and Shinn, S.W. 2004. "A Returns Policy for Distribution Channel Coordination of Perishable Items." European Journal of Operational Research 152(3):700-80.
65. Hansen, P., and Mladenovic, N. 2003. "Variable Neighborhood Search." In Handbook of Metaheuristics, edited by F. Glover and G.A. Kochenberger, 145-84. Boston: Kluwer Academic Publishers.
66. Harrison, T.P. 2004. "Principles for the Strategic Design of Supply Chains." In The Practice of Supply Chain Management: Where Theory and Application Converge, edited by T.P. Harrison, H.L. Lee, and J.J. Neele, 3-12. New York: Springer Science & Busines Media Inc.
67. He, J., Chang, D., Mi, W., and Yen, W. 2010. "A Hybrid Parallel Genetic Algorithm for Yard Crane Scheduling." Transportation Research Part E: Logistics and Transportation Review 46(1):136-55.
68. Henderson, D., Jacobson, S.H., and Johnson, A.W. 2003. "The Theory and Practice of Simulated Annealing." In Handbook of Metaheuristics, edited by F. Glover and G.A. Kochenberger, 287-321. Boston: Kluwer Academic Publishers.
69. Hillier, F.S., Hillier, M.S., and Lieberman, G.J. 2000. Introduction to Management Science: A Modeling and Case Studies Approach With Spreadsheets. Boston: McGraw- Hill Co.
70. Holland, J.H. 1962. "Outline for Logical Theory of Adaptive Systems." Journal of the Association for Computing Machinery 3:297-314.
71. Imai, A., Chen, H.C., Nishimura, E., and Papadimitriou, S. 2008. "The Simultaneous Berth and Quay Crane Allocation Problem." Transportation Research: Part E: Logistics and Transportation Review 44(5):900-20.
72. Jaeggi, D.M., Parks, G.T., Kipouros, T., and Clarkson, P.J. 2008. "The Development of a Multi-Objective Tabu Search Algorithm for Continous Optimisation Problems." European Journal of Operational Research 185(3):1192-212. (Pubitemid 47500191)
73. Javid, A.A., and Azad, N. 2010. "Incorporating Location, Routing and Inventory Decisions in Supply Chain Network Design." Transportation Research: Part E: Logistics and Transportation Review 46(5):582-97.
74. Joborn, M., Crainic, T.G., Gendreau, M., Holmberg, K., and Lundgren, J.T. 2004. "Economies of Scale in Empty Freight Car Distribution in Scheduled Railways." Transportation Science 38(2):121-34.
75. Karaboga, D. 2005. An Idea Based on Honey Bee Swarm for Numerical Optimization. Technical Report-TR06 for Erciyes University, 1-10.
76. Kariv, O., and Hakimi, S.L. 1979. "An Algorithmic Approach to Network Location Problems." SIAM Journal of Applied Mathematics 37:513-60.
77. Kennedy, J., and Eberhart, R.C. 1995. Particle Swarm Optimization. Paper read at Proceedings IEEE International Conference on Neural Networks, Piscataway, NJ.
78. Kergosien, Y., Lente, C., Piton, D., and Billaut, J.-C. 2011. "A Tabu Search Heuristic for the Dynamic Transportation of Patients Between Care Units." European Journal of Operational Research 214(2):442-52.
79. Kirkpatrick, S., Gelatt, C.D.J., and Vecchi, M.P. 1983. "Optimization by Simulated Annealing." Science 220: 671-79.
80. Krishnanand, K.N., and Ghose, D. 2009. "Glowworm Swarm Optimisation: A New Method for Optimising Multi-Modal Functions." International Journal of Computational Intelligence Studies 1(1):93-119.
81. Laporte, G. 2007. "What You Should Know About the Vehicle Routing Problem." Naval Research Logistics 54(8):811-19. (Pubitemid 350189025)
82. Lenstra, J.K., and Rinnooy Kan, A. 1981. "Complexity of Vehicle Routing and Scheduling Problems." Networks 11:221-28.
83. Lin, S. 1965. "Computer Solutions of the Traveling Salesman Problem." Bell Systems Journal 44:2245-69.
84. Lodi, A., Martello, S., and Vigo, D. 2004. "Tspack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems." Annals of Operations Research 131(1-4):203-13. (Pubitemid 39187380)
85. Lourenco, H.R. 2005. "Logistics Management, an Opportunity for Metaheuristics." In Metaheuristic Optimization via Memory and Evolution, edited by C. Rego and B. Alidaee, 329-56. Boston: Kluwer Academic Publishers.
86. McMullen, P.R. 2001. "An Efficient Frontier Approach to Addressing JIT Sequencing Problems With Setups via Search Heuristics." Computers and Industrial Engineering 41(3):335-53. (Pubitemid 33018921)
87. McMullen, P.R., and Frazier, G.V. 2000. "A Simulated Annealing Approach to Mixed-Model Sequencing With Multiple Objectives on a Just-in-Time Line." IIE Transactions 32:679-86.
88. McMullen, P.R., and Tarasewich, P. 2006. "Multi-Objective Assembly Line Balancing via a Modified Ant Colony Optimization." International Journal of Production Research 44(1):27-42. (Pubitemid 43000415)
89. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., and Teller, E. 1953. "Equation of State Calculations by Fast Computing Machines." Journal of Chemical Physics 21:1087-92.
90. Min, H., Ko, C.S., and Ko, H.-J. 2008. "Managing Product Returns in Customer-Centric E-Tail Environments." International Journal of Services Technology and Management 9(1):51-70. (Pubitemid 351169633)
91. Mladenovic, N. 1995. "A Variable Neighborhood Algorithm - A New Metaheuristic for Combinatorial Optimization." Paper read at Optimization Days, at Montreal, Canada.
92. Mladenovic, N., and Hansen, P. 1997. "Variable Neighborhood Search." Computers and Operations Research 24:1097-100.
93. Moin, N.H., Salhi, S., and Aziz, N.A.B. 2011. "An Efficient Hybrid Genetic Algorithm for the Multi-Product Multi- Period Inventory Routing Problem." International Journal of Production Economics 133(1):334-43.
94. Mollenkopf, D., and Closs, D.J. 2005. "The Hidden Value in Reverse Logistics." Supply Chain Management Review 9(5):34-43.
95. Morin, S., Gagne, C., and Gravel, M. 2009. "Ant Colony Optimization With a Specialized Pheromone Trail for the Car-Sequencing Problem." European Journal of Operational Research 197(3):1185-91.
96. Mucherino, A., and Seref, O. 2008. "Modelling and Solving Real-Life Global Optimisation Problems With Metaheuristic Methods." In Advances in Modeling Agricultural Systems, edited by P.J. Papajorgji and P.M. Pardolos, 403-20. New York: Springer.
97. Nyaga, G.N., Closs, D.J., Rodrigues, A., and Calantone, R.J. 2007. "The Impact of Demand Uncertainty and Configuration Capacity on Customer Service Performance in a Configure-to-Order Environment." Journal of Business Logistics 27(2):83-96.
98. Osman, I.H. 1993. "Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem." Annals of Operations Research 41(1-4):421-51.
99. Pankratz, G. 2005. "Dynamic Vehicle Routing by Means of a Genetic Algorithm." International Journal of Physical Distribution and Logistics Management 35(5):362-83. (Pubitemid 40885606)
100. Pedersen, M.B., Crainic, T.G., and Madsen, O.B.G. 2009. "Models and Tabu Search Metaheuristics for Service Network Design With Asset-Balance Requirements." Transportation Science 43(2):158-77.
101. Pereira, F.B., and Tavaras, J. (eds.) 2010. Bio-Inspired Algorithms for the Vehicle Routing Problem. Berlin, Germany: Springer.
102. Potvin, J.-Y. 2009. "Evolutionary Algorithms for Vehicle Routing." INFORMS Journal on Computing 21(4):518-48.
103. Powers, R. 1989. "Optimization Models for Logistics Decisions." Journal of Business Logistics 10(1):106-21.
104. Ragsdale, C.T. 2011. Spreadsheet Modeling and Decision Analysis. 6th ed. Mason, OH: South-Western Cengage Learning.
105. Rechenberg, I. 1973. Evolutionsstrategie: Optimierung Technischer Systeme Nach Prinzipien Der Bilogischen Evolution. Stuttgart: Frommann-Holzboog.
106. Reeves, C. 2003. "Genetic Algorithms." In Handbook of Metaheuristics, edited by F. Glover and G.A. Kochenberger, 55-82. Boston: Kluwer Academic Publishers.
107. Reimann, M., and Laumanns, M. 2006. "Savings Based Ant Colony Optimization for the Capacitated Minimum Spanning Tree Problem." Computers and Operations Research 33(6):1794-822. (Pubitemid 41525711)
108. Reimann, M., and Ulrich, H. 2006. "Comparing Backhauling Strategies in Vehicle Routing Using Ant Colony Optimization." Central European Journal of Operations Research 14(2):105-23. (Pubitemid 44727093)
109. Rosing, K.E., and ReVelle, C.S. 1997. "Heuristic Concentration: Two Stage Solution Construction." European Journal of Operational Research 97(1):75-86. (Pubitemid 127369266)
110. Shah-Hosseini, H. 2007. Problem Solving by Intelligent Water Drops. Proceedings of the IEEE Congress on Evolutionary Computation, CEC Singapore, 3226-31.
111. Shapiro, J.F. 2001. Modeling the Supply Chain. Pacific Grove, CA: Thomson Learning Inc.
112. Shintani, K., Imai, A., Nishimura, E., and Papadimitriou, S. 2007. "The Container Shipping Network Design Problem With Empty Container Repositioning." Transportation Research: Part E: Logistics and Transportation Review 43(1):39-59. (Pubitemid 44524668)
113. Shyu, S.J., Lin, B.M.T., and Yin, P.Y. 2004. "Application of Ant Colony Optimization for No-Wait Flowshop Scheduling Problem to Minimize the Total Completion Time." Computers and Industrial Engineering 47(2 /3): 181-93.
114. Simchi-Levi, D., Kaminsky, P., and Simchi-Levi, E. 2000. Designing and Managing the Supply Chain. New York: McGraw-Hill /Irwin.
115. Sitarz, S. 2009. "Ant Algorithm and Simulated Annealing for Multicriteria Dynamic Programming." Computers and Operations Research 36(2):433-41.
116. Solomon, M.M. 1987. "Algorithms for the Vehicle Routing and Scheduling Problems With Time Window Constraints." Operations Research 35(2):254-65.
117. Sun, M. 2005. "A Tabu Search Heuristic for the Uncapacitated Facility Location Problem." In Metaheuristic Optimization via Memory and Evolution, edited by C. Rego and B. Alidaee, 191-212. Boston: Kluwer Academic Publishers.
118. Taillard, E. 1993. "Benchmarks for Basic Scheduling Problems." European Journal of Operational Research 64(2):278-85. (Pubitemid 23599340)
119. Taillard, E.D. 1995. "Comparison of Iterative Searches for the Quadratic Assignment Problem." Location Science 3(2):87-105.
120. Tamura, K., and Yasuda, K. 2011. "Spiral Dynamics Inspired Optimization." Journal of Advanced Computational Intelligence and Intelligent Informatics 15(8): 1116-22.
121. Tang, C.-H. 2011. "A Scenario Decomposition-Genetic Algorithm Method for Solving Stochastic Air Cargo Container Loading Problems." Transportation Research: Part E: Logistics and Transportation Review 47(4):520-31.
122. Tarasewich, P., and McMullen, P.R. 2002. "Swarm Intelligence: Power in Numbers." Communications of the ACM 45(8):62-67.
123. Tsang, E.P.K., and Voudouris, C. 1997. "Fast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem." Operations Research Letters 20(3):119-27. (Pubitemid 127419755)
124. Van Der Bruggen, L.J.J., Lenstra, J.K., and Schuur, P.C. 1993. "Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem With Time Windows." Transportation Science 27(3):298-311.
125. Verma, M., Verter, V., and Zufferey, N. 2012. "A Bi-Objective Model for Planning and Managing Rail-Truck Intermodal Transportation of Hazardous Materials." Transportation Research: Part E: Logistics and Transportation Review 48(1):132-49.
126. Vis, I.F.A., and Carlo, H.J. 2010. "Sequencing Two Cooperating Automated Stacking Cranes in a Container Terminal." Transportation Science 44(2):168-82.
127. Wang, H.-F., and Chen, Y.-Y. 2012. "A Genetic Algorithm for the Simultanesous Delivery and Pick Up Problems With Time Window." Computers and Industrial Engineering 62(1):84-95.
128. Woodruff, D.L., and Zemel, E. 1993. "Hashing Vectors for Tabu Search." Annals of Operations Research 41(1- 4):123-27.
129. Xu, J., Yan, F., and Li, S. 2011. "Vehicle Routing Optimization With Soft Time Windows in a Fuzzy Random Environment." Transportation Research Part E 47(6):1075-91.
130. Yamada, T., Russ, B.F., Castro, J., and Taniguchi, E. 2009. "Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications." Transportation Science 43(2):129-43.
131. Yang, X.S. 2008. Nature-Inspired Metaheuristic Algorithms. Beckington: Luniver Press.
132. Yang, X.S., and Deb, S. 2009. Cuckoo Search via Levy Flights. Proceedings of the World Congress on Nature and Biologically Inspired Computing, December, Coimbatore, India, 210-14.
133. Yi, W., and Kumar, A. 2007. "Ant Colony Optimization for Disaster Relief Operations." Transportation Research 43(6):660-72. (Pubitemid 47371970)
134. Yu, B., Yang, Z.-Z., and Yao, B. 2009. "An Improved Ant Colony Optimization for Vehicle Routing Problem." European Journal of Operational Research 196(1):171-76.
135. Zanakis, S.H., and Evans, J.R. 1981. "Heuristic " Optimization": Why, When, and How to Use It." Interfaces 11(5):84-91.
136. Zhao, G., Jiang, P., Zheng, M., Zhou, G., and Chen, B. 2008. "Using Swarm Intelligence Algorithm to Solve a Part Clustering Model Based on Weighted Directed Graph." International Journal of Production Research 46(7):1911-32. (Pubitemid 351270695)