Yang Yu
Orcid: 0000-0003-2942-3544Affiliations:
- Northeastern University, College of Information Science and Engineering, Shenyang, China
According to our database1,
Yang Yu
authored at least 26 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A two-stage stochastic programming model and parallel Master-Slave adaptive GA for flexible <i>Seru</i> system formation.
Int. J. Prod. Res., February, 2024
A bi-objective approach for the multi-skilled worker assignment of a hybrid assembly line-seru production system.
RAIRO Oper. Res., 2024
2023
Reducing tardy batches by <i>seru</i> production: Model, exact solution, cooperative coevolution solution, and insights.
Comput. Oper. Res., December, 2023
Multi-skilled worker assignment in seru production system for the trade-off between production efficiency and workload fairness.
Kybernetes, 2023
A phased intelligent algorithm for dynamic seru production considering seru formation changes.
Appl. Intell., 2023
2022
Multi-objective cooperative coevolution algorithm with a Master-Slave mechanism for <i>Seru</i> Production.
Appl. Soft Comput., 2022
2020
Reducing the total tardiness by Seru production: model, exact and cooperative coevolution solutions.
Int. J. Prod. Res., 2020
Int. J. Prod. Res., 2020
An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows.
Complex., 2020
2019
Return and refund policy for product and core service bundling in the dual-channel supply chain.
Int. Trans. Oper. Res., 2019
A Cooperative Coevolution Algorithm for the Seru Production With Minimizing Makespan.
IEEE Access, 2019
A New Framework of Intelligent Public Transportation System Based on the Internet of Things.
IEEE Access, 2019
2018
A based-on-set-partitioning exact approach to multi-trip of picking up and delivering customers to airport.
Int. J. Comput. Sci. Eng., 2018
Electron. Commer. Res. Appl., 2018
Integration of an improved dynamic ensemble selection approach to enhance one-vs-one scheme.
Eng. Appl. Artif. Intell., 2018
Comput. Ind. Eng., 2018
2017
Line-seru conversion towards reducing worker(s) without increasing makespan: models, exact and meta-heuristic solutions.
Int. J. Prod. Res., 2017
An exact decomposition method to save trips in cooperative pickup and delivery based on scheduled trips and profit distribution.
Comput. Oper. Res., 2017
Line-hybrid seru system conversion: Models, complexities, properties, solutions and insights.
Comput. Ind. Eng., 2017
2014
Beam Search Combined With MAX-MIN Ant Systems and Benchmarking Data Tests for Weighted Vehicle Routing Problem.
IEEE Trans Autom. Sci. Eng., 2014
Mathematical analysis and solutions for multi-objective line-cell conversion problem.
Eur. J. Oper. Res., 2014
2013
Combining local search into non-dominated sorting for multi-objective line-cell conversion problem.
Int. J. Comput. Integr. Manuf., 2013
2010
A sweep-heuristic algorithm combined with partition of time and district for large-scale vehicle routing and scheduling problem of pickup and delivery of customers to airport.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010
The vehicle routing and scheduling best balance model and algorithm for free pickup and delivery service in flight ticket sales companies.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010