A hybrid ant colony algorithm for the capacitated location-routing problem

Author

Yan, Jitao ; Zhang, Qiuwen ; Zhang, Wenshuai ; Zhen, Tong

Author_Institution

Pingdingshan Inst. of Technol., Pingdingshan, China

Volume

1

fYear

2008

fDate

17-19 Nov. 2008

Firstpage

38

Lastpage

43

Abstract

The capacitated location-routing problem (CLRP) belongs to the field of logistics of transportation. The CLRP appears as a combination of two difficult problems: the facility location problem (FLP) and the vehicle routing problem (VRP).It is an NP-hard problem. In order to solve practical large scale capacitated LRP, We propose a hybrid ant colony algorithm to solve the CLRP. To compare the proposed algorithm with other heuristic algorithms, a series of computational experiments are done on randomly generated test problems. The simulation results demonstrate that the hybrid ant colony algorithm is feasible and efficient.

Keywords

computational complexity; facility location; optimisation; transportation; NP-hard problem; capacitated location-routing problem; facility location problem; hybrid ant colony algorithm; logistics; vehicle routing problem; Costs; Educational institutions; Heuristic algorithms; Hybrid intelligent systems; Information science; Knowledge engineering; Logistics; Routing; Transportation; Vehicles;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on

Conference_Location

Xiamen

Print_ISBN

978-1-4244-2196-1

Electronic_ISBN

978-1-4244-2197-8

Type

conf

DOI

10.1109/ISKE.2008.4730895

Filename

4730895