A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A tailored adaptive large neighborhood search algorithm for the air cargo partitioning problem with a piecewise linear cost function

Published:2023-08-03 Issue:23 Volume:27 Page:17639-17656
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Jin Xin,Qin Hu,Cheng Chun^ORCID

Funder

National Natural Science Foundation of China

Natural Science Foundation of Liaoning Province

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

https://link.springer.com/content/pdf/10.1007/s00500-023-09033-8.pdf

Reference40 articles.

1. Alvarez-Valdés R, Parreño F, Tamarit JM (2015) Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectrum 37(1):49–74

2. Buljubašić M, Vasquez M (2016) Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing. Comput Oper Res 76:12–21

3. Caprara A, Toth P (2001) Lower bounds and algorithms for the 2-dimensional vector packing problem. Discret Appl Math 111(3):231–262

4. Côté JF, Haouari M, Iori M (2019) A primal decomposition algorithm for the two-dimensional bin packing problem. arXiv preprint arXiv:1909.06835

5. Crainic TG, Perboli G, Tadei R (2009) Ts2pack: a two-level tabu search for the three-dimensional bin packing problem. Eur J Oper Res 195(3):744–760

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP