Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2017.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2605973318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039765 / 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: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling / rank
 
Normal rank

Revision as of 21:19, 14 July 2024

scientific article
Language Label Description Also known as
English
Variable neighborhood search algorithms for pickup and delivery problems with loading constraints
scientific article

    Statements

    Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (English)
    0 references
    0 references
    0 references
    4 January 2018
    0 references
    routing
    0 references
    loading constraints
    0 references
    backhauls
    0 references
    variable neighborhood search
    0 references

    Identifiers