An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments

码头 卡车 排队 计算机科学 排队论 队列管理系统 运筹学 服务质量 计算机网络 工程类 汽车工程 操作系统 海洋工程
作者
Asefeh Hasani Goodarzi,Eleen Diabat,Armin Jabbarzadeh,Marc Paquet
出处
期刊:Computers & Operations Research [Elsevier BV]
卷期号:138: 105513-105513 被引量:11
标识
DOI:10.1016/j.cor.2021.105513
摘要

Cross-docking is a strategy to facilitate a persistent process from suppliers to the consumer points, without long-term storage of products at a distribution warehouse. Products are collected from various origins by inbound trucks, unloaded to the cross-dock, reconsolidated with other products, and finally loaded onto outbound trucks within the same or next day. Because of the limited number of dock-doors as the main resources and the uncertain arrival time of trucks at the cross-dock, queue problems in such environments are unavoidable. This study considers a vehicle routing problem (VRP) for a multi-door cross-docking system with a queuing approach. A real application of the proposed model can be found in congestion conditions at the cross-docking yard, when the queuing time of the vehicles (i.e., the queuing delay) may reduce the quality of service. Moreover, in some cases, improper queue management at a facility such as a cross-dock may incur an economic cost associated with the waiting time in the queue. In this study, we focus on the receiving doors of a cross-dock and assume that the rate of truck arrivals at the cross-dock is a random variable. Moreover, the cross-dock is not able to provide service to all vehicles simultaneously; it has some limitations such as capacity constraints and service time restrictions. Thus, an M/M/c queuing formulation is proposed to model this cross-docking environment, in which the vehicles’ dispatch plan for starting the pickup process would also be determined. In the proposed multi-channel queuing system, the arrival flow of trucks to the cross-docking terminal can be deemed as a Poisson process, resulting in a nonlinear mathematical formulation to optimize the problem. The model is then linearized. To handle its computational complexity, we develop a new Genetic Algorithm (GA) to obtain near-optimal solutions to the problem and compare them with those of the optimization software GAMS. Then, a sensitivity analysis is done on different parameters of the model, and their effect on transportation cost and waiting cost of vehicles in the queue is investigated. The results show that considering a queuing approach in this problem, even for a small-scale problem derived from a real case study, can improve the average waiting time of trucks in the queue considerably compared with the situation in which all parameters are assumed deterministic.

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
包容的剑完成签到 ,获得积分10
2秒前
等待的大炮完成签到,获得积分10
2秒前
注水萝卜完成签到 ,获得积分10
4秒前
Chem34完成签到,获得积分10
12秒前
14秒前
量子星尘发布了新的文献求助10
14秒前
hhh2018687完成签到,获得积分10
14秒前
14秒前
15秒前
15秒前
15秒前
15秒前
16秒前
16秒前
16秒前
16秒前
16秒前
16秒前
16秒前
嘒彼小星完成签到 ,获得积分10
16秒前
16秒前
17秒前
17秒前
17秒前
17秒前
18秒前
ri_290完成签到,获得积分10
18秒前
19秒前
nsc发布了新的文献求助30
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
nsc发布了新的文献求助10
21秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038039
求助须知:如何正确求助?哪些是违规求助? 3575756
关于积分的说明 11373782
捐赠科研通 3305574
什么是DOI,文献DOI怎么找? 1819239
邀请新用户注册赠送积分活动 892655
科研通“疑难数据库(出版商)”最低求助积分说明 815022