Search results for "1103"
showing 10 items of 538 documents
Dynamic Design Intents Capture with Formal Ontology and Perdurants Object Concept for Collaborative Product Design
2016
Loss of design intents and related information throughout the lifecycle of products are common. Capturing design intents of an assembly, which include a temporal (dynamic) stages, is even harder. This research work aims to enhance the spatiotemporal mereotopology (STM) based ontology in tune with the contemporary efforts in this research domain. The main idea with such STM ontology is to capture dynamic design intents and develop an integrated data translation framework from Computer Aided Design (CAD) system to a visualization system. This integration framework is intended to enhance design sharing in a collaborative environment. In this paper, the framework is demonstrated with a simple m…
Big Data in operations and supply chain management: a systematic literature review and future research agenda
2021
In the era of digitalisation, the role of Big Data is proliferating, receiving considerable attention in all sectors and domains. The domain of operations and supply chain management (OSCM) is no different since it offers multiple opportunities to generate a large magnitude of data in real-time. Such extensive opportunities for data generation have attracted academics and practitioners alike who are eager to tap different elements of Big Data application in OSCM. Despite the richness of prior studies, there is limited research that extensively reviews the extant findings to present an overview of the different facets of this area. The current study addresses this gap by conducting a systema…
Large multiple neighborhood search for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem (SoftCluVRP) is a variant of the classical capacitated vehicle-routing problem. Customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. In this paper, we present a large multiple neighborhood search for the SoftCluVRP. We design and analyze multiple cluster destroy and repair operators as well as two post-optimization components, which are both based on variable neighborhood descent. The first allows inter-route exchanges of complete clusters, while the second searches for intra-route improvements by combining classical neighborhoods (2-opt, Or-opt, double-bridge) and the Balas-Simo…
Consistent Clustering of Elements in Large Pairwise Comparison Matrices
2018
[EN] In multi-attribute decision making the number of decision elements under consideration may be huge, especially for complex, real-world problems. Typically these elements are clustered and then the clusters organized hierarchically to reduce the number of elements to be simultaneously handled. These decomposition methodologies are intended to bring the problem within the cognitive ability of decision makers. However, such methodologies have disadvantages, and it may happen that such a priori clustering is not clear, and/or the problem has previously been addressed without any grouping action. This is the situation for the case study we address, in which a panel of experts gives opinions…
A simulated annealing-based approach for the joint optimization of production/inventory and preventive maintenance policies
2017
Even if more reliable than the past, the performance of modern manufacturing systems is still affected by machine’s deteriorations and breakdowns. As a consequence, adequate maintenance programs must be implemented to adequately satisfy demands during manufacturing stops due to unexpected failures or preventive maintenance (PM) actions. Despite production and maintenance are closely related issues, their joint optimization has become an important research topic just during the last decade. Therefore, the present paper proposes a model for the combined optimization of production/inventory control and PM policies with the aim of minimizing the total expected cost per unit time. The model is f…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
Mathematical models for a cutting problem in the glass manufacturing industry
2021
Abstract The glass cutting problem proposed for the ROADEF 2018 challenge is a two-dimensional, three-stage guillotine cutting process, with an additional cut to obtain pieces in some specific situations. However, it is not a standard problem because it includes specific constraints. The sheets produced in the glass manufacturing process have defects that make them different and have to be used in order. The pieces to be cut are grouped into subsets and the pieces from each subset must be cut in order. We approach the problem by developing and solving integer linear models. We start with the basic model, which includes the essential features of the problem, as a classical three-stage cuttin…
Sampled Fictitious Play on Networks
2019
We formulate and solve the problem of optimizing the structure of an information propagation network between multiple agents. In a given space of interests (e.g., information on certain targets), each agent is defined by a vector of their desirable information, called filter, and a vector of available information, called source. The agents seek to build a directed network that maximizes the value of the desirable source-information that reaches each agent having been filtered en route, less the expense that each agent incurs in filtering any information of no interest to them. We frame this optimization problem as a game of common interest, where the Nash equilibria can be attained as limit…
A strategic oscillation simheuristic for the Time Capacitated Arc Routing Problem with stochastic demands
2021
Abstract The Time Capacitated Arc Routing Problem (TCARP) extends the classical Capacitated Arc Routing Problem by considering time-based capacities instead of traditional loading capacities. In the TCARP, the costs associated with traversing and servicing arcs, as well as the vehicle’s capacity, are measured in time units. The increasing use of electric vehicles and unmanned aerial vehicles, which use batteries of limited duration, illustrates the importance of time-capacitated routing problems. In this paper, we consider the TCARP with stochastic demands, i.e.: the actual demands on each edge are random variables which specific values are only revealed once the vehicle traverses the arc. …
Meta-heuristic Algorithms for Nesting Problem of Rectangular Pieces
2017
Abstract Nesting problems consist of placing multiple items onto larger shapes finding a good arrangement. The goal of the nesting process is to minimize the waste of material. It is common to assume, as in the present work, that the stock sheet has fixed width and infinite height, since in the real world a company may have to cut pieces from a roll of material. The complexity of such problems is often faced with a two-stage approach, so-called “hybrid algorithm”, combining a placement routine and a meta-heuristic algorithm. Starting from a given positioning sequence, the placement routine generates a non-overlapping configuration. The encoded solution is manipulated and modified by the met…