Loading...

Three hybrid GAs for discounted fixed charge transportation problems

Ghassemi Tari, F ; Sharif University of Technology | 2018

684 Viewed
  1. Type of Document: Article
  2. DOI: 10.1080/23311916.2018.1463833
  3. Publisher: Cogent OA , 2018
  4. Abstract:
  5. The problem of allocating heterogeneous fleet of vehicles to the existing distribution network for dispensing products fro. manufacturing firm t. set of depots is considered. It is assume. heterogeneous fleet of vehicles with the given capacities and total costs consisting o. discounted fixed cost an. variable cost proportional to the amount shipped is employed for handling products. To minimize the total transportation costs, the problem is modeled i. form of the nonlinear mixed integer program. Due to the NP hard complexity of the mathematical model, three prioritized K-mean clustering hybrid GAs, by incorporating two new heuristic algorithms, are proposed. The efficiency of the algorithms is compared and the best one is designated. The designated algorithm is compared with CPLEX as well as two recently cited algorithms, and the results supported its high effectiveness and efficiency in terms of solution quality and CPU time. © 2018 The Author(s). This open access article is distributed unde. Creative Commons Attribution (CC-BY) 4.0 license
  6. Keywords:
  7. Discounted transportation cost. MILP model ; Fixed charge transportation model ; Manufacturing logistics ; Prioritized K-mean clustering hybrid genetic algorithm
  8. Source: Cogent Engineering ; Volume 5, Issue 1 , 2018 ; 23311916 (ISSN)
  9. URL: https://www.cogentoa.com/article/10.1080/23311916.2018.1463833