Nothing Special   »   [go: up one dir, main page]

Skip to main content

Multi-objective Pick-up Point Location Optimization Based on a Modified Genetic Algorithm

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2019)

Abstract

To solve the logistics terminal distribution problem, we construct the multi-objective location allocation model of pick-up point. The model considers the characteristics of express logistics system, enterprise demand and customer demand for delivery distance, and two objectives of minimizing location cost and maximizing customer distance satisfaction are included. We set the segmentation distance function according to the distance of the user from the pick-up point, and calculate the satisfaction function. To solve the model, we modify the non-dominated sorting genetic algorithm with elite strategy algorithm (NSGA-II). Consider the needs of the enterprise or user, we modify the crossover operator, and use the tournament method to evaluate the offspring population generated by genetic operations to reduce the loss of elite individuals. We also verify the effectiveness of the model and the modified algorithm through experiments. Experimental results show that the modified algorithm can obtain a better Pareto optimal solution set for the multi-objective location-allocation problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Abin, A.A.: Querying beneficial constraints before clustering using facility location analysis. IEEE Trans. Cybern. 48(1), 312–323 (2018)

    Article  MathSciNet  Google Scholar 

  2. Brimberg, J., Revelle, C.: A bi-objective plant location problem: cost vs. demand served. Location Sci. 6(1–4), 121–135 (1998)

    Article  Google Scholar 

  3. Akgul, O., Shah, N., Papageorgiou, L.G.: An optimisation framework for a hybrid first/second generation bioethanol supply chain. Comput. Chem. Eng. 42, 101–114 (2012)

    Article  Google Scholar 

  4. Olivares-Benitez, E., Ríos-Mercado, R.Z., González-Velarde, J.L.: A metaheuristic algorithm to solve the selection of transportation channels in supply chain design. Int. J. Prod. Econ. 145(1), 161–172 (2013)

    Article  Google Scholar 

  5. Prakash, A., Chan, F.T.S., Liao, H., Deshmukh, S.G.: Network optimization in supply chain: a KBGA approach. Decis. Support Syst. 52, 528–538 (2012)

    Article  Google Scholar 

  6. Shankar, B.L., Basavarajappa, S., Chen, J.C.H., Kadadevaramath, R.S.: Location and allocation decisions for multi-echelon supply chain network - a multi-objective evolutionary approach. Exp. Syst. Appl. 40(2), 551–562 (2013)

    Article  Google Scholar 

  7. Konak, A., Kulturel-Konak, S., Snyder, L.: A multi-objective approach to the competitive facility location problem. Proc. Comput. Sci. 108, 1434–1442 (2017)

    Article  Google Scholar 

  8. Bilir, C., Ekici, S.O., Ulengin, F.: An integrated multi-objective supply chain network and competitive facility location model. Comput. Ind. Eng. 108, 136–148 (2017)

    Article  Google Scholar 

  9. Sheu, J.B., Lin, A.Y.S.: Hierarchical facility network planning model for global logistics net-work configurations. Appl. Math. Model. 36(7), 3053–3066 (2012)

    Article  MathSciNet  Google Scholar 

  10. Büdenbender, K., Grünert, T., Sebastian, H.J.: A hybrid tabu search/ branch-and-bound algorithm for the direct flight network design problem. Transp. Sci. 34(4), 364–380 (2000)

    Article  Google Scholar 

  11. Yang, Z., Chen, H., Chu, F., Wang, N.: An effective hybrid approach to the two-stage capacitated facility location problem. Eur. J. Oper. Res. 275(2), 467–480 (2019)

    Article  MathSciNet  Google Scholar 

  12. Zhao, M., Chen, Q.: Risk-based optimization of emergency rescue facilities locations for large-scale environmental accidents to improve urban public safety. Nat. Hazards 75(1), 163–189 (2014). https://doi.org/10.1007/s11069-014-1313-2

    Article  Google Scholar 

  13. Drezner, Z., Wesolowsky, G.O., Drezner, T.: The gradual covering problem. Nav. Res. Log. 51(6), 841–855 (2004)

    Article  MathSciNet  Google Scholar 

  14. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.A.M.T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  15. Azad, M.A.K., Fernandes, E.M.G.P.: A modified differential evolution based solution technique for economic dispatch problems. J. Ind. Manage. Optim. 8(4), 1017–1038 (2012)

    MathSciNet  MATH  Google Scholar 

  16. Jiang, Q., Wang, L., Hei, X., Yu, G.L., Lin, Y.Y., Lu, X.F.: MOEA/D-ARA+SBX: a new multi-objective evolutionary algorithm based on decomposition with artificial raindrop algorithm and simulated binary crossove. Knowl.-Based Syst. 107, 197–218 (2016)

    Article  Google Scholar 

  17. Lu, F., Li, Y.H.: Model and algorithm of inventory path problem for spare parts logistics system. Ind. Eng. Manage. 15(2), 82–86 (2010)

    Google Scholar 

  18. Ding, S., Chen, C., Xin, B., Pardalos, M.P.: A bi-objective load balancing model in a distributed simulation system using NSGA-II and MOPSO approaches. Appl. Soft. Comput. 63, 249–267 (2018)

    Article  Google Scholar 

  19. Jiang, S., Ong, Y.S., Zhang, J., Feng, L.: Consistencies and contradictions of performance metrics in multiobjective optimization. IEEE Trans. Cybern. 44(12), 2391–2404 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant No. 61976242, in part by the Opening Project of Guangdong Province Key Laboratory of Computational Science at the Sun Yat-sen University under Grant No. 2018002, in part by the Open Fund of Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education under Grant No. IPIU2019003, and in part by the State Key Program of National Natural Science of China under Grant No. 61836009.

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Shuai Chen , Bin Cao or Ruichang Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, S., Cao, B., Li, R. (2020). Multi-objective Pick-up Point Location Optimization Based on a Modified Genetic Algorithm. In: Pan, L., Liang, J., Qu, B. (eds) Bio-inspired Computing: Theories and Applications. BIC-TA 2019. Communications in Computer and Information Science, vol 1159. Springer, Singapore. https://doi.org/10.1007/978-981-15-3425-6_60

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3425-6_60

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3424-9

  • Online ISBN: 978-981-15-3425-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics