IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v238y2016i1p27-4010.1007-s10479-015-1986-2.html
   My bibliography  Save this article

Modeling supermarket re-layout from the owner’s perspective

Author

Listed:
  • Péter Boros
  • Orsolya Fehér
  • Zoltán Lakner
  • Sadegh Niroomand
  • Béla Vizvári

Abstract

It is well-known that if a customer follows a longer path while shopping then the expected value of his/her purchased amount is increased; therefore the sale amount of the supermarket can be increased. This study deals with a new problem: how to re-layout a supermarket the impulsive purchases of the average customer are maximized. Supermarket is a shop of limited size and is definitely smaller than the hypermarket. It is assumed that it is located in a living area and customers know its layout well. In many countries, there are plenty of shops like that. In a case study 27 clusters of customers are defined based on 13,300 real buying. To assume that actors behave in a rational way, is traditional in analysis of economic problems. Rationality means in that case that customers choose the shortest possible path according to their a priori purchase plan. Thus, traveling salesman problem (TSP) can be used to simulate the customer’s shopping path. Dantzig–Fulkerson–Johnson formulation of TSP is used to maximize the shortest traveled path of each customer type by rearranging the items of the supermarket as a max–min problem. The computational experiences on the case study show that the total distance is increased in the new layout proposed by the model. Copyright Springer Science+Business Media New York 2016

Suggested Citation

  • Péter Boros & Orsolya Fehér & Zoltán Lakner & Sadegh Niroomand & Béla Vizvári, 2016. "Modeling supermarket re-layout from the owner’s perspective," Annals of Operations Research, Springer, vol. 238(1), pages 27-40, March.
    • Handle: RePEc:spr:annopr:v:238:y:2016:i:1:p:27-40:10.1007/s10479-015-1986-2
    DOI: 10.1007/s10479-015-1986-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1986-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1986-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Erjen van Nierop & Dennis Fok & Philip Hans Franses, 2008. "Interaction Between Shelf Layout and Marketing Effectiveness and Its Impact on Optimizing Shelf Arrangements," Marketing Science, INFORMS, vol. 27(6), pages 1065-1082, 11-12.
    2. Sam K. Hui & Peter S. Fader & Eric T. Bradlow, 2009. "—The Traveling Salesman Goes Shopping: The Systematic Deviations of Grocery Paths from TSP Optimality," Marketing Science, INFORMS, vol. 28(3), pages 566-572, 05-06.
    3. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ramazan Şahin & Sadegh Niroomand & Esra Duygu Durmaz & Saber Molla-Alizadeh-Zavardehi, 2020. "Mathematical formulation and hybrid meta-heuristic solution approaches for dynamic single row facility layout problem," Annals of Operations Research, Springer, vol. 295(1), pages 313-336, December.
    2. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    3. Yi Sun & Teruaki Hayashi & Yukio Ohsawa, 2021. "A Latent Topic Analysis and Visualization Framework for Category-Level Target Promotion in the Supermarket," The Review of Socionetwork Strategies, Springer, vol. 15(2), pages 429-453, November.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Péter Boros & Orsolya Fehér & Zoltán Lakner & Sadegh Niroomand & Béla Vizvári, 2016. "Modeling supermarket re-layout from the owner’s perspective," Annals of Operations Research, Springer, vol. 238(1), pages 27-40, March.
    2. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    3. Neves-Moreira, Fábio & Almada-Lobo, Bernardo & Guimarães, Luís & Amorim, Pedro, 2022. "The multi-product inventory-routing problem with pickups and deliveries: Mitigating fluctuating demand via rolling horizon heuristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    4. Furini, Fabio & Persiani, Carlo Alfredo & Toth, Paolo, 2016. "The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 38-55.
    5. Almoustafa, Samira & Hanafi, Said & Mladenović, Nenad, 2013. "New exact method for large asymmetric distance-constrained vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 226(3), pages 386-394.
    6. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2000. "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron & Steel Complex," European Journal of Operational Research, Elsevier, vol. 124(2), pages 267-282, July.
    7. Og[breve]uz, Ceyda & Sibel Salman, F. & Bilgintürk YalçIn, Zehra, 2010. "Order acceptance and scheduling decisions in make-to-order systems," International Journal of Production Economics, Elsevier, vol. 125(1), pages 200-211, May.
    8. Santos, Lui­s & Coutinho-Rodrigues, João & Current, John R., 2008. "Implementing a multi-vehicle multi-route spatial decision support system for efficient trash collection in Portugal," Transportation Research Part A: Policy and Practice, Elsevier, vol. 42(6), pages 922-934, July.
    9. Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
    10. Anja Fischer & Frank Fischer, 2015. "An extended approach for lifting clique tree inequalities," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 489-519, October.
    11. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    12. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    13. Sven Mallach, 2021. "Inductive linearization for binary quadratic programs with linear constraints," 4OR, Springer, vol. 19(4), pages 549-570, December.
    14. Bianchi-Aguiar, Teresa & Hübner, Alexander & Carravilla, Maria Antónia & Oliveira, José Fernando, 2021. "Retail shelf space planning problems: A comprehensive review and classification framework," European Journal of Operational Research, Elsevier, vol. 289(1), pages 1-16.
    15. Ostermeier, Manuel & Düsterhöft, Tobias & Hübner, Alexander, 2021. "A model and solution approach for store-wide shelf space allocation," Omega, Elsevier, vol. 102(C).
    16. Sebastian Henn & André Scholz & Meike Stuhlmann & Gerhard Wäscher, 2015. "A New Mathematical Programming Formulation for the Single-Picker Routing Problem in a Single-Block Layout," FEMM Working Papers 150005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    17. Robert P. Rooderkerk & Harald J. van Heerde & Tammo H. A. Bijmolt, 2013. "Optimizing Retail Assortments," Marketing Science, INFORMS, vol. 32(5), pages 699-715, September.
    18. Bradlow, Eric T. & Gangwar, Manish & Kopalle, Praveen & Voleti, Sudhir, 2017. "The Role of Big Data and Predictive Analytics in Retailing," Journal of Retailing, Elsevier, vol. 93(1), pages 79-95.
    19. Moreno, Alfredo & Munari, Pedro & Alem, Douglas, 2019. "A branch-and-Benders-cut algorithm for the Crew Scheduling and Routing Problem in road restoration," European Journal of Operational Research, Elsevier, vol. 275(1), pages 16-34.
    20. Akbari, Sina & Escobedo, Adolfo R., 2023. "Beyond kemeny rank aggregation: A parameterizable-penalty framework for robust ranking aggregation with ties," Omega, Elsevier, vol. 119(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:238:y:2016:i:1:p:27-40:10.1007/s10479-015-1986-2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.