A tabu search heuristic for the vehicle routing problem
Management Science
Tabu Search
Scheduling Transportation of Live Animals to Avoid the Spread of Diseases
Transportation Science
Adaptive memory search for multidemand multidimensional knapsack problems
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
A distance function to support optimized selection decisions
Decision Support Systems
A Decomposition Approach for the Inventory-Routing Problem
Transportation Science
The petrol station replenishment problem with time windows
Computers and Operations Research
Solving a rich vehicle routing and inventory problem using column generation
Computers and Operations Research
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Computers and Operations Research
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
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.