Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2015.10.010 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2015.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1877579279 / 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: Solving an urban waste collection problem using ants heuristics / 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: The Capacitated Arc Routing Problem: Lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-First Branch-and-Price-Second 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: The mixed capacitated arc routing problem with non-overlapping routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on Arc Routing Problems: An annotated bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289893 / 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: Lower and upper bounds for location-arc routing problems with vehicle capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4510100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated arc routing problem with intermediate facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated arc routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the mixed capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network service scheduling and routing / 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: Improved bounds for large scale capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic method for a mixed capacitated arc routing problem: A refuse collection application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for the sectoring arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search procedure for the multi-compartment capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate solutions for the capacitated arc routing problem / 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: Experimental evaluation of heuristic optimization algorithms: A tutorial / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Arc Routing and Scheduling Problem with Transshipment / 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: Q5191184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fleet size and mix problem for capacitated arc routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with evolutionary path-relinking for the capacitated arc routing problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2015.10.010 / rank
 
Normal rank

Latest revision as of 00:11, 9 December 2024

scientific article
Language Label Description Also known as
English
Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
scientific article

    Statements

    Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    waste collection
    0 references
    capacitated arc routing problem
    0 references
    mixed network
    0 references
    intermediate facilities
    0 references
    time restrictions
    0 references
    constructive heuristics
    0 references
    minimise fleet size
    0 references
    benchmark instances
    0 references
    0 references
    0 references
    0 references

    Identifiers