A tabu search approach for the livestock collection problem
From MaRDI portal
Publication:2482370
DOI10.1016/j.cor.2007.02.021zbMath1133.90311OpenAlexW2025355525MaRDI QIDQ2482370
Publication date: 16 April 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.021
tabu searchvehicle routing problem (VRP)rich VRPlivestock transportationVRP with inventory constraintsVRP with side constraints
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Case-oriented studies in operations research (90B90)
Related Items
Rich vehicle routing problems: from a taxonomy to a definition, A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands, Classification, models and exact algorithms for multi-compartment delivery problems, An iterated tabu search for the multi-compartment vehicle routing problem, Solving a rich vehicle routing and inventory problem using column generation, The prisoner transportation problem, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, Efficient GRASP solution approach for the prisoner transportation problem, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, Vehicle routing problems with multiple trips, Vehicle routing problems with multiple trips, The petrol station replenishment problem with time windows, A tabu search approach for the livestock collection problem, Restricted dynamic programming: a flexible framework for solving realistic VRPs, A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem, A multi-compartment vehicle routing problem in cold-chain distribution, Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A two-phase tabu search approach to the location routing problem
- Adaptive memory search for Boolean optimization problems
- A two-phase algorithm for the partial accessibility constrained vehicle routing problem
- A tabu search approach for the livestock collection problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Parallel iterative search methods for vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem