Crossover iterated local search for SDCARP (Q489138): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dan Lin / 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.1007/s40305-014-0056-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977370146 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds and exact algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic tabu search algorithm for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search for the periodic capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / 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: A variable neighborhood descent algorithm for a real waste collection problem with mobile depots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / 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: A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Capacitated arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive memetic algorithms for arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for a bi-objective capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved heuristic for the capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 13:54, 9 July 2024

scientific article
Language Label Description Also known as
English
Crossover iterated local search for SDCARP
scientific article

    Statements

    Crossover iterated local search for SDCARP (English)
    0 references
    0 references
    0 references
    27 January 2015
    0 references
    capacitated arc routing problem
    0 references
    split-delivery
    0 references
    memetic algorithm
    0 references
    iterated local search
    0 references
    0 references
    0 references
    0 references

    Identifiers