Tug scheduling for hinterland barge transport: a branch-and-price approach
From MaRDI portal
Publication:1681331
DOI10.1016/j.ejor.2017.07.063zbMath1374.90182OpenAlexW2743467755MaRDI QIDQ1681331
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.063
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items (2)
A feature-extraction-based lightweight convolutional and recurrent neural networks adaptive computing model for container terminal liner handling volume forecasting ⋮ The assignment and loading transportation problem
Uses Software
Cites Work
- Distribution-free vessel deployment for liner shipping
- Tactical berth allocation under uncertainty
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows
- Fundamental properties and pseudo-polynomial-time algorithm for network containership sailing speed optimization
- An iterative two-phase hybrid matheuristic for a multi-product short sea inventory-routing problem
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Analysis of job assignment with batch arrivals among heterogeneous servers
- Assignment problems: a golden anniversary survey
- An exact algorithm for large multiple knapsack problems
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem
- Speed optimization and bunkering in liner shipping in the presence of uncertain service times and time windows at ports
- Branch-and-price approaches for the multiperiod technician routing and scheduling problem
- Revisiting a class of liner fleet deployment models
- A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
- Ship routing and scheduling in the new millennium
- Fleet routing position-based model for inventory pickup under production shutdown
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Terminal allocation problem in a transshipment hub considering bunker consumption
This page was built for publication: Tug scheduling for hinterland barge transport: a branch-and-price approach
