Author of the publication

Study on split delivery open vehicle routing problem within two splits.

, , and . ICNC-FSKD, page 724-728. IEEE, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Solving Open Shop Scheduling Problem via Graph Attention Neural Network., , , and . ICTAI, page 277-284. IEEE, (2020)A Self-adaptive Iterated Local Search Algorithm on the Permutation Flow Shop Scheduling Problem., , , and . ICINCO (1), page 378-384. SciTePress, (2014)Models for aircraft maintenance routing problem with consideration of remaining time and robustness., , and . Comput. Ind. Eng., (2019)Study on Heuristics for the Permutation Flowshop with Sequence Dependent Setup Times., , and . IRI, page 417-421. IEEE Systems, Man, and Cybernetics Society, (2009)A More Effective Constructive Algorithm for Permutation Flowshop Problem., , and . IDEAL, volume 4224 of Lecture Notes in Computer Science, page 25-32. Springer, (2006)HQC: An Efficient Method for ROLAP with Hierarchical Dimensions., , and . RSFDGrC (2), volume 3642 of Lecture Notes in Computer Science, page 211-220. Springer, (2005)Enhanced Iterated Local Search Algorithms for the Permutation Flow Shop Problem Minimizing Total Flow Time., , , and . ICINCO (1), page 58-65. SciTePress, (2013)A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem., , , and . PACIIA (1), page 891-895. IEEE Computer Society, (2008)A column-generation-based heuristic for passenger recovery problem considering multi-flights and seat-sharing constraints., , and . ICCAD, page 1-6. IEEE, (2020)Study on Iterated Local Search Algorithm for Permutation Flowshop Problem with Total Flowtime Objective., , and . ICAIC (2), volume 225 of Communications in Computer and Information Science, page 236-245. Springer, (2011)