YLYiqing Lin

Yiqing Lin

*This is an algorithmically generated author record based on publicly available information.

Yiqing Lin has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A multi-objective supplier selection framework based on user-preferences

    by Federico Toffano, Michele Garraffa, Yiqing Lin, Steven Prestwich, Helmut Simonis, Nic Wilson

    This paper introduces an interactive framework to guide decision-makers in a multi-criteria supplier selection process. State-of-the-art multi-criteria methods for supplier selection elicit the decision-maker’s preferences among the criteria by processing pre-collected data from different stakeholders. We propose a different approach where the preferences are elicited through an active learning loop. At each step, the framework optimally solves a combinatorial problem multiple times with different weights assigned to the objectives. Afterwards, a pair of solutions among those computed is selected using a particular query selection strategy, and the decision-maker expresses a preference between them. These two steps are repeated until a specific stopping criterion is satisfied. We also introduce two novel fast query selection strategies, and we compare them with a myopically optimal query selection strategy. Computational experiments on a large set of randomly generated instances are used to examine the performance of our query selection strategies, showing a better computation time and similar performance in terms of the number of queries taken to achieve convergence. Our experimental results also show the usability of the framework for real-world problems with respect to the execution time and the number of loops needed to achieve convergence.


  • Open Access

    Efficient Propagation of Uncertainties in Manufacturing Supply Chains: Time Buckets, L-leap and Multilevel Monte Carlo

    by Nai-Yuan Chiang, Yinqing Lin, Quan Long

    Uncertainty propagation of large scale discrete supply chains can be prohibitive when a large number of events occur during the simulated period and discrete event simulations (DES) are costly. We present a time bucket method to approximate and accelerate the DES of supply chains. Its stochastic version, which we call the L(logistic)-leap method, can be viewed as an extension of the leap methods, e.g., tau-leap, D-leap, developed in the chemical engineering community for the acceleration of stochastic DES of chemical reactions. The L-leap method instantaneously updates the system state vector at discrete time points and the production rates and policies of a supply chain are assumed to be stationary during each time bucket. We propose to use Multilevel Monte Carlo (MLMC) to efficiently propagate the uncertainties in a supply chain network, where the levels are naturally defined by the sizes of the time buckets of the simulations. We demonstrate the efficiency and accuracy of our methods using four numerical examples derived from a real world manufacturing material flow. In these examples, our multilevel L-leap approach can be faster than the standard Monte Carlo (MC) method by one or two orders of magnitudes without compromising the accuracy.

  • Agent-Based Simulation of Evacuation: An Office Building Case Study

    by Yiqing Lin, Igor Fedchenia, Bob LaBarre, Robert Tomastik