Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. (Netherlands), 63:339-370, 1996. yCCA70141/96 ga96fJ-YPotvin. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Indexed Bibliography of Genetic Algorithms and the Traveling.. - Alander (2000) (Correct)
....articles The following list contains the references to every journal article included in this bibliography. The list is arranged in alphabetical order by the name of the journal. Acta Electronica Sinica (China) 68] Advanced Technology for Developers, 132, 147] Ann. Oper. Res. Netherlands) [55, 66] Arti cial Intelligence, 12] Arti cial Intelligence Review, 93] Autom. Prod. Inform. Ind. France) 30] Biological Cybernetics, 99, 100, 101, 102, 115, 119, 129] Br. Telecommun. Eng. UK) 14] Complex Systems, 126] Computers Industrial Engineering, 23] Cybern. Syst. USA) 81] ....
....Pavel, 48, 75, 77] Ost, Alexander, 150] Pal, K. F. 129] Palmer, Mark R. 135] Pao, Yoh Han, 162] Percus, Allon, 12] Perov, V. L. 101] Pesch, Erwin, 19, 144] Peterson, Carsten, 145] Petry, Frederick E. 110] Pierreval, Henri, 30] Portmann, Marie Claude, 30] Potvin, Jean Yves, [55, 62, 66] Potvin, J. Y. 70] Prinetto, P. 146] Qu, Liangsheng, 94] Quilleret, F. 70] Radcli e, Nicholas J. 63] Rao, Vasant B. 149] Rau e, Paul Erik, 50] Rebaudengo, Maurizio, 146] Reetz, Bob, 147] Reinartz, Karl Dieter, 150] Richardson, Jon T. 135] Roberts, A. 28] Roberts, S. M. ....
[Article contains additional citation context not shown here]
Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. (Netherlands), 63:339-370, 1996. yCCA70141/96 ga96fJ-YPotvin.
An Indexed Bibliography of Genetic Algorithms and the Traveling.. - Alander (2000) (Correct)
....articles The following list contains the references to every journal article included in this bibliography. The list is arranged in alphabetical order by the name of the journal. Acta Electronica Sinica (China) 68] Advanced Technology for Developers, 132, 147] Ann. Oper. Res. Netherlands) [55, 66] Arti cial Intelligence, 12] Arti cial Intelligence Review, 93] Autom. Prod. Inform. Ind. France) 30] Biological Cybernetics, 99, 100, 101, 102, 115, 119, 129] Br. Telecommun. Eng. UK) 14] Complex Systems, 126] Computers Industrial Engineering, 23] Cybern. Syst. USA) 81] ....
....Pavel, 48, 75, 77] Ost, Alexander, 150] Pal, K. F. 129] Palmer, Mark R. 135] Pao, Yoh Han, 162] Percus, Allon, 12] Perov, V. L. 101] Pesch, Erwin, 19, 144] Peterson, Carsten, 145] Petry, Frederick E. 110] Pierreval, Henri, 30] Portmann, Marie Claude, 30] Potvin, Jean Yves, [55, 62, 66] Potvin, J. Y. 70] Prinetto, P. 146] Qu, Liangsheng, 94] Quilleret, F. 70] Radcli e, Nicholas J. 63] Rao, Vasant B. 149] Rau e, Paul Erik, 50] Rebaudengo, Maurizio, 146] Reetz, Bob, 147] Reinartz, Karl Dieter, 150] Richardson, Jon T. 135] Roberts, A. 28] Roberts, S. M. ....
[Article contains additional citation context not shown here]
Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. (Netherlands), 63:339-370, 1996. yCCA70141/96 ga96aJ-YPotvin.
Perturbation Method For Probabilistic Search For.. - Cohoon, Karro.. (Correct)
....the details of our genetic algorithm SPAN,c omparetheSPAN method with a state of the art genetic algorithm, and draw conclusions. For a detailed history of the TSP see the monograph of Lawler, Lenstra, Rinnooy Kan, and Shmoys [11] For an examination of TSP genetic algorithms see Potvin s survey [14]. 2. A simple heuristic with bounded performance Although the primary area of investigation that we consider here is probabilistic search and in particular, a genetic algorithm, it is first necessary to consider one of the classic effective heuristics that uses a minimum spanning tree as a basis ....
....that produces the offspring s tour out of elements (building blocks) from its parents p 1 and p 2 .Letpbe the tour represented by p 1 and let t be the tour represented by p 2 . Some of the more popular TSP crossovers are variants of the following methods (for a more complete list see Potvin [14]) Listing 1. A basic genetic algorithm. Algorithm Construct initial population P Compute fitnesses for strings in P best =min score(p) pin P for i = 1 to the number of generations N G Offspring =emptyset for j =1to number of crossovers N C p 1 = choose(P, fitness) p 2 = choose(P ....
[Article contains additional citation context not shown here]
J.-Y. Potvin, "Genetic algorithms for the traveling salesman problem," Annals of Operations Research, pp. 339-370, 1996.
An Indexed Bibliography of Genetic Algorithms - Papers of.. - Jarmo T. Alander (1999) (Correct)
....[333] Adv. Eng. Softw. UK) 517, 657, 689, 832] Advanced Composites Letters, 324] AES J. Audio Eng. Soc. 872] AI Communications, 141] AIAA Journal, 612, 870] AIAA Journal on Disc, 230, 337, 512, 660, 815] Analytical Chemistry, 24, 374, 633] Ann. Oper. Res. Netherlands) [182, 192, 852, 900] Annals of Operations Research, 648, 677] APL Quote Quad, 303, 463] Appl. Artif. Intell. 282] Appl. Artif. Intell. USA) 427] Appl. Intell. Int. J.Artif. Intell. Neural Netw. Complex Probl Solving Technol (Netherlands) 687, 904] Appl. Intell. Int. Artif. Intell. Neural Netw. Complex ....
....E. 62, 606] Phan Tan Luu, R. 60] Phillips, C. 363] Piazzi, Aurelio, 294] Pierre, S. 364] Pierreval, Henri, 849] Pirlot, Marc, 365] Plumbley, Mark, 511] Poloni, Carlo, 761] Poon, Josiah, 738] Poon, J. 843] Posp ichal, Jir i, 246] Potts, C. N. 628] Potvin, Jean Yves, [192, 687, 831, 874, 893, 900, 904] Poza, Mikel, 730] Prabhu, Devaraya, 606] Preppernau, Bryan L. 204] Prince, R. G. H. 366] Prinetto, Paolo, 819] Pullan, W. J. 527, 805] Qiang, Wang, 369, 763] Qingchun, Meng, 371] Qiu, Gnoping, 372] Qizhi, Zhang, 345] Quinn, Roger D. 133] Quinte, A. 209] Rabow, Alfred A. ....
[Article contains additional citation context not shown here]
Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. (Netherlands), 63:339--370, 1996. yCCA70141/96 ga96fJ-YPotvin.
An Indexed Bibliography of Genetic Algorithms - Papers of.. - Jarmo T. Alander (1999) (Correct)
....[333] Adv. Eng. Softw. UK) 517, 657, 689, 832] Advanced Composites Letters, 324] AES J. Audio Eng. Soc. 872] AI Communications, 141] AIAA Journal, 612, 870] AIAA Journal on Disc, 230, 337, 512, 660, 815] Analytical Chemistry, 24, 374, 633] Ann. Oper. Res. Netherlands) [182, 192, 852, 900] Annals of Operations Research, 648, 677] APL Quote Quad, 303, 463] Appl. Artif. Intell. 282] Appl. Artif. Intell. USA) 427] Appl. Intell. Int. J.Artif. Intell. Neural Netw. Complex Probl Solving Technol (Netherlands) 687, 904] Appl. Intell. Int. Artif. Intell. Neural Netw. Complex ....
....E. 62, 606] Phan Tan Luu, R. 60] Phillips, C. 363] Piazzi, Aurelio, 294] Pierre, S. 364] Pierreval, Henri, 849] Pirlot, Marc, 365] Plumbley, Mark, 511] Poloni, Carlo, 761] Poon, Josiah, 738] Poon, J. 843] Posp ichal, Jir i, 246] Potts, C. N. 628] Potvin, Jean Yves, [192, 687, 831, 874, 893, 900, 904] Poza, Mikel, 730] Prabhu, Devaraya, 606] Preppernau, Bryan L. 204] Prince, R. G. H. 366] Prinetto, Paolo, 819] Pullan, W. J. 527, 805] Qiang, Wang, 369, 763] Qingchun, Meng, 371] Qiu, Gnoping, 372] Qizhi, Zhang, 345] Quinn, Roger D. 133] Quinte, A. 209] Rabow, Alfred A. ....
[Article contains additional citation context not shown here]
Jean-Yves Potvin. Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. (Netherlands), 63:339--370, 1996. yCCA70141/96 ga96aJ-YPotvin.
Real-Time Decision Problems: an Operations Research.. - Séguin.. (Correct)
No context found.
Potvin, J.-Y. 1993. Genetic Algorithms for the Traveling Salesman Problem. Report CRT-936, Center for Research on Transportation, University of Montreal, Canada. To appear in Annals of Operations Research.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC