Abstract
This paper presented an optimization model for the generic multi-commodity logistics network design, in which the objective function was to minimize the total cost, including the location cost and inventory cost and supply and demand cost. The heuristic algorithm was developed for the model. Practical application denotes the optimization method operates rapidly and the result is rational, so it can provide a scientific decision-making support method for the design of the network, it is an effective method for solving large-scale problems, and the cost of total saving is feasibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barahona, F., Chudak, F.A.: Near-optimal solutions to large-scale facility location problems. Discrete Optimization 2(1), 35–50 (2005); Maxwell, C.: A Treatise on Electricity and Magnetism, 3rd edn., pp. 68–73. Clarendon, Oxford (1892)
Ferguson, D., Stentz, A.: The Delayed D* Algorithm for Efficient Path Replanning. In: Proceedings of the IEEE International Conference, pp. 2045–2050 (2005)
Ma, Z.-J., Dai, Y.: Optimization Model for Reverse Logistics Network Design for Product Recovery. Journal of Industrial Engineering and Engineering Management 19(4), 114–117 (2005)
Jayaraman, V., Guide Jr., V., Srivastava, R.: A Closed- loop Logistics Model for Remanufacturing. Journal of the Operational Research Society 50, 497–508 (1999)
Jayaraman, V., Raymond, A., Rolland, E.: The Design of Reverse Distribution Networks Models and Solution Procedures. European Journal of Operational Research 150(1), 128–149 (2003)
Parsopoulos, K.E., Vrahatis, M.N.: On the computation of all global minimizers through particle swarm optimization. IEEE Trans. Evolutionary Computation 8(3), 211–224 (2004)
Horner, M.W., O’Kelly, M.E.: Embedding Economies of Scale Concepts for Hub Network Design. Journal of Transport Geography 9, 255–265 (2001)
Burkard, R.E., Dollani, H., Thach, P.T.: Linear Approximations in a Dymanic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks. Journal of Global Optimization 19, 121–139 (2001)
Hahm, J., Yano, C.A.: The Economic Lot and Delivery Scheduling Problem: The Single Item Case. International Journal of Production Economics 28, 235–252 (1992)
Hu, T.-L., Sheu, J.-B., Huang, K.-H.: A reverse logistics cost minimization model for the treatment of hazards wastes. Transportation Research Part E 38, 457–473 (2002)
Fleischmann, M., Krikke, H.R., Dekker, R., Flapper, S.D.P.: A characterization of Logistics networks for Product recovery. Omega 28, 653–666 (2000)
Chen, Y., Cao, Z., Zhou, G.: Application of theory of constraints to reverse logistics. Logistics Technology 29, 252–254 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xue, D., Li, Z., Xue, N. (2012). Multi-commodity Logistics Network Design Based on Heuristic Algorithm. In: Jin, D., Lin, S. (eds) Advances in Electronic Engineering, Communication and Management Vol.1. Lecture Notes in Electrical Engineering, vol 139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27287-5_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-27287-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27286-8
Online ISBN: 978-3-642-27287-5
eBook Packages: EngineeringEngineering (R0)