The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.21984 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.21984 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3084549995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced lower bound for the time-dependent travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint programming approach to the Chinese postman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the node, edge, and arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows / 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: The time-dependent prize-collecting arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for the traveling salesman problem with time-dependent service times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-price-and-cut for the mixed capacitated general routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependent vehicle routing problem with a multi ant colony system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phase branch-and-cut for the mixed capacitated general routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-dependent hierarchical Chinese postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of Ranks in One-Criterion Variance Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The windy rural postman problem with a time-dependent zigzag option / rank
 
Normal rank
Property / cites work
 
Property / cites work: A capacitated general routing problem on mixed networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using constraint-based operators to solve the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the Chinese postman problem with time-dependent travel time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc routing problems with time-dependent service costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach for the Rural Postman Problem with Time Dependent Travel Times / 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: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-constrained Chinese postman problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.21984 / rank
 
Normal rank

Latest revision as of 18:21, 30 December 2024

scientific article; zbMATH DE number 7769698
Language Label Description Also known as
English
The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands
scientific article; zbMATH DE number 7769698

    Statements

    The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2023
    0 references
    metaheuristic
    0 references
    mixed capacitated general routing problem
    0 references
    road winter maintenance
    0 references
    slack induction by string removals
    0 references
    time-dependent demands
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references