Beam-ACO for the travelling salesman problem with time windows (Q2270441): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Beam-ACO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086918511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Exact Algorithm for the TSPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO for Simple Assembly Line Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows Part II: Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875843 / rank
 
Normal rank

Latest revision as of 13:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Beam-ACO for the travelling salesman problem with time windows
scientific article

    Statements

    Beam-ACO for the travelling salesman problem with time windows (English)
    0 references
    0 references
    0 references
    18 March 2010
    0 references
    ant colony optimization
    0 references
    travelling salesman problem with time windows
    0 references
    hybridization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers