A Metaheuristic Algorithm for the Fixed Charge Transportation Problem
Transportation companies are known to charge a fixed fee in addition to the price per unit of the product. This makes the transportation problem an NP-hard problem. We propose an algorithm that uses coding and decoding from the genetic approach and the formulas of the teaching-learning-based optimization method by adapting them to integers. Experiments show that the results found by the proposed algorithm are compatible with the results of other metaheuristic algorithms, but the processing time is much less than other algorithms.
Authors
- Nermin Kartli
Publication Details
- Published
- 2024-10-26
- DOI
- https://doi.org/10.1109/ubmk63289.2024.10773580
- Citations
- 1
- Primary Topic
- Optimization and Mathematical Programming
- Type
- article
- Field-Weighted Citation Impact
- 0.33