Solving the Optimization of Physical Distribution Routing Problem with Hybrid Genetic Algorithm

3Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In view of the deficiency of genetic algorithm in local search ability, a simulated annealing algorithm for optimization of physical distribution routing problem is constructed. Compared with the traditional optimization algorithm, the hybrid genetic algorithm has faster convergence speed, better distribution result and better application value.

Cite

CITATION STYLE

APA

Zhai, R. (2020). Solving the Optimization of Physical Distribution Routing Problem with Hybrid Genetic Algorithm. In Journal of Physics: Conference Series (Vol. 1550). Institute of Physics Publishing. https://doi.org/10.1088/1742-6596/1550/2/022001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free