A large neighbourhood based heuristic for two-echelon routing problems (Q342576): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/cor/BreunigSHV16, #quickstatements; #temporary_batch_1731475607626
 
(6 intermediate revisions by 6 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CMA-ES / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593437733 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59389533 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.08003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the two-echelon capacitated location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guide to vehicle routing heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on two-echelon routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of heuristics for a two-level routing-location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Record breaking optimization results using the ruin and recreate principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/cor/BreunigSHV16 / rank
 
Normal rank

Latest revision as of 06:30, 13 November 2024

scientific article
Language Label Description Also known as
English
A large neighbourhood based heuristic for two-echelon routing problems
scientific article

    Statements

    A large neighbourhood based heuristic for two-echelon routing problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    two-echelon vehicle routing problem
    0 references
    wo-echelon location routing problem
    0 references
    two-echelon location routing problem with single depot
    0 references
    adaptive large neighbourhood search
    0 references
    covariance matrix adaptation evolution strategy
    0 references
    capacitated vehicle routing problem
    0 references
    large neighbourhood search
    0 references
    multi-depot vehicle routing problem
    0 references
    split delivery vehicle routing problem
    0 references
    variable neighbourhood search
    0 references
    heuristic
    0 references
    city logistics
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers