A solution approach for log truck scheduling based on composite pricing and branch and bound

DOI10.1111/1475-3995.00420zbMath1106.90316OpenAlexW2019943475MaRDI QIDQ3044067

Peter Värbrand, Myrna Palmgren, Mikael Rönnqvist

Publication date: 10 August 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00420

zbMATH Keywords

forestryvehicle routingbranch-and-boundpick up and deliverycomposite princing

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Traffic problems in operations research (90B20)

Related Items (11)

A Maritime Pulp Distribution Problem ⋮ The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches ⋮ Resource constrained routing and scheduling: review and research prospects ⋮ A Column Generation Model for Truck Routing in the Chilean Forest Industry ⋮ Using Operational Research for Supply Chain Planning in the Forest Products Industry ⋮ Integrated planning of loaded and empty container movements ⋮ Combined vehicle routing and scheduling with temporal precedence and synchronization constraints ⋮ Solution approaches for solving the log transportation problem ⋮ A hybrid method based on linear programming and tabu search for routing of logging trucks ⋮ A hybrid constraint programming approach to the log-truck scheduling problem ⋮ Flow-based integer linear programs to solve the weekly log-truck scheduling problem

Cites Work

• Unnamed Item
• The pickup and delivery problem with time windows
• The General Pickup and Delivery Problem

This page was built for publication: A solution approach for log truck scheduling based on composite pricing and branch and bound