期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 151, 期 3, 页码 520-535出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(02)00650-1
关键词
distribution; logistics; routing; transportation
In this paper we deal with the pickup and delivery of full truckloads under time window constraints. Our objective function is to minimize empty vehicle movements, as these use resources without directly adding value to the products transported. We first give an exact formulation of the problem. After that we present a relaxed problem formulation based on network flows, which can be used to calculate a lower bound to the solution value. Furthermore, we propose four different savings based heuristics for the problem. Our results show that these heuristics find very good solutions quickly. We also perform a sensitivity analysis by studying the impact of time window tightness on the performance of our heuristics. (C) 2002 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据