探讨一种固定运输模式下的越库转运问题——采用运输量不可拆分的单次运送方式以最小费用通过选择固定的运输路径将货物经过越库转运到目的地,其货物将可能在越库中停留甚至无法运到目的地,这将会导致库存成本和惩罚成本.文中证明了此...探讨一种固定运输模式下的越库转运问题——采用运输量不可拆分的单次运送方式以最小费用通过选择固定的运输路径将货物经过越库转运到目的地,其货物将可能在越库中停留甚至无法运到目的地,这将会导致库存成本和惩罚成本.文中证明了此类越库转运问题是强NP难题,因此本文针对该问题的特殊结构,提出一种采用了邻域搜索技术的自适应遗传算法(AGA with NS)来有效的解决该类问题,数值试验结果表明该算法比CPLEX求解更加高效.此外文中还分别比较了在不采用邻域搜索或者自适应策略的情况下的三种遗传算法,其数值实验结果表明邻域搜索策略以及自适应策略对提高算法的效率有显著的影响.展开更多
In this paper,we investigate a kind of truck-door assignment problem in a crossdock.Multiple related realistic constraints such as the capacity of trucks,the capacity of temporary storage area,the time windows of truc...In this paper,we investigate a kind of truck-door assignment problem in a crossdock.Multiple related realistic constraints such as the capacity of trucks,the capacity of temporary storage area,the time windows of trucks as well as the operational time inside the crossdock are considered and therefore,make the assignment problem strongly NP-hard and very challenging.A two-stage genetic algorithm is proposed to solve this problem and the experimental results show the superiority of this approach in comparison to CPLEX solver in terms of effectiveness and efficiency especially for the large-scale instances.That is,the decision making process can speed up and a near optimal truck-door assignment scheme can be obtained within a relatively short time by applying this two-stage approach in practice.展开更多
文摘探讨一种固定运输模式下的越库转运问题——采用运输量不可拆分的单次运送方式以最小费用通过选择固定的运输路径将货物经过越库转运到目的地,其货物将可能在越库中停留甚至无法运到目的地,这将会导致库存成本和惩罚成本.文中证明了此类越库转运问题是强NP难题,因此本文针对该问题的特殊结构,提出一种采用了邻域搜索技术的自适应遗传算法(AGA with NS)来有效的解决该类问题,数值试验结果表明该算法比CPLEX求解更加高效.此外文中还分别比较了在不采用邻域搜索或者自适应策略的情况下的三种遗传算法,其数值实验结果表明邻域搜索策略以及自适应策略对提高算法的效率有显著的影响.
文摘In this paper,we investigate a kind of truck-door assignment problem in a crossdock.Multiple related realistic constraints such as the capacity of trucks,the capacity of temporary storage area,the time windows of trucks as well as the operational time inside the crossdock are considered and therefore,make the assignment problem strongly NP-hard and very challenging.A two-stage genetic algorithm is proposed to solve this problem and the experimental results show the superiority of this approach in comparison to CPLEX solver in terms of effectiveness and efficiency especially for the large-scale instances.That is,the decision making process can speed up and a near optimal truck-door assignment scheme can be obtained within a relatively short time by applying this two-stage approach in practice.
