Parallel solution methods for vehicle routing problems. (English) Zbl 1187.90046
Golden, Bruce (ed.) et al., The vehicle routing problem. Latest advances and new challenges. New York, NY: Springer (ISBN 978-0-387-77777-1/hbk). Operations Research/Computer Science Interfaces Series 43, 171-198 (2008).
Summary: Parallel solution methods contribute to efficiently address large and complex combinatorial optimization problems, vehicle routing problems in particular. Parallel exact and heuristic methods for VRP variants are increasingly being proposed, and the pace seems to increase in recent years. “New” strategies have been proposed and many of the best known solutions to classical formulations have thus been obtained. This chapter describes and discusses the main strategies used to parallelize exact and metaheuristic solution methods for vehicle routing problems. It also provides an up-to-date survey of contributions to this rapidly evolving field and points to a number of promising research directions.
For the entire collection see [Zbl 1142.90004].
For the entire collection see [Zbl 1142.90004].
MSC:
| 90B06 | Transportation, logistics and supply chain management |
| 90B35 | Deterministic scheduling theory in operations research |
Keywords:
parallel computation; parallelization strategies; branch-and-bound; metaheuristics; vehicle routing problemsReferences:
| [1] | Alba, E., Parallel Metaheuristics. A New Class of Algorithms. (2005), Hoboken, NJ: John Wiley & Sons, Hoboken, NJ |
| [2] | Alba, E.; Dorronsoro, B.; Gottlieb, J.; Günther, R. R., Solving the Vehicle Routing Problem by Using Cellular Genetic Algorithms, Evolutionary Computation in Combinatorial Optimization, 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004, volume 3004 of Lecture Notes in Computer Science, 11-20 (2004), Heidelberg: Springer-Verlag, Heidelberg · Zbl 1177.90331 |
| [3] | Attanasio, A.; Cordeau, J. F.; Ghiani, G.; Laporte, G., Parallel Tabu Search Heuristics for the Dynamic Multi-Vehicle Dial-a-ride Problem, Parallel Computing, 30, 377-387 (2004) · doi:10.1016/j.parco.2003.12.001 |
| [4] | Azencott, R., Simulated Annealing Parallelization Techniques. (1992), New York, NY: John Wiley & Sons, New York, NY · Zbl 0746.00020 |
| [5] | Badeau, P.; Gendreau, M.; Guertin, F.; Potvin, J.-Y.; Taillard, É. D., A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows, Transportation Research C: Emerging Technologies, 5, 2, 109-122 (1997) · doi:10.1016/S0968-090X(97)00005-3 |
| [6] | Barr, R. S.; Hickman, B. L., Reporting Computational Experiments with Parallel Algorithms:Issues, Measures, and Experts Opinions, ORSA Journal on Computing, 5, 1, 2-18 (1993) · Zbl 0775.65029 |
| [7] | Benkner, S., Doerner, K., Hartl, R.F., Kiechle, G., and Lucka, M. Communication Strategies for Parallel Cooperative Ant Colony Optimization on Clusters and Grids. InComplimentary Proceedings of PARA04, pages 3-12, 2004. |
| [8] | Berger, J.; Barkaoui, M.; Cantú-Paz, E.; Foster, J. A.; Deb, K.; Davis, L.; Roy, R.; O’Reilly, U.-M.; Beyer, H.-G.; Standish, R. K.; Kendal, G.; Wilson, S. W.; Harman, M.; Wegener, J.; Dasgupta, D.; Potter, M. A.; Schultz, A. C.; Dowsland, K. A.; Jonoska, N.; Miller, J. F., Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem, Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionay Computation Conference, Chicago, IL, USA, July 12-16, 2003, Proceedings, Part I, volume 2723 of Lecture Notes in Computer Science, 646-656 (2003), Heidelberg: Springer-Verlag, Heidelberg · Zbl 1028.68678 |
| [9] | Berger, J.; Barkaoui, M., A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows, Computers & Operations Research, 31, 12, 2037-2053 (2004) · Zbl 1100.90503 · doi:10.1016/S0305-0548(03)00163-1 |
| [10] | Bertsekas, D. P.; Tsitsiklis, J. N., Parallel and Distributed Computation, Numerical Methods. (1989), Englewood Cliffs, NJ: Prentice-Hall, Englewood Cliffs, NJ · Zbl 0743.65107 |
| [11] | Bullnheimer, B.; Hartl, R.; Strauβ, C., An Improved Ant System Algorithm for the Vehicle Routing Problem, Annals of Operations Research, 89, 319-328 (1999) · Zbl 0937.90125 · doi:10.1023/A:1018940026670 |
| [12] | Bullnheimer, B.; Kotsis, G.; Strauβ, C., Parallelization Strategies for the Ant System, Applied Optimization, 24, 87-100 (1998) · Zbl 0942.65065 |
| [13] | Cantú-Paz, E., A Survey of Parallel Genetic Algorithms, Calculateurs Parallèles, Réseaux et Systèmes répartis, 10, 2, 141-170 (1998) |
| [14] | Christofides, N.; Mingozzi, A.; Toth, P.; Christofides, N.; Mingozzi, A.; Toth, P.; Sandi, C., The Vehicle Routing Problem, Combinatorial Optimization, 315-338 (1979), New York: John Wiley, New York · Zbl 0413.90075 |
| [15] | Cordeau, J.-F.; Laporte, G.; Mercier, A., A Unified Tabu Search Heuristic for Vehicle Routing Problems with Time Windows, Journal of the Operational Research Society, 52, 928-936 (2001) · Zbl 1181.90034 · doi:10.1057/palgrave.jors.2601163 |
| [16] | Cordeau, J.F. and G. Laporte, G. A Tabu Search Heuristics for the Static Multi-vehicle Dial-a-ride Problem.Transportation Research Part B, pages 579-594, 2003. |
| [17] | Crainic, T. G.; Rego, C.; Alidaee, B., Parallel Computation, Co-operation, Tabu Search, Metaheuristic Optimization Via Memory and Evolution: Tabu Search and Scatter Search, 283-302 (2005), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 1072.90055 · doi:10.1007/0-387-23667-8_13 |
| [18] | Crainic, T. G.; Gendreau, M.; Potvin, J.-Y.; Alba, E., Parallel Tabu Search, Parallel Metaheuristics, 298-313 (2005), Hoboken, NJ: John Wiley & Sons, Hoboken, NJ · Zbl 1137.90725 |
| [19] | Crainic, T. G.; Le Cun, B.; Roucairol, C.; EL-Ghazali, Talbi, Parallel Branch and Bound Algorithms, Parallel Combinatorial Optimization, 1-28 (2006), New York: John Wiley & Sons, New York · doi:10.1002/9780470053928.ch1 |
| [20] | Crainic, T. G.; Li, Y.; Toulouse, M., A First Multilevel Cooperative Algorithm for the Capacitated Multicommodity Network Design, Computers & Operations Research, 33, 9, 2602-2622 (2006) · Zbl 1086.90009 · doi:10.1016/j.cor.2005.07.015 |
| [21] | Crainic, T. G.; Nourredine, H.; Alba, E., Parallel Meta-Heuristics Applications, Parallel Metaheuristics, 447-494 (2005), Hoboken, NJ: John Wiley & Sons, Hoboken, NJ · Zbl 1137.90023 · doi:10.1002/0471739383.ch19 |
| [22] | Crainic, T. G.; Toulouse, M.; Crainic, T. G.; Laporte, G., Parallel Metaheuristics, Fleet Management and Logistics, 205-251 (1998), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 0985.90094 |
| [23] | Crainic, T. G.; Toulouse, M.; Glover, F.; Kochenberger, G., Parallel Strategies for Meta-heuristics, Handbook in Metaheuristics, 475-513 (2003), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 1053.90138 · doi:10.1007/0-306-48056-5_17 |
| [24] | Crainic, T. G.; Toulouse, M.; Gendreau, M., Parallel Asynchronous Tabu Search for Multicommodity Location-Allocation with Balancing Requirements, Annals of Operations Research, 63, 277-299 (1995) · Zbl 0851.90033 · doi:10.1007/BF02125458 |
| [25] | Crainic, T. G.; Toulouse, M.; Gendreau, M., Towards a Taxonomy of Parallel Tabu Search Algorithms, INFORMS Journal on Computing, 9, 1, 61-72 (1997) · Zbl 0891.90094 |
| [26] | Cung, V.-D.; Martins, S. L.; Ribeiro, C. C.; Roucairol, C.; Ribeiro, C. C.; Hansen, P., Strategies for the Parallel Implementations of Metaheuristics, Essays and Surveys in Metaheuristics, 263-308 (2002), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 1005.90066 |
| [27] | Czech, Z.J. and Czarnas, P. Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. In10th Euromicro Workshop on Parallel, Distributed and Network-based Processing, pages 376-383, 2002. |
| [28] | Dai, C., Li, B., and Toulouse, M. A Multilevel Cooperative Tabu Search Algorithm for the Covering Design Problem.Journal of Combinatorial Mathematics and Combinatorial Computing, 2007. · Zbl 1176.05012 |
| [29] | Deb, K.; Pratab, A.; Agrawal, S.; Meyarivan, T., A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, 6, 2, 182-197 (2002) · doi:10.1109/4235.996017 |
| [30] | Doerner, K.; Hartl, R. F.; Kiechle, G.; Lucka, M.; Reimann, M.; Gottlieb, J.; Raidl, G. R., Parallel Ant Systems for the Capacitated Vehicle Routing Problem, Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Proceedings, volume 3004 of Lecture Notes in Computer Science, 72-83 (2004), Berlin: Springer-Verlag, Berlin · Zbl 1177.90338 |
| [31] | Doerner, K. F.; Hartl, R. F.; Benkner, S.; Lucka, M., Cooperative Savings based Ant Colony Optimization - Multiple Search and Decomposition Approaches, Parallel Processing Letters, 16, 3, 351-369 (2006) · doi:10.1142/S0129626406002691 |
| [32] | Doerner, K. F.; Hartl, R. F.; Lucka, M.; Vajtersic, M.; Trobec, R.; Zinterhof, P.; Uhl, A., A Parallel Version of the D-Ant Algorithm for the Vehicle Routing Problem, Parallel Numerics ’05, 109-118 (2005), New York, NY: Springer-Verlag, New York, NY |
| [33] | Dorigo, M.; Stuetzle, T.; Glover, F.; Kochenberger, G., The Ant Colony Metaheuristic. Algorithms, Applications, and Advances, Handbook in Metaheuristics, 251-285 (2003), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 1102.90378 |
| [34] | Drummond, L. M.A.; Ochi, L. S.; Vianna, D. S.; Rolin, J., A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem, International Workshop on Formal Methods for Parallel Programming: Theory and Applications (FMPPTA’99), volume 1586 of Lecture Notes in Computer Science, 183-191 (1999), Heidelberg: Springer-Verlag, Heidelberg |
| [35] | Drummond, L. M.A.; Ochi, L. S.; Vianna, D. S., An Asynchronous Parallel Metaheuristic for the Period Vehicle Routing Problem, Future Generation Computer Systems, 17, 4, 379-386 (2001) · Zbl 1016.68176 · doi:10.1016/S0167-739X(99)00118-1 |
| [36] | Talbi, E.-G., Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem, volume 2871 of Lecture Notes in Computer Science. (2006), Berlin: Springer-Verlag, Berlin |
| [37] | Garcia, B. L.; Potvin, J.-Y.; Rousseau, J. M., A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints, Computers & Operations Research, 21, 9, 1025-1033 (1994) · Zbl 0815.90067 · doi:10.1016/0305-0548(94)90073-6 |
| [38] | Gehring, H.; Homberger, J., A Parallel Two-Phase Metaheuristic for Routing Problems with Time Windows, Asia-Pacific Journal of Operational Research, 18, 1, 35-47 (2001) |
| [39] | Gehring, H.; Homberger, J., Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows, Journal of Heuristics, 8, 251-276 (2002) · Zbl 1012.68793 · doi:10.1023/A:1015053600842 |
| [40] | Gendreau, M.; Guertin, F.; Potvin, J.-Y.; Taillard, EdotE. D., Tabu Search for Real-Time Vehicle Routing and Dispatching, Transportation Science, 33, 4, 381-390 (1999) · Zbl 0958.90051 |
| [41] | Gendreau, M.; Hertz, A.; Laporte, G., A Tabu Search Heuristic for the Vehicle Routing Problem, Management Science, 40, 1276-1290 (1994) · Zbl 0822.90053 |
| [42] | Gendreau, M.; Laporte, G.; Semet, F., A Dynamic Model and Parallel Tabu Search Heuristic for Real-time Ambulance Relocation, Parallel Computing, 27, 12, 1641-1653 (2001) · Zbl 0982.68053 · doi:10.1016/S0167-8191(01)00103-X |
| [43] | Glover, F.; Laguna, M., Tabu Search (1997), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 0930.90083 |
| [44] | Golden, B. L.; Wasil, E. A.; Kelly, J. P.; Chao, I. M.; Crainic, T. G.; Laporte, G., Metaheuristics in Vehicle Routing, Fleet Management and Logistics, pages 33-56. (1998), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 0997.90021 |
| [45] | Greening, D. R., Asynchronous Parallel Simulated Annealing, Lectures in Complex Systems, 3, 497-505 (1990) |
| [46] | Greening, D. R., Parallel Simulated Annealing Techniques, Physica D, 42, 293-306 (1990) · doi:10.1016/0167-2789(90)90084-3 |
| [47] | Holmqvist, K.; Migdalas, A.; Pardalos, P. M.; Migdalas, A.; Pardalos, P. M.; Storoy, S., Parallelized Heuristics for Combinatorial Search, Parallel Computing in Optimization, 269-294 (1997), Norwell, MA: Kluwer Academic Publishers, Norwell, MA · Zbl 0896.90158 |
| [48] | Homberger, J.; Gehring, H., Two Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows, INFOR, 37, 297-318 (1999) · Zbl 07677595 |
| [49] | Guervos, J. M., Parallel and Hybrid Models for Multi-objective Optimization: Application to the Vehicle Routing Problem, volume 2439 of Lecture Notes in Computer Science. (2002), Berlin: Springer-Verlag, Berlin |
| [50] | Le Bouthillier, A.; Crainic, T. G., A Cooperative Parallel Meta-Heuristic for the Vehicle Routing Problem with Time Windows, Computers & Operations Research, 32, 7, 1685-1708 (2005) · Zbl 1074.90006 · doi:10.1016/j.cor.2003.11.023 |
| [51] | Le Bouthillier, A.; Crainic, T. G.; Kropf, P., Towards a Guided Cooperative Search. Publication CRT-05-09, Centre de recherche sur les transports (2005), Canada: Université de Montréal, Montréal, QC, Canada |
| [52] | Lin, S.-C., Punch, W., and Goodman, E. Coarse-Grain Parallel Genetic Algorithms: Categorization and New Approach. InSixth IEEE Symposium on Parallel and Distributed Processing, pages 28-37. IEEE Computer Society Press, 1994. |
| [53] | Moreno-Pérez, J. A.; Hansen, P.; Mladenović, N.; Alba, E., Parallel Variable Neighborhood Search, Parallel Metaheuristics, 247-266 (2005), Hoboken, NJ: John Wiley & Sons, Hoboken, NJ · Zbl 1146.90504 · doi:10.1002/0471739383.ch11 |
| [54] | Mühlenbein, H.; Balci, O.; Sharda, R.; Zenios, S., Parallel Genetic Algorithms in Combinatorial Optimization, Computer Science and Operations Research: New Developments in their Interface, 441-456 (1992), New York, NY: Pergamon Press, New York, NY |
| [55] | Ochi, L. S.; Vianna, D. S.; Drummond, L. M.A.; Victor, A. O., A Parallel Evolutionary Algorithm for the Vehicle Routing Problem with Heterogeneous Fleet, Future Generation Computer Systems, 14, 3, 285-292 (1998) · doi:10.1016/S0167-739X(98)00034-X |
| [56] | Oduntan, I.O., Toulouse, M., Baumgartner, R., Somorjai, R., and Crainic, T.G. A Multilevel Tabu Search Algorithm for the Feature Selection Problem in Biomedical Data Sets.Computers & Mathematics with Applications, 2006. · Zbl 1137.92020 |
| [57] | Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F., and Deogun, J.S. Multi-Level Cooperative Search: Application to the Netlist/Hypergraph Partitioning Problem. InProceedings of International Symposium on Physical Design, pages 192-198. ACM Press, 2000. |
| [58] | Ouyang, M.; Toulouse, M.; Thulasiraman, K.; Glover, F.; Deogun, J. S., Multilevel Cooperative Search for the Circuit/Hypergraph Partitioning Problem, IEEE Transactions on Computer-Aided Design, 21, 6, 685-693 (2002) · doi:10.1109/TCAD.2002.1004312 |
| [59] | Pardalos, P. M.; Pitsoulis, L.; Mavridou, T.; Resende, M. G.C.; Ferreira, A.; Rolim, J., Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP, Proceedings of Workshop on Parallel Algorithms for Irregularly Structured Problems, Lecture Notes in Computer Science, volume 980, 317-331 (1995), Berlin: Springer-Verlag, Berlin |
| [60] | Polacek, M.; Benkner, S.; Doerner, K. F.; Hartl, R. F., A Cooperative and Adaptive Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. Working paper, Institute of Management Science (2006), Vienna, Austria: University of Vienna, Vienna, Austria |
| [61] | Polacek, M.; Hartl, R. F.; Doerner, K. F.; Reimann, M., A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows, Journal of Heuristics, 10, 6, 613-627 (2004) · doi:10.1007/s10732-005-5432-5 |
| [62] | Prins, C., A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem, Computers & Operations Research, 31, 12, 1985-2002 (2004) · Zbl 1100.90504 · doi:10.1016/S0305-0548(03)00158-8 |
| [63] | Ralphs, T. K.; Talbi, E.-G., Parallel Branch and Cut Algorithms, Parallel Combinatorial Optimization, 53-101 (2006), Hoboken, NJ: Wiley-Interscience, Wiley & Sons, Hoboken, NJ · doi:10.1002/9780470053928.ch3 |
| [64] | Ralphs, T. K., Parallel Branch and Cut for Capacitated Vehicle Routing, Parallel Computing, 29, 607-629 (2003) · doi:10.1016/S0167-8191(03)00045-0 |
| [65] | Ralphs, T. K.; Ladaacuteany, L.; Saltzman, M. J., Parallel Branch, Cut, and Price for Large-Scale Discrete Optimization, Mathematical Programming, 98, 1-3, 253-280 (2003) · Zbl 1082.90102 · doi:10.1007/s10107-003-0404-8 |
| [66] | Ralphs, T. K.; Ladány, L.; Saltzman, M. J., A Library Hierarchy for Implementing Scalable Parallel Search Algorithms, Journal of Parallel and Distributed Computing, 37, 207-212 (2004) · Zbl 1062.90039 |
| [67] | Ram, D. J.; Sreenivas, T. H.; Subramaniam, K. G., Parallel Simulated Annealing Algorithms, Journal of Parallel and Distributed Computing, 37, 207-212 (1996) · doi:10.1006/jpdc.1996.0121 |
| [68] | Rego, C.; Roucairol, C.; Osman, I. H.; Kelly, J. P., A Parallel Tabu Search Algorithm Using Ejection Chains for the VRP, Meta-Heuristics: Theory & Applications, 253-295 (1996), Norwell, MA: Kluwer Academic Publishers, Norwell, MA |
| [69] | Reimann, M.; Doerner, K.; Hartl, R., D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem, Computers & Operations Research, 31, 4, 563-591 (2004) · Zbl 1061.90024 · doi:10.1016/S0305-0548(03)00014-5 |
| [70] | Reimann, M.; Stummer, M.; Doerner, K.; Langton, C.; Cantuacute-Paz, E.; Mathias, K. E.; Roy, R.; Davis, L.; Poli, R.; Balakrishnan, K.; Honavar, V.; Rudolph, G.; Wegener, J.; Bull, L.; Potter, M. A.; Schultz, A. C.; Miller, J. F.; Burke, E. K.; Jonoska, N., A Savings Based Ants System for the Vehicle Routing Problem, GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, USA, July 9-13, 2002, 1317-1326 (2002), San Francisco, CA: Morgan Kaufmann Publishers, Inc., San Francisco, CA |
| [71] | Rochat, Y.; Taillard, É. D., Probabilistic Diversification and Intensification in Local Search for Vehicle Routing, Journal of Heuristics, 1, 1, 147-167 (1995) · Zbl 0857.90032 · doi:10.1007/BF02430370 |
| [72] | Schulze, J.; Fahle, T., A Parallel Algorithm for the Vehicle Routing Problem with Time Window Constraints, Annals of Operations Research, 86, 585-607 (1999) · Zbl 0922.90059 · doi:10.1023/A:1018948011707 |
| [73] | Shonkwiler, R.; Forrest, S., Parallel Genetic Algorithms, Proceedings of the Fifth International Conference on Genetic Algorithms, 199-205 (1993), San Mateo, CA: Morgan Kaufmann, San Mateo, CA |
| [74] | Solomon, M. M., Time Window Constrained Routing and Scheduling Problems, Operations Research, 35, 2, 254-265 (1987) · Zbl 0625.90047 · doi:10.1287/opre.35.2.254 |
| [75] | Taillard, Edot. D., Parallel Iterative Search Methods for Vehicle Routing Problems, Networks, 23, 661-673 (1993) · Zbl 0804.90045 · doi:10.1002/net.3230230804 |
| [76] | Taillard, Edot. D.; Badeau, P.; Gendreau, M.; Guertin, F.; Potvin, J.-Y., A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows, Transportation Science, 31, 2, 170-186 (1997) · Zbl 0886.90070 |
| [77] | Talbi, E.-G., Parallel Combinatorial Optimization. Wiley-Interscience (2006), Hoboken, NJ: Wiley & Sons, Hoboken, NJ |
| [78] | Toulouse, M.; Thulasiraman, K.; Glover, F.; Amestoy, P.; Berger, P.; Daydeacute, M.; Duff, I.; Fraysseeacute, V.; Giraud, L.; Ruiz, D., Multi-Level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning, 5th International Euro-Par Parallel Processing Conference, volume 1685 of Lecture Notes in Computer Science, 533-542 (1999), Heidelberg: Springer-Verlag, Heidelberg |
| [79] | Verhoeven, M. G.A.; Aarts, E. H.L., Parallel Local Search, Journal of Heuristics, 1, 1, 43-65 (1995) · Zbl 0853.68156 · doi:10.1007/BF02430365 |
| [80] | Voβ, S.; Du, D.-Z.; Pardalos, P. M., Tabu Search: Applications and Prospects, Network Optimization Problems, pages 333-353. (1993), Singapore: World Scientific Publishing Co., Singapore · Zbl 0941.68504 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
