Consider the ordinary transportation problem with the objective to minimize the cost of transporting a single commodity from M warehouses to N demand locations. Each warehouse i has a finite capacity ki. We convert the above problem into a dual problem and construct a greedy algorithm to solve it

The purpose of this chapter is to solve multi-objective formulation for traveling salesman and transportation problems. Computations are based on real data for the road freight transportation of a Spanish company. The company was selected because of its importance in Spanish economy and market....

Situation des Ladungsverkehrs -- Neuere Ansätze der Transportplanung -- Ausgewählte Grundlagen der Touren- und Standortplanung -- Ein multikriterielles Location Routing Problem mit Abholungen, Auslieferungen, Umladungen und mehrfachem Fahrzeugeinsatz -- Problemdekomposition mit heuristischen...

Latent class models offer an alternative perspective to the popular mixed logit form, replacing the continuous distribution with a discrete distribution in which preference heterogeneity is captured by membership of distinct classes of utility description. Within each class, preference...

We study a distribution warehouse in which trailers need to be assigned to docks for loading or unloading. A parking lot is used as a buffer zone and transportation between the parking lot and the docks is performed by auxiliary resources called terminal tractors. Each incoming trailer has a...

Transportation problem at its general form consists in finding an optimum transportation plan of a product from the receiving centers to consuming centers, so that the transportation costs to be minimal

The evaluation of transport projects has become increasingly complex. Different aspects have to be taken into account and the consequences of the problems are usually far reaching and the different policy alternatives are numerous and difficult to predict. Several pressure or action groups have...