IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v105y2021ics0305048321001274.html
   My bibliography  Save this article

Planning profitable tours for field sales forces: A unified view on sales analytics and mathematical optimization

Author

Listed:
  • Meyer, Anne
  • Glock, Katharina
  • Radaschewski, Frank

Abstract

A key task of sales representatives in operational planning is to select the most profitable customers to visit within the next few days. A strongly varying set of scoring methods predicting or approximating the expected response exists for this customer selection phase. However, in the case of field sales forces, the final customer selection is strongly interrelated with the tour planning decisions. To this end, we formalize variants of the profitable sales representatives tour problem as a multi-period team orienteering problem, thereby providing a unified view on the customer scoring and the tour planning phase. In an extensive computational study on real-world instances from the retail industry, we systematically examine the impact of the aggregation level and the content of information provided by a scoring method and the sensitivity of the proposed models concerning prediction errors. We show that the selection of a customer scoring and tour planning variant depends on the available data. Furthermore, we work out where to put in effort for the data acquisition and scoring phase to get better operational tours.

Suggested Citation

  • Meyer, Anne & Glock, Katharina & Radaschewski, Frank, 2021. "Planning profitable tours for field sales forces: A unified view on sales analytics and mathematical optimization," Omega, Elsevier, vol. 105(C).
    • Handle: RePEc:eee:jomega:v:105:y:2021:i:c:s0305048321001274
    DOI: 10.1016/j.omega.2021.102518
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048321001274
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2021.102518?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. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    2. Bernd Skiera & Sönke Albers, 1998. "COSTA: Contribution Optimizing Sales Territory Alignment," Marketing Science, INFORMS, vol. 17(3), pages 196-213.
    3. Dang, Duc-Cuong & Guibadj, Rym Nesrine & Moukrim, Aziz, 2013. "An effective PSO-inspired algorithm for the team orienteering problem," European Journal of Operational Research, Elsevier, vol. 229(2), pages 332-344.
    4. J. D’Haen & D. Van Den Poel, 2013. "Model-supported business-to-business prospect prediction based on an iterative customer acquisition framework," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 13/863, Ghent University, Faculty of Economics and Business Administration.
    5. Rick Lawrence & Claudia Perlich & Saharon Rosset & Ildar Khabibrakhmanov & Shilpa Mahatma & Sholom Weiss & Matt Callahan & Matt Collins & Alexey Ershov & Shiva Kumar, 2010. "Operations Research Improves Sales Force Productivity at IBM," Interfaces, INFORMS, vol. 40(1), pages 33-46, February.
    6. M. Angélica Salazar-Aguilar & Vincent Boyer & Romeo Sanchez Nigenda & Iris A. Martínez-Salazar, 2019. "The sales force sizing problem with multi-period workload assignments, and service time windows," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(1), pages 199-218, March.
    7. Martínez, Andrés & Schmuck, Claudia & Pereverzyev, Sergiy & Pirker, Clemens & Haltmeier, Markus, 2020. "A machine learning framework for customer purchase prediction in the non-contractual setting," European Journal of Operational Research, Elsevier, vol. 281(3), pages 588-596.
    8. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    9. V. Kumar & Werner Reinartz, 2018. "Customer Relationship Management," Springer Texts in Business and Economics, Springer, edition 3, number 978-3-662-55381-7, June.
    10. Murali Mantrala & Sönke Albers & Fabio Caldieraro & Ove Jensen & Kissan Joseph & Manfred Krafft & Chakravarthi Narasimhan & Srinath Gopalakrishna & Andris Zoltners & Rajiv Lal & Leonard Lodish, 2010. "Sales force modeling: State of the field and research agenda," Marketing Letters, Springer, vol. 21(3), pages 255-272, September.
    11. Bose, Indranil & Chen, Xi, 2009. "Quantitative models for direct marketing: A review from systems perspective," European Journal of Operational Research, Elsevier, vol. 195(1), pages 1-16, May.
    12. Ke, Liangjun & Zhai, Laipeng & Li, Jing & Chan, Felix T.S., 2016. "Pareto mimic algorithm: An approach to the team orienteering problem," Omega, Elsevier, vol. 61(C), pages 155-166.
    13. Roland T. Rust & Ming-Hui Huang, 2014. "The Service Revolution and the Transformation of Marketing Science," Marketing Science, INFORMS, vol. 33(2), pages 206-221, March.
    14. Kotiloglu, S. & Lappas, T. & Pelechrinis, K. & Repoussis, P.P., 2017. "Personalized multi-period tour recommendations," Tourism Management, Elsevier, vol. 62(C), pages 76-88.
    15. Juan G. Moya-García & M. Angélica Salazar-Aguilar, 2020. "Territory Design for Sales Force Sizing," International Series in Operations Research & Management Science, in: Roger Z. Ríos-Mercado (ed.), Optimal Districting and Territory Design, chapter 0, pages 191-206, Springer.
    16. Doug J. Chung & Byungyeon Kim & Byoung G. Park, 2019. "How Do Sales Efforts Pay Off? Dynamic Panel Data Analysis in the Nerlove–Arrow Framework," Management Science, INFORMS, vol. 65(11), pages 5197-5218, November.
    17. Maldonado, Sebastián & Domínguez, Gonzalo & Olaya, Diego & Verbeke, Wouter, 2021. "Profit-driven churn prediction for the mutual fund industry: A multisegment approach," Omega, Elsevier, vol. 100(C).
    18. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    19. Zhou, Lin & Zhen, Lu & Baldacci, Roberto & Boschetti, Marco & Dai, Ying & Lim, Andrew, 2021. "A Heuristic Algorithm for solving a large-scale real-world territory design problem," Omega, Elsevier, vol. 103(C).
    20. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    21. Christos Orlis & Nicola Bianchessi & Roberto Roberti & Wout Dullaert, 2020. "The Team Orienteering Problem with Overlaps: An Application in Cash Logistics," Transportation Science, INFORMS, vol. 54(2), pages 470-487, March.
    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. Johannes Habel & Sascha Alavi & Nicolas Heinitz, 2023. "A theory of predictive sales analytics adoption," AMS Review, Springer;Academy of Marketing Science, vol. 13(1), pages 34-54, June.

    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. Christos Orlis & Nicola Bianchessi & Roberto Roberti & Wout Dullaert, 2020. "The Team Orienteering Problem with Overlaps: An Application in Cash Logistics," Transportation Science, INFORMS, vol. 54(2), pages 470-487, March.
    2. Fang, Chao & Han, Zonglei & Wang, Wei & Zio, Enrico, 2023. "Routing UAVs in landslides Monitoring: A neural network heuristic for team orienteering with mandatory visits," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    3. Kirac, Emre & Milburn, Ashlea Bennett, 2018. "A general framework for assessing the value of social data for disaster response logistics planning," European Journal of Operational Research, Elsevier, vol. 269(2), pages 486-500.
    4. Xia, Jun & Wang, Kai & Wang, Shuaian, 2019. "Drone scheduling to monitor vessels in emission control areas," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 174-196.
    5. Katharina Glock & Anne Meyer, 2020. "Mission Planning for Emergency Rapid Mapping with Drones," Transportation Science, INFORMS, vol. 54(2), pages 534-560, March.
    6. Jost, Christian & Jungwirth, Alexander & Kolisch, Rainer & Schiffels, Sebastian, 2022. "Consistent vehicle routing with pickup decisions - Insights from sport academy training transfers," European Journal of Operational Research, Elsevier, vol. 298(1), pages 337-350.
    7. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    8. Johannes Habel & Sascha Alavi & Nicolas Heinitz, 2023. "A theory of predictive sales analytics adoption," AMS Review, Springer;Academy of Marketing Science, vol. 13(1), pages 34-54, June.
    9. Ruiz-Meza, José & Montoya-Torres, Jairo R., 2022. "A systematic literature review for the tourist trip design problem: Extensions, solution techniques and future research lines," Operations Research Perspectives, Elsevier, vol. 9(C).
    10. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    11. Glock, Katharina & Meyer, Anne, 2023. "Spatial coverage in routing and path planning problems," European Journal of Operational Research, Elsevier, vol. 305(1), pages 1-20.
    12. Stavropoulou, F. & Repoussis, P.P. & Tarantilis, C.D., 2019. "The Vehicle Routing Problem with Profits and consistency constraints," European Journal of Operational Research, Elsevier, vol. 274(1), pages 340-356.
    13. Zhao, Yanlu & Alfandari, Laurent, 2020. "Design of diversified package tours for the digital travel industry : A branch-cut-and-price approach," European Journal of Operational Research, Elsevier, vol. 285(3), pages 825-843.
    14. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
    15. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    16. Alejandro Estrada-Moreno & Albert Ferrer & Angel A. Juan & Javier Panadero & Adil Bagirov, 2020. "The Non-Smooth and Bi-Objective Team Orienteering Problem with Soft Constraints," Mathematics, MDPI, vol. 8(9), pages 1-16, September.
    17. Cinar, Ahmet & Salman, F. Sibel & Bozkaya, Burcin, 2021. "Prioritized single nurse routing and scheduling for home healthcare services," European Journal of Operational Research, Elsevier, vol. 289(3), pages 867-878.
    18. Ke, Liangjun & Zhai, Laipeng & Li, Jing & Chan, Felix T.S., 2016. "Pareto mimic algorithm: An approach to the team orienteering problem," Omega, Elsevier, vol. 61(C), pages 155-166.
    19. Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    20. Mohammadmehdi Hakimifar & Vera C. Hemmelmayr & Fabien Tricoire, 2023. "A lexicographic maximin approach to the selective assessment routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(1), pages 205-249, March.

    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:eee:jomega:v:105:y:2021:i:c:s0305048321001274. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.