A metaheuristic approach to fisheries survey route planning (Q5278221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1111/itor.12252 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GALib / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57709767 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.12252 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2413037331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the travelling salesperson problem with hotel selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust ship scheduling with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the family traveling salesperson problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/itor/MesquitaMPW17 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1111/ITOR.12252 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:36, 30 December 2024

scientific article; zbMATH DE number 6744655
Language Label Description Also known as
English
A metaheuristic approach to fisheries survey route planning
scientific article; zbMATH DE number 6744655

    Statements

    A metaheuristic approach to fisheries survey route planning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    traveling salesman problem
    0 references
    multiple time windows
    0 references
    genetic algorithm
    0 references
    adaptive large neighborhood search
    0 references
    heuristics
    0 references

    Identifiers