Skip to main content
Erschienen in: Memetic Computing 4/2018

25.06.2018 | Regular Research Paper

A discrete bilevel brain storm algorithm for solving a sales territory design problem: a case study

verfasst von: Samuel Nucamendi-Guillén, Dámaris Dávila, José-Fernando Camacho-Vallejo, Rosa G. González-Ramírez

Erschienen in: Memetic Computing | Ausgabe 4/2018

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A sales territory design problem faced by a manufacturing company that supplies products to a group of customers located in a service region is addressed in this paper. The planning process of designing the territories has the objective to minimizing the total dispersion of the customers without exceeding a limited budget assigned to each territory. Once territories have been determined, a salesperson has to define the day-by-day routes to satisfy the demand of customers. Currently, the company has established a service level policy that aims to minimize total waiting times during the distribution process. Also, each territory is served by a single salesperson. A novel discrete bilevel optimization model for the sales territory design problem is proposed. This problem can be seen as a bilevel problem with a single leader and multiple independent followers, in which the leader’s problem corresponds to the design of territories (manager of the company), and the routing decision for each territory corresponds to each follower. The hierarchical nature of the current company’s decision-making process triggers some particular characteristics of the bilevel model. A brain storm algorithm that exploits these characteristics is proposed to solve the discrete bilevel problem. The main features of the proposed algorithm are that the workload is used to verify the feasibility and to cluster the leader’s solutions. In addition, four discrete mechanisms are used to generate new solutions, and an elite set of solutions is considered to reduce computational cost. This algorithm is used to solve a real case study, and the results are compared against the current solution given by the company. Results show a reduction of more than 20% in the current costs with the solution obtained by the proposed algorithm. Furthermore, a sensitivity analysis is performed, providing interesting managerial insights to improve the current operations of the company.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Altman M (1997) Is automation the answer: the computational complexity of automated redistricting. Rutgers Comput Technol Law J 23(1):81–142 Altman M (1997) Is automation the answer: the computational complexity of automated redistricting. Rutgers Comput Technol Law J 23(1):81–142
2.
Zurück zum Zitat Angel-Bello F, Martínez-Salazar I, Alvarez A (2013) Minimizing waiting times in a route design problem with multiple use of a single vehicle. Electron. Notes Discrete Math 41:269–276CrossRef Angel-Bello F, Martínez-Salazar I, Alvarez A (2013) Minimizing waiting times in a route design problem with multiple use of a single vehicle. Electron. Notes Discrete Math 41:269–276CrossRef
3.
Zurück zum Zitat Bacao F, Lobo V, Painho M (2005) Applying genetic algorithms to zone design. Soft Comput 9:341–348CrossRef Bacao F, Lobo V, Painho M (2005) Applying genetic algorithms to zone design. Soft Comput 9:341–348CrossRef
4.
5.
Zurück zum Zitat Caramia M, Mari R (2016) A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim Lett 10(5):997–1019MathSciNetCrossRef Caramia M, Mari R (2016) A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim Lett 10(5):997–1019MathSciNetCrossRef
6.
Zurück zum Zitat Cheng S, Qin Q, Chen J, Shi Y (2016) Brain storm optimization algorithm: a review. Artif Intell Rev 46:445–458CrossRef Cheng S, Qin Q, Chen J, Shi Y (2016) Brain storm optimization algorithm: a review. Artif Intell Rev 46:445–458CrossRef
7.
Zurück zum Zitat Chou C, Kimbrough SO, Sullivan-Fedock J, Woodard CJ, Murphy FH (2012) Using interactive evolutionary computation (IEC) with validated surrogate fitness functions for redistricting. In: Genetic and evolutionary computation conference. ACM Digital Library, pp 1071–1078 Chou C, Kimbrough SO, Sullivan-Fedock J, Woodard CJ, Murphy FH (2012) Using interactive evolutionary computation (IEC) with validated surrogate fitness functions for redistricting. In: Genetic and evolutionary computation conference. ACM Digital Library, pp 1071–1078
8.
Zurück zum Zitat Chou CI (2011) A knowledge-based evolution algorithm approach to political districting problem. Comput Phys Commun 182:209–212MathSciNetCrossRef Chou CI (2011) A knowledge-based evolution algorithm approach to political districting problem. Comput Phys Commun 182:209–212MathSciNetCrossRef
9.
Zurück zum Zitat El-Abd M (2017) Global-best brain storm optimization algorithm. Swarm Evol Comput 37:27–44CrossRef El-Abd M (2017) Global-best brain storm optimization algorithm. Swarm Evol Comput 37:27–44CrossRef
10.
Zurück zum Zitat Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1217MathSciNetCrossRef Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM J Sci Stat Comput 13(5):1194–1217MathSciNetCrossRef
11.
Zurück zum Zitat Hu F, Yang S, Xu W (2014) A non-dominated sorting genetic algorithm for the location and districting planning of earthquake shelters. Int J Geogr Inf Sci 28(7):1482–1501CrossRef Hu F, Yang S, Xu W (2014) A non-dominated sorting genetic algorithm for the location and districting planning of earthquake shelters. Int J Geogr Inf Sci 28(7):1482–1501CrossRef
12.
Zurück zum Zitat Iannoni AP, Morabito R, Saydam C (2009) An optimization approach for ambulance location and the districting of the response segments on highways. Eur J Oper Res 195:528–542CrossRef Iannoni AP, Morabito R, Saydam C (2009) An optimization approach for ambulance location and the districting of the response segments on highways. Eur J Oper Res 195:528–542CrossRef
13.
Zurück zum Zitat Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach: applications, algorithms and GIS integration. Top 13(1):1–56MathSciNetCrossRef Kalcsics J, Nickel S, Schröder M (2005) Towards a unified territorial design approach: applications, algorithms and GIS integration. Top 13(1):1–56MathSciNetCrossRef
14.
Zurück zum Zitat Karahan I, Köksalan M (2010) A territory defining multiobjective evolutionary algorithms and preference incorporation. Trans Evol Comput 14(4):636–664CrossRef Karahan I, Köksalan M (2010) A territory defining multiobjective evolutionary algorithms and preference incorporation. Trans Evol Comput 14(4):636–664CrossRef
15.
Zurück zum Zitat Lei H, Laporte G, Guo B (2012) Districting for routing with stochastic customers. EURO J Transp Logist 1(1–2):67–85CrossRef Lei H, Laporte G, Guo B (2012) Districting for routing with stochastic customers. EURO J Transp Logist 1(1–2):67–85CrossRef
16.
Zurück zum Zitat Lei H, Wang R, Laporte G (2016) Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Comput Oper Res 67:12–24MathSciNetCrossRef Lei H, Wang R, Laporte G (2016) Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm. Comput Oper Res 67:12–24MathSciNetCrossRef
17.
Zurück zum Zitat Nucamendi-Guillén S, Martínez-Salazar I, Angel-Bello F, Moreno-Vega JM (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J Oper Res Soc 67(8):1121–1134CrossRef Nucamendi-Guillén S, Martínez-Salazar I, Angel-Bello F, Moreno-Vega JM (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J Oper Res Soc 67(8):1121–1134CrossRef
18.
Zurück zum Zitat Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728–735MathSciNetCrossRef Ribeiro GM, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 39(3):728–735MathSciNetCrossRef
19.
Zurück zum Zitat Rincón-García EA, Gutiérrez-Andrade MA, de-los Cobos-Silva SG, Lara-Velázquez P, Mora-Gutiérrez RA, Ponsich A (2012) A discrete particle swarm optimization algorithm for designing electoral zones. In: Methods for decision making in an uncertain environment, pp 174–197 Rincón-García EA, Gutiérrez-Andrade MA, de-los Cobos-Silva SG, Lara-Velázquez P, Mora-Gutiérrez RA, Ponsich A (2012) A discrete particle swarm optimization algorithm for designing electoral zones. In: Methods for decision making in an uncertain environment, pp 174–197
20.
Zurück zum Zitat Rivera JC, Afsar HM, Prins C (2015) A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Comput Optim Appl 61(1):159–187MathSciNetCrossRef Rivera JC, Afsar HM, Prins C (2015) A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem. Comput Optim Appl 61(1):159–187MathSciNetCrossRef
21.
Zurück zum Zitat Salazar-Aguilar MA, Ríos-Mercado RZ, González-Velarde JL, Molina J (2012) Multiobjective scatter search for a commercial territory design problem. Ann Oper Res 199(1):343–360MathSciNetCrossRef Salazar-Aguilar MA, Ríos-Mercado RZ, González-Velarde JL, Molina J (2012) Multiobjective scatter search for a commercial territory design problem. Ann Oper Res 199(1):343–360MathSciNetCrossRef
22.
Zurück zum Zitat Saucedo-Martínez JA, Pérez-Lara M, Marmolejo-Saucedo JA, Salais-Fierro TE, Vasant P (2017) Industry 4.0 framework for management and operations: a review. J Ambient Intell Humaniz Comput 9:1–13 Saucedo-Martínez JA, Pérez-Lara M, Marmolejo-Saucedo JA, Salais-Fierro TE, Vasant P (2017) Industry 4.0 framework for management and operations: a review. J Ambient Intell Humaniz Comput 9:1–13
23.
Zurück zum Zitat Shen L (2014) Research and application of v-SVR based on brain storm optimization algorithm. Master’s thesis, Lanzhou University Shen L (2014) Research and application of v-SVR based on brain storm optimization algorithm. Master’s thesis, Lanzhou University
25.
Zurück zum Zitat Sun Y (2014) A hybrid approach by integrating brain storm optimization algorithm with grey neural network for stock index forecasting. Abstr. Appl. Anal. 2014:1–10 Sun Y (2014) A hybrid approach by integrating brain storm optimization algorithm with grey neural network for stock index forecasting. Abstr. Appl. Anal. 2014:1–10
26.
Zurück zum Zitat Talbi EG (2013) Metaheuristics for bi-level optimization, vol 482. Springer, BerlinMATH Talbi EG (2013) Metaheuristics for bi-level optimization, vol 482. Springer, BerlinMATH
27.
Zurück zum Zitat Tavares-Pereira F, Rui Figueira J, Mousseau V, Roy B (2007) Multiple criteria districting problems. The public transportation network pricing system of the paris region. Ann Oper Res 154:69–92MathSciNetCrossRef Tavares-Pereira F, Rui Figueira J, Mousseau V, Roy B (2007) Multiple criteria districting problems. The public transportation network pricing system of the paris region. Ann Oper Res 154:69–92MathSciNetCrossRef
28.
Zurück zum Zitat Vanneschi L, Henriques R, Castelli M (2017) Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem. Swarm Evol Comput 36:37–51CrossRef Vanneschi L, Henriques R, Castelli M (2017) Multi-objective genetic algorithm with variable neighbourhood search for the electoral redistricting problem. Swarm Evol Comput 36:37–51CrossRef
29.
Zurück zum Zitat Xiao N (2008) A unified conceptual framework for geographical optimization using evolutionary algorithms. Ann Assoc Am Geogr 98(4):795–817CrossRef Xiao N (2008) A unified conceptual framework for geographical optimization using evolutionary algorithms. Ann Assoc Am Geogr 98(4):795–817CrossRef
30.
Zurück zum Zitat Zoltners AA, Sinha P (1983) Sales territory alignment: a review and model. Manag Sci 29(11):1237–1256CrossRef Zoltners AA, Sinha P (1983) Sales territory alignment: a review and model. Manag Sci 29(11):1237–1256CrossRef
Metadaten
Titel
A discrete bilevel brain storm algorithm for solving a sales territory design problem: a case study
verfasst von
Samuel Nucamendi-Guillén
Dámaris Dávila
José-Fernando Camacho-Vallejo
Rosa G. González-Ramírez
Publikationsdatum
25.06.2018
Verlag
Springer Berlin Heidelberg
Erschienen in
Memetic Computing / Ausgabe 4/2018
Print ISSN: 1865-9284
Elektronische ISSN: 1865-9292
DOI
https://doi.org/10.1007/s12293-018-0266-5

Weitere Artikel der Ausgabe 4/2018

Memetic Computing 4/2018 Zur Ausgabe