01661012

Component

With the rapid development of logistics industry, the demand for cargo transport and warehousing is also increasing. When constructing logistics network, location-routing problem (LRP), including vehicle routing problem (VRP) and location assignment problem (LAP), is necessary to be considered. In previous researches, this problem is considered in an independent way to find the optimal solution. However there are mutual restraints between VRP and LAP. Thus, this paper proposed the fusion algorithm with immune algorithm as the holistic framework and ant colony algorithm as the core to solve the objective function. In the first phase of fusion algorithm, taboo list of ant colony algorithm was improved, and immune algorithm was integrated; in the second phase, the fusion algorithm was designed to solve the relationship between VRP and LAP by value transferring method. A numerical study was given by example data to analyze the differences between fusion algorithm and traditional algorithm. Compared with traditional algorithm, the fusion algorithm can save 49.5% of total cost and have higher operation efficiency, thus verifying the feasibility and effectiveness of fusion algorithm.

This paper was sponsored by TRB committee AT015 Standing Committee on Freight Transportation Planning and Logistics.

18-00492

English

16p

2018

Transportation Research Board 97th Annual Meeting

Digital/other

Figures; References; Tables

Algorithms; Costs; Delivery vehicles; Distribution support businesses; Location; Logistics; Routing

Freight Transportation; Planning and Forecasting

Transportation Research Board Annual Meeting 2018 Paper #18-00492

TRIS, TRB, ATRI

Jan 8 2018 10:08AM