Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportationANNALS OF OPERATIONS RESEARCHIF4.52024-07-033PRE
A Three-Front Parallel Branch-and-Cut Algorithm for Production and Inventory Routing Problems用于生产和库存路径问题的三前并行分支和切割算法TRANSPORTATION SCIENCEIF4.82024-07-015PRE
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman ProblemEXPERT SYSTEMS WITH APPLICATIONSIF7.52024-03-016PRE
The dial-a-ride problem with private fleet and common carrier私人舰队和普通承运人的拨号问题COMPUTERS & OPERATIONS RESEARCHIF4.32022-11-019PRE
A two-level lot sizing and scheduling problem applied to a cosmetic industryCOMPUTERS & CHEMICAL ENGINEERINGIF3.92022-07-012PRE
The two-echelon production-routing problemEUROPEAN JOURNAL OF OPERATIONAL RESEARCHIF62021-01-0137PREAI
The two-echelon inventory-routing problem with fleet managementCOMPUTERS & OPERATIONS RESEARCHIF4.32020-09-0117OAAI
The exact solutions of several types of container loading problemsEUROPEAN JOURNAL OF OPERATIONAL RESEARCHIF62020-07-0130PREAI
The two-echelon multi-depot inventory-routing problem两级多仓库库存路径问题COMPUTERS & OPERATIONS RESEARCHIF4.32019-01-0141PREAI