نتایج جستجو برای: lin kernigan algorithm

تعداد نتایج: 763587  

2012
Scott S. C. Wigley

A preliminary report of the "blind" controlled trial of BCG in progress at Karimui in the Eastem Highlands of the Territory of Papua and New Guinea has been published (In). In March 1963, 85 per cent of the 5,000 persons comprising the Karimui population were tested with 0.1 ml. of 1: 1,000 OT (10 TU ). In March 1964, a sample of 1,331 persons was retested and the results of these hlberculin su...

Journal: :Computers & OR 2013
Ravi Kothari Diptesh Ghosh

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, while minimizing the weighted sum of the distances between all pairs of facilities. The problem is known to be NP-hard. In this paper, we present a neighborhood search heuristic called LK-INSERT which uses a Lin-Kernighan neighborhood structure built on insertion neighborhoods. To...

Journal: :European Journal of Operational Research 2011
César Rego Dorabela Gamboa Fred Glover Colin Osterman

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.09.010 ⇑ Corresponding author. Tel.: +1 662 915 5519. E-mail addresses: [email protected] (C. R (D. Gamboa), [email protected] (F. Glover), [email protected] (C. Osterman). Heuristics for the traveling salesman problem (TSP) have made remarkable advances in recent years. We survey the leading methods an...

2004
Jano I. van Hemert Neil Urquhart

This paper introduces a generator that creates problem instances for the Euclidean symmetric travelling salesman problem. To fit real world problems, we look at maps consisting of clustered nodes. Uniform random sampling methods do not result in maps where the nodes are spread out to form identifiable clusters. To improve upon this, we propose an evolutionary algorithm that uses the layout of n...

Journal: :INFORMS Journal on Computing 2003
David Applegate William J. Cook André Rohe

We discuss several issues that arise in the implementation of Martin, Otto, and Felten's Chained Lin-Kernighan heuristic for large-scale traveling salesman problems. Computational results are presented for TSPLIB instances ranging in size from 11,849 cities up to 85,900 cities; for each of these instances, solutions within 1% of the optimal value can be found in under 1 CPU minute on a 300 Mhz ...

Journal: :Journal of the Canadian Health Libraries Association / Journal de l'Association des bibliothèques de la santé du Canada 2014

Journal: :Journal für Ornithologie 1859

2012
Chun-Fei Hsu Chih-Min Lin

Recently, neural-network-based adaptive control technique has attracted increasing attentions, because it has provided an efficient and effective way in the control of complex nonlinear or ill-defined systems (Duarte-Mermoud et al., 2005; Hsu et al., 2006; Lin and Hsu, 2003; Lin et al., 1999; Peng et al. 2004). The key elements of this success are the approximation capabilities of the neural ne...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید