Tunis's topographical and pictorial guide to Niagara : containing, also, a description of the route through Canada, and the great northern route, from Niagara Falls to Montreal, Boston, and Saratoga Springs. Also, full and accurate tables of distances on all railroads running to and from Niagara Falls. --

Cover title: Tunis's guide to Niagara and traveller's companion, illustrated.

The Canada Southern Railway, extending from Detroit and Toledo to Buffalo and Niagara Falls, forms the quickest and most attractive route between the west and the east.

Includes routes and rates: p.33-64.

A tour from the City of New-York, to Detroit, in the Michigan Territory, made between the 2d of May and the 22d of September, 1818 : the tour extends from New-York, by Albany, Schenectady, and Utica to Sacket's Harbor, and thence throught Lake Ontario, to St. Lawrence river, and down that stream to Hamilton village. Thence along both banks of the St. Lawrence, from Hamilton to the Thousand Islands; thence to Sacket's Harbor by water; from that place by the route of great Sodus, Geneva, Cananaigua and Batavia, to Buffalo; and from thence to Black Rock, Fort Erie, the Falls of Niagara, Queenston, Lewiston, and the memorable fields of Bridgewater and Chippewa after viewing the interesting place of Niagara, the author traversed the south shore of Lake Erie to the City of Detroit, and visited in the latter range, Dunkirk, Erie, Cleveland, Sandusky, and other places of less note. The tour is accompanied with a map upon which the route will be designated; a particular map of the Falls andRiver of Niagara, and the environs of the City of Detroit /

Errata slip inserted.

Using genetic algorithms for the single allocation hub location problem

Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on the Single Allocation Hub Location Problem (SAHLP). Genetic Algorithms (GAs) for the capacitated and uncapacitated variants of the SAHLP based on new chromosome representations and crossover operators are explored. The GAs is tested on two well-known sets of real-world problems with up to 200 nodes. The obtained results are very promising. For most of the test problems the GA obtains improved or best-known solutions and the computational time remains low. The proposed GAs can easily be extended to other variants of location problems arising in network design planning in transportation systems.

Niagara Navigation Company Limited: Buffalo-Niagara Falls-Toronto route (1911)

The Niagara Navigation Company Limited, popularly known as the Niagara River Line.

Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem

Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origin-destination links are impractical. This work investigates the single allocation hub location problem, and proposes a genetic algorithm (GA) approach for it. The effectiveness of using a single-objective criterion measure for the problem is first explored. Next, a multi-objective GA employing various fitness evaluation strategies such as Pareto ranking, sum of ranks, and weighted sum strategies is presented. The effectiveness of the multi-objective GA is shown by comparison with an Integer Programming strategy, the only other multi-objective approach found in the literature for this problem. Lastly, two new crossover operators are proposed and an empirical study is done using small to large problem instances of the Civil Aeronautics Board (CAB) and Australian Post (AP) data sets.

Iron Mountain Route Railway schedule: the great through line St. Louis, Arkansas and Texas to the Hot Springs of Arkansas

Iron Mountain Route Railway schedule: the great through line St. Louis, Arkansas and Texas to the Hot Springs of Arkansas.

Union Pacific Railway: the Kansas and Nebraska route schedule

Union Pacific Railway: the Kansas and Nebraska route schedule, 1882.

Le financement des municipalités par le gouvernement fédéral au Canada et aux États-Unis: transferts et facteurs d'allocation.

Rapport de recherche

Fair Production and Allocation of an Excludable Nonrival Good

We study fairness in economies with one private good and one partially excludable nonrival good. A social ordering function determines for each profile of preferences an ordering of all conceivable allocations. We propose the following Free Lunch Aversion condition: if the private good contributions of two agents consuming the same quantity of the nonrival good have opposite signs, reducing that gap improves social welfare. This condition, combined with the more standard requirements of Unanimous Indifference and Responsiveness, delivers a form of welfare egalitarianism in which an agent's welfare at an allocation is measured by the quantity of the nonrival good that, consumed at no cost, would leave her indifferent to the bundle she is assigned.

Efficient Strategy-Proof Allocation Functions in Linear Production Economies

In a linear production model, we characterize the class of efficient and strategy-proof allocation functions, and the class of efficient and coalition strategy-proof allocation functions. In the former class, requiring equal treatment of equals allows us to identify a unique allocation function. This function is also the unique member of the latter class which satisfies uniform treatment of uniforms.