skip to main content
10.1145/3653081.3653114acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiotaaiConference Proceedingsconference-collections
research-article

Pricing and replenishment decision of supermarket vegetables based on optimal profit planning model

Published:03 May 2024Publication History

ABSTRACT

With the continuous improvement of social productivity and the increasingly fierce market competition, supermarkets, as the main suppliers of vegetables, occupy a high proportion in commodity circulation. In order to improve supermarket profit effectively and meet market demand, a profit optimal solution model based on single product constraint was established. In order to maximize the profit function, the summation range of the function is changed to the number of restocked items on the day, and the sales quality and sales type of the goods are constrained. Combining the constraint conditions and the maximum profit objective equation, the optimal profit model based on single product replenishment and pricing was established. On July 1, 2023, the optimal profit situation using genetic algorithm is: net profit of 2678.98 yuan, sales of 677.35 kg. Combining the constraint conditions and the object equation of a single product, an optimal profit model based on the replenishment and pricing of a single product was established.

References

  1. Amirgaliyev B, Kuchanskyi O, Andrashko Y, A Dynamic Model of Profit Maximization for Carsharing Services: Astana, Republic of Kazakhstan [J].Urban Science, 2023, 7(3).Google ScholarGoogle Scholar
  2. Lv Yongwei, Zhang Ying. Cost-plus pricing [J]. Sales & Marketing,1996, (11):64.Google ScholarGoogle Scholar
  3. An Qi. Research on pricing of science and technology novelty search service based on cost plus pricing [J]. Library Research and Work, 2021, (10):25-31+24.Google ScholarGoogle Scholar
  4. Zhang Ziying, Zhou Bo. Variable cost pricing under Market economy [J]. Journal of Shenyang University, 2003, (03):57-59.Google ScholarGoogle Scholar
  5. Lu Y J. Research on dynamic pricing of high-quality fresh vegetables in Chinese supermarkets [D]. Beijing Jiaotong University, 2010.Google ScholarGoogle Scholar
  6. NilumindaO, EkanayakeU. The Novel Efficient Method to Solve Balanced and Unbalanced Profit Maximization in Transportation Problems [J]. American Journal of Mathematical and Computer Modelling, 2023, 8(2).Google ScholarGoogle Scholar
  7. Habiba M, Salah M A, René L. Nonlinear dynamic and chaos in a remanufacturing duopoly game with heterogeneous players and nonlinear inverse demand functions [J]. Journal of Difference Equations and Applications, 2023, 29(9-12): 1503-1515.Google ScholarGoogle ScholarCross RefCross Ref
  8. S. B B, Rajan B, Li L, Mathematical programming methods for reducing inequity due to stock-outs of pharmaceuticals in low-resourced regions using a mobile pharmacy [J]. Computers & Industrial Engineering, 2023, 182.Google ScholarGoogle Scholar
  9. Alves F O, Martins E S D, Ricardo S S D, ILS-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation [J]. Computers and Operations Research, 2023, 157.Google ScholarGoogle Scholar
  10. Jiawei C, Yingxin H. Optimized Design of a Squeezed-Branch Pile Group Based on an Improved Particle Swarm Algorithm [J]. Sustainability, 2023, 15(3).Google ScholarGoogle Scholar

Index Terms

  1. Pricing and replenishment decision of supermarket vegetables based on optimal profit planning model

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      IoTAAI '23: Proceedings of the 2023 5th International Conference on Internet of Things, Automation and Artificial Intelligence
      November 2023
      902 pages
      ISBN:9798400716485
      DOI:10.1145/3653081

      Copyright © 2023 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 3 May 2024

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed limited
    • Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)3

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format