1,720,956 research outputs found
Optimising transportation plans for multi-warehouse, multi-product systems: mitigating the impact of new purchase and sales orders
No full textIn the rapidly evolving landscape of supply chain management, the agility to adapt to changing demands while maintaining operational efficiency is paramount. This paper introduces a novel approach to managing transportation plans within a multi-warehouse, multi-product framework, focussing on minimising disruptions to existing schedules in response to new purchase and sales orders. Our research aims to redefine existing transportation plans, originally set before the arrival of additional orders, with the objective of implementing the least possible alterations while satisfying all customer requirements. The primary challenge addressed in this study is to maintain stock levels above a predefined minimum threshold in various warehouses without compromising the efficiency of the distribution network. Unlike traditional routing problems, the focus is not on selecting the routes for transportation, but on strategically deciding when to initiate a vehicle trip or adjusting the number of products in already scheduled trips. To address the problem, a mixed-integer linear programming model based on a flow network graph is proposed. To reduce the size of the network, exact and heuristic pre-processing procedures are developed. A first set of computational tests was conducted on data provided by a textile industry that needs to minimise changes in the transport plan to meet the variation in demand for different goods. A detailed analysis of the results of instances with up to 14,000 products and 23 million items is reported. Further computational tests were randomly generated to verify the efficiency of the proposed techniques in different scenarios. The promising results of the computational tests highlight the applicability of the proposed approach in the industrial scenario analysed
Integrating Human-Centric AI in Fashion Industry Optimization: A Step Towards Industry 5.0
No full textThis work explores the intersection of advanced manufacturing and the emerging human-centric Industry 5.0 paradigm, specifically within the high-fashion clothing industry. We address the critical issue of optimising cutting operations, a traditionally time-intensive and wasteful process, by minimising setup times and reducing fabric waste. The cutting process primarily consists of laying multiple layers of fabric on a cutting machine and securing templates (stencils) of the parts on top of these layers before the actual cutting can start. We introduce a novel solution that blends the technological advances of Industry 4.0, particularly the integration of mathematical models and the enterprise information system, with the worker-focused ethos of Industry 5.0. The core innovation lies in our use of Large Language Models to translate operators’ feedback, expressed in natural language, into quantifiable objectives for linear programming optimisation algorithms. The experimental analysis, conducted on a real-world industrial dataset, validates the effectiveness of the proposed solution, underscoring its potential to enhance industrial operations by harmoniously blending advanced technology with human well-being
The Trigger Arc TSP: Optimise the Picking Process in Warehouses with Compactable Storage Systems
No full textThis work introduces the Trigger Arc Travelling Salesman Problem (TATSP), a variant of the classical TSP that models dynamic arc costs influenced by the solution’s path. It is presented a real-world application that can be modelled through the TATSP, aiming to optimise operations in warehouses with compactable storage systems. An Integer Linear Programming model (ILP) is described and implemented. Finally, the experimental results obtained from a set of generated instances are discussed
A Branch & Bound Algorithm for the Rainbow Spanning Forest Problem
No full textIn this paper, we present a Branch & Bound algorithm for solving an NP-hard combinatorial optimisation problem denoted as Rainbow Spanning Forest Problem (RSFP). The RSFP consists of finding a spanning forest of an undirected, edge-coloured graph G with the minimum number of rainbow components, where a rainbow component of G is a subgraph of G that has all the edges with different colours. The proposed method is capable of determining the optimal solution within 0.4 s for small instances, thus proving to be computationally competitive with respect to the methods used by the most recent optimisation libraries and commercial SW environments available
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
