Cargo Vessel Route Rationalization with Chimerical Genetic Algorithm

ABSTRACT: One of the most basic problems in logistics is the problem of route rationalization. Route rationalization may be based on different criterions, but at its core it always can be reduced to classic mathematical problems, such as travelling salesman problem (TSP). This study discusses methods, used to find approximate solutions for TSP and proposes authors modification of classic genetic algorithm (GA) for solving vessel’s route rationalization problem. Test results and strategies for vessel’s route rationalization are discussed. A number of conclusions on best strategies for route rationalization is carried out.

KEYWORDS: Sea Ports, Cargo Vessel, Route Rationalization, Cargo Vessel Route Rationalization, Chimerical Genetic Algorithm, Travelling Salesman Problem (TSP), Genetic Algorithm (GA)

REFERENCES

Koberg, Esteban, and Annachiara Longoni "A systematic review of sustainable supply chain management in global supply chains." Journal of cleaner production 207 (2019): 1084–1098. - doi:10.1016/j.jclepro.2018.10.033

Orponen, P. and H. Mannila "On approximation preserving reductions: Complete problems and robust measures'", Technical Report, Department of Computer Science, University of Helsinki (1987): 28 p.

Qian, Hao and Tao Su "Hybrid algorithm based on max and min ant system and particle swarm optimization for solving TSP problem." 33rd Youth Academic Annual Conference of Chinese Association of Automation (YAC). IEEE (2018): 683-687. - doi:10.1109/YAC.2018.8406459

Jedrzejowicz, Piotr and Izabela Wierzbowska "Parallelized Swarm Intelligence Approach for Solving TSP and JSSP Problems." Algorithms 13.6 (2020): 142. - doi:10.3390/a13060142

Bouman, Paul, Niels Agatz and Marie Schmidt "Dynamic programming approaches for the traveling salesman problem with drone." Networks 72.4 (2018): 528-542. - doi:10.1002/net.21864

Salii, Yaroslav. "Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization." European Journal of Operational Research 272.1 (2019): 32-42. - doi:10.1016/j.ejor.2018.06.003

George, Tintu and T. Amudha. "Genetic Algorithm Based Multi-objective Optimization Framework to Solve Traveling Salesman Problem." Advances in Computing and Intelligent Systems (2020): 141-151. - doi:10.1007/978-981-15-0222-4_12

Juwairiah, Juwairiah, et al. "Genetic Algorithm for Optimizing Traveling Salesman Problems with Time Windows (TSP-TW)." International Journal of Artificial Intelligence & Robotics (IJAIR) 1.1 (2019): 1-8. - doi:10.25139/ijair.v1i1.2024

Akter, Shamima, et al. "Genetic Algorithm with Updated Multipoint Crossover Technique and its Application to TSP." 2020 IEEE Region 10 Symposium (TENSYMP). IEEE, 2020. - doi:10.1109/TENSYMP50017.2020.9231017

Allaoua, Hemmak. "Combination of Genetic Algorithm with Dynamic Programming for Solving TSP." Int. J. Advance Soft Compu. Appl 9.2 (2017): 31-44.

Kuznetsov, Aleksandr L., Aleksandr V. Kirichenko, and German B. Popov. “Chimerical genetic algorithm for sea route rationalization.” Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S.O. Makarova 9.3 (2017): 456–467. DOI: 10.21821/2309-5180-2017-9-3-456-467. - doi:10.21821/2309-5180-2017-9-3-456-467

Citation note:

Kuznetsov A.L., Popov G.B.: Cargo Vessel Route Rationalization with Chimerical Genetic Algorithm. TransNav, the International Journal on Marine Navigation and Safety of Sea Transportation, Vol. 14, No. 4, doi:10.12716/1001.14.04.28, pp. 1005-1008, 2020

BibTeX EndNote

Authors in other databases:

Alexander Kuznetsov: Scopus icon

57196277330