Optimization Research of Logistics Distribution Routing Based on Heuristic Algorithm

Jie Lv; Lin Zhao

doi:10.4028/www.scientific.net/AMM.401-403.2175

Paper Titles

Simulation of Signalized Intersection Model
p.2159

Application of Logistic Model in Container Throughput Prediction
p.2163

Empirical Study of Factors for Implementing Reverse Logistics in Pharmaceutical Manufacturing Firms
p.2166

Multi-Factor and Polymorphism Failure Probability Calculation for Natural Gas Pipelines
p.2170

Optimization Research of Logistics Distribution Routing Based on Heuristic Algorithm
p.2175

Predicting Model of Container Throughput of Fujian Province Based on Grey Model
p.2179

The Study of the Regional Logistics Cooperation System Based on the Industrial Cluster
p.2183

The Real Estate Industry and Three Industry Correlation Empirical Analysis, Shan’xi Province
p.2187

A Theory Model of the Existence Stable Measure for the Industrial Technology Innovation Strategy Alliance
p.2193

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 401-403Optimization Research of Logistics Distribution...

Optimization Research of Logistics Distribution Routing Based on Heuristic Algorithm

Abstract:

Optimization algorithm of logistics distribution routing has been a hot area of research for several years. Due to the complex calculation and difficult to obtain exact solutions, the problem is a NP-Hard problem. Based on 73 customers sales and geographic locations of Y corporate, logistics distribution routing is optimize designed by nearest insertion heuristic and scanning algorithm.

You might also be interested in these eBooks

Frontiers of Manufacturing Science and Measuring Technology III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 401-403)

Pages:

2175-2178

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.401-403.2175

Citation:

Cite this paper

Online since:

September 2013

Authors:

Jie Lv, Lin Zhao

Keywords:

Logistics Distribution, Nearest Insertion Heuristic, Scanning Algorithm, Vehicle Routing Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Liu Fanghua, Algorithm research of logistics distribution routing with time window, Zhejiang province: Zhejiang normal university, (2010).

Google Scholar

[2] Balinski M, Quand R, On an integer program for a delivery problem, Operations Research, 12 (1962) 300-304.

Google Scholar

[3] Eilon S, Watson-Gandy CDT, Christofides N, Distribution management: mathematical modeling and practical analysis, Hafner Press, London, 1971, pp.357-361.

Google Scholar

[4] Gillett B, Miller L, A heuristic algorithm for the vehicle dispatch problem, Operations Research, 22 (1974) 340-349.

DOI: 10.1287/opre.22.2.340

Google Scholar

[5] Kohl. N, O. B. G. Madsen, An Optimization Algorithm for the Vehicle Routing with Time Windows based on Lagrangrian Relaxation, Operations Research, 45 (1997) 395-406.

DOI: 10.1287/opre.45.3.395

Google Scholar

[6] Zhang Hong, Research of vehicle routing problem in distribution, Heilongjiang province: Harbin engineering university, (2007).

Google Scholar

[7] Li Jun, Heuristic algorithm of vehicle routing problem with time window, System Engineering, 5 (1996) 40-50.

Google Scholar

[8] Chen, Ailing, Logistics distribution vehicle routing problem with time windows, Advanced Materials Research, 468-471(2012) 2047-(2051).

DOI: 10.4028/www.scientific.net/amr.468-471.2047

Google Scholar