A Novel Model for Production Distribution Optimization and its Solution

Abstract:

A production distribution problem (PDP) with the third party logistics (3PL) is discussed in the present paper. Then, a PDP model is built as an extended type of vehicle routing problem (VRP), which is a classical model in logistics. The novel model can be transformed into the combination of generalized travelling salesman problem (GTSP) and TSP with constraints. Some characters about the existing solutions of PDP are discussed. As a result, a genetic algorithm for PDP is proposed. Finally the result of numerical simulation shows the feasibility and effectiveness of the new model.

• Periodical: Advanced Materials Research (Volumes 204-210)
• Pages: 2210-2213
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.204-210.2210
• Online since: February 2011
• Authors: Xi Zhao, Ying Li
• Keywords: 3PL, Genetic Algorithm (GA), GTSP, Production Distribution, SCM

References

[1] Information on http: /www. tobaccochina. com/tech/data/20054/y401103302. htm.

[2] Bodin, L., Golden, B., Assad, A., Ball, M., 1983. Routing and Scheduling of Vehicles and Crews-the State of Art. Computers & Operations Research, 10 (2), 62-212.

[3] Fisher, M., 1997. Vehicle routing. Network Routing, volume 8 of Handbooks in Operations Research and Management Science. chapter 1, pages 1-79. NorthHolland.

DOI: 10.1016/s0927-0507(05)80105-7

[4] Halse, K., 1992. Modeling and Solving Complex Vehicle Routing Problems. PhD thesis, Department for Mathematical Modeling, Technical University of Denmark.

[5] Solomon, M.M., 1987. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operation Research 35 254-265.

DOI: 10.1287/opre.35.2.254

[6] Kallehauge, B., Larsen, J., Madsen, B.G. O, 2000. Lagrangean duality applied on vehicle routing with time windows experimental results. IMM Department of mathematical modelling. Technical University of Denmark, DK-2800.

[7] Gambardella, L.M., Taillard, E., Agazzi, G., 1999. MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows, In D. Corne, M. Dorigo and F. Glover, editors, New Ideas in Optimization. McGraw-Hill.

[8] Bent, R., Hentenryck, P.V., 2001. A Two-Stage Hybrid Local search for the Vehicle Routing Problem with Time Windows. Technical Report CS-01-06, Department of Computer Sicence, BrownUniversity.

DOI: 10.1287/trsc.1030.0049

[9] Berger, J., Barkaoui, M., Bräysy, O., 2001. A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Working paper, Defense Research Establishment Valcartier, Canada.

[10] Huang, H., Yang, X.W., Hao, Z.F., Wu, C.G., Liang, Y.C., Zhao, X., 2005. Hybrid Chromosome Genetic Algorithm for Generalized Traveling Salesman Problems. ICNC 2005, Lecture Notes in Computer Science 3612, 137-140.

DOI: 10.1007/11539902_16

[11] Wu, C.G., Liang, Y.C., Lee, H.P., Lu, C., 2004. Generalized chromosome genetic algorithm for generalized traveling salesman problems and its applications for machining, Physical Review E. 70 016701.

DOI: 10.1103/physreve.70.016701

[12] Goldberg, D., Lingle, R., Alleles, 1985. loci and the travelling salesman problem, in Grefenstette, J., editor, Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NK, 154-159.