Sensitive Ants in Solving the Generalized Vehicle Routing Problem

08/27/2012
by   Camelia-M. Pintea, et al.
0

The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population of ants can potentially intensify the search while in the same time inducing diversity for the exploration of the environment. The performance of sensitive ant models is investigated for solving the generalized vehicle routing problem. Numerical results and comparisons are discussed and analysed with a focus on emphasizing any particular aspects and potential benefits related to hybrid ant-based models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2020

Learning (Re-)Starting Solutions for Vehicle Routing Problems

A key challenge in solving a combinatorial optimization problem is how t...
research
04/07/2020

Hybrid 2-stage Imperialist Competitive Algorithm with Ant Colony Optimization for Solving Multi-Depot Vehicle Routing Problem

The Multi-Depot Vehicle Routing Problem (MDVRP) is a real-world model of...
research
04/03/2023

Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows

With the rise of e-commerce and increasing customer requirements, logist...
research
12/22/2021

A Deep Reinforcement Learning Approach for Solving the Traveling Salesman Problem with Drone

Reinforcement learning has recently shown promise in learning quality so...
research
05/15/2020

MineReduce: an approach based on data mining for problem size reduction

Hybrid variations of metaheuristics that include data mining strategies ...
research
08/24/2012

A Unifying Survey of Reinforced, Sensitive and Stigmergic Agent-Based Approaches for E-GTSP

The Generalized Traveling Salesman Problem (GTSP) is one of the NP-hard ...

Please sign up or login with your details

Forgot password? Click here to reset