تعداد نشریات | 418 |
تعداد شمارهها | 10,006 |
تعداد مقالات | 83,641 |
تعداد مشاهده مقاله | 78,610,208 |
تعداد دریافت فایل اصل مقاله | 55,764,767 |
A set-covering formulation for a drayage problem with single and double container loads | ||
Journal of Industrial Engineering International | ||
دوره 14، شماره 4، اسفند 2018 اصل مقاله (441.71 K) | ||
نویسندگان | ||
A. Ghezelsoflu1؛ M. Di Francesco1؛ A. Frangioni2؛ P. Zuddas* 1 | ||
1Department of Mathematics and Computer Science, University of Cagliari, Cagliari, Italy | ||
2Department of Computer Science, University of Pisa, Pisa, Italy | ||
چکیده | ||
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality by a commercial solver, significantly outperforming a previously proposed node-arc formulation. Moreover, the model can be effectively used to evaluate a new distribution policy, which results in an enlarged set of feasible routes and can increase savings w.r.t. the policy currently employed by the carrier. | ||
کلیدواژهها | ||
Drayage Vehicle routing problem Street؛ turns Set covering | ||
آمار تعداد مشاهده مقاله: 76 تعداد دریافت فایل اصل مقاله: 67 |