A hybrid method based on linear programming and tabu search for routing of logging trucks
type: Item
instance of: scholarly article
title: A hybrid method based on linear programming and tabu search for routing of logging trucks
zbMATH Open document ID: 1162.90512
author: Patrik Flisberg
author: Bertil Lidén
author: Mikael Rönnqvist
published in: Computers \& Operations Research
publication date: 2008-12-04T00:00:00Z
full work available at URL: http://hdl.handle.net/11250/163861
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 5377409
zbMATH Keywords: forestry
zbMATH Keywords: routing
zbMATH Keywords: tabu search
zbMATH Keywords: linear programming
zbMATH Keywords: OR in practice
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W3125510483
cites work: A guide to vehicle routing heuristics
cites work: Q4532228
cites work: A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
cites work: A unified heuristic for a large class of vehicle routing problems with backhauls
cites work: The multi-depot vehicle routing problem with inter-depot routes
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
cites work: Optimization in forestry
cites work: A solution approach for log truck scheduling based on composite pricing and branch and bound
cites work: A near-exact method for solving the log-truck scheduling problem
DOI: 10.1016/J.COR.2007.12.012
description: scientific article; zbMATH DE number 5377409