23 resultados para Customer Relation Management
em Consorci de Serveis Universitaris de Catalunya (CSUC), Spain
Resumo:
Peer-reviewed
Resumo:
Proyecto realizado para la empresa de reparación de aparatos eléctricos Domestic Appliance con el que se se pretende facilitar y mejorar el proceso de gestión de todas las reparaciones que se realizan mediante una aplicación web. A nivel de Pyme, se trata de un sistema básico de CRM (Customer Relationship Management) y de un gestor de incidencias con el que los empleados de la empresa Domestic Appliance podrán mantener un mejor seguimiento de todos los casos abiertos, ver estadísticas y obtener información de todos los clientes. El sistema se completa con la gestión de un correo interno dónde los usuarios se podrán enviar información confidencial entre ellos, actuando como un correo interno.
Resumo:
El proyecto está basado en la creación de una herramienta para poder gestionar las relaciones que el Centro Metalúrgico de Sabadell tiene con sus clientes. La tarea a desarrollar es un CRM (Custom Relationship Management) para gestionar todos los servicios y ofertas que ofrece el centro con sus clientes, desde cursos impartidos u organizados, consultas que tienen los empleados de los socios, asesoramientos, acciones de los clientes pero también información útil para conocer el estado de acciones comerciales con un cliente, contactos de un socio, así como sus empleados.
Resumo:
Customer Experience Management (CEM) se ha convertido en un factor clave para el éxito de las empresas. CEM gestiona todas las experiencias que un cliente tiene con un proveedor de servicios o productos. Es muy importante saber como se siente un cliente en cada contacto y entonces poder sugerir automáticamente la próxima tarea a realizar, simplificando tareas realizadas por personas. En este proyecto se desarrolla una solución para evaluar experiencias. Primero se crean servicios web que clasifican experiencias en estados emocionales dependiendo del nivel de satisfacción, interés, … Esto es realizado a través de minería de textos. Se procesa y clasifica información no estructurada (documentos de texto) que representan o describen las experiencias. Se utilizan métodos de aprendizaje supervisado. Esta parte es desarrollada con una arquitectura orientada a servicios (SOA) para asegurar el uso de estándares y que los servicios sean accesibles por cualquier aplicación. Estos servicios son desplegados en un servidor de aplicaciones. En la segunda parte se desarrolla dos aplicaciones basadas en casos reales. En esta fase Cloud computing es clave. Se utiliza una plataforma de desarrollo en línea para crear toda la aplicación incluyendo tablas, objetos, lógica de negocio e interfaces de usuario. Finalmente los servicios de clasificación son integrados a la plataforma asegurando que las experiencias son evaluadas y que las tareas de seguimiento son automáticamente creadas.
Resumo:
Crear una aplicació i-CRM, el Customer Relationship Management és un sistema que permet a les empreses manejar tota la informació relativa als seus clients des d'una única plataforma de programari. L'esmentada aplicació tindrà una interfície Web, i una estructura multicapa, que pugui ser emprada des de qualsevol localització i el nombre d'usuaris no sigui una limitació. Bàsicament, consistirà en una aplicació on es puguin crear entitats comercials (clients i potencials), i mantenir la relació bàsica amb els mateixos, aquesta es restringirà als contactes comercials, incidències i campanyes de màrqueting relacional.
Resumo:
El PFC tracte de la implementació d'un web de serveis informàtics basat en software de codi obert i per tal de emprendre-ho i tirar endavant com a negoci, s'ha dut a terme un estudi de les tecnologies i un pla d'empresa, mirant de treu-re la màxima rendibilitat al web.Els serveis escollits com a model de negoci són bàsicament quatre: el disseny web, el disseny de webs e-commerce o tendes virtuals, la implementació de gestors de recursos d'empresa coneguts com ERP (de l'anglès Enterprise Resources Planning), i la implementació de gestors de relacions amb els clients coneguts com CRM (de l'anglès Customer Relationship Management).El primer capítol es una introducció, el segon capítol tracta de el software lliure, que és, quins models de negoci aporta i els tipus de llicència existents, el tercer capítol es un pla d'empresa on es detalla els serveis que oferirem i com ho gestionarem, el quart capítol tracta de les tecnologies utilitzades i el per que, i finalment unes conclusions.La web, netsolucion.com, que s'ha dissenyat amb Wordpress, implica no tan sols el haver d'estudiar i d'aprendre aquesta plataforma sinó també totes les que s'ofereixen com a serveis, que son:Gestor de Bases de Dades MySQL i PHP per al disseny web, Prestashop per al disseny de tendes virtuals, OpenERP per a la implementació dels gestors de recursos de empresa (ERP's) i els gestors de relacions amb els clients (CRM's).
Resumo:
Peer-reviewed
Resumo:
I describe the customer valuations game, a simple intuitive game that can serve as a foundation for teaching revenue management. The game requires little or no preparation, props or software, takes around two hours (and hence can be finished in one session), and illustrates the formation of classical (airline and hotel) revenue management mechanisms such as advanced purchase discounts, booking limits and fixed multiple prices. I normally use the game as a base to introduce RM and to develop RM forecasting and optimization concepts off it. The game is particularly suited for non-technical audiences.
Resumo:
The objective of research was to analyse the potential of Normalized Difference Vegetation Index (NDVI) maps from satellite images, yield maps and grapevine fertility and load variables to delineate zones with different wine grape properties for selective harvesting. Two vineyard blocks located in NE Spain (Cabernet Sauvignon and Syrah) were analysed. The NDVI was computed from a Quickbird-2 multi-spectral image at veraison (July 2005). Yield data was acquired by means of a yield monitor during September 2005. Other variables, such as the number of buds, number of shoots, number of wine grape clusters and weight of 100 berries were sampled in a 10 rows × 5 vines pattern and used as input variables, in combination with the NDVI, to define the clusters as alternative to yield maps. Two days prior to the harvesting, grape samples were taken. The analysed variables were probable alcoholic degree, pH of the juice, total acidity, total phenolics, colour, anthocyanins and tannins. The input variables, alone or in combination, were clustered (2 and 3 Clusters) by using the ISODATA algorithm, and an analysis of variance and a multiple rang test were performed. The results show that the zones derived from the NDVI maps are more effective to differentiate grape maturity and quality variables than the zones derived from the yield maps. The inclusion of other grapevine fertility and load variables did not improve the results.
Resumo:
This paper explores two major issues, from biophysical and historical viewpoints. We examine land management, which we define as the long-term fertility maintenance of land in relation to agriculture, fishery and forestry. We also explore humans’ positive role as agents aiming to reinforce harmonious materials circulation within the land. Liebig’s view on nature, agriculture and land, emphasizes the maintenance of long-term land fertility based on his agronomical thought that the circulation of matter in agricultural fields must be maintained with manure as much as possible. The thoughts of several classical economists, on nature, agriculture and land are reassessed from Liebig’s view point. Then, the land management problem is discussed at a much more fundamental level, to understand the necessary conditions for life in relation to land management. This point is analyzed in terms of two mechanisms: entropy disposal on the earth, and material circulation against gravitational field. Finally from the historical example of the metropolis of Edo, it is shown that there is yet another necessary condition for the sustainable management of land based on the creation of harmonious material cycles among cities, farm land, forests and surrounding sea areas in which humans play a vital role as agent.
Resumo:
This article focuses on business risk management in the insurance industry. A methodology for estimating the profit loss caused by each customer in the portfolio due to policy cancellation is proposed. Using data from a European insurance company, customer behaviour over time is analyzed in order to estimate the probability of policy cancelation and the resulting potential profit loss due to cancellation. Customers may have up to two different lines of business contracts: motor insurance and other diverse insurance (such as, home contents, life or accident insurance). Implications for understanding customer cancellation behaviour as the core of business risk management are outlined.
Resumo:
Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.
Resumo:
Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.
Resumo:
The choice network revenue management model incorporates customer purchase behavioras a function of the offered products, and is the appropriate model for airline and hotel networkrevenue management, dynamic sales of bundles, and dynamic assortment optimization.The optimization problem is a stochastic dynamic program and is intractable. A certainty-equivalencerelaxation of the dynamic program, called the choice deterministic linear program(CDLP) is usually used to generate dyamic controls. Recently, a compact linear programmingformulation of this linear program was given for the multi-segment multinomial-logit (MNL)model of customer choice with non-overlapping consideration sets. Our objective is to obtaina tighter bound than this formulation while retaining the appealing properties of a compactlinear programming representation. To this end, it is natural to consider the affine relaxationof the dynamic program. We first show that the affine relaxation is NP-complete even for asingle-segment MNL model. Nevertheless, by analyzing the affine relaxation we derive a newcompact linear program that approximates the dynamic programming value function betterthan CDLP, provably between the CDLP value and the affine relaxation, and often comingclose to the latter in our numerical experiments. When the segment consideration sets overlap,we show that some strong equalities called product cuts developed for the CDLP remain validfor our new formulation. Finally we perform extensive numerical comparisons on the variousbounds to evaluate their performance.
Resumo:
Customer choice behavior, such as 'buy-up' and 'buy-down', is an importantphe-nomenon in a wide range of industries. Yet there are few models ormethodologies available to exploit this phenomenon within yield managementsystems. We make some progress on filling this void. Specifically, wedevelop a model of yield management in which the buyers' behavior ismodeled explicitly using a multi-nomial logit model of demand. Thecontrol problem is to decide which subset of fare classes to offer ateach point in time. The set of open fare classes then affects the purchaseprobabilities for each class. We formulate a dynamic program todetermine the optimal control policy and show that it reduces to a dynamicnested allocation policy. Thus, the optimal choice-based policy caneasily be implemented in reservation systems that use nested allocationcontrols. We also develop an estimation procedure for our model based onthe expectation-maximization (EM) method that jointly estimates arrivalrates and choice model parameters when no-purchase outcomes areunobservable. Numerical results show that this combined optimization-estimation approach may significantly improve revenue performancerelative to traditional leg-based models that do not account for choicebehavior.