An efficient GVNS for solving Traveling Salesman Problem with Time Windows (Q2840756): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 general VNS heuristic for the traveling salesman problem with time windows / 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: Q4365133 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Beam-ACO for the travelling salesman problem with time windows / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Variable neighborhood search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows / rank | |||
Normal rank |
Latest revision as of 15:28, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient GVNS for solving Traveling Salesman Problem with Time Windows |
scientific article |
Statements
An efficient GVNS for solving Traveling Salesman Problem with Time Windows (English)
0 references
23 July 2013
0 references
traveling salesman problem
0 references
time window
0 references
GVNS
0 references