Improving LTL truck load utilization on line

DOI10.1016/j.ejor.2010.10.014zbMath1210.90028OpenAlexW1977793006MaRDI QIDQ531465

Bernhard Otten, Joris van de Klundert

Publication date: 29 April 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.014

zbMATH Keywords

heuristicstransportationpackingE-commerce

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Mathematical programming (90C99)

Related Items (2)

Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics ⋮ Two heuristic solution concepts for the vehicle selection problem in line haul transports

Cites Work

• Scheduling jobs with fixed start and end times
• On-line scheduling of jobs with fixed start and end times
• Stochastic on-line knapsack problems
• The CNN problem and other \(k\)-server variants
• Dynamic vehicle routing: Status and prospects
• The Dynamic and Stochastic Knapsack Problem
• Acceptance and Dispatching Policies for a Distribution Problem
• Diversion Issues in Real-Time Vehicle Dispatching
• A quasi-PTAS for unsplittable flow on line graphs
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Interval selection: Applications, algorithms, and lower bounds
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• A unified approach to approximating resource allocation and scheduling
• On-line single-server dial-a-ride problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improving LTL truck load utilization on line