Domicile selection and risk pooling for trucking networks.: An article from: IIE Transactions
Book Details
Author(s)Randolph W. Hall
ISBN / ASINB00082BPEU
ISBN-13978B00082BPE6
AvailabilityAvailable for download now
MarketplaceUnited States 🇺🇸
Description
This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on April 1, 2004. The length of the article is 5999 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.
From the author: Less-than-TruckLoad (LTL) carriers transport small to medium sized shipments through networks of terminals. One of the issues in designing an LTL network is to determine how drivers should be distributed among locations, with the goal of reducing total variability through risk pooling. By concentrating drivers at a limited number of terminals, the carrier has greater flexibility to respond to random variations in demand, because they can be more readily shifted among routes. The problem is challenging because the risk-pooling objective is concave/minimization, leading to multiple locally optimal solutions. Each solution is defined by a rank ordering of terminals according to assigned demand. When a tour visits multiple terminals, it is assigned to the terminal with the highest rank (i.e., the one with the largest total demand). Based on the rank-ordering concept, a heuristic algorithm and an exact (branch-and-bound) algorithm are developed and applied to test problems. The exact algorithm offers reasonable computation times for moderately sized networks, typical of center-to-center routes of LTL carriers. For large networks, incorporating smaller end-of-line terminals in addition to centers, early termination of the algorithm seems to be a reasonable heuristic.
Citation Details
Title: Domicile selection and risk pooling for trucking networks.
Author: Randolph W. Hall
Publication:IIE Transactions (Refereed)
Date: April 1, 2004
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: 36 Issue: 4 Page: 299(7)
Distributed by Thomson Gale
From the author: Less-than-TruckLoad (LTL) carriers transport small to medium sized shipments through networks of terminals. One of the issues in designing an LTL network is to determine how drivers should be distributed among locations, with the goal of reducing total variability through risk pooling. By concentrating drivers at a limited number of terminals, the carrier has greater flexibility to respond to random variations in demand, because they can be more readily shifted among routes. The problem is challenging because the risk-pooling objective is concave/minimization, leading to multiple locally optimal solutions. Each solution is defined by a rank ordering of terminals according to assigned demand. When a tour visits multiple terminals, it is assigned to the terminal with the highest rank (i.e., the one with the largest total demand). Based on the rank-ordering concept, a heuristic algorithm and an exact (branch-and-bound) algorithm are developed and applied to test problems. The exact algorithm offers reasonable computation times for moderately sized networks, typical of center-to-center routes of LTL carriers. For large networks, incorporating smaller end-of-line terminals in addition to centers, early termination of the algorithm seems to be a reasonable heuristic.
Citation Details
Title: Domicile selection and risk pooling for trucking networks.
Author: Randolph W. Hall
Publication:IIE Transactions (Refereed)
Date: April 1, 2004
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: 36 Issue: 4 Page: 299(7)
Distributed by Thomson Gale
More Books by Randolph W. Hall
