Coupling ant colony systems with strong local searches
From MaRDI portal
Publication:1926808
DOI10.1016/j.ejor.2012.02.038zbMath1253.90195OpenAlexW2001600893MaRDI QIDQ1926808
Dennis Weyland, Luca Maria Gambardella, Roberto Montemanni
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.02.038
combinatorial optimizationmetaheuristicsant colony optimizationprobabilistic traveling salesman problemssequential ordering problemsteam orienteering problems
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ Boosting ant colony optimization via solution prediction and machine learning ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Solving the orienteering problem with time windows via the pulse framework ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ An improved ant colony system for the sequential ordering problem ⋮ An efficient ant colony optimization algorithm for the blocks relocation problem ⋮ An iterative three-component heuristic for the team orienteering problem with time windows ⋮ A Tabu search algorithm for the probabilistic orienteering problem ⋮ The synchronized multi-assignment orienteering problem ⋮ Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The orienteering problem: a survey
- A hybrid particle swarm optimization approach for the sequential ordering problem
- Heuristics for the multi-period orienteering problem with multiple time windows
- Iterated local search for the team orienteering problem with time windows
- An efficient implementation of local search algorithms for constrained routing problems
- A heuristic manipulation technique for the sequential ordering problem
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- A path relinking approach for the team orienteering problem
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
- An inexact algorithm for the sequential ordering problem
- Stochastic vehicle routing
- The team orienteering problem
- A fast and effective heuristic for the orienteering problem
- Minimum directed 1-subtree relaxation for score orienteering problem
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- A heuristic for the multiple tour maximum collection problem
- Strong linear programming relaxations for the orienteering problem
- The traveling salesman. Computational solutions for RSP applications
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
- A TABU search heuristic for the team orienteering problem
- Solving the probabilistic TSP with ant colony optimization
- The precedence-constrained asymmetric traveling salesman polytope
- Combining simulated annealing with local search heuristics
- An exact algorithm for team orienteering problems
- Aggregation for the probabilistic traveling salesman problem
- Ant colony optimization theory: a survey
- A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
- Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem
- The orienteering problem
- The Orienteering Problem with Time Windows
- Fast Algorithms for Geometric Traveling Salesman Problems
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
- Solving the Orienteering Problem through Branch-and-Cut
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers
- A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
This page was built for publication: Coupling ant colony systems with strong local searches
