Fastest Complete Vehicle Routing Problem Using Learning Multiple Ant Colony Algorithm

Abstract:

Article Preview

The objective of fastest completed vehicle routing problem (FCVRP) is to minimum complete time, this kind VRP problem was applied in emergency management and quick response supply chain management. Multiple ant colony algorithm for this problem is studied in this paper. The conception of FCVRP is given and then vehicle allocation method and objective function computing method are given to convert FCVRP problem to optimal alignment problem. At same time one local search method of this problem is introduced. Then learning multiple ant colony algorithm is bring forward to solve FCVRP and one numerical example is solved by this algorithm at last.

Info:

Periodical:

Advanced Materials Research (Volumes 217-218)

Edited by:

Zhou Mark

Pages:

1044-1049

DOI:

10.4028/www.scientific.net/AMR.217-218.1044

Citation:

S. Y. Wen and Y. Li, "Fastest Complete Vehicle Routing Problem Using Learning Multiple Ant Colony Algorithm", Advanced Materials Research, Vols. 217-218, pp. 1044-1049, 2011

Online since:

March 2011

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.