Locating switches (2019). Expert Systems With Applications, 136, 338–352.

Mercedes Landete (University Miguel Hernández of Elche), Alfredo Marín (University of Murcia) and José Luis Sainz-Pardo (University Miguel Hernández of Elche).

Abstract. In this paper, a novel problem in transshipment networks has been proposed. The main aims of this pa- per are to introduce the problem and to give useful tools for solving it both in exact and approximate ways. In a transshipment network it is important to decide which are the best paths between each pair of nodes. Representing the network by a graph, the union of thesepaths is a delivery subgraph of the original graph which has all the nodes and some edges. Nodes in this subgraph which are adjacent to more than two nodes are called switches because when sending the flow between any pair of nodes, switches on the path must adequately direct it. Switches are facilities which direct flows among users. The installation of a switch involves the installation of adequate equipment and thus an allocation cost. Furthermore, traversing a switch also implies a service cost or allocation cost. The Switch Location Prob- lem is defined as the problem of determining which is the delivery subgraph with the total lowest cost. Two of the three solutions approaches that we propose are decomposition algorithms based on articula- tion vertices, the exact and the math-heuristic ones. These two approaches could be embedded in expert systems for locating switches in transshipment networks. The results should help a decision maker to select the adequate approach depending on the shape and size of the network and also on the exter- nal time-limit. Our results show that the exact approach is a valuable tool if the network has less than 1000 nodes. Two upsides of our heuristics are that they do not require special networks and give good solutions, gap-wise. The impact of this paper is twofold: it highlights the difficulty of adequately locating switches and it emphasizes the benefit of decomposing algorithms.

Keywords. Discrete location; Math-heuristic; Articulation vertex; Block-Cutpoint graph

El CIO participará en las Jornadas de Innovación en Calzado

El CIO participará en las Jornadas de Innovación en Calzado

Programa

El CIO, uno de los catorce institutos universitarios de investigación en matemáticas de España, estará presente en las Jornadas de Innovación en Calzado “Estrategias de Marketing y Comercialización para el Sector del Calzado” que se celebrarán el 26 de septiembre, de 9:00 a 13:15 horas, en la Cámara de Comercio de Elche (Parque Industrial). 

En estas jornadas, se pretende reflexionar sobre el futuro del retail del sector calzado, introduciendo la importancia de incorporar las nuevas estrategias de marketing y comercialización para el sector del calzado.  El investigador del CIO y profesor de la Universidad Miguel Hernández de Elche Alex Rabasa intervendrá de 11:30 a 11:45 horas con la ponencia “Exprimiendo los datos desde el sector del calzado”.

Esta actividad es de carácter gratuito y ha sido organizada por el Cluster Calzado Innovación (CCI), con la colaboración de INESCOP y FICE.

Más información en: https://www.inescop.es/es/actualidad/jornada-marketing-y-comercializacion

Programmer eXperience: A Systematic Literature Review (2019). IEEE Access, 7, 71079-71094.

Jenny Morales (Autonomous University of Chile), Cristian Rusu (Pontifical Catholic University of Chile), Federico Botella (Miguel Hernández University of Elche) and Daniela Quiñones (Pontifical Catholic University of Chile).

Abstract. Programmers use various software development artifacts in their work, such as programming environments, design documents, and programming codes. These software artifacts can be studied and improved based on usability and User eXperience (UX) factors. In this paper, we consider programmers to be a specific case of users and analyze different elements that influence their experience in this specific context. We conducted a systematic literature review of papers published over the last ten years related to 1) the definition of the Programmer eXperience (PX); 2) the PX, UX, and usability factors regarding the programming environments, design documents, and programming codes; and 3) sets of heuristics to evaluate the software development artifacts mentioned before. We analyzed 73 articles, and the results obtained show that: 1) the important elements that influence the PX are the motivation of programmers and the choice of tools they use in their work, such as programming environments; 2) most of the identified studies (59%) aimed to evaluate the influence of the PX, UX, and usability on programming environments; 3) the majority of the studies (70%) used methods such as usability tests and/or heuristic evaluation methods; and 4) four sets of heuristics are used to evaluate software development artifacts in relation to programming environments, programming languages, and application programming interfaces. The results suggest that further research in this area is necessary to better understand and evaluate the concept of the PX.

Keywords. Heuristic evaluation; Programmer eXperience; Systematic literature review; User eXperience; Usability

Performance evaluation through DEA benchmarking adjusted to goals (2019). Omega, 87, 150-157.

José L. Ruiz (Miguel Hernández University of Elche) and Inmaculada Sirvent (Miguel Hernández University of Elche).

Abstract. Data Envelopment Analysis (DEA) is extended to the evaluation of performance of organizations within the framework of the implementation of plans for improvements that set management goals. Managers usually set goals without having any evidence that they will be achievable at the moment of conduct- ing performance evaluation or, on the contrary, they may set little too unambitious goals. Using DEA for the benchmarking ensures an evaluation in terms of targets that both are attainable and represent best practices. In addition, the approach we propose adjusts the DEA benchmarking to the goals in order to consider the policy of improvements that was pursued with the setting of such goals. From the method- ological point of view, the models that minimize the distance to the DEA strong efficient frontier are extended to incorporate goal information. Specifically, the models developed seek DEA targets that are as close as possible to both actual performances and management goals. To illustrate, we examine an example that is concerned with the evaluation of performance of public Spanish universities.

Keywords. Performance evaluation; Benchmarking; Goals; DEA; Target setting

Seminario de Sebastián Lozano

10 octubre, 2019
12:30 pma1:30 pm

Speaker: Sebastián Lozano (Universidad de Sevilla)

Title: “Análisis DEA de procesos en red (Network DEA): Modelos y aplicaciones”

Date: jueves 10 de octubre, 12:30 horas.

Localication: Sala de Seminarios del CIO (Edificio Torretamarit)

Abstract. El análisis por envoltura de datos (DEA) convencional considera el proceso productivo como una caja negra, esto es, como un proceso único que realiza la transformación de las entradas en salidas. Existen, sin embargo, enfoques DEA que abren esa caja y distinguen dentro de la misma diferentes subprocesos, cada uno con sus propias entradas y salidas, y normalmente con flujos de productos intermedios entre los subprocesos. Una característica fundamental, pues, de este tipo de enfoques Network DEA (NDEA) es que cada subproceso tiene su propia tecnología. Se pueden formular modelos DEA, tanto de tipo multiplicador como envolvente, para este tipo de situaciones. Hay variantes en cuanto a la notación que se usa así como al tratamiento de los productos intermedios. Existen enfoques radiales, directional distance function (DDF), Network SBM, etc. También se pueden considerar inputs compartidos y salidas indeseables. Por lo que respecta a las aplicaciones, éstas son numerosas y abarcan desde el sector transporte al sector bancario, sector hotelero, deportes, etc.