A hybrid method based on linear programming and tabu search for routing of logging trucks

DOI10.1016/J.COR.2007.12.012MaRDI QIDQ958445zbMATH OpenOpenAlexFDO

Authors Patrik Flisberg, Bertil Lidén, Mikael Rönnqvist

Publication date 4 December 2008

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11250/163861

zbMATH Keywords

linear programmingforestryroutingtabu searchOR in practice

Mathematics Subject Classification ID

Linear programming (90C05) Search theory (90B40)

Recommendations

• scientific article; zbMATH DE number 5282970
• Timber transport vehicle routing problems: formulation and heuristic solution
• A solution approach for log truck scheduling based on composite pricing and branch and bound
• A heuristic to solve the synchronized log-truck scheduling problem
• A hybrid constraint programming approach to the log-truck scheduling problem

Cites work

• scientific article; zbMATH DE number 1749225 (Why is no real title available?)
• A guide to vehicle routing heuristics
• A near-exact method for solving the log-truck scheduling problem
• A solution approach for log truck scheduling based on composite pricing and branch and bound
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
• A unified heuristic for a large class of vehicle routing problems with backhauls
• A unified tabu search heuristic for vehicle routing problems with time windows
• Optimization in forestry
• The multi-depot vehicle routing problem with inter-depot routes

Cited in

(19)

• scientific article; zbMATH DE number 5282970 (Why is no real title available?)
• AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
• Multiple vehicle synchronisation in a full truck-load pickup and delivery problem: a case-study in the biomass supply chain
• A heuristic to solve the synchronized log-truck scheduling problem
• Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
• Solution approaches for solving the log transportation problem
• Assessing the benefits of storage and transshipments yards in timber supply chains by a column generation + GRASP approach
• Fifty years of operational research in forestry
• A two-stage solution method for the annual dairy transportation problem
• Timber transport vehicle routing problems: formulation and heuristic solution
• Self-imposed time windows in vehicle routing problems
• Using Operational Research for Supply Chain Planning in the Forest Products Industry
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• A solution approach for log truck scheduling based on composite pricing and branch and bound
• The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches
• Memory and learning in metaheuristics
• A survey on matheuristics for routing problems
• Flow-based integer linear programs to solve the weekly log-truck scheduling problem

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A hybrid method based on linear programming and tabu search for routing of logging trucks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958445)