Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jingfeng Yang 0003

dblp:50/371-3 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0007-1458-6857ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Optimization for machine learning · 40% Generative modeling · 20% Planning, search and constraint satisfaction · 20%
Theoretical computer science
2 papers
Mathematical optimization · 100%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning
combinatorial optimization
0.912025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
diverse solution generation
0.912025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025
Machine learning › Generative modeling
generative flow networks
0.912025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025
Machine learning › Optimization for machine learning › combinatorial optimization
vehicle routing
0.912025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025
Mathematical optimization › combinatorial optimization › vehicle routing
pickup and delivery problem
0.912025
Neuro-Ins: A Learning-Based One-Shot Node Insertion for Dynamic Routing Problems · IEEE Trans. Knowl. Data Eng. 2025
Mathematical optimization › combinatorial optimization
vehicle routing
0.912025
Neuro-Ins: A Learning-Based One-Shot Node Insertion for Dynamic Routing Problems · IEEE Trans. Knowl. Data Eng. 2025
Mathematical optimization › combinatorial optimization › vehicle routing
capacitated vehicle routing
0.312025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025
Mathematical optimization
discrete optimization
0.312025
Adversarial Generative Flow Network for Solving Vehicle Routing Problems · ICLR 2025

Methods — techniques the papers use, named apart from their topics

proximal policy optimization · 1.7hybrid decoding · 1.7encoder-decoder · 1.7attention mechanism · 1.7adversarial training · 1.7generative flow networks · 0.9generative flow network · 0.9
YearPublicationVenuePosition
2025 Adversarial Generative Flow Network for Solving Vehicle Routing Problems
abstract
Recent research into solving vehicle routing problems (VRPs) has gained significant traction, particularly through the application of deep (reinforcement) learning for end-to-end solution construction. However, many current construction-based neural solvers predominantly utilize Transformer architectures, which can face scalability challenges and struggle to produce diverse solutions. To address these limitations, we introduce a novel framework beyond Transformer-based approaches, i.e., Adversarial Generative Flow Networks (AGFN). This framework integrates the generative flow network (GFlowNet)—a probabilistic model inherently adept at generating diverse solutions (routes)—with a complementary model for discriminating (or evaluating) the solutions. These models are trained alternately in an adversarial manner to improve the overall solution quality, followed by a proposed hybrid decoding method to construct the solution. We apply the AGFN framework to solve the capacitated vehicle routing problem (CVRP) and travelling salesman problem (TSP), and our experimental results demonstrate that AGFN surpasses the popular construction-based neural solvers, showcasing strong generalization capabilities on synthetic and real-world benchmark instances.
Jingfeng Yang 0003, Zhiguang Cao, Xu Chi
ICLR2
2025 Neuro-Ins: A Learning-Based One-Shot Node Insertion for Dynamic Routing Problems
abstract
The rise in instant delivery services necessitates efficient route planning in last-mile delivery scenarios, where new orders arrive dynamically and need to be integrated into existing routes. In such contexts, complete re-optimization of routes are not permitted, and node insertion to existing route sequences is the only viable option. However, many existing heuristics for node insertion, such as the Cheapest Insertion (CI) method, are myopic and often result in suboptimal solutions retrospectively. This paper presents Neuro-Ins, an initial yet novel attempt at harnessing a learning-based framework to handle the insertion of new orders for the Pickup and Delivery Problem (PDP). In contrast to CI, which considers only one node at a time for insertion, Neuro-Ins leverages an Attention-Mechanism (AM) based encoder-decoder structure to collectively consider all nodes to be inserted, thereby enhancing the quality of the eventual solution. To further improve the model's representation of the current route, we introduce a position embedding to enrich the node feature embedding with positional information of the route. Experiments on synthetic and real-world datasets demonstrate that Neuro-Ins, trained by PPO, consistently outperforms CI without compromising computational speed, and it also surpasses the performance of state-of-the-art solution methods implemented in the industry. Our findings emphasize the importance of explicitly considering all nodes to be inserted along with the en-route nodes and their positions in the route, showcasing the efficacy of the proposed AM-based framework in optimizing the instant delivery routes.
Zhiqin Zhang 0001, Jingfeng Yang 0003, Zhiguang Cao, Hoong Chuin Lau
IEEE Trans. Knowl. Data Eng.2