Ant colony optimization with clustering for solving the dynamic location routing problem

DOI10.1016/j.amc.2016.03.035zbMath1410.90117OpenAlexW2339005802MaRDI QIDQ1733491

Shangce Gao, Jiujun Cheng, Zheng Tang, Yasuhiro Inazumi, Yirui Wang

Publication date: 21 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2016.03.035

zbMATH Keywords

dynamic optimizationclustering algorithmdynamic environmentlocation routingant colony algorithmimmigrant scheme

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Location‐routing problem: a classification of recent research ⋮ Dynamic vehicle routing problems with enhanced ant colony optimization ⋮ 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 ⋮ Sustainable multi-depot emergency facilities location-routing problem with uncertain information

Uses Software

• VRP
• KEEL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Using clustering analysis in a capacitated location-routing problem
• Multi-strategy ensemble particle swarm optimization for dynamic optimization
• Models and exact solutions for a class of stochastic location-routing problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Heuristic solutions to multi-depot location-routing problems
• A two-phase tabu search approach to the location routing problem
• An improved ant system algorithm for the vehicle routing problem
• A genetic algorithm for the vehicle routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
• Integrating multi-product production and distribution in newspaper logistics
• Ant colony system for a dynamic vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Parallel metaheuristics: recent advances and new trends
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
• Reducibility among Combinatorial Problems
• Equation of State Calculations by Fast Computing Machines
• A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands

This page was built for publication: Ant colony optimization with clustering for solving the dynamic location routing problem