Search results

While significant efforts have been made to study auction and logistics theories in the context of perishable supply chain trading (PSCT) over the last few years, the consensus has not yet been reached on how best to examine the impact of physical-internet-enabled auction logistics (AL) decisions and processes on dynamic perishable products transactions. The purpose of this paper is to address this gap by investigating the existing situations and identifying future opportunities for both academic and industrial communities.

The relevant literature was sort out along with three dimensions, namely auction mechanism, level of decision and coordination. The methods of field investigation and focus group discussion were also used to explore the factors influencing AL performance.

A number of key findings presented. First, there is an emerging paradigm shift from offline auction to online auction. Robust and resilient AL are needed to fulfill the massive number of orders from different channels while considering dynamic decisions. Second, three-level decisions in AL have been explicitly classified and defined. Various mathematical techniques used in literature vis-à-vis the contexts of AL were mapped. Third, a coordination mechanism that dynamically balances trade-off between logistics efficiency and transaction price was discussed. Lastly, several opportunities for future research were distinguished with coherent connection of research domains and open questions.

This paper not only summaries key themes of current research dimensions, but also indicates existing deficiencies and potential research directions. The findings can be used as the basis for future research in PSCT and related topics.

Today's logistics industry is facing severe challenges since global transportation demand increases substantially. Carriers are urged to reduce empty loads and CO2 emissions through collaboration. Therefore, the concept of Physical Internet (PI) came into being. However, PI is still in its infancy. It is difficult to understand its sophisticated coordination mechanism, which makes learning of the concept more complicated.

Gamification is an effective approach to help students improve their learning curve. At the same time, the psychological and behavioral changes in learning will also pose an impact on learning efficiency. This paper introduces a PI transportation game and designs a set of gamification teaching experiments. In the experiment, a control group and three experimental groups are set up, and the experiment was designed to respond to a plethora of research questions using the methods of T-test, correlation analysis and regression analysis. Experimental results were analyzed through the method of multivariate statistics.

This paper looks for superior pedagogical methods and procedures for students to learn PI while providing suggestions for PI's learning among undergraduates. The authors found (1) gamification teaching will make participants feel more satisfied and master more knowledge points; (2) the scores of logistics testing have been significantly improved after gamification teaching and (3) flow experience has a significant impact on game revenue.

This is the first study about the impact of gamification on teaching and learning PI. The authors apply the methods of T-test, correlation analysis and regression analysis to analyze the collected data. The paper proves that gamification can help students learn PI and that flow experience can improve the efficiency of students learning PI.

Tacit knowledge in frontline operations is primarily reflected in the holders’ intuition about dynamic systems. Despite the implicit nature of tacit knowledge, the understanding of complex systems it encapsulates can be displayed through formalization methods. This study seeks to develop a methodology for formalizing tacit knowledge in a dynamic delivery system.

This study employs a structured survey to gather experiential knowledge from dispatchers engaged in last-mile delivery operations. This knowledge is then formalized using a value function approximation approach, which transforms tacit insights into structured inputs for dynamic decision-making. We apply this methodology to optimize delivery operations in an online-to-offline pharmacy context.

The raw system feature data are not strongly correlated with the system’s development trends, making them ineffective for guiding dynamic decision-making. However, the system features obtained through preprocessing the raw data increase the predictiveness of dynamic decisions and improve the overall effectiveness of decision-making in delivery operations.

This research provides a foundational framework for studying sequential dynamic decision problems, highlighting the potential for improved decision quality and system optimization through the formalization and integration of tacit knowledge.

This approach proposed in this study offers a method to preserve and formalize critical operational expertise. By embedding tacit knowledge into decision-making systems, organizations can enhance real-time responsiveness and reduce operational costs.

This study presents a novel approach to integrating tacit knowledge into dynamic decision-making frameworks, demonstrated in a real-world last-mile delivery context. Unlike previous research that focuses primarily on explicit data-driven methods, our approach leverages the implicit, experience-based insights of operational staff, leading to more informed and effective decision-making strategies.

Cycle time reduction is important for order fulling process but often subject to resource constraints. This study considers an unrelated parallel machine environment where orders with random demands arrive dynamically. Processing speeds are controlled by resource allocation and subject to diminishing marginal returns. The objective is to minimize long-run expected order cycle time via order schedule and resource allocation decisions.

A stochastic optimization algorithm named CAP is proposed based on particle swarm optimization framework. It takes advantage of derived bound information to improve local search efficiency. Parameter impacts including demand variance, product type number, machine speed and resource coefficient are also analyzed through theoretic studies. The algorithm is evaluated and benchmarked with four well-known algorithms via extensive numerical experiments.

First, cycle time can be significantly improved when demand randomness is reduced via better forecasting. Second, achieving processing balance should be of top priority when considering resource allocation. Third, given marginal returns on resource consumption, it is advisable to allocate more resources to resource-sensitive machines.

A novel PSO-based optimization algorithm is proposed to jointly optimize order schedule and resource allocation decisions in a dynamic environment with random demands and stochastic arrivals. A general quadratic resource consumption function is adopted to better capture diminishing marginal returns.