A two-stage solution method for the annual dairy transportation problem

被引：23

作者：

Masson, Renaud ^{[1
,2
]}

Lahrichi, Nadia ^{[1
,2
]}

Rousseau, Louis-Martin ^{[1
,2
]}

机构：

[1] CIRRELT, CP 6128,Succ Ctr Wile, Montreal, PQ H3C 3J7, Canada

[2] Ecole Polytech Montreal, Dept Math & Genie Ind, Montreal, PQ, Canada

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2016年 / 251卷 / 01期

关键词：

Dairy transportation problem; Two-stage method; TRAVELING SALESMAN PROBLEM; VEHICLE-ROUTING PROBLEMS; MILK COLLECTION PROBLEM; TIME WINDOWS; ALGORITHM; PICKUP; OPTIMIZATION; HEURISTICS;

D O I：

10.1016/j.ejor.2015.10.058

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

The annual dairy transportation problem involves designing the routes that collect milk from farms and deliver it to processing plants. The demands of these plants can change from one week to the next, but the collection is fixed by contract and must remain the same throughout the year. While the routes are currently designed using the historical average demand from the plants, we show that including the information about plants demands leads to significant savings. We propose a two-stage method based on an adaptive large neighborhood search (ALNS). The first phase solves the transportation problem and the second phase ensures that the optimization of plant assignment is performed. An additional analysis based on period clustering is conducted to speed up the resolution. (C) 2015 Elsevier B.V. All rights reserved.

引用

页码：36 / 43

页数：8

共 30 条

[1]

[Anonymous], TECHNICAL REPORT

[2]

Basnet C, 1997, J OPER RES SOC, V48, P786

[3] An exact algorithm for a milk tanker scheduling and sequencing problem [J].