Nai-Kang Yu

According to our database1, Nai-Kang Yu authored at least 12 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An alternating direction multiplier method with variable neighborhood search for electric vehicle routing problem with time windows and battery swapping stations.
Appl. Soft Comput., 2024

A Branch and Price Heuristic Algorithm for the Vehicle Routing Problem with Time Windows.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2024

A Branch and Price Algorithm for the Two-Agent Heterogeneous Fleet Vehicle Routing Problem with Time Windows.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2024

A Branch-and-Price Heuristic Algorithm for Vehicle Routing Problem with Soft Time Windows.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2024

2023
Lagrange Heuristic Algorithm Incorporated with Decomposition Strategy for Green Multi-depot Heterogeneous-Fleet Vehicle Routing Problem.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2023

Runtime Analysis of Estimation of Distribution Algorithms for a Simple Scheduling Problem.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2023

ADMM with SUSLM for Electric Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Windows.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2023

Real-Time Crowdsourced Delivery Optimization Considering Maximum Detour Distance.
Proceedings of the Advanced Intelligent Computing Technology and Applications, 2023

2021
An Improved Lagrangian Relaxation Algorithm for Solving the Lower Bound of Production Logistics.
Proceedings of the Intelligent Computing Theories and Application, 2021

Hybrid Grey Wolf Optimizer for Vehicle Routing Problem with Multiple Time Windows.
Proceedings of the Intelligent Computing Theories and Application, 2021

Hybrid Whale Optimization Algorithm for Solving Green Open Vehicle Routing Problem with Time Windows.
Proceedings of the Intelligent Computing Theories and Application, 2021

2018
Improved Sub-gradient Algorithm for Solving the Lower Bound of No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates.
Proceedings of the Intelligent Computing Methodologies - 14th International Conference, 2018


  Loading...