By Topic

A learning-based iterated local search algorithm for the asymmetrical prize collecting vehicle routing problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Naiqun Dong ; Polytech. Sch., Shenyang Ligong Univ., Shenyang, China ; Jianyou Xu

This paper proposes a learning-based iterated local search algorithm for the asymmetrical prize collecting vehicle routing problem, which is a new variant of VRP where the objective is a linear combination of three objects: minimization of total distance, minimization of vehicles used, and maximization of customers served. Some benchmark problem instances are taken as the experiment data and the computational results show that our approach can yield about 4.05% average duality gap compared to the lower bound.

Published in:

System Science, Engineering Design and Manufacturing Informatization (ICSEM), 2012 3rd International Conference on  (Volume:2 )

Date of Conference:

20-21 Oct. 2012