default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYanru Chen 0002
Person information
- affiliation: Southwest Jiaotong University, School of Economics and Management, Sichuan, China
Other persons with the same name
- Yan-Ru Chen (aka: Yanru Chen) — disambiguation page
- Yanru Chen 0001
![[0000-0002-9677-7142]](https://devdomain4test.ir/img/orcid-mark.12x12.png "0000-0002-9677-7142")
(aka: YanRu Chen 0001) — Sichuan University, Institute for Industrial Internet Research, College of Computer Science, Chengdu, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j15]Zongcheng Zhang, Maoliang Ran, Yanru Chen, M. I. M. Wahab, Mujin Gao, Yangsheng Jiang:
Dynamic crowdsourcing problem in urban-rural distribution using the learning-based approach. Comput. Oper. Res. 185: 107292 (2026)- [j14]Shuang Liang, Yanru Chen, Zongcheng Zhang, M. I. M. Wahab, Qinxin Xiao:
An attention-enhanced meta-heuristic algorithm for multi-drone assisted humanitarian delivery problem. Comput. Oper. Res. 193: 107504 (2026) - 2025
- [j13]Mujin Gao, Yanru Chen, Zongcheng Zhang, M. I. M. Wahab:
Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints. Comput. Oper. Res. 183: 107152 (2025) - [j12]Zongcheng Zhang, Yangsheng Jiang, Mujin Gao, Yanru Chen, M. I. M. Wahab:
Deep reinforcement learning-based column generation for the two-dimensional vector variable-sized packing problem. Expert Syst. Appl. 271: 126534 (2025) - [j11]Maoliang Ran, Yanru Chen, M. I. M. Wahab, Zongcheng Zhang:
Reinforcement learning-based algorithm for the dynamic multi-depot crowdsourced delivery problem. Expert Syst. Appl. 283: 127818 (2025) - 2024
- [j10]Ziqiang Zhu, Yanru Chen, M. I. M. Wahab:
An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows. Comput. Oper. Res. 170: 106761 (2024) - [j9]Shanshan Meng, Yanru Chen, Dong Li:
The multi-visit drone-assisted pickup and delivery problem with time windows. Eur. J. Oper. Res. 314(2): 685-702 (2024) - 2023
- [j8]Mujin Gao, Yanru Chen, Junheng Li, M. I. M. Wahab:
Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows. Comput. Oper. Res. 157: 106267 (2023) - 2021
- [j7]Yanru Chen, Decheng Li, Zongcheng Zhang, M. I. M. Wahab, Yangsheng Jiang:
Solving the battery swap station location-routing problem with a mixed fleet of electric and conventional vehicles using a heuristic branch-and-price algorithm with an adaptive selection scheme. Expert Syst. Appl. 186: 115683 (2021)
2010 – 2019
- 2019
- [j6]Yanru Chen, Lu Yang, Yangsheng Jiang, M. I. M. Wahab, Jie Yang:
Joint replenishment decision considering shortages, partial demand substitution, and defective items. Comput. Ind. Eng. 127: 420-435 (2019) - 2016
- [j5]Yanru Chen, M. I. M. Wahab, Pornthipa Ongkunaruk:
A joint replenishment problem considering multiple trucks with shipment and resource constraints. Comput. Oper. Res. 74: 53-63 (2016) - 2015
- [j4]Lu Hu, Yangsheng Jiang, Juanxiu Zhu, Yanru Chen:
A PH/PH(n)/C/C state-dependent queuing model for metro station corridor width design. Eur. J. Oper. Res. 240(1): 109-126 (2015) - [j3]Yanru Chen, Yangsheng Jiang, M. I. M. Wahab, Xiaoqiang Long:
The facility layout problem in non-rectangular logistics parks with split lines. Expert Syst. Appl. 42(21): 7768-7780 (2015) - 2013
- [j2]Lu Hu, Yangsheng Jiang, Juanxiu Zhu, Yanru Chen:
Hybrid of the scatter search, improved adaptive genetic, and expectation maximization algorithms for phase-type distribution fitting. Appl. Math. Comput. 219(10): 5495-5515 (2013) - [j1]Yangsheng Jiang, Lu Hu, Juanxiu Zhu, Yanru Chen:
PH fitting of the arrival interval distribution of the passenger flow on urban rail transit stations. Appl. Math. Comput. 225: 158-170 (2013)
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 2026-07-08 01:24 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
