GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2017.05.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2614564353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations of generalized ATSP into ATSP. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyper-Heuristics: An Emerging Direction in Modern Search Technology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The symmetric generalized traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2749862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Generalized Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search for the discrete and continuous berth allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Dubins Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient composite heuristic for the symmetric generalized traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random-key genetic algorithm for the generalized traveling salesman problem / rank
 
Normal rank

Latest revision as of 03:12, 16 July 2024

scientific article
Language Label Description Also known as
English
GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
scientific article

    Statements

    GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    generalized traveling salesman problem
    0 references
    traveling salesman problem
    0 references
    adaptive large neighborhood search
    0 references
    clustered traveling salesman
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references