Heuristic solutions to multi-depot location-routing problems (Q1603335): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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 / cites work
 
Property / cites work: Implementing vehicle routing algorithms / 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: An exact algorithm for minimizing routing and operating costs in depot location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3787762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and exact solutions for a class of stochastic location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution to the warehouse location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested Heuristic Methods for the Location-Routeing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4955264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for \(l_ p\) norm location-allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incorporating vehicle into the vehicle routing fleet composition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708092 / rank
 
Normal rank

Latest revision as of 11:45, 4 June 2024

scientific article
Language Label Description Also known as
English
Heuristic solutions to multi-depot location-routing problems
scientific article

    Statements

    Heuristic solutions to multi-depot location-routing problems (English)
    0 references
    0 references
    0 references
    0 references
    11 July 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references