Abstract
Group line-haul operation involves the daily movement of trailers between a central breakbulk terminal and a set of end-of-line satellite terminals. When each tractor can pull two trailers, there are many possibilities for creating tractor tours that accomplish the required pickup, delivery, and empty-balancing operations. The challenge is to create optimal tours that minimize transportation costs. An optimization procedure is described that is based on a branch-and-bound framework. It involves Lagrangian relaxation for lower bounds and two upper-bound heuristics for solving this problem.
Original language | American English |
---|---|
Pages (from-to) | 12-23 |
Number of pages | 12 |
Journal | Transportation Research Record |
State | Published - 1987 |
Externally published | Yes |
ASJC Scopus subject areas
- Civil and Structural Engineering
- Mechanical Engineering