Studying Two-Stage Vehicle Scheduling at Distribution Center Based on Cross-Docking Model

Author(s):  
Jing Gao ◽  
Ju-hong Gao
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Gustavo Correa Issi ◽  
Rodrigo Linfati ◽  
John Willmer Escobar

Cross-docking is a logistics strategy in which products arriving at a distribution center are unloaded from inbound trucks and sorted for transfer directly to outbound trucks, reducing costs and storage and product handling times. This paper addresses a cross-docking problem by designing a mixed-integer linear programming (MILP) model to determine a schedule for inbound and outbound trucks in a mixed service-mode dock area that minimizes the time from when the first inbound truck arrives until the last outbound truck departs (makespan). The model is developed using AMPL software with the CPLEX and Gurobi solvers, which provide results for different instances, most of these with actual shift data from an integrated distribution center of a multinational food company located in Concepción, Chile. The results obtained from the case study are notable and show the effectiveness of the proposed mathematical model.


CICTP 2020 ◽  
2020 ◽  
Author(s):  
Jinhao Zhang ◽  
Jingshuai Yang ◽  
Qingkai Liu ◽  
Haoyu Zhang

2013 ◽  
Vol 340 ◽  
pp. 581-586
Author(s):  
Zhu Wang

This thesis goes deep into the vehicle scheduling problem (VSP), which is the key problem for the distribution center.This paper analyzes and optimizes the mathematical model of vehicle scheduling problem. The problem of dynamic vehicle scheduling with time windows is described in great details in the thesis, which also gives an arithmetic solution aiming at the scheduling problem.Finally, based on the research results and under the background of logistics distribution enterprises, the vehicle scheduling algorithm is exposed to experiment.


Author(s):  
Jianying Zhong ◽  
Jibin Zhu ◽  
Yonghao Guo ◽  
Yunxin Chang ◽  
Chaofeng Zhu

Customer clustering technology for distribution process is widely used in location selection, distribution route optimization and vehicle scheduling optimization of power logistics distribution center. Aiming at the problem of customer clustering with unknown distribution center location, this paper proposes a clustering algorithm considering distribution network structure and distribution volume constraint, which makes up for the defect that the classical Euclidean distance does not consider the distribution road information. This paper proposes a logistics distribution customer clustering algorithm, which improves CLARANS algorithm to make the clustering results meet the constraints of customer distribution volume. By using the single vehicle load rate, the sufficient conditions for logistics distribution customer clustering to be solvable under the condition of considering the ubiquitous and constraints are given, which effectively solves the problem of logistics distribution customer clustering with sum constraints. The results state clearly that the clustering algorithm can effectively deal with large-scale spatial data sets, and the clustering process is not affected by isolated customers, The clustering results can be effectively applied to the distribution center location, distribution cost optimization, distribution route optimization and distribution area division of vehicle scheduling optimization.


Sign in / Sign up

Export Citation Format

Share Document