Expand icon Search icon File icon file Download

Items where Author is "Yang, Xinan"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 15.

Abdollahi, Mohammad and Yang, Xinan and Fairbank, Michael and Nasri, moncef (2023) Demand Management in Time-slotted Last-mile Delivery via Dynamic Routing with Forecast Orders. European Journal of Operational Research, 309 (2). pp. 704-718. DOI https://doi.org/10.1016/j.ejor.2023.01.023

Yang, Xinan and Chitsuphaphan, Thanet and Dai, Hongsheng and Meng, Fanlin (2022) EVB-Supportive Energy Management for Residential Systems with Renewable Energy Supply. World Electric Vehicle Journal, 13 (7). p. 122. DOI https://doi.org/10.3390/wevj13070122

Yang, Xinan and Thomos, Nikolaos (2021) An approximate dynamic programming approach for collaborative caching. Engineering Optimization, 53 (6). pp. 1005-1023. DOI https://doi.org/10.1080/0305215x.2020.1767098

Hosseini, Eghbal and Sadiq, Ali Safaa and Ghafoor, Kayhan Zrar and Rawat, Danda B and Saif, Mehrdad and Yang, Xinan (2021) Volcano eruption algorithm for solving optimization problems. Neural Computing and Applications, 33 (7). pp. 2321-2337. DOI https://doi.org/10.1007/s00521-020-05124-x

Yang, Xinan and Salhi, Abdel and Daham, Hajem (2021) Combined Strip and Discharge Delivery of Containers in Heterogeneous Fleets with Time Windows. Computers and Operations Research, 127. p. 105141. DOI https://doi.org/10.1016/j.cor.2020.105141

Yang, Xinan and Daham, Hajem (2020) A column generation based decomposition and aggregation approach for combining orders in inland transportation of containers. OR Spectrum, 42 (1). pp. 261-296. DOI https://doi.org/10.1007/s00291-020-00577-x

Yang, Xinan and Thomos, Nikolaos (2019) A rolling-horizon dynamic programming approach for collaborative caching. Working Paper. Arxiv. (Unpublished)

Salhi, Abdellah and Alsoufi, Ghazwan and Yang, Xinan (2019) An evolutionary approach to a combined mixed integer programming model of seaside operations as arise in container ports. Annals of Operations Research, 272 (1-2). pp. 69-98. DOI https://doi.org/10.1007/s10479-017-2539-7

Alsoufi, Ghazwan and Yang, Xinan and Salhi, Abdellah (2018) Combined quay crane assignment and quay crane scheduling with crane inter-vessel movement and non-interference constraints. Journal of the Operational Research Society, 69 (3). pp. 372-383. DOI https://doi.org/10.1057/s41274-017-0226-3

Yang, Xinan and Strauss, Arne K (2017) An approximate dynamic programming approach to attended home delivery management. European Journal of Operational Research, 263 (3). pp. 935-945. DOI https://doi.org/10.1016/j.ejor.2017.06.034

Daham, Hajem A and Yang, Xinan and Warnes, Michaela K (2017) An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders. Journal of the Operational Research Society, 68 (6). pp. 678-694. DOI https://doi.org/10.1057/s41274-016-0132-0

Yang, Xinan and Vernitski, Alexei and Carrea, Laura (2016) An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters. European Journal of Operational Research, 252 (3). pp. 985-994. DOI https://doi.org/10.1016/j.ejor.2016.01.042

Yang, Xinan and Strauss, Arne K and Currie, Christine SM and Eglese, Richard (2016) Choice-Based Demand Management and Vehicle Routing in E-Fulfillment. Transportation Science, 50 (2). pp. 473-488. DOI https://doi.org/10.1287/trsc.2014.0549

Alsoufi, Ghazwan and Yang, Xinan and Salhi, Abdellah (2016) Robust Berth Allocation Using a Hybrid Approach Combining Branch-and-Cut andĀ theĀ Genetic Algorithm. In: Lecture Notes in Computer Science. Springer International Publishing, pp. 187-201. ISBN 9783319396354. Official URL: http://dx.doi.org/10.1007/978-3-319-39636-1_14

Grothey, Andreas and Yang, Xinan (2011) Top-percentile traffic routing problem by dynamic programming. Optimization and Engineering, 12 (4). pp. 631-655. DOI https://doi.org/10.1007/s11081-010-9130-2

This list was generated on Sat Nov 30 00:17:04 2024 GMT.