Bin Ji
Orcid: 0000-0003-3452-8308Affiliations:
- Huazhong University of Science and Technology, School of Hydropower and Information Engineering, Wuhan, China
According to our database1,
Bin Ji
authored at least 27 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
A branch-and-price-based heuristic for the vehicle routing problem with two-dimensional loading constraints and time windows.
Int. Trans. Oper. Res., March, 2024
Multiobjective Variable Neighborhood Descent for Heterogeneous Multi-UAV Coordinated Scheduling.
IEEE Trans. Aerosp. Electron. Syst., 2024
2023
Expert Syst. Appl., August, 2023
Modelling and heuristically solving three-dimensional loading constrained vehicle routing problem with cross-docking.
Adv. Eng. Informatics, August, 2023
A Novel Scattered Storage Policy Considering Commodity Classification and Correlation in Robotic Mobile Fulfillment Systems.
IEEE Trans Autom. Sci. Eng., April, 2023
An Enhanced NSGA-II for Solving Berth Allocation and Quay Crane Assignment Problem With Stochastic Arrival Times.
IEEE Trans. Intell. Transp. Syst., January, 2023
Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints.
Eur. J. Oper. Res., 2023
An Enhanced Adaptive Large Neighborhood Search for Unrelated Parallel Machine Scheduling With Sequence Dependent Setup Times.
IEEE Access, 2023
2022
Hybrid Multi-Objective Optimization Approach With Pareto Local Search for Collaborative Truck-Drone Routing Problems Considering Flexible Time Windows.
IEEE Trans. Intell. Transp. Syst., 2022
Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels.
Adv. Eng. Informatics, 2022
2021
Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective.
Eur. J. Oper. Res., 2021
An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective.
Comput. Oper. Res., 2021
An enhanced neighborhood search algorithm for solving the split delivery vehicle routing problem with two-dimensional loading constraints.
Comput. Ind. Eng., 2021
Comput. Ind. Eng., 2021
2020
An Adaptive Large Neighborhood Search for Solving Generalized Lock Scheduling Problem: Comparative Study With Exact Methods.
IEEE Trans. Intell. Transp. Syst., 2020
Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA-II.
Int. Trans. Oper. Res., 2020
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem.
Comput. Oper. Res., 2020
A Multi-objective Constraint-handling based Approach for Short-term Hydro-thermal-wind Co-scheduling Problem.
Proceedings of the 46th Annual Conference of the IEEE Industrial Electronics Society, 2020
2019
A Binary Borg-Based Heuristic Method for Solving a Multi-Objective Lock and Transshipment Co-Scheduling Problem.
IEEE Trans. Intell. Transp. Syst., 2019
A Hybrid Intelligent Approach for Co-Scheduling of Cascaded Locks With Multiple Chambers.
IEEE Trans. Cybern., 2019
Eur. J. Oper. Res., 2019
2017
IEEE Trans. Intell. Transp. Syst., 2017
Modified NSGA-II for Solving Continuous Berth Allocation Problem: Using Multiobjective Constraint-Handling Strategy.
IEEE Trans. Cybern., 2017
2016
Appl. Soft Comput., 2016
2015
Lockage scheduling of Three Gorges-Gezhouba dams by hybrid of chaotic particle swarm optimization and heuristic-adjusted strategies.
Appl. Math. Comput., 2015
2014
A new approach for unit commitment problem via binary gravitational search algorithm.
Appl. Soft Comput., 2014
A novel approach for economic dispatch of hydrothermal system via gravitational search algorithm.
Appl. Math. Comput., 2014