The cross-docking is a very important subject in logistics and supply chain managements.According to the definition,cross-docking is a process dealing with transhipping inventory,in which goods and products are unload...The cross-docking is a very important subject in logistics and supply chain managements.According to the definition,cross-docking is a process dealing with transhipping inventory,in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly loaded onto an outbound truck.Cross-docking is favored due to its advantages in reducing the material handing cost,the needs to store the product in warehouse,as well decreasing the labor cost by eliminating packaging,storing,pick-location and order picking.In cross-docking,products can be consolidated and transported as a full load,reducing overall distribution costs.In this paper,we focus on a truck scheduling at the multidoor,multi-crossdocking network with inventory constraints and process capability constraints.In this model,a truck can visit severals docks for loading or unloading many types products.This situation is very common in reality.This study also developed an exact mathematical model using mixedinteger linear programming(MILP)with the objective of minimizing the makespan to obtaint the benchmark in small scale problems.Large scale problems are solved through Simulated Annealing(SA)algorithm and Tabu Search(TS)algorithm.Performance of these algorithms will be compared to benchmarks obtained from solver as well as to each other.展开更多
This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special at...This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations.A Mixed Integer Program（MIP） model is constructed,and a two-stage heuristic algorithm is proposed.In the first stage an Ant Colony Optimization（ACO） algorithm is employed to generate the yard location assignment for discharging containers.In the second stage,the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem,and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms.展开更多
文摘The cross-docking is a very important subject in logistics and supply chain managements.According to the definition,cross-docking is a process dealing with transhipping inventory,in which goods and products are unloaded from an inbound truck and process through a flow-center to be directly loaded onto an outbound truck.Cross-docking is favored due to its advantages in reducing the material handing cost,the needs to store the product in warehouse,as well decreasing the labor cost by eliminating packaging,storing,pick-location and order picking.In cross-docking,products can be consolidated and transported as a full load,reducing overall distribution costs.In this paper,we focus on a truck scheduling at the multidoor,multi-crossdocking network with inventory constraints and process capability constraints.In this model,a truck can visit severals docks for loading or unloading many types products.This situation is very common in reality.This study also developed an exact mathematical model using mixedinteger linear programming(MILP)with the objective of minimizing the makespan to obtaint the benchmark in small scale problems.Large scale problems are solved through Simulated Annealing(SA)algorithm and Tabu Search(TS)algorithm.Performance of these algorithms will be compared to benchmarks obtained from solver as well as to each other.
基金supported by the National Nature Science Foundation of China under grant no.71102011
文摘This paper examines the yard truck scheduling,the yard location assignment for discharging containers,and the quay crane scheduling in container terminals.Taking into account the practical situation,we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations.A Mixed Integer Program（MIP） model is constructed,and a two-stage heuristic algorithm is proposed.In the first stage an Ant Colony Optimization（ACO） algorithm is employed to generate the yard location assignment for discharging containers.In the second stage,the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem,and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms.
