A hybrid constraint programming approach to the log-truck scheduling problem
From MaRDI portal
Publication:545549
DOI10.1007/s10479-010-0698-xzbMath1231.90186OpenAlexW2073479310MaRDI QIDQ545549
Michel Gendreau, Nizar El Hachemi, Louis-Martin Rousseau
Publication date: 22 June 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-010-0698-x
Related Items (5)
A hybrid constraint programming approach to a wood procurement problem with bucking decisions ⋮ Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations ⋮ The Combined Vehicle Routing and Foldable Container Scheduling Problem: A Model Formulation and Tabu Search Based Solution Approaches ⋮ Flow-based integer linear programs to solve the weekly log-truck scheduling problem ⋮ A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows
Uses Software
Cites Work
- A hybrid method for the planning and scheduling
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- Optimization in forestry
- Probe backtrack search for minimal perturbation in dynamic scheduling
- Crew assignment via constraint programming: Integrating column generation and heuristic tree search
- Models and algorithms for integration of vehicle and crew scheduling
- A solution approach for log truck scheduling based on composite pricing and branch and bound
- A near-exact method for solving the log-truck scheduling problem
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Search and strategies in OPL
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A hybrid constraint programming approach to the log-truck scheduling problem