Search results
Results from the WOW.Com Content Network
In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781. [1] In the 1920s A.N. Tolstoi was one of the first to study the transportation problem mathematically.
Transshipment problems form a subgroup of transportation problems, where transshipment is allowed. In transshipment, transportation may or must go through intermediate nodes, possibly changing modes of transport. The Transshipment problem has its origins in medieval times [dubious – discuss] when trading started to become a mass phenomenon ...
The Chicago Area Transportation Study (CATS) researchers developed diversion curves for freeways versus local streets. There was much work in California also, for California had early experiences with freeway planning. In addition to work of a diversion sort, the CATS attacked some technical problems that arise when one works with complex networks.
Another related problem is the bottleneck travelling salesman problem: Find a Hamiltonian cycle in a weighted graph with the minimal weight of the weightiest edge. A real-world example is avoiding narrow streets with big buses. [15] The problem is of considerable practical importance, apart from evident transportation and logistics areas.
The first zonal trip generation (and its inverse, attraction) analysis in the Chicago Area Transportation Study (CATS) [2] followed the “decay of activity intensity with distance from the central business district (CBD)” thinking current at the time. Data from extensive surveys were arrayed and interpreted on a distance-from-CBD scale.
The berth allocation problem (also known as the berth scheduling problem) is a NP-complete problem in operations research, regarding the allocation of berth space for vessels in container terminals. Vessels arrive over time and the terminal operator needs to assign them to berths in order to be served (loading and unloading containers) as soon ...
A transport network, or transportation network, is a network or graph in geographic space, describing an infrastructure that permits and constrains movement or flow. [1] Examples include but are not limited to road networks , railways , air routes , pipelines , aqueducts , and power lines .
Inventory Routing Problem (IRP): Vehicles are responsible for satisfying the demands in each delivery point [7] Multi-Depot Vehicle Routing Problem (MDVRP): Multiple depots exist from which vehicles can start and end. [8] Vehicle Routing Problem with Transfers (VRPWT): Goods can be transferred between vehicles at specially designated transfer hubs.