A tabu search approach for the livestock collection problem

被引：44

作者：

Oppen, Johan ^{[1
]}

Lokketangen, Arne ^{[1
]}

机构：

[1] Molde Univ Coll, Molde 6402, Norway

来源：

COMPUTERS & OPERATIONS RESEARCH | 2008年 / 35卷 / 10期

关键词：

vehicle routing problem (VRP); rich VRP; VRP with side constraints; VRP with inventory constraints; livestock transportation; tabu search;

D O I：

10.1016/j.cor.2007.02.021

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We present a problem dealing with transportation of live animals to slaughterhouses. The problem is taken from the Norwegian meat industry, and may be viewed as a vehicle routing problem extended with inventory constraints to ensure a smooth production flow at the slaughterhouse. In addition, several constraints to ensure animal welfare have to be met. These include duration limits for how long animals can stay on the vehicle as well as rules for mixing different animal categories. In this paper, we show that this real-world problem can be solved heuristically, even if it is large both in size and complexity. A tabu search based solution method for the problem is presented, and results from computational testing are given, including comparisons with manual solutions from today's planning system. (C) 2007 Elsevier Ltd. All rights reserved.

引用

页码：3213 / 3229

页数：17

共 21 条

[11] Adaptive memory search for Boolean optimization problems [J].