Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   JOURNAL OF INDUSTRIAL MANAGEMENT   SUMMER 2013 , Volume 8 , Number 24; Page(s) 99 To 112.
 
Paper: 

OPTIMIZING OF OPEN VEHICLE ROUTING PROBLEM BY USING AN EFFICIENT HYBRID META-HEURISTIC ALGORITHM

 
 
Author(s):  SADATI ESKANDARI ZAHRA, ZARIE HASSAN, MAHMMUD JANLO AHMAD, MAHMMUDI DARAIE NARGES, YOUSEFI KHOSHBAKHT MAJID*
 
* ISLAMIC AZAD UNIVERSITY, HAMADAN BRANCH, HAMADAN, IRAN
 
Abstract: 

The Open Vehicle Routing Problem (OVRP) is one of the most intensively studied problems in computational mathematics that nowadays and it has been receiving much attention by researchers and scientists. In this Problem, the objective is to define minimized distance traveled of the several vehicles that start to move simultaneously from the depot and visit some customers. It is noted that against to the Vehicle Routing Problem (VRP), it is not necessary that vehicles return to the depot after servicing the customers. This paper proposes a meta-heuristic algorithm in which at the first stage, a modified elite ant colony (EAS) is applied for finding a suboptimal solution, and at the second stage, the insert and swap local search algorithms are used for finding better solutions. Computational results on fifteen standard benchmark problem instances show that the proposed algorithm is comparable in terms of solution quality of other meta-heuristic algorithms.

 
Keyword(s): ELITE ANT COLONY, NP-COMPLETE PROBLEMS, OPEN VEHICLE ROUTING PROBLEM, MIXED META-HEURISTIC ALGORITHM
 
References: 
  • ندارد
 
  Persian Abstract Yearly Visit 61
 
Latest on Blog
Enter SID Blog