default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYongliang Lu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Qinghua Wu, Mu He, Jin-Kao Hao
, Yongliang Lu:
An effective hybrid evolutionary algorithm for the clustered orienteering problem. Eur. J. Oper. Res. 313(2): 418-434 (2024)- [j17]Mu He, Qinghua Wu, Una Benlic, Yongliang Lu, Yuning Chen:
An effective multi-level memetic search with neighborhood reduction for the clustered team orienteering problem. Eur. J. Oper. Res. 318(3): 778-801 (2024) - [j16]Yanchao Zhang, Ziyi Yan, Junfeng Gao, Yiyang Shen, Haozhe Zhou, Wei Tang, Yongliang Lu, Yongjie Yang:
UAV imaging hyperspectral for barnyard identification and spatial distribution in paddy fields. Expert Syst. Appl. 255: 124771 (2024) - [j15]Yongliang Lu, Una Benlic, Qinghua Wu:
An effective hybrid evolutionary algorithm for the set orienteering problem. Inf. Sci. 654: 119813 (2024) - 2023
- [j14]Qinghua Wu, Zhe Sun, Una Benlic, Yongliang Lu:
A parallel adaptive memory algorithm for the capacitated modular hub location problem. Comput. Oper. Res. 153: 106173 (2023) - 2022
- [j13]Yanchao Zhang, Wen Yang, Wenbo Zhang, Jiya Yu, Jianxin Zhang, Yongjie Yang, Yongliang Lu, Wei Tang:
Two-step ResUp&Down generative adversarial network to reconstruct multispectral image from aerial RGB image. Comput. Electron. Agric. 192: 106617 (2022) - [j12]Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 144: 105799 (2022) - [j11]Mu He, Qinghua Wu, Yongliang Lu:
Breakout local search for the cyclic cutwidth minimization problem. J. Heuristics 28(5): 583-618 (2022) - [j10]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Solving the clustered traveling salesman problem via traveling salesman problem methods. PeerJ Comput. Sci. 8: e972 (2022) - 2021
- [j9]Yongliang Lu, Una Benlic, Qinghua Wu:
A highly effective hybrid evolutionary algorithm for the covering salesman problem. Inf. Sci. 564: 144-162 (2021) - 2020
- [j8]Yongliang Lu, Una Benlic, Qinghua Wu:
An effective memetic algorithm for the generalized bike-sharing rebalancing problem. Eng. Appl. Artif. Intell. 95: 103890 (2020) - [i1]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Solving the Clustered Traveling Salesman Problem via TSP methods. CoRR abs/2007.05254 (2020)
2010 – 2019
- 2019
- [j7]Yanchao Zhang, Junfeng Gao, Haiyan Cen, Yongliang Lu, Xiaoyue Yu, Yong He, Jan G. Pieters:
Automated spectral feature extraction from hyperspectral images to differentiate weedy rice and barnyard grass from a rice crop. Comput. Electron. Agric. 159: 42-49 (2019) - [j6]Yongliang Lu, Una Benlic, Qinghua Wu:
A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 101: 285-297 (2019) - [j5]Yongliang Lu, Una Benlic, Qinghua Wu, Bo Peng:
Memetic algorithm for the multiple traveling repairman problem with profits. Eng. Appl. Artif. Intell. 80: 35-47 (2019) - [j4]Yongliang Lu, Jin-Kao Hao, Qinghua Wu:
Hybrid evolutionary search for the traveling repairman problem with profits. Inf. Sci. 502: 91-108 (2019) - 2018
- [j3]Yongliang Lu, Una Benlic, Qinghua Wu:
A hybrid dynamic programming and memetic algorithm to the Traveling Salesman Problem with Hotel Selection. Comput. Oper. Res. 90: 193-207 (2018) - [j2]Yongliang Lu, Una Benlic, Qinghua Wu:
Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 97: 18-30 (2018) - [j1]Yongliang Lu, Una Benlic, Qinghua Wu:
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints. Eur. J. Oper. Res. 268(1): 54-69 (2018)
Coauthor Index
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 2024-08-15 23:46 CEST 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:
