Jianguang Feng

Jianguang Feng

Auto-generated profile, based on publicly available information

Jianguang Feng

School of Management, Northwestern Polytechnical University, Xi’an 710072, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
25 October 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ACAda Che
Ada Che
WWWenjia Wang
Wenjia Wang
XMXiaohu Mu
Xiaohu Mu
YZYipei Zhang
Yipei Zhang
JFJianguang Feng
Jianguang Feng
The petrol station replenishment problem (PSRP) refers to the process of transporting petroleum products from oil depots to petrol stations via tank trucks. It mainly consists of two parts: allocating petroleum products to tank trucks and planning the travel route of each truck. In this study, we examine a new variant of PSRP by considering a multi-depot vehicle routing problem with open inter-depot routes (MDVRPOI). Each depot can act as an intermediate replenishment facility, and each truck can be reloaded at any depot any number of times within the working period. Moreover, trucks can end their routes at any depot instead of making a long empty drive to the start depot. The trucks are heterogeneous with multiple load-specific compartments. We formulate the problem as a mixed-integer linear programming (MILP) model. Given the problem’s complexity, a tabu-based adaptive large neighborhood search (T-ALNS) algorithm is proposed, which integrates the tabu search approach into ALNS to solve the problem effectively. The T-ALNS executes multiple problem-tailored destroy/repair operators on the station, trip, and route levels. A local search procedure with problem-specific operators and an adaptive strategy is further embedded into T-ALNS. We use the real data of an oil company in China to evaluate our algorithm. Computational results show that our T-ALNS significantly outperforms the CPLEX solver and other algorithms in terms of solution quality and computation time. Further, it realizes an average reduction in transportation cost of about 45% compared to the company’s actual strategy.

2 August 2024 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YWYang Wang
Yang Wang
JWJunpeng Wang
Junpeng Wang
JHJin-Kao Hao
Jin-Kao Hao
JFJianguang Feng
Jianguang Feng
We study a sensor–weapon–target assignment (S-WTA) problem that considers the desired probability of target destruction and aims to minimize the total cost of combat resources. Lower and upper bounds for the S-WTA problem are obtained by constructing linear approximation models. We also propose an adaptive large neighborhood search (ALNS) algorithm characterized by a model-driven repair phase to solve this problem. The destruction phase adaptively selects a destruction operator to remove partial resource assignments and produces an incomplete reference solution. For the destroyed solution, the repair phase generates a reduced subproblem that optimizes only the destroyed parts while keeping the other parts fixed. Each subproblem is formulated as a mixed integer programming model and solved by a general-purpose solver to repair the destroyed solution. Computational experiments show that the approximation formulations can obtain tight lower and upper bounds for most problem instances. Moreover, our proposed ALNS algorithm is competitive with the solver for small instances and effectively solves large instances. In addition, we experimentally demonstrate that our ALNS outperforms state-of-the-art algorithms in the literature, and the proposed model-driven solution repair phase outperforms the traditional heuristic repair operators.

5 February 2024 in European Journal of Operational Research
Verified
Journal Article
Open access
JFJianguang Feng
Jianguang Feng
ACAda Che
Ada Che
CCChengbin Chu
Chengbin Chu
ELEugene Levner
Eugene Levner
VKVladimir Kats
Vladimir Kats

7 March 2025 in European Journal of Operational Research
Verified
Journal Article
Closed access
ZDZixiong Dong
Zixiong Dong
ACAda Che
Ada Che
JFJianguang Feng
Jianguang Feng

18 November 2024 in OR Spectrum
Verified
Journal Article
Closed access
PDF file
YWYang Wang
Yang Wang
WHWenjie Hu
Wenjie Hu
JHJin-Kao Hao
Jin-Kao Hao
JFJianguang Feng
Jianguang Feng

1 January 2023 in Journal of Industrial and Management Optimization
Verified
Journal Article
Closed access
PDF file
ACAda Che
Ada Che
SZSihan Zhang
Sihan Zhang
YZYipei Zhang
Yipei Zhang
JFJianguang Feng
Jianguang Feng
This article studies the speed-scaling robotic cell scheduling problem with constrained peak power consumption. The objective is to minimize cycle time and peak power consumption simultaneously. First, we formulate a bi-objective mixed integer programming model for the problem and propose a strategy to preprocess overlapping time windows. Then, we analyze the structural properties of the proposed model and develop an iterative $ \varepsilon $-constraint method to generate its complete Pareto front. Numerical experiments demonstrate that the proposed method effectively solves the robotic cell scheduling problem and that appropriate scheduling of speed-scaling machines can make a trade-off between productivity and power consumption.