Bin Ji

Dr. Bin Ji


Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 October 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
QLQizhang Luo
Qizhang Luo
GWGuohua Wu
Guohua Wu
Bin JiBin Ji
Bin Ji
LWLing Wang
Ling Wang
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
The collaboration of drones and trucks for last-mile delivery has attracted much attention. In this paper, we address a collaborative routing problem of the truck-drone system, in which a truck collaborates with multiple drones to perform parcel deliveries and each customer can be served earlier and later than the required time with a given tolerance. To meet the practical demands of logistics companies, we build a multi-objective optimization model that minimizes total distribution cost and maximizes overall customer satisfaction simultaneously. We propose a hybrid multi-objective genetic optimization approach incorporated with a Pareto local search algorithm to solve the problem. Particularly, we develop a greedy-based heuristic method to create initial solutions and introduce a problem-specific solution representation, genetic operations, as well as six heuristic neighborhood strategies for the hybrid algorithm. Besides, an adaptive strategy is adopted to further balance the convergence and the diversity of the hybrid algorithm. The performance of the proposed algorithm is evaluated by using a set of benchmark instances. The experimental results show that the proposed algorithm outperforms three competitors. Furthermore, we investigate the sensitivity of the proposed model and hybrid algorithm based on a real-world case in Changsha city, China.

25 October 2022 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Bin JiBin Ji
Bin Ji
HHHan Huang
Han Huang
SYSamson Shenglong Yu
Samson Shenglong Yu
The berth allocation and quay crane assignment problem (BACAP) is an important port operation planning problem. To obtain an effective and reliable schedule of berth and quay crane (QC), this study addresses the BACAP with stochastic arrival times of vessels. An efficient method combining scenario generation is presented to simulate the stochastic arrival times. After then, a mixed integer linear programming (MILP) model is established, aiming to minimize the expectation of the vessels’ total stay time in port. A multi-objective constraint-handling (MOCH) strategy is adopted to reformulate the developed model, which converts constraint violations into an objective, thus transforming the single-objective optimization model with complex constraints into a dual-objective optimization model with only easy-handling constraints. Then an enhanced non-dominated sorting genetic algorithm II (ENSGA-II) is proposed to solve the dual-objective model, in which a neighborhood search algorithm and a search bias mechanism are incorporated to strengthen the local exploitation capability. Furthermore, a repair method (RM), penalty function (PF) and the superiority of feasible solutions (SF) strategy for constraint handling are designed respectively and incorporated with genetic algorithm to solve the original single-objective optimization model. Finally, numerical experiments on instances in the literature are conducted to validate the effectiveness of the MOCH and the proposed ENSGA-II. The results show that the average total stay time of vessels is reduced when stochastic arrival times are considered. Comparison results with another two multi-objective methods and three single-objective methods combined with different constraint-handling strategies corroborate the superiority of the proposed ENSGA-II and MOCH.

Verified
Journal Article
Open access
PDF file
MTMin Tang
Min Tang
Bin JiBin Ji
Bin Ji
XFXiaoping Fang
Xiaoping Fang
SYSamson Shenglong Yu
Samson Shenglong Yu
The continuous berth allocation and quay crane assignment problem considers the size of berths and ships, the number of quay cranes, the dynamic ships and non-crossing constraints of quay cranes. In this work, a mixed-integer linear programming model of this problem is established, aiming at minimizing the total stay time and delay penalty of ships. To solve the model, the continuous berth is separated into discrete segments via a proposed discretization strategy. Thereafter, a large neighborhood search algorithm composed of the random removal operator and relaxed sorting-based insertion operator and a backtracking comparison-based constraint repair strategy are proposed. The effectiveness of the model and algorithm presented is verified via real-life instances with different characteristics, and the performances of different combinations of removal operators and insertion operators in the large neighborhood search algorithmic framework are analyzed. Numerical results show that the large neighborhood search algorithm can optimally solve the small-scale instances in a reasonable time. Meanwhile, the results of large-scale instances show that the large neighborhood search algorithm incorporating the discretization strategy is more efficient than other genetic algorithms based on continuous optimization. With the proposed approach, high-quality berth and quay crane allocation results can be obtained efficiently.

15 March 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
Saiqi ZhouSaiqi Zhou
Saiqi Zhou
Bin JiBin Ji
Bin Ji
YSYalong Song
Yalong Song
SYSamson Shenglong Yu
Samson Shenglong Yu
Dezhi ZhangDezhi Zhang
Dezhi Zhang
Tom Van WoenselTom Van Woensel
Tom Van Woensel

12 February 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
Bin JiBin Ji
Bin Ji
XYXiaohui Yuan
Xiaohui Yuan
YYYanbin Yuan
Yanbin Yuan
A complex and typical scheduling problem in waterway transportation: co-scheduling of cascaded locks with multiple chambers (CCLM) is studied. Based on in-depth analysis of the problem properties, the CCLM is handled by separating it into three interconnected subproblems, each with a simpler structure and higher flexibility to be handled. The outer layer and inner layer concerns the sum of lockage number and ship placement, respectively. The interlayer as a connection bridge between the other two refers to lockage direction combination and timetable optimization which is a high-dimensional mixed integer optimization problem. To solve the CCLM problem, a hybrid approach based on iteration which mainly combines quantum inspired binary gravitational search algorithm and modified moth-flame optimization algorithm is proposed. In addition, two different scheduling rules which are usually concerned in practice, the area utilization maximization and first-come-first-served (FCFS) rule, are also tested in the CCLM problem. Experiments are conducted on instances that are extracted from real world data. The scheduling and comparison results verify that the CCLM problem can be well handled by the proposed method.

6 August 2022 in European Journal of Operational Research
Verified
Journal Article
Closed access
Bin JiBin Ji
Bin Ji
ZZZheng Zhang
Zheng Zhang
SYSamson S. Yu
Samson S. Yu
Saiqi ZhouSaiqi Zhou
Saiqi Zhou
GWGuohua Wu
Guohua Wu