Ant colony optimisation algorithm for distribution-allocation problem in a two-stage supply chain with a fixed transportation charge
| Autor: | Ratnaji Vanga, Rajagopalan Sridharan, Vinay V. Panicker |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
Engineering
Mathematical optimization business.industry Heuristic (computer science) Strategy and Management Supply chain Charge (physics) Transportation theory Management Science and Operations Research Ant colony Industrial and Manufacturing Engineering Genetic algorithm Benchmark (computing) business Fixed cost |
| Zdroj: | International Journal of Production Research. 51:698-717 |
| ISSN: | 1366-588X 0020-7543 |
| DOI: | 10.1080/00207543.2012.658118 |
| Popis: | In a fixed charge transportation problem, each route is associated with a fixed charge (or a fixed cost) and a transportation cost per unit transported. The presence of the fixed cost makes the problem difficult to solve, thereby requiring the use of heuristic methods. In this paper, an algorithm based on ant colony optimisation is proposed to solve the distribution-allocation problem in a two-stage supply chain with a fixed transportation cost for a route. A numerical study on benchmark problem instances has been carried out. The results obtained for the proposed algorithm have been compared with that for the genetic algorithm-based heuristic currently available in the literature. It is statistically confirmed that the proposed algorithm provides significantly better solutions. |
| 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. |