Hits:

Indexed by:期刊论文

Date of Publication:2016-09-01

Journal:ADVANCES IN MECHANICAL ENGINEERING

Included Journals:SCIE、Scopus

Volume:8

Issue:9

Page Number:1-13

ISSN No.:1687-8140

Key Words:Automobile chain maintenance parts delivery problem; multi-depot vehicle routing problem; adaptive strategy; ant colony algorithm; time windows

Abstract:The mode of automotive maintenance chain is gaining more and more attention in China because of its advantages such as the lower cost, higher speed, higher availability, and strong adaptability. Since the automobile chain maintenance parts delivery problem is a very complex multi-depot vehicle routing problem with time windows, a virtual center depot is assumed and adopted to transfer multi-depot vehicle routing problem with time windows to multi-depot vehicle routing problem with the virtual central depot, which is similar to a vehicle routing problem with time windows. Then an improved ant colony optimization with saving algorithms, mutation operation, and adaptive ant-weight strategy is presented for the multi-depot vehicle routing problem with the virtual central depot. At last, the computational results for benchmark problems indicate that the proposed algorithm is an effective method to solve the multi-depot vehicle routing problem with time windows. Furthermore, the results of an automobile chain maintenance parts delivery problem also indicate that the improved ant colony algorithm is feasible for solving this kind of delivery problem.