Yongchang Wei

Prof. Yongchang Wei

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 November 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
CCChongyang Chen
Chongyang Chen
SZSong Zhu
Song Zhu
YWYongchang Wei
Yongchang Wei
CYChunyu Yang
Chunyu Yang
This paper studies one type of delayed memristor-based fractional-order neural networks (MFNNs) on the finite-time stability problem. By using the method of iteration, contracting mapping principle, the theory of differential inclusion, and set-valued mapping, a new criterion for the existence and uniqueness of the equilibrium point which is stable in finite time of considered MFNNs is established when the order α satisfies 0<α<1. Then, when 1<α<2, on the basis of generalized Gronwall inequality and Laplace transform, a sufficient condition ensuring the considered MFNNs stable in finite time is given. Ultimately, simulation examples are proposed to demonstrate the validity of the results.

6 February 2017 in Flexible Services and Manufacturing Journal
Verified
Journal Article
Closed access
PDF file
FCFangyu Chen
Fangyu Chen
YWYongchang Wei
Yongchang Wei
HWHongwei Wang
Hongwei Wang

25 May 2018 in International Journal of Production Research
Verified
Journal Article
Closed access
FCFangyu Chen
Fangyu Chen
Gangyan XuGangyan Xu
Gangyan Xu
YWYongchang Wei
Yongchang Wei
This paper focuses on multiple-block warehouses with ultra-narrow aisles and access restriction. These new features observed from one of the largest online retailers in China allow order pickers enter pick aisles from specific entrances but prohibit them from traversing the aisles. This impedes the application of traditional heuristic order picking methods. To address the order picking problem in such warehouses, we propose six heuristic routing methods by extending the basic Return, Largest Gap and Mid-point methods for the single-block warehouse. These six heuristic methods are named RNA, LNA, MNA, RNAP, LNAP and MNAP, respectively. The major improvements are achieved through setting rules with respect to determining the access mode of aisles as well as changing working aisles. Using real order information, a comprehensive simulation for comparison is conducted to evaluate the effectiveness of our improved routing methods under 12 warehouse layouts. The simulation results demonstrate that LNAP achieves the shortest average picking routes in most scenarios. The impacts of warehouse layout on performance measurements are analysed as well. It is ascertained that setting more cross aisles and connect aisles helps mitigate the negative impacts.

1 September 2019 in Neural Networks
Verified
Journal Article
Closed access
CCChongyang Chen
Chongyang Chen
SZSong Zhu
Song Zhu
YWYongchang Wei
Yongchang Wei

1 January 2019 in Complexity
Verified
Journal Article
Open access
PDF file
FCFangyu Chen
Fangyu Chen
GXGangyan Xu
Gangyan Xu
YWYongchang Wei
Yongchang Wei
A problem‐specific routing algorithm integrating ant colony optimization (ACO) and integer‐coded genetic algorithm (GA) is developed to address the newly observed limitations imposed by ultranarrow aisles and access restriction, which exist in the largest e‐commerce enterprise with self‐run logistics in China. Those limitations prohibit pickers from walking through the whole aisle, and the access restriction even allows them to access the pick aisles only from specific entrances. The ant colony optimization is mainly responsible for generating the initial chromosomes for the genetic algorithm, which then searches the near‐optimal solutions of picker‐routing with our novel chromosome design by recording the detailed information of access modes and subaisles. To demonstrate the merits of the proposed algorithm, a comprehensive simulation for comparison is conducted with 12 warehouse layouts with real order information. The simulation results show that the proposed hybrid algorithm is superior to dedicated heuristics in terms of solution quality. The impacts of the parameters with respect to warehouse layout on the picking efficiency are analyzed as well. Setting more connect aisles and cross aisles is suggested to effectively optimize the picking‐service efficiency in the presence of access limitations.

1 January 2018 in Complexity
Verified
Journal Article
Open access
YWYongchang Wei
Yongchang Wei
FCFangyu Chen
Fangyu Chen
FXFeng Xiong
Feng Xiong
The horizontal interaction between retailers, coupled with replenishment rules and time delays, makes the dynamics in supply chain systems highly complicated. This paper aims to explore the impacts of lateral transshipments on the stability, bullwhip effect, and other performance measurements in the context of a two‐tiered supply chain system composed of one supplier and two retailers. In particular, we developed a unified discrete‐time state space model to address two different scenarios of placing orders. Analytical stability results are derived, through which we found that inappropriate lateral transshipment policies readily destabilize the supply chain system. Moreover, the lead time of lateral transshipments further complicates the stability problem. Theoretical results are validated through simulation experiments and the influences of system parameters on performance measures are investigated numerically. Numerical simulations show that lateral transshipments help improve the customer service level for both retailers. It is also interesting to observe that the demand of the two retailers can be satisfied even if only one retailer places orders from the upstream supplier.