کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
479341 | 1446209 | 2007 | 19 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: A Lagrangian relaxation-based heuristic for the vehicle routing with full container load A Lagrangian relaxation-based heuristic for the vehicle routing with full container load](/preview/png/479341.png)
We address a problem of vehicle routing that arises in picking up and delivering full container load from/to an intermodal terminal. The substantial cost and time savings are expected by efficient linkage between pickup and delivery tasks, if the time of tasks and the suitability of containers for cargo allow. As this problem is NP-hard, we develop a subgradient heuristic based on a Lagrangian relaxation which enables us to identify a near optimal solution. The heuristic consists of two sub-problems: the classical assignment problem and the generalized assignment problem. As generalized assignment problem is also NP-hard, we employ an efficient solution procedure for a bin packing based problem, which replaces the generalized assignment problem. The heuristic procedure is tested on a wide variety of problem examples. The test results demonstrate that the procedure developed here can efficiently solve large instances of the problem.
Journal: European Journal of Operational Research - Volume 176, Issue 1, 1 January 2007, Pages 87–105