A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (Q4979997): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SSJ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.1111/itor.12070 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084221840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the two-dimensional loading vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tabu search for the vehicle routing problem with two-dimensional loading constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:12, 8 July 2024

scientific article; zbMATH DE number 6305874
Language Label Description Also known as
English
A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
scientific article; zbMATH DE number 6305874

    Statements

    A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (English)
    0 references
    0 references
    0 references
    0 references
    20 June 2014
    0 references
    vehicle routing problem
    0 references
    vehicle packing
    0 references
    multistart algorithms
    0 references
    biased randomization
    0 references
    heuristics
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references