An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10732-008-9101-3 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-008-9101-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025178129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A food distribution network problem: a case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound for the Split Delivery Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Truck Dispatching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Savings by Split Delivery Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split delivery routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing with split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The split delivery vehicle scheduling problem with time windows and grid network distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the split delivery vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-delivery routeing heuristics in livestock feed distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing helicopters for crew exchanges on off-shore locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10732-008-9101-3 / rank
 
Normal rank

Latest revision as of 10:43, 10 December 2024

scientific article
Language Label Description Also known as
English
An adaptive memory algorithm for the split delivery vehicle routing problem
scientific article

    Statements

    An adaptive memory algorithm for the split delivery vehicle routing problem (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2010
    0 references
    adaptive memory
    0 references
    vehicle routing
    0 references
    split delivery
    0 references
    route angle control
    0 references
    heuristic
    0 references
    variable neighborhood descent
    0 references

    Identifiers