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

Paper Information

Journal:   PRODUCTION AND OPERATIONS MANAGEMENT   FALL 2017-WINTER 2018 , Volume 8 , Number 2 (15) ; Page(s) 29 To 45.
 
Paper: 

OPEN SELECTIVE VEHICLE ROUTING PROBLEM WITH PRICING, SOLVED BY IMPROVED IMPERIALIST COMPETITIVE ALGORITHM

 
 
Author(s):  HOSSEINZADEH ABOLFAZL, ALINAGHIAN MEHDI*, SABBAGH MOHAMMAD SAIID
 
* DEPARTMENT OF INDUSTRIAL AND SYSTEMS ENGINEERING, ISFAHAN UNIVERSITY OF TECHNOLOGY, IRAN
 
Abstract: 

In this paper, modeling and solving an open selective vehicle routing problem with pricing are introduced. We will discuss optimal pricing when using a homogeneous fleet of vehicles. Furthermore, in some real world applications, companies prefer to distribute their products using rented vehicles so returning to the depot is not required. Therefore we face an open routing problem. Despite the applicability of such problem, we did not find any published research that examines it. also an Improved Imperialist Competitive Algorithm (IICA) is proposed to solve proposed model. For validating this method, some small scale problems are solved and results are compared to the results of an exact method and Simulated Annealing (SA) algorithm. The comparison of results shows that the proposed method is suitable for solving the model. For investigating its efficiency in dealing with real world problems, some large scale problems are solved and the results are compared to the results of Simulated Annealing (SA) algorithm. Results show that IICA is more efficient than SA.

 
Keyword(s): PRICING, OPEN VEHICLE ROUTING PROBLEM, SIMULATED ANNEALING ALGORITHM. IMPROVED IMPERIALIST COMPETITIVE ALGORITHM, SELECTIVE VEHICLE ROUTING PROBLEM
 
References: 
    exThe server principal "sidrdro" is not able to access the database "admin_Host353" under the current security context.
 
  Persian Abstract Yearly Visit 59
 
Latest on Blog
Enter SID Blog