List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Simulated annealing heuristic for the general share-a-ride problem xxxEngineering Optimization j=[Engineering Optimization] a=[ ] j-bytes=[69,110,103,105,110,101,101,114,105,110,103,32,79,112,116,105,109,105,122,97,116,105,111,110] | 2022-12-23 | Paper |
| Solving the multi-modal transportation problem via the rough interval approach xxxRAIRO - Operations Research j=[RAIRO - Operations Research] a=[ ] j-bytes=[82,65,73,82,79,32,45,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2022-11-02 | Paper |
| Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks xxxComputers & Operations Research j=[Computers & Operations Research] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,115,32,92,38,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2022-03-07 | Paper |
| Multi-objective fixed-charge transportation problem with random rough variables xxxInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems j=[International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems] a=[ ] j-bytes=[73,110,116,101,114,110,97,116,105,111,110,97,108,32,74,111,117,114,110,97,108,32,111,102,32,85,110,99,101,114,116,97,105,110,116,121,44,32,70,117,122,122,105,110,101,115,115,32,97,110,100,32,75,110,111,119,108,101,100,103,101,45,66,97,115,101,100,32,83,121,115,116,101,109,115] | 2021-09-08 | Paper |
| A simulated annealing heuristic for the capacitated green vehicle routing problem xxxMathematical Problems in Engineering j=[Mathematical Problems in Engineering] a=[ ] j-bytes=[77,97,116,104,101,109,97,116,105,99,97,108,32,80,114,111,98,108,101,109,115,32,105,110,32,69,110,103,105,110,101,101,114,105,110,103] | 2020-02-20 | Paper |
| Simulated annealing for the blood pickup routing problem xxx j=[ ] a=[ ] j-bytes=[38,110,98,115,112,59] | 2019-05-27 | Paper |
| Effects of dominance on operation policies in a two-stage supply chain in which market demands follow the Bass diffusion model xxxRAIRO - Operations Research j=[RAIRO - Operations Research] a=[ ] j-bytes=[82,65,73,82,79,32,45,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2019-05-07 | Paper |
| Ranking generalized fuzzy numbers in fuzzy decision making based on the left and right transfer coefficients and areas xxxApplied Mathematical Modelling j=[Applied Mathematical Modelling] a=[ ] j-bytes=[65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,97,108,32,77,111,100,101,108,108,105,110,103] | 2018-10-10 | Paper |
| A simulated annealing heuristic for the open location-routing problem xxxComputers & Operations Research j=[Computers & Operations Research] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,115,32,92,38,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2016-11-10 | Paper |
| An integrated approach for resource allocation in manufacturing plants xxxApplied Mathematics and Computation j=[Applied Mathematics and Computation] a=[ ] j-bytes=[65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115,32,97,110,100,32,67,111,109,112,117,116,97,116,105,111,110] | 2016-05-02 | Paper |
| A simulated annealing heuristic for the team orienteering problem with time windows xxxEuropean Journal of Operational Research j=[European Journal of Operational Research] a=[ ] j-bytes=[69,117,114,111,112,101,97,110,32,74,111,117,114,110,97,108,32,111,102,32,79,112,101,114,97,116,105,111,110,97,108,32,82,101,115,101,97,114,99,104] | 2012-08-16 | Paper |
| The museum visitor routing problem xxxApplied Mathematics and Computation j=[Applied Mathematics and Computation] a=[ ] j-bytes=[65,112,112,108,105,101,100,32,77,97,116,104,101,109,97,116,105,99,115,32,97,110,100,32,67,111,109,112,117,116,97,116,105,111,110] | 2010-05-11 | Paper |
| Solving the truck and trailer routing problem based on a simulated annealing heuristic xxxComputers & Operations Research j=[Computers & Operations Research] a=[ ] j-bytes=[67,111,109,112,117,116,101,114,115,32,92,38,32,79,112,101,114,97,116,105,111,110,115,32,82,101,115,101,97,114,99,104] | 2008-12-17 | Paper |
Research outcomes over time
This page was built for person: Vincent F. Yu
