Customer purchase behavior prediction in E-commerce: a conceptual framework and research agenda

Digital retailers are experiencing an increasing number of transactions coming from their consumers online, a consequence of the convenience in buying goods via E-commerce platforms. Such interactions compose complex behavioral patterns which can be analyzed through predictive analytics to enable businesses to understand consumer needs. In this abundance of big data and possible tools to analyze them, a systematic review of the literature is missing. Therefore, this paper presents a systematic literature review of recent research dealing with customer purchase prediction in the E-commerce context. The main contributions are a novel analytical framework and a research agenda in the field. The framework reveals three main tasks in this review, namely, the prediction of customer intents, buying sessions, and purchase decisions. Those are followed by their employed predictive methodologies and are analyzed from three perspectives. Finally, the research agenda provides major existing issues for further research in the field of purchase behavior prediction online

Applications of biased-randomized algorithms and simheuristics in integrated logistics

Transportation and logistics (T&L) activities play a vital role in the development of many businesses from different industries. With the increasing number of people living in urban areas, the expansion of on-demand economy and e-commerce activities, the number of services from transportation and delivery has considerably increased. Consequently, several urban problems have been potentialized, such as traffic congestion and pollution. Several related problems can be formulated as a combinatorial optimization problem (COP). Since most of them are NP-Hard, the finding of optimal solutions through exact solution methods is often impractical in a reasonable amount of time. In realistic settings, the increasing need for 'instant' decision-making further refutes their use in real life. Under these circumstances, this thesis aims at: (i) identifying realistic COPs from different industries; (ii) developing different classes of approximate solution approaches to solve the identified T&L problems; (iii) conducting a series of computational experiments to validate and measure the performance of the developed approaches. The novel concept of 'agile optimization' is introduced, which refers to the combination of biased-randomized heuristics with parallel computing to deal with real-time decision-making.Las actividades de transporte y logística (T&L) juegan un papel vital en el desarrollo de muchas empresas de diferentes industrias. Con el creciente número de personas que viven en áreas urbanas, la expansión de la economía a lacarta y las actividades de comercio electrónico, el número de servicios de transporte y entrega ha aumentado considerablemente. En consecuencia, se han potencializado varios problemas urbanos, como la congestión del tráfico y la contaminación. Varios problemas relacionados pueden formularse como un problema de optimización combinatoria (COP). Dado que la mayoría de ellos son NP-Hard, la búsqueda de soluciones óptimas a través de métodos de solución exactos a menudo no es práctico en un período de tiempo razonable. En entornos realistas, la creciente necesidad de una toma de decisiones "instantánea" refuta aún más su uso en la vida real. En estas circunstancias, esta tesis tiene como objetivo: (i) identificar COP realistas de diferentes industrias; (ii) desarrollar diferentes clases de enfoques de solución aproximada para resolver los problemas de T&L identificados; (iii) realizar una serie de experimentos computacionales para validar y medir el desempeño de los enfoques desarrollados. Se introduce el nuevo concepto de optimización ágil, que se refiere a la combinación de heurísticas aleatorias sesgadas con computación paralela para hacer frente a la toma de decisiones en tiempo real.Les activitats de transport i logística (T&L) tenen un paper vital en el desenvolupament de moltes empreses de diferents indústries. Amb l'augment del nombre de persones que viuen a les zones urbanes, l'expansió de l'economia a la carta i les activitats de comerç electrònic, el nombre de serveis del transport i el lliurament ha augmentat considerablement. En conseqüència, s'han potencialitzat diversos problemes urbans, com ara la congestió del trànsit i la contaminació. Es poden formular diversos problemes relacionats com a problema d'optimització combinatòria (COP). Com que la majoria són NP-Hard, la recerca de solucions òptimes mitjançant mètodes de solució exactes sovint no és pràctica en un temps raonable. En entorns realistes, la creixent necessitat de prendre decisions "instantànies" refuta encara més el seu ús a la vida real. En aquestes circumstàncies, aquesta tesi té com a objectiu: (i) identificar COP realistes de diferents indústries; (ii) desenvolupar diferents classes d'aproximacions aproximades a la solució per resoldre els problemes identificats de T&L; (iii) la realització d'una sèrie d'experiments computacionals per validar i mesurar el rendiment dels enfocaments desenvolupats. S'introdueix el nou concepte d'optimització àgil, que fa referència a la combinació d'heurístiques esbiaixades i aleatòries amb informàtica paral·lela per fer front a la presa de decisions en temps real.Tecnologies de la informació i de xarxe

Multi-Agent Systems

A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. Agent systems are open and extensible systems that allow for the deployment of autonomous and proactive software components. Multi-agent systems have been brought up and used in several application domains

Valoriser le patrimoine culturel pyrénéen à l’aide d’une plateforme et d’une application mobile

Le projet TCVPYR est un projet européen FEDER dont le but est de promouvoir le tourisme dans la région française des Pyrénées en exploitant son patrimoine culturel. Il implique des chercheurs de différents domaines : géographes, historiens, anthropologues et informaticiens. Cet article présente deux approches pour tirer parti des points d’intérêts (POI) liés au patrimoine culturel, toutes deux intégrant des concepts du Web de données. La première s’intéresse à la publication automatique des données dans des plateformes open data connues comme Wikipédia. La seconde concerne une application mobile open source dédiée à des itinéraires touristiques. La première approche propose un processus automatique complet permettant de publier n’importe quel jeu de données sur Wikipédia. Grâce à une preuve de concepts (POC), nous avons validé ce processus sur un jeu de données contenant des données géoréférencées du patrimoine culturel, collectées par les chercheurs du projet TCVPYR dans différentes régions des Pyrénées. Ces mêmes données sont également mises à disposition du grand public dans la seconde approche originale de valorisation : une application mobile open source dédiée à la valorisation du patrimoine pyrénéen via la génération personnalisée d’itinéraires touristiques.TCVPYR is a European FEDER project which aims to promote tourism in the French Pyrenees region by leveraging its cultural heritage. It involves scientists from various domains: geographers, historians, anthropologists, and computer scientists. This paper presents two approaches to exploit cultural heritage points of interest (POI), both using Web of data concepts. One consists in publishing these data into the database of well-known open data platforms such as Wikipedia. The other one consists in an open source mobile application dedicated to touristic itineraries. The first approach involves a fully automated process to publish any dataset on Wikipedia. Thanks to a proof of concept (POC), we validate this process on a sample of geo-referenced cultural heritage data collected by TCVPYR researchers in different regions of the Pyrenees. These same data are also highlighted in the second approach via a mobile application recommending personalised touristic itineraries

Genetic Algorithm for Solving the Integrated Production-Distribution-Direct Transportation Planning

This paper proposes a model of integrated production, distribution and transportation planning for 4-echelon supply chain system that consists of a manufacturer using a continuous production process, a distribution center, distributors and retailers. By means of time-dependent demand at all retailers and direct transportation from one echelon to its successive echelons, the purpose of this paper is to determine production/replenishment and transportation policies at manufacturer, distribution center, distributors and retailers in order to minimize annually total system cost. Due to the proposed model is classified as a mixed integer non-linear programming so it is almost impossible to solve the model using the exact optimization methods and a lot of time is needed when the enumeration methods is applied to solve only a small scale problem. In this paper, we apply the genetic algorithm for solving the model. Using integer encoding for constructing the chromosome, the best solution is going to be searched. Compared with enumeration method, the difference of the result is only 0.0594% with the consumption time is only 0.5609% time that enumeration methods need

IFIP TC 13 Seminar: trends in HCI proceedings, March 26, 2007, Salamanca (Spain)

Actas del 13o. Seminario de la International Federation for Information Processing (IFIP), celebrado en Salamanca el 26 de marzo de 2007, sobre las nuevas líneas de investigación en la interacción hombre-máquina, gestión del conocimiento y enseñanza por la Web

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

CORPORATE SOCIAL RESPONSIBILITY IN ROMANIA

The purpose of this paper is to identify the main opportunities and limitations of corporate social responsibility (CSR). The survey was defined with the aim to involve the highest possible number of relevant CSR topics and give the issue a more wholesome perspective. It provides a basis for further comprehension and deeper analyses of specific CSR areas. The conditions determining the success of CSR in Romania have been defined in the paper on the basis of the previously cumulative knowledge as well as the results of various researches. This paper provides knowledge which may be useful in the programs promoting CSR.Corporate social responsibility, Supportive policies, Romania

A Review of Resonant Converter Control Techniques and The Performances

paper first discusses each control technique and then gives experimental results and/or performance to highlights their merits. The resonant converter used as a case study is not specified to just single topology instead it used few topologies such as series-parallel resonant converter (SPRC), LCC resonant converter and parallel resonant converter (PRC). On the other hand, the control techniques presented in this paper are self-sustained phase shift modulation (SSPSM) control, self-oscillating power factor control, magnetic control and the H-∞ robust control technique