A time-based pheromone approach for the ant system (Q1758053): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MACS-VRPTW / 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/s11590-012-0451-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969350563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rank based version of the ant system. -- A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved ant system algorithm for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified tabu search heuristic for vehicle routing problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Encyclopedia of Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid search method for the vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general heuristic for vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / 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: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by ant algorithms: possible roles for an individual ant / rank
 
Normal rank

Latest revision as of 21:06, 5 July 2024

scientific article
Language Label Description Also known as
English
A time-based pheromone approach for the ant system
scientific article

    Statements

    A time-based pheromone approach for the ant system (English)
    0 references
    0 references
    0 references
    7 November 2012
    0 references
    ant systems
    0 references
    vehicle routing
    0 references
    time windows
    0 references
    metaheuristics
    0 references
    ant colony optimization
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers