Coupling ant colony systems with strong local searches (Q1926808): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(8 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2012.02.038 / rank
Normal rank
 
Property / author
 
Property / author: Q706973 / rank
Normal rank
 
Property / author
 
Property / author: Roberto Montemanni / rank
Normal rank
 
Property / author
 
Property / author: Luca Maria Gambardella / rank
 
Normal rank
Property / author
 
Property / author: Roberto Montemanni / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MACS-VRPTW / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.1016/j.ejor.2012.02.038 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001600893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid particle swarm optimization approach for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for team orienteering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the probabilistic TSP with ant colony optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation for the probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and effective heuristic for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colony optimization theory: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orienteering Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum directed 1-subtree relaxation for score orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear programming relaxations for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining simulated annealing with local search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3075638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2956989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic manipulation technique for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of local search algorithms for constrained routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach for the team orienteering problem / 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 TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2012.02.038 / rank
 
Normal rank

Latest revision as of 13:10, 16 December 2024

scientific article
Language Label Description Also known as
English
Coupling ant colony systems with strong local searches
scientific article

    Statements

    Coupling ant colony systems with strong local searches (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    combinatorial optimization
    0 references
    metaheuristics
    0 references
    ant colony optimization
    0 references
    sequential ordering problems
    0 references
    team orienteering problems
    0 references
    probabilistic traveling salesman problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers