Skip to main content
Erschienen in: Information Systems and e-Business Management 4/2020

21.01.2019 | Original Article

RETRACTED ARTICLE: E-commerce information system data analytics by advanced ACO for asymmetric capacitated vehicle delivery routing

verfasst von: Yuan Zhang, Yu Yuan, Kejing Lu

Erschienen in: Information Systems and e-Business Management | Ausgabe 4/2020

Einloggen

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

search-config
loading …

Abstract

Logistic industry is experiencing its golden era for development due to its supportive role of electronic commerce operation. Big data retrieved from electronic business information system is becoming one of core competitive enterprise resources. Data analytics is playing a pivotal role to enhance effectiveness and efficiency of operation management. Generally, a well-designed delivery routing plan can reduce logistics cost and improve customer satisfaction for online business to a large extent. According to this, literatures on improvement of delivery efficiency are reviewed in this research. In existing literatures, for instance, ant colony algorithm, genetic algorithm and other combined algorithm are quite popular for such a kind of problem. Even though some algorithms are quite advanced, they are still difficult for implementation due to different constraints and larger-scale of raw electronic commerce data obtained from information system. In this paper, an advanced ant colony algorithm, as a heuristic algorithm, is implemented to optimize planning for an asymmetric capacitated vehicle routing problem. This paper not only emphasizes on ACO algorithm improvement and avoiding premature convergence, but also implementation in a real-world e-commerce delivery, which has more practical meaning for big data analytics and operation management.

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
Zurück zum Zitat Altinel IK, Oncan T (2005) A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J Oper Res Soc 56:954–961CrossRef Altinel IK, Oncan T (2005) A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J Oper Res Soc 56:954–961CrossRef
Zurück zum Zitat Bae ST, Hwang HS, Cho GS, Goan MJ (2007) Integrated GA-VRP solver for multi-depot system. Comput Ind Eng 53(2):233–240CrossRef Bae ST, Hwang HS, Cho GS, Goan MJ (2007) Integrated GA-VRP solver for multi-depot system. Comput Ind Eng 53(2):233–240CrossRef
Zurück zum Zitat Barbucha D (2014) A cooperative agent-based multiple neighborhood search for the capacitated vehicle routing problem. Recent Adv Knowl-Based Paradig Appl 234:129–143CrossRef Barbucha D (2014) A cooperative agent-based multiple neighborhood search for the capacitated vehicle routing problem. Recent Adv Knowl-Based Paradig Appl 234:129–143CrossRef
Zurück zum Zitat Battarra M, Golden B, Vigo D (2008) Tuning a parametric Clarke–Wright heuristic via a genetic algorithm. J Oper Res Soc 59:1568–1572CrossRef Battarra M, Golden B, Vigo D (2008) Tuning a parametric Clarke–Wright heuristic via a genetic algorithm. J Oper Res Soc 59:1568–1572CrossRef
Zurück zum Zitat Choi TM, Chan HK, Yue X (2016) Recent development in big data analytics for business operations and risk management. IEEE Trans Cybern 47(1):81–92CrossRef Choi TM, Chan HK, Yue X (2016) Recent development in big data analytics for business operations and risk management. IEEE Trans Cybern 47(1):81–92CrossRef
Zurück zum Zitat Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581CrossRef Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581CrossRef
Zurück zum Zitat Corominas A, Garcia-Villoria A, Pastor R (2010) Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics). J Oper Res Soc 61:1309–1314CrossRef Corominas A, Garcia-Villoria A, Pastor R (2010) Fine-tuning a parametric Clarke and Wright heuristic by means of EAGH (empirically adjusted greedy heuristics). J Oper Res Soc 61:1309–1314CrossRef
Zurück zum Zitat Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 4(6):80–91CrossRef Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 4(6):80–91CrossRef
Zurück zum Zitat Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66CrossRef Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1:53–66CrossRef
Zurück zum Zitat Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26:29–41CrossRef Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B Cybern 26:29–41CrossRef
Zurück zum Zitat Dotan T (2002) How can ebusiness improve customer satisfaction? Case studies in the financial service industry. J Inf Technol Case Appl Res 4(4):22–48 Dotan T (2002) How can ebusiness improve customer satisfaction? Case studies in the financial service industry. J Inf Technol Case Appl Res 4(4):22–48
Zurück zum Zitat Frasch W, Spetzler D, York J, Xiong F (2012) Methods for generating a distribution of optimal solutions to nondeterministic polynomial optimization problems Frasch W, Spetzler D, York J, Xiong F (2012) Methods for generating a distribution of optimal solutions to nondeterministic polynomial optimization problems
Zurück zum Zitat Frei FX (2006) Breaking the trade-off between efficiency and service. Harv Bus Rev 84(11):93–101 Frei FX (2006) Breaking the trade-off between efficiency and service. Harv Bus Rev 84(11):93–101
Zurück zum Zitat Gligor DM, Holcomb MC (2012) Understanding the role of logistics capabilities in achieving supply chain agility: a systematic literature review. Supply Chain Manag Int J 17(4):438–453CrossRef Gligor DM, Holcomb MC (2012) Understanding the role of logistics capabilities in achieving supply chain agility: a systematic literature review. Supply Chain Manag Int J 17(4):438–453CrossRef
Zurück zum Zitat Jie YU, Subramanian N, Ning K, Edwards D (2015) Product delivery service provider selection and customer satisfaction in the era of internet of things: a Chinese e-retailers’ perspective. Int J Prod Econ 159:104–116CrossRef Jie YU, Subramanian N, Ning K, Edwards D (2015) Product delivery service provider selection and customer satisfaction in the era of internet of things: a Chinese e-retailers’ perspective. Int J Prod Econ 159:104–116CrossRef
Zurück zum Zitat Juan A, Faulin J, Jorba J, Riera D, Masip D, Barrios B (2011) On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. J Oper Res Soc 62:1085–1097CrossRef Juan A, Faulin J, Jorba J, Riera D, Masip D, Barrios B (2011) On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. J Oper Res Soc 62:1085–1097CrossRef
Zurück zum Zitat Ke L, Feng Z (2013) A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 40(2):633–638CrossRef Ke L, Feng Z (2013) A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Comput Oper Res 40(2):633–638CrossRef
Zurück zum Zitat Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceeding of IEEE international conference on neural networks. IEEE Press, Perth Western, pp 1942–1948 Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceeding of IEEE international conference on neural networks. IEEE Press, Perth Western, pp 1942–1948
Zurück zum Zitat Kirk J (1973) Fixed endpoints open traveling salesman problem—genetic algorithm. Acta Univ Carol Med Monogr 56(2):7–20 Kirk J (1973) Fixed endpoints open traveling salesman problem—genetic algorithm. Acta Univ Carol Med Monogr 56(2):7–20
Zurück zum Zitat Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. Oper Res Spektrum 5(2):77–85CrossRef Laporte G, Nobert Y (1983) A branch and bound algorithm for the capacitated vehicle routing problem. Oper Res Spektrum 5(2):77–85CrossRef
Zurück zum Zitat Lim S, Jin X, Srai JS (2018) Consumer-driven e-commerce: a literature review, design framework and research agenda on last-mile logistics models. Int J Phys Distrib Logist Manag 48:308–332CrossRef Lim S, Jin X, Srai JS (2018) Consumer-driven e-commerce: a literature review, design framework and research agenda on last-mile logistics models. Int J Phys Distrib Logist Manag 48:308–332CrossRef
Zurück zum Zitat Nilsson BJ, Ottmann T, Schuierer S, Icking C (1992) Restricted orientation computational geometry. Data Structures and Efficient Algorithms, Final Report on the Dfg Special Joint Initiative. Springer Nilsson BJ, Ottmann T, Schuierer S, Icking C (1992) Restricted orientation computational geometry. Data Structures and Efficient Algorithms, Final Report on the Dfg Special Joint Initiative. Springer
Zurück zum Zitat Nizar AH, Zhao JH, Dong ZY (2007) Customer information system data pre-processing with feature selection techniques for non-technical losses prediction in an electricity market. In: International conference on power system technology Nizar AH, Zhao JH, Dong ZY (2007) Customer information system data pre-processing with feature selection techniques for non-technical losses prediction in an electricity market. In: International conference on power system technology
Zurück zum Zitat Onoyama T, Maekawa T, Komoda N (2006) GA applied VRP solving method for a cooperative logistics network. In: IEEE conference on emerging technologies and factory automation Onoyama T, Maekawa T, Komoda N (2006) GA applied VRP solving method for a cooperative logistics network. In: IEEE conference on emerging technologies and factory automation
Zurück zum Zitat Osaba E, Diaz F, Onieva E (2013) Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl Intell 41(1):145–166CrossRef Osaba E, Diaz F, Onieva E (2013) Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts. Appl Intell 41(1):145–166CrossRef
Zurück zum Zitat Paz A, Moran S (1977) Non-deterministic polynomial optimization problems and their approximation. Theor Comput Sci 15(3):251–277CrossRef Paz A, Moran S (1977) Non-deterministic polynomial optimization problems and their approximation. Theor Comput Sci 15(3):251–277CrossRef
Zurück zum Zitat Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Program 94(2–3):343–359CrossRef Ralphs TK, Kopman L, Pulleyblank WR, Trotter LE (2003) On the capacitated vehicle routing problem. Math Program 94(2–3):343–359CrossRef
Zurück zum Zitat Renaud J, Boctor FF (2002) A sweep based algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 140:618–628CrossRef Renaud J, Boctor FF (2002) A sweep based algorithm for the fleet size and mix vehicle routing problem. Eur J Oper Res 140:618–628CrossRef
Zurück zum Zitat Sharvani GS, Ananth AG, Rangaswamy TM (2012) Analysis of different pheromone decay techniques for ACO based routing in ad hoc wireless networks. Int J Comput Appl 56(2):31–38 Sharvani GS, Ananth AG, Rangaswamy TM (2012) Analysis of different pheromone decay techniques for ACO based routing in ad hoc wireless networks. Int J Comput Appl 56(2):31–38
Zurück zum Zitat Stubbs E (2014) Big data, big innovation: enabling competitive differentiation through business analytics. Wiley, New YorkCrossRef Stubbs E (2014) Big data, big innovation: enabling competitive differentiation through business analytics. Wiley, New YorkCrossRef
Zurück zum Zitat Tao N, Chen G, Tao N (2012) Solving VRP using ant colony optimization algorithm. Comput Model Eng Sci 83(1):23–55 Tao N, Chen G, Tao N (2012) Solving VRP using ant colony optimization algorithm. Comput Model Eng Sci 83(1):23–55
Zurück zum Zitat Toth P, Vigo D (1997a) An exact algorithm for the vehicle routing problem with backhauls. Transp Sci 31(4):372–385CrossRef Toth P, Vigo D (1997a) An exact algorithm for the vehicle routing problem with backhauls. Transp Sci 31(4):372–385CrossRef
Zurück zum Zitat Toth P, Vigo D (1997b) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31(1):60–71CrossRef Toth P, Vigo D (1997b) Heuristic algorithms for the handicapped persons transportation problem. Transp Sci 31(1):60–71CrossRef
Zurück zum Zitat Tyworth JE, Joseph LC, John CL (1987) Traffic management: planning, operations, and control. Addison-Wesley, Reading Tyworth JE, Joseph LC, John CL (1987) Traffic management: planning, operations, and control. Addison-Wesley, Reading
Zurück zum Zitat Wang CB, Guo J (2013) A new hybrid algorithm based on artificial fish swarm algorithm and genetic algorithm for VRP. Appl Mech Mater 325–326:1722–1725CrossRef Wang CB, Guo J (2013) A new hybrid algorithm based on artificial fish swarm algorithm and genetic algorithm for VRP. Appl Mech Mater 325–326:1722–1725CrossRef
Zurück zum Zitat Yu B, Yang Z, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196:171–176CrossRef Yu B, Yang Z, Yao B (2009) An improved ant colony optimization for vehicle routing problem. Eur J Oper Res 196:171–176CrossRef
Zurück zum Zitat Zhang Y (2017) Data pre-processing for real-world e-commerce delivery address clustering. Adv Intell Syst Res (AISR) 2017(150):164–168 Zhang Y (2017) Data pre-processing for real-world e-commerce delivery address clustering. Adv Intell Syst Res (AISR) 2017(150):164–168
Zurück zum Zitat Zhang X, Gong H, Guo Y, Zhang L (2015) Improved chaos particle swarm algorithm on VRP. Comput Digit Eng 43(12):2106–2109 Zhang X, Gong H, Guo Y, Zhang L (2015) Improved chaos particle swarm algorithm on VRP. Comput Digit Eng 43(12):2106–2109
Zurück zum Zitat Zhou Y, He J, Nie Q (2009) A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artif Intell 173(2):240–257CrossRef Zhou Y, He J, Nie Q (2009) A comparative runtime analysis of heuristic algorithms for satisfiability problems. Artif Intell 173(2):240–257CrossRef
Metadaten
Titel
RETRACTED ARTICLE: E-commerce information system data analytics by advanced ACO for asymmetric capacitated vehicle delivery routing
verfasst von
Yuan Zhang
Yu Yuan
Kejing Lu
Publikationsdatum
21.01.2019
Verlag
Springer Berlin Heidelberg
Erschienen in
Information Systems and e-Business Management / Ausgabe 4/2020
Print ISSN: 1617-9846
Elektronische ISSN: 1617-9854
DOI
https://doi.org/10.1007/s10257-019-00405-y

Weitere Artikel der Ausgabe 4/2020

Information Systems and e-Business Management 4/2020 Zur Ausgabe