Three hybrid GAs for discounted fixed charge transportation problems
| Autor: | Zhrasadat Hashemi, Farhad Ghassemi Tari |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
021103 operations research General Computer Science Distribution networks Computer science General Chemical Engineering 05 social sciences 0211 other engineering and technologies General Engineering ComputerApplications_COMPUTERSINOTHERSYSTEMS 02 engineering and technology prioritized k-mean clustering hybrid genetic algorithm Set (abstract data type) Fixed charge lcsh:TA1-2040 manufacturing logistics 0502 economics and business discounted transportation cost. milp model fixed charge transportation model lcsh:Engineering (General). Civil engineering (General) 050203 business & management |
| Zdroj: | Cogent Engineering, Vol 5, Iss 1 (2018) |
| ISSN: | 2331-1916 |
| Popis: | The problem of allocating heterogeneous fleet of vehicles to the existing distribution network for dispensing products from a manufacturing firm to a set of depots is considered. It is assumed a heterogeneous fleet of vehicles with the given capacities and total costs consisting of a discounted fixed cost and a variable cost proportional to the amount shipped is employed for handling products. To minimize the total transportation costs, the problem is modeled in a 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |