Title of Dissertation: DYNAMIC DECISION MAKING FOR LESS-THAN-TRUCKLOAD TRUCKING OPERATIONS Behrang Hejazi, Doctor of Philosophy, 2009 Directed By: Professor Ali Haghani Department of Civil and Environmental Engineering On a typical day, more than 53 million tons of goods valued at about $36 million are moved on the US multimodal transportation network. An efficient freight transportation indust...

 Abstract: The shipments of hazardous materials (HAZMATs) induce various risks to the road network. Today, one of the major considerations of transportation system managers is HAZMATs shipments, due to the increasing demand of these goods (because it is more used in industry, agriculture, medicine, etc.), and the rising number of incidents that are associated to hazardous materials. This paper ...

In this paper, we present a mathematical programming model based on a timespace network representation for solving real-time transportation problems in forestry. We cover a wide range of unforeseen events that may disrupt the planned transportation operations (e.g., delays, changes in the demand and changes in the topology of the transportation network). Although each of these events has differ...

This note develops asymptotic formulae for single-commodity network flow problems with random inputs. The transportation linear programming problem (TLP) where N points lie in a region of R is one example. It is found that the average distance traveled by an item in the TLP increases with N; i.e., the unit cost is unbounded when N and the length of the region are increased in a fixed ratio. Fur...

inventory models play an important role in determining the optimal ordering and pricing policies. much work has been reported in literature regarding inventory models with finite or infinite replenishment. but in many practical situations the replenishment is governed by random factors like procurement, transportation, environmental condition, availability of raw material etc., hence, it is nee...

Motivated by an application in highway pricing, we consider the problem that consists in setting profit-maximizing tolls on a clique subset of a multicommodity transportation network. Following a proof that clique pricing is NP-hard, we propose strong valid inequalities, some of which define facets of the 2-commodity polyhedron. The numerical efficiency of these inequalities is assessed by embe...

In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs.  The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...

In this paper, we developed a supply chain network game theory model with differentiated products and transportation costs in the case of time-based oligopolistic competition. The firms are profit-maximizers and have, as their strategic variables, the product shipments and the guaranteed delivery times to the consumers at the demand markets with the guaranteed delivery times never exceeding the...