Performance des ULD - BUSINESS INTELLIGENCE SUR LES PERFORMANCES

BUSINESS INTELLIGENCE SUR LES PERFORMANCES

I.4 Performance des ULD

Nesta seção estão expostos os resultados dos testes executados com as listas A (TAPPE- DOUT.NET, 2019a) e B (TAPPEDOUT.NET, 2019b).

Tabela 7.2. Testes no Crawler das lojas específicas em segundos

Lista 30 cartas 60 cartas 100 cartas

Lista A 157,17 321,82 542,28 Lista A 157,84 321,52 567,31 Lista A 158,98 320,82 555,89 Lista B 150,76 299,88 528 Lista B 151 304,14 522,90 Lista B 154,29 300,96 518,89

Tabela 7.3. Execuções dos modelos lineares nas listas A e B em segundos - Parte 1

Modelo Lista Cartas Unids Lojas Tam Tempo Preço

MODELO 1 LISTA A 30 1 119 3 5,57 198,1 MODELO 1 LISTA B 30 1 120 5 3,95 503,62 MODELO 1 LISTA A 60 1 120 6 20,15 358,74 MODELO 1 LISTA B 60 1 120 7 5,48 827,02 MODELO 1 LISTA A 100 1 120 8 20,93 539,75 MODELO 1 LISTA B 100 1 120 10 10,52 1121,03 MODELO 2 LISTA B 30 1 120 5 5,14 503,62 MODELO 2 LISTA A 30 1 119 3 5,95 198,1 MODELO 2 LISTA B 30 2 120 8 16,32 1023,34 MODELO 2 LISTA A 30 2 119 7 17,06 373,21 MODELO 2 LISTA A 30 4 119 11 746,89 809,82 MODELO 2 LISTA B 30 4 120 12 54,08 2045,05 MODELO 2 LISTA A 60 1 120 6 22,65 358,74 MODELO 2 LISTA B 60 1 120 7 5,92 827,02 MODELO 2 LISTA A 60 2 121 9 192,71 650,18 MODELO 2 LISTA B 60 2 120 11 84,85 1665,38 MODELO 2 LISTA B 60 4 120 18 585,0 3343,91 MODELO 2 LISTA A 60 4 120 15 1494,0 1362,22 MODELO 2 LISTA B 100 1 120 10 9,81 1121,03 MODELO 2 LISTA A 100 1 120 8 22,54 539,75 MODELO 2 LISTA A 100 2 120 13 933,0 1046,5 MODELO 2 LISTA B 100 2 120 14 136,0 2233,83 MODELO 2 LISTA A 100 4 120 21 23853,0 2069,69 MODELO 2 LISTA B 100 4 120 25 1339,0 4477,04 MODELO 3 LISTA A 30 1 119 3 6,2 198,1

Tabela 7.4. Execuções dos modelos lineares nas listas A e B em segundos - Parte 2

Modelo Lista Cartas Unids Lojas Tam Tempo Preço

MODELO 3 LISTA B 30 1 120 5 4,08 503,63 MODELO 3 LISTA B 30 2 120 8 5,63 1023,34 MODELO 3 LISTA A 30 2 119 7 4,74 373,21 MODELO 3 LISTA A 30 4 119 11 9,66 746,89 MODELO 3 LISTA B 30 4 120 12 5,25 2045,05 MODELO 3 LISTA A 60 1 120 6 30,44 358,75 MODELO 3 LISTA B 60 1 120 7 5,49 827,02 MODELO 3 LISTA A 60 2 120 9 10,88 681,5 MODELO 3 LISTA B 60 2 120 11 11,43 1665,38 MODELO 3 LISTA A 60 4 120 15 16,93 1363,2 MODELO 3 LISTA B 60 4 120 18 8,69 3343,91 MODELO 3 LISTA B 100 1 120 10 11,85 1121,03 MODELO 3 LISTA A 100 1 120 8 14,33 539,75 MODELO 3 LISTA A 100 2 120 13 91,26 1046,69 MODELO 3 LISTA B 100 2 120 14 28,83 2233,83 MODELO 3 LISTA B 100 4 120 25 20,71 4477,04 MODELO 3 LISTA A 100 4 120 21 164,52 2069,7

AARTS, E.H.L.; LENSTRA, J.K. Local search in combinatorial optimization. [S.l.]: Wiley- Interscience, 1997. (Wiley-Interscience series in discrete mathematics and optimization). ISBN 0471-94822-5.

AMAZON. Amazon Web Page. 2019. <https://www.amazon.com.br>. Acessado: 2019-06-15. BEASLEY, J.E; CHU, P.C. A genetic algorithm for the set covering problem. European

Journal of Operational Research, v. 94, n. 2, p. 392 – 404, 1996. ISSN 0377-2217. Disponível

em: <http://www.sciencedirect.com/science/article/pii/037722179500159X>.

BOTICARIO. Boticario Web Page. 2019. <https://www.boticario.com.br>. Acessado: 2019- 06-15.

BUSCAPE. Buscape Web Page. 2019. <https://www.buscape.com.br>. Acessado: 2019-06- 15.

CAMELCAMELCAMEL. CamelCamelCamel Web Page. 2019. <https://camelcamelcamel. com>. Acessado: 2019-06-15.

CHO, Junghoo; GARCIA-MOLINA, Hector. Synchronizing a database to improve freshness. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of

Data. New York, NY, USA: ACM, 2000. (SIGMOD ’00), p. 117–128. ISBN 1-58113-217-4.

Disponível em: <http://doi.acm.org/10.1145/342009.335391>.

CHO, Junghoo; GARCIA-MOLINA, Hector. Synchronizing a database to improve freshness.

SIGMOD Rec., ACM, New York, NY, USA, v. 29, n. 2, p. 117–128, maio 2000. ISSN 0163-5808.

Disponível em: <http://doi.acm.org/10.1145/335191.335391>.

CORMEN, Thomas H.; LEISERSON, Charles E.; RIVEST, Ronald L.; STEIN, Clifford.

Introduction to Algorithms, Third Edition. 3rd. ed. [S.l.]: The MIT Press, 2009. ISBN

0262033844, 9780262033848.

CORREIOS. Página dos correios. 2019. <http://www.correios.com.br>. Acessado: 2019-05- 03.

COSMETICOS, Epoca. Epoca Cosmeticos Web Page. 2019. <https://www.epocacosmeticos. com.br>. Acessado: 2019-06-15.

COSMETICOS, Nikkey. Nikkey Cosmeticos Web Page. 2019. <https://www.nikkeycosmeticos. com.br>. Acessado: 2019-06-15.

COULOURIS, George; DOLLIMORE, Jean; KINDBERG, Tim; BLAIR, Gordon. Distributed

Systems: Concepts and Design. 5th. ed. USA: Addison-Wesley Publishing Company, 2011.

ISBN 0132143011, 9780132143011.

DORIGO, Marco; CARO, Gianni Di. Ant colony optimization: A new meta-heuristic. In: . [S.l.: s.n.], 1999. v. 2, p. 1477 Vol. 2. ISBN 0-7803-5536-9.

DUCKDUCKGO. DuckDuckGo Web Page. 2019. <https://duckduckgo.com>. Acessado: 2019-06-15.

EBIT. Webshoppers 37 edição. 2017. <https://www.ebit.com.br/webshoppers>. Acessado: 2019-05-03.

EBIT. Webshoppers 38 edição. 2018. <https://www.ebit.com.br/webshoppers>. Acessado: 2019-08-03.

FISHER, Marshall L.; WOLSEY, Laurence. On the greedy heuristic for continuous covering and packing problems. Siam Journal on Algebraic and Discrete Methods, v. 3, 12 1982. GAREY, Michael R.; JOHNSON, David S. Computers and Intractability; A Guide to the

Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co., 1990. ISBN

0716710455.

GARFINKEL, Robert; GOPAL, Ram; PATHAK, Bhavik; YIN, Fang. Shopbot 2.0: Integrating recommendations and promotions with comparison shopping. Decision Support

Systems, v. 46, n. 1, p. 61 – 69, 2008. ISSN 0167-9236. Disponível em: <http://www.

sciencedirect.com/science/article/pii/S0167923608000869>.

GARFINKEL, Robert; GOPAL, Ram; TRIPATHI, Arvind; YIN, Fang. Design of a shopbot and recommender system for bundle purchases. Decision Support Systems, v. 42, n. 3, p. 1974 – 1986, 2006. ISSN 0167-9236. Disponível em: <http://www.sciencedirect.com/science/ article/pii/S0167923606000741>.

GOOGLE. Google Shopping Web Page. 2019. <https://www.google.com/shopping?hl= pt-BR>. Acessado: 2019-06-15.

GOOGLE. Google Web Page. 2019. <https://www.google.com>. Acessado: 2019-06-15. GREGORIO, Daniele Varrazzo Federico Di. Psycopg2 extras web page. 2019. <http: //initd.org/psycopg/docs/extras.html>. Acessado: 2019-06-15.

GROTSCHEL, Konrad-Zuse-Zentrum M. Geometric Algorithms and Combinatorial Optimi-

zation. [S.l.: s.n.], 1993.

LIGAMAGIC. Ligamagic Web Page. 2019. <https://ligamagic.com>. Acessado: 2019-06-15. LIU, Bing; MENCZER, Filippo. Web crawling. In: . Web Data Mining: Exploring

Hyperlinks, Contents, and Usage Data. Berlin, Heidelberg: Springer Berlin Heidelberg,

2011. p. 311–362. ISBN 978-3-642-19460-3. Disponível em: <https://doi.org/10.1007/ 978-3-642-19460-3\_8>.

NAKAO, Thiago Alexandre. Shopbot github page. 2019. <https://github.com/nakaosensei/ Shopbot-Project>. Acessado: 2019-06-10.

NEMHAUSER, George L.; WOLSEY, Laurence A. Integer and Combinatorial Optimization. New York, NY, USA: Wiley-Interscience, 1988. ISBN 0-471-82819-X.

POSTGRESQL. PostgreSQL web page. 2019. <https://www.postgresql.org/>. Acessado: 2019-06-10.

RAIDL, Günther; PUCHINGER, Jakob. Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: . [S.l.: s.n.], 2008. v. 114, p. 31–62.

Shkapenyuk, V.; Suel, T. Design and implementation of a high-performance distributed web crawler. In: Proceedings 18th International Conference on Data Engineering. [S.l.: s.n.], 2002. p. 357–368. ISSN 1063-6382.

TAPPEDOUT.NET. A Commander deck sample. 2019. <http://tappedout.net/mtg-decks/ 17-06-19-the-ur-dragon/?cb=1560782444>. Acessado: 2019-06-10.

TAPPEDOUT.NET. A Commander deck sample. 2019. <http://tappedout.net/mtg-decks/ my-five-colors-wait-for-it-victor/>. Acessado: 2019-06-10.

TRIVAGO. Trivago Web Page. 2019. <https://www.trivago.com.br>. Acessado: 2019-05-03. TURBAN, Efraim; LEE, Jae K.; KING, David; LIANG, Ting Peng; TURBAN, Deborrah.

Electronic Commerce 2010. 6th. ed. Upper Saddle River, NJ, USA: Prentice Hall Press, 2009.

ISBN 0136100368, 9780136100362.

UG. UG card shop web page. 2019. <https://www.ugcardshop.com.br/>. Acessado: 2019-06- 12.

WIZARDS. Magic Formats. 2019. <https://magic.wizards.com/en/game-info/gameplay/ rules-and-formats/formats>. Acessado: 2019-05-03.

WIZARDS. Magic Sets. 2019. <https://magic.wizards.com/en/products/card-set-archive>. Acessado: 2019-05-03.

WIZARDS. Wizards of the Coast story. 2019. <https://company.wizards.com/content/ company>. Acessado: 2019-05-03.

WOLSEY, LA. Wiley-interscience series in discrete mathematics and optimization. Integer

Programming, 1998.

WONG, Jimmy. New to Magic? 2018. <https://magic.wizards.com/en/new-to-magic>. Acessado: 2019-05-03.

YAHOO. Yahoo Shopping Web Page. 2019. <https://shopping.yahoo.com>. Acessado: 2019- 06-15.

ZAPLY. Zaply Web Page. 2019. <https://zaply.com.br>. Acessado: 2019-05-03.

ZHANG, Jie; JING, Bing. The impacts of shopbots on online consumer search. In: . [S.l.: s.n.], 2011. p. 1 – 10.

Dans le document Optimisation des performances logistique du fret aérien par la BI et les méthodes de management digital. (Page 106-110)