摘要
针对托盘调配过程中的优化问题,以产生的调配费用少和托盘需求点的时间延误小为目标,以供给、需求、装卸、运送能力为约束,建立多目标的托盘调配模型.将传统的遗传算法进行改进,设计了遗传退火算法来求解带时间限制的托盘调配问题的启发式算法,并以实例进行验证.实例结果表明:算法在求解小规模的调配问题上,比传统算法更易获得最优解或近似最优解.
Aiming at the optimization problem in the process of pallet allocation,a multi-objective pallet allocation model was established to generate less deployment cost and less time delay at the demand point of the pallet with the constraints of supply,demand,loading and unloading,and transportation capacity.The traditional genetic algorithm was improved,and a genetic annealing algorithm was designed to solve the heuristic algorithm of pallet allocation problem with time limit,and verified by an example.The example results show that the algorithm is easier to obtain the optimal solution or approximate optimal solution than traditional algorithms in solving small-scale deployment problems.
作者
陈皓
程牟娟
李平
CHEN Hao;CHENG Moujuan;LI Ping(School of Economics and Management,Yibin University,Yibin,Sichuan 644000,China;School of Transportation and Logistics,Southwest Jiaotong University,Chengdu 611756,China)
出处
《宜宾学院学报》
2020年第6期67-72,94,共7页
Journal of Yibin University
基金
铁道部科技研究开发计划项目“铁路货物装载加固方案辅助决策及过程可视化技术研究”(2013X014-E)。
关键词
托盘
调配
时间约束
优化
pallet
deployment
time constraints
optimization
