Ant colony optimization with clustering for solving the dynamic location routing problem
From MaRDI portal
Recommendations
- Improved ant colony optimization algorithm for solving dynamic vehicle routing problem with time windows
- A monarch butterfly optimization for the dynamic vehicle routing problem
- An ant colony algorithm based on clustering and partition optimization
- An ant colony algorithm aimed at dynamic continuous optimization
- A dynamic optimisation approach for ant colony optimisation using the multidimensional knapsack problem
Cites work
- scientific article; zbMATH DE number 1703864 (Why is no real title available?)
- scientific article; zbMATH DE number 2079890 (Why is no real title available?)
- scientific article; zbMATH DE number 1488087 (Why is no real title available?)
- scientific article; zbMATH DE number 2114491 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
- A genetic algorithm for the vehicle routing problem
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
- A two-phase tabu search approach to the location routing problem
- An improved ant system algorithm for the vehicle routing problem
- Ant colony optimization.
- Ant colony system for a dynamic vehicle routing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Equation of state calculations by fast computing machines
- Heuristic solutions to multi-depot location-routing problems
- Integrating multi-product production and distribution in newspaper logistics
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Models and exact solutions for a class of stochastic location-routing problems
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Multi-strategy ensemble particle swarm optimization for dynamic optimization
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Parallel metaheuristics: recent advances and new trends
- Reducibility among combinatorial problems
- Using clustering analysis in a capacitated location-routing problem
Cited in
(9)- A customized genetic algorithm for bi-objective routing in a dynamic network
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- A monarch butterfly optimization for the dynamic vehicle routing problem
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- Location‐routing problem: a classification of recent research
- Sustainable multi-depot emergency facilities location-routing problem with uncertain information
- An improved hybrid genetic search with data mining for the CVRP
- Dynamic vehicle routing problems with enhanced ant colony optimization
This page was built for publication: Ant colony optimization with clustering for solving the dynamic location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1733491)
