A novel ant colony system for solving the one-commodity traveling salesman problem with selective pickup and delivery

2012 ◽  
Author(s):  
Lian-Ming Mou ◽  
Xi-Li Dai
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony System ◽  
Pickup And Delivery ◽  
The One

An Improved Ant Colony System Based on Negative Biased

2010 ◽  
Vol 439-440 ◽  
pp. 558-562
Author(s):  
Jin Qiu Yang ◽  
Jian Gang Yang ◽  
Gen Lang Chen
Keyword(s):  
Convergence Rate ◽  
Ant Colony Optimization ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Ant Colony ◽  
Ant Colony System ◽  
Ant System

Ant System (AS) was the first Ant Colony Optimization (ACO) algorithm, which converged too slowly and consumed huge computation. Among the variants of AS, Ant Colony System (ACS) was one of the most successful algorithms. But ACS converged so rapidly that it always was in early stagnation. An improved Ant Colony System based on Negative Biased (NBACS) was introduced in the paper to overcome the early stagnation of the ACS. Experiments for Traveling Salesman Problem (TSP) showed that better solutions were obtained at the same time when the convergence rate accelerated more rapidly.

Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem

2009 ◽  
Vol 56 (4) ◽  
pp. 1642-1648 ◽  
Author(s):  
Fanggeng Zhao ◽  
Sujian Li ◽  
Jiangsheng Sun ◽  
Dong Mei
Keyword(s):  
Genetic Algorithm ◽  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Pickup And Delivery ◽  
The One

The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

Networks ◽  
2007 ◽  
Vol 50 (4) ◽  
pp. 258-272 ◽  
Author(s):  
Hipólito Hernández-Pérez ◽  
Juan-José Salazar-González
Keyword(s):  
Traveling Salesman Problem ◽  
Traveling Salesman ◽  
Pickup And Delivery ◽  
The One
Sign in / Sign up

Export Citation Format

Share Document