Work

Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm

Year: 2015

Type: conference-paper

Abstract: The capacitated vehicle routing problems (CVRP) are NP-hard. Most approaches can solve small-scale case studies to optimality. Furthermore, they are time-consuming. To overcome the limitation, this paper presents a novel three-phase heuristic approach for the capacitated vehicle routing problem. The first phase aims to identify sets of cost-effective feasible clusters through an improved ant-clustering algorithm, in which the adaptive strategy is adopted. The second phase assigns clusters to vehicles and sequences them on each tour. The third phase orders nodes within clusters for every tour and genetic algorithm is used to order nodes within clusters. The simulation indicates the algorithm attains high quality results in a short time.

Source: MATEC Web of Conferences

DOI: 10.1051/matecconf/20152203022

Authors: Jiashan Zhang, Xiaoqun Lin, Yi Jun, Qiang Li

Institutions: Chongqing Vocational Institute of Engineering, Chongqing University of Science and Technology

Language: English

Topic: Vehicle Routing Optimization Methods

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: diamond

Funder: National Natural Science Foundation of China