Location allocation planning of logistics depots using genetic algorithm

• Autorzy: Ren Y. , Awasthi A.
• Języki publikacji: EN

Abstrakty

EN

Location planning of logistics depots and customer allocation are important decisions in supply chain network design. A carefully planned network design positively impacts the economics of business organizations and their competitivity in national and international markets. In this paper, we present a genetic algorithm based approach for solving location allocation planning problem of logistics depots. The problem is solved considering multiple criteria such as minimal distance, travel cost, travel time etc. A numerical application is provided to demonstrate the proposed approach.

Słowa kluczowe

EN

genetic algorithm; location-allocation problem; logistics planning

• Wydawca: Publishing House of Poznan University of Technology
• Czasopismo: Research in Logistics & Production
• Rocznik: 2012
• Tom: Vol. 2, No. 3
• Strony: 247--257
• Opis fizyczny: Bibliogr. 26 poz.

Twórcy

autor

Ren Y.

autor

Awasthi A.

• CIISE, Concordia University, Montreal, QC, H3G2W1, Canada,

Bibliografia

• 1. Abdinnour-Helm S. (1998), "A hybrid heuristic for the uncapacitated hub location problem", [in:] European Journal of Operational Research, Vol. 106, No. 2-3, pp. 489-499.
• 2. Alander J.T. (1992), "On optimal population size of genetic algorithms", [in:] Proceedings of computer systems and software engineering, 6th annual European computer conference, IEEE Computer Society, pp. 65-70.
• 3. Anand S., Knott K. (1986), "Computer assisted models used in the solution of warehouse location-allocation problems", [in:] Computers & Industrial Engineering, Vol. 11, No. 1-4, pp. 100-104.
• 4. Armour G, Buffa E (1965), "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities", [in:] Management Science, Vol. 9, No. 2, pp. 294-309.
• 5. Arora, S., Raghavan, P., Rao, S. (1998), "Approximation schemes for Euclidean k-medians and related problems", [in:] Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 106-113.
• 6. Azarmand Z., Neishabouri E.(2009), "Location Allocation Problem, Facility Location" [in:] Contributions to Management Science, pp. 93-109.
• 7. Banks J. (1998), Handbook of simulation principle, methodology, advances, applications, and practice, Wiley, pp. 324-329.
• 8. Barreto S, Ferreira C, Paixão J, Santos B.S. (2007), "Using clustering analysis in a capacitated location-routing problem", [in:] European Journal of Operational Research, Vol. 179, No. 3, pp. 968-977.
• 9. Brimberg J., ReVelle C. (1998). "Solving the plant location problem on a line by linear programming", [in:] Top, No. 6, pp. 277-286.
• 10. Chan Felix T.S, Kumar Niraj (2009), "Effective allocation of customers to distribution centres: A multiple ant colony optimization approach", [in:] Robotics and computer- integrated manufacturing, No. 25, pp. 1-12.
• 11. Chen J.-F.(2007), "A hybrid heuristic for the uncapacitated single allocation hub location problem", [in:] Omega, Vol. 35, No. 2, pp. 211-220.
• 12. Cooper L. (1964), "Heuristic methods for location-allocation problems", [in:] SIAM Rev Vol. 6, No. 1, pp. 37-53.
• 13. Doerner Karl F., Gutjahr Walter J., Nolz Pamela C. (2009), "Multi-criteria location planning for public facilities in tsunami-prone coastal areas", [in:] OR Spectrum, Vol. 31, No. 3, pp. 651-678.
• 14. Drezner Z. (1984), "The planar two-center and two-median problems", [in:] Transportation Science No. 18, pp. 351-361.
• 15. Ernst A.T., Krishnamoorthy M, (1999), "Solution algorithms for the capacitated single allocation hub location problem", [in:] Annals of Operations Research, No. 86, pp. 141-159.
• 16. Fortenberry J.C., Mitra A. (1986), "A multiple criteria approach to the location-allocation problem", [in:] Computers & Industrial Engineering, Vol. 10, No 1, pp. 77-87.
• 17. Freek A. (1999), Multi-factors decision analysis via ratio and difference judgment.
• 18. Gamal M. D. H., Salhi S. (2001), "Constructive heuristics for the uncapacitated continuous location-allocation problem", [in:] Journal of the Operational Research Society, Vol. 52, pp. 821-829.
• 19. Goldberg, D.E. (1989), Genetic algorithms in search, optimization and machine Learning, Kluwer academic publishers, Boston, MA.
• 20. Gong D., Gen M., Yamazaki G., Xu W. (1997), "Hybrid evolutionary method for capacitated location-allocation problem", [in:] Computers & Industrial Engineering, Vol. 33, No. 3-4, pp. 577-580.
• 21. Hsieh K.H., Tien F.C. (2004), "Self-organizing feature maps for solving location-allocation problems with rectilinear distances", [in:] Computers & Operations Research, Vol. 31, No. 7, pp. 1017-1031.
• 22. Jaramillo J.H., Bhadury J., Batta R. (2002), "On the use of genetic algorithms to solve location problems", [in:] Computers and Operations Research, No. 29, pp. 761-779.
• 23. Love R. F., Morris J. G., Wesolowsky G. (1988), Facility location: models and methods. Publications in operations research, 57, New York: North-Holland.
• 24. Marler R. Timothy, Arora Jasbir S.(2009), "The weighted sum method for multi-objective optimization: new insights", [in:] Structural and Multidisciplinary Optimization, Vol. 41, No. 6, pp. 853-862
• 25.Murray A.T., Church R.L., (1996), "Applying simulated annealing to location-planning models", [in:] Journal of Heuristics, No. 2, pp. 31-53.
• 26. Zhou G., Min H., Gen M. (2003), "A genetic algorithm approach to the bi-criteria allocation of customers to warehouses", [in:] International Journal of Production Economics, No. 86, pp. 35-45.