default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBin Ji 0001
Person information
- affiliation: Huazhong University of Science and Technology, School of Hydropower and Information Engineering, Wuhan, China
Other persons with the same name
- Bin Ji — disambiguation page
- Bin Ji 0002
![[0000-0002-5508-5051]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-5508-5051")
— National University of Defense Technology, College of Computer, Changsha, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j31]Yalong Song, Bin Ji, Samson S. Yu:
Multi-Port Berth Allocation and Time-Invariant Quay Crane Assignment Problem With Speed Optimization. IEEE Trans. Intell. Transp. Syst. 26(1): 128-142 (2025)- 2024
- [j30]Bin Ji, Yalong Song, Samson S. Yu, Qian Wei:
A modified adaptive large neighborhood search algorithm for solving the multi-port continuous berth allocation problem with vessel speed optimization. Comput. Ind. Eng. 198: 110699 (2024) - [j29]Bin Ji, Shujing Zhang, Samson S. Yu, Xin Xiao, Chen Chen, Guohua Zheng:
Novel model and solution method for flexible job shop scheduling problem with batch processing machines. Comput. Oper. Res. 161: 106442 (2024) - [j28]Saiqi Zhou, Dezhi Zhang, Bin Ji, Shuangyan Li:
Two-echelon vehicle routing problem with direct deliveries and access time windows. Expert Syst. Appl. 244: 121150 (2024) - [j27]Bin Ji, Saiqi Zhou, Dezhi Zhang, Samson S. Yu:
A branch-and-price-based heuristic for the vehicle routing problem with two-dimensional loading constraints and time windows. Int. Trans. Oper. Res. 31(2): 658-691 (2024) - [j26]Huan Liu, Guohua Wu, Bin Ji, Ling Wang:
Multiobjective Variable Neighborhood Descent for Heterogeneous Multi-UAV Coordinated Scheduling. IEEE Trans. Aerosp. Electron. Syst. 60(2): 1808-1823 (2024) - [j25]Dezhi Zhang, Saiqi Zhou, Bin Ji, Shuangyan Li:
A Two-Echelon Capacitated Vehicle Routing Problem With Sharing Satellite Resources. IEEE Trans. Intell. Transp. Syst. 25(9): 12216-12227 (2024) - 2023
- [j24]Bin Ji, Suying Zhang, Samson Shenglong Yu, Dezhi Zhang:
An Enhanced Adaptive Large Neighborhood Search for Unrelated Parallel Machine Scheduling With Sequence Dependent Setup Times. IEEE Access 11: 16735-16748 (2023) - [j23]Xuekai Cen, Guo Zhou, Bin Ji, Samson S. Yu, Zheng Zhang, Xiaoping Fang:
Modelling and heuristically solving three-dimensional loading constrained vehicle routing problem with cross-docking. Adv. Eng. Informatics 57: 102029 (2023) - [j22]Bin Ji, Zheng Zhang, Samson S. Yu, Saiqi Zhou, Guohua Wu:
Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints. Eur. J. Oper. Res. 306(3): 1219-1235 (2023) - [j21]Saiqi Zhou, Bin Ji, Yalong Song, Samson S. Yu, Dezhi Zhang, Tom Van Woensel:
Hub-and-spoke network design for container shipping in inland waterways. Expert Syst. Appl. 223: 119850 (2023) - [j20]Zhongqiang Ma, Guohua Wu, Bin Ji, Ling Wang, Qizhang Luo, Xinjiang Chen:
A Novel Scattered Storage Policy Considering Commodity Classification and Correlation in Robotic Mobile Fulfillment Systems. IEEE Trans Autom. Sci. Eng. 20(2): 1020-1033 (2023) - [j19]Bin Ji, Han Huang, Samson S. Yu:
An Enhanced NSGA-II for Solving Berth Allocation and Quay Crane Assignment Problem With Stochastic Arrival Times. IEEE Trans. Intell. Transp. Syst. 24(1): 459-473 (2023) - 2022
- [j18]Bin Ji, Min Tang, Ziyun Wu, Samson S. Yu, Saiqi Zhou, Xiaoping Fang:
Hybrid rolling-horizon optimization for berth allocation and quay crane assignment with unscheduled vessels. Adv. Eng. Informatics 54: 101733 (2022) - [j17]Qizhang Luo, Guohua Wu, Bin Ji, Ling Wang, Ponnuthurai Nagaratnam Suganthan:
Hybrid Multi-Objective Optimization Approach With Pareto Local Search for Collaborative Truck-Drone Routing Problems Considering Flexible Time Windows. IEEE Trans. Intell. Transp. Syst. 23(8): 13011-13025 (2022) - 2021
- [j16]Bin Ji, Dezhi Zhang, Samson S. Yu, Chuanxiong Kang:
Mathematical programming models for scheduling multiple cascaded waterway locks. Comput. Ind. Eng. 156: 107289 (2021) - [j15]Bin Ji, Saiqi Zhou, Samson S. Yu, Guohua Wu:
An enhanced neighborhood search algorithm for solving the split delivery vehicle routing problem with two-dimensional loading constraints. Comput. Ind. Eng. 162: 107720 (2021) - [j14]Bin Ji, Dezhi Zhang, Samson S. Yu, Xiaoping Fang:
An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective. Comput. Oper. Res. 127: 105164 (2021) - [j13]Bin Ji, Dezhi Zhang, Samson S. Yu, Binqiao Zhang:
Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective. Eur. J. Oper. Res. 288(1): 47-62 (2021) - 2020
- [j12]Dezhi Zhang, Wei Xu, Bin Ji, Shuangyan Li, Yajie Liu:
An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem. Comput. Oper. Res. 123: 105035 (2020) - [j11]Bin Ji, Hongjun Sun, Xiaohui Yuan, Yanbin Yuan, Xiaorong Wang:
Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA-II. Int. Trans. Oper. Res. 27(3): 1501-1525 (2020) - [j10]Bin Ji, Xiaohui Yuan, Yanbin Yuan, Xiaohui Lei, Herbert H. C. Iu:
An Adaptive Large Neighborhood Search for Solving Generalized Lock Scheduling Problem: Comparative Study With Exact Methods. IEEE Trans. Intell. Transp. Syst. 21(8): 3344-3356 (2020) - 2019
- [j9]Bin Ji, Xiaohui Yuan, Yanbin Yuan, Xiaohui Lei, Tyrone Fernando, Herbert H. C. Iu:
Exact and heuristic methods for optimizing lock-quay system in inland waterway. Eur. J. Oper. Res. 277(2): 740-755 (2019) - [j8]Bin Ji, Xiaohui Yuan, Yanbin Yuan:
A Hybrid Intelligent Approach for Co-Scheduling of Cascaded Locks With Multiple Chambers. IEEE Trans. Cybern. 49(4): 1236-1248 (2019) - [j7]Bin Ji, Xiaohui Yuan, Yanbin Yuan:
A Binary Borg-Based Heuristic Method for Solving a Multi-Objective Lock and Transshipment Co-Scheduling Problem. IEEE Trans. Intell. Transp. Syst. 20(3): 947-958 (2019) - 2017
- [j6]Bin Ji, Xiaohui Yuan, Yanbin Yuan:
Modified NSGA-II for Solving Continuous Berth Allocation Problem: Using Multiobjective Constraint-Handling Strategy. IEEE Trans. Cybern. 47(9): 2885-2895 (2017) - [j5]Bin Ji, Xiaohui Yuan, Yanbin Yuan:
Orthogonal Design-Based NSGA-III for the Optimal Lockage Co-Scheduling Problem. IEEE Trans. Intell. Transp. Syst. 18(8): 2085-2095 (2017) - 2016
- [j4]Xiaohui Yuan, Bin Ji, Yanbin Yuan, Xiaotao Wu, Xiaopan Zhang:
Co-scheduling of lock and water-land transshipment for ships passing the dam. Appl. Soft Comput. 45: 150-162 (2016) - 2015
- [j3]Yanbin Yuan, Bin Ji, Xiaohui Yuan, Yuehua Huang:
Lockage scheduling of Three Gorges-Gezhouba dams by hybrid of chaotic particle swarm optimization and heuristic-adjusted strategies. Appl. Math. Comput. 270: 74-89 (2015) - 2014
- [j2]Xiaohui Yuan, Bin Ji, Zhijun Chen, Zhihuan Chen:
A novel approach for economic dispatch of hydrothermal system via gravitational search algorithm. Appl. Math. Comput. 247: 535-546 (2014) - [j1]Xiaohui Yuan, Bin Ji, Shuangquan Zhang, Hao Tian, Yanhong Hou:
A new approach for unit commitment problem via binary gravitational search algorithm. Appl. Soft Comput. 22: 249-260 (2014)
Conference and Workshop Papers
- 2020
- [c1]Bin Ji, Samson S. Yu, Zikang Su:
A Multi-objective Constraint-handling based Approach for Short-term Hydro-thermal-wind Co-scheduling Problem. IECON 2020: 1507-1512
Coauthor Index
aka: Samson S. Yu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-20 20:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
