Xingyin Wang

Orcid: 0000-0002-4021-3954

According to our database1, Xingyin Wang authored at least 18 papers between 2014 and 2022.

Collaborative distances:

Timeline

2014
2015
2016
2017
2018
2019
2020
2021
2022
0
1
2
3
4
5
1
2
4
3
1
2
1
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem.
Networks, 2022

2021
Instances for the Close Enough Traveling Salesman Problem.
Dataset, March, 2021

On the road to better routes: Five decades of published research on the vehicle routing problem.
Networks, 2021

Estimating the Tour Length for the Close Enough Traveling Salesman Problem.
Algorithms, 2021

2019
A New Dominance Method Based on Expanding Dominated Area for Many-Objective Optimization.
Int. J. Pattern Recognit. Artif. Intell., 2019

A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties.
Eur. J. Oper. Res., 2019

The Bin Packing Problem with Item Fragmentation: A worst-case analysis.
Discret. Appl. Math., 2019

A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman Problem.
Comput. Oper. Res., 2019

2018
Two-Archive Based Evolutionary Algorithm Using Adaptive Reference Direction and Decomposition for Many-Objective Optimization.
Proceedings of the 14th International Conference on Computational Intelligence and Security, 2018

2017
The vehicle routing problem with drones: several worst-case results.
Optim. Lett., 2017

The vehicle routing problem with drones: Extended models and connections.
Networks, 2017

A novel approach to solve the split delivery vehicle routing problem.
Int. Trans. Oper. Res., 2017

An alpha-Dominance Expandation Based Algorithm for Many-Objective Optimization.
Proceedings of the 13th International Conference on Computational Intelligence and Security, 2017

2016
Vehicle Routing Problems that Minimize the Completion Time: Heuristics, Worst-Case Analyses, and Computational Results.
PhD thesis, 2016

The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement.
Comput. Oper. Res., 2016

2015
The min-max multi-depot vehicle routing problem: heuristics and computational results.
J. Oper. Res. Soc., 2015

Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis.
Eur. J. Oper. Res., 2015

2014
A worst-case analysis for the split delivery capacitated team orienteering problem with minimum delivery amounts.
Optim. Lett., 2014


  Loading...