Volume 49, Number 4, October-December 2015
|Page(s)||689 - 716|
|Published online||27 March 2015|
Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator
1 Department of Applied Mathematics and
Computational Sciences, PSG College of Technology, 641004
2 Department of Computer Applications, PSG College of Technology, 641004 Coimbatore, India.
Accepted: 10 December 2014
Route planning and goods distribution are a major component of any logistics. Vehicle Routing Problem is a class of problems addressing the issues of logistics. Vehicle Routing Problem with Limited Refueling Halts is introduced in this paper. The objective is to plan a route with an emphasis on the time and cost involved in refueling vehicles. The method is tailored to find optimal routes with minimal halts at the refueling stations. The problem is modeled as a bi objective optimization problem and is solved using particle swarm optimization. A new mutation operator called greedy mutation operator is introduced. Experiments are conducted with available data sets and MATLABR2011a is used for implementation.
Mathematics Subject Classification: 90B06 / 90C27 / 90C59
Key words: Logistics / Vehicle Routing Problem / particle swarm optimization
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.