System and method for optimizing the utilization of a cargo space and for maximizing the revenue from a cargo transport

• US 20060015396A1
• Filed: 05/13/2005
• Published: 01/19/2006
• Est. Priority Date: 05/13/2004
• Status: Abandoned Application

• Current Assignee: Lufthansa Cargo AG (Deutsche Lufthansa AG)
• Original Assignee: Lufthansa Cargo AG (Deutsche Lufthansa AG)
• Inventors: Blomeyer, Johannes
• Application Number:
  US11/129,047
• Publication Number:
  US 20060015396A1
• Time in Patent Office: Days
• US Class Current: 705/13
• CPC Class Codes: G06Q 10/025 Coordination of plural reservations, e.g. plural trip segments, transportation combined with accommodation
• CPC Class Codes: G06Q 90/00 Systems or methods specially adapted for administrative, commercial, financial, managerial or supervisory purposes, not involving significant data processing

Abstract

The present invention relates to a process for the automatic maximization and/or optimization of the load, the chargeable weight, the revenue, the capacities and/or the cargo space of a cargo transport, particularly of an air-cargo transport, consisting of cargo of differing volume weight d, calculated as volume per weight, wherein a maximum cargo volume V_max and a maximum cargo weight W_max are predetermined for the cargo space. The process in accordance with the invention uses scaled values of volume weight and is based particularly on the optimization process of linear programming.

Claims

1. A method for optimizing the utilization of and/or maximizing revenue from a cargo space for a cargo transport, comprising:

recording incoming transport requests for cargo units n, and for each transport request, with regard to its volume V_n, its weight W_n, and, in given cases its rate r_n as price per chargeable weight unit cw,

determining the volume weights d_n of the cargo units n, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determining the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where d_s is a given standard volume weight;

determining whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd_n which is in a range of 0≦

sd_n<

0.5 or of 0.5 <

sd_n≦

1, and

accepting the transport request if it has an extreme scaled volume weight sd_n, insofar as the maximum capacity of cargo volume V_max and the maximum capacity of cargo weight W_max will not be exceeded on acceptance of the n^th transport request.

3. The method according to claim 1, wherein

incoming transport requests for cargo units n are recorded, and for each transport request, with regard to its volume V_n, its weight W_n, and, in given cases, its rate r_n as price per chargeable weight unit cw,

the volume weights d_n of the cargo units are determined, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

wherein based on the determined volume weight d_n, the scaled volume weight sd_n is determined, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

further comprising determining a still available capacity of volume V_rem, taking into account the maximum capacity of cargo volume V_max, and the still available capacity of weight W_rem, taking into account the maximum capacity of cargo weight W_max,

calculating the volume weight d_k of the still available capacity via d_k=V_rem/W_rem, and

if d_k=0, then sd_k=0,

if 0<

d_k≦

ds, then sd_k=d_k/2ds,

if ds<

d_k<

∞

, then sd_k=1−

ds/2d_n, and

if d_k=∞

, then sd_k=1, in which sd_k represents the scaled volume weight of the still available capacity d_k and where

if the weight W_rem>

0 and the volume V_rem≦

0, then the volume weight d_k=(V_rem/W_rem),

if the weight W_rem=0 and the volume V_rem<

0, then the volume weight d_k=∞

, and

if the weight W_rem=0 and the volume V_rem=0, then the volume weight d_k is indeterminate,

determining whether the scaled volume weight sd_k of the available capacity is smaller than, greater than, or the same as 0.5, and

if sd_k<

0.5, the transport request is accepted if sd_n<

sd_k or if 0≦

sd_n≦

0.5,

if sd_k>

0.5, the transport request is accepted if sd_n>

sd_k or if 0.5≦

s_dn≦

1, and

if sd_k=0.5, the transport request is accepted if 0≦

sd_n<

0.5 or 0.5<

sd_n≦

1,

insofar as the maximum capacity of cargo volume V_max and the maximum capacity of cargo weight W_max will not be exceeded on acceptance of the n^th transport request.

6. The method according to claim 1, wherein

incoming transport requests for cargo units n are recorded with regard to their volume V_n, their weight W_n, their chargeable weight unit cw, and their rate r_n per chargeable weight unit cw of the cargo unit n,

determining the volume weight d_n of the cargo units, where

if the weight W_n of the n^th cargo unit≧

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of>

0, then

the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determining the scaled volume weight sd_n, where,

if d_n=0, then s_d=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a standard volume weight,

on the basis of the determined amount of scaled volume weights sd_n, forming at least two volume weight classes K_x with lower and upper classes limits d_g, where no class K_x is formed which has a lower limit with an sd value<

0.5 and an upper limit with an sd value>

0.5,

calculating the volume weights of the class limits d_g in such a manner that

if sd_g=0, then d_g=0,

if 0<

sd_g≦

0.5, then d_g=2 sd_g×

ds,

if 0.5<

sd_g<

1, then d_g=ds/(2−

2 sd_g), and

if sd_g=1, then d_g=∞

, and

assigning the cargo units n to the volume weight classes K_x(d_n).

7. The method according to claim 1, further comprising:

recording forecasted cargo quantities with regard to their volume V_m, their weight W_m, their requested price r_m for the chargeable weight cw, of the cargo quantity m,

determining the volume weight d_m of the cargo units, where

if the weight W_m of the cargo quantity m≧

0 and the volume V_m of the cargo quantity m≧

0, then the volume weight d_m=(V_m/W_m),

if the weight W_m of the cargo quantity m=0 and the volume V_m>

0, then the volume weight d_m=∞

, and

if the weight W_m of the cargo quantity m=0 and the volume V_m=0, then the volume weight d_m is indeterminate,

based on the determined volume weight d_m, determining the scaled volume weight sd_m, where,

if d_m=0, then sd_m=0,

if 0<

d_m≦

ds, then sd_m=d_m/2ds,

if ds<

d_m<

∞

, then sd_m=1−

ds/2d_m, and

if d_m=∞

, then sd_m=1,

where ds is a given standard volume weight,

on the basis of the forecasted amount with the scaled volume weights sd_m, forming at least two volume weight classes K_z with lower and upper classes limits d_f, where no class K_z is formed which has a lower limit with an sd value<

0.5 and an upper limit with an sd value>

0.5,

calculating the volume weights d_f of the class limits in such a manner that

if sd_f=0, then d_f=0,

if 0<

sd_f≦

0.5, then d_f=2 sd_f×

ds,

if 0.5<

sd_f<

1, then d_f=ds/(2−

2 sd_f), and

if sd_f=1, then d_f=∞

, and

assigning the cargo amounts m to the volume weight classes K_z(d_m).

10. The method according to claim 1, further comprising:

defining an amount of incoming cargo transport requests via their respective requested volumes V_n, requested weights W_n, their attainable rates r_n expressed as price per chargeable weight unit cw, the volume weight d_n, and the scaled volume weight sd_n, where

the volume weight d_n of a cargo unit n is determined as follows, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determining the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight,

defining a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd_n requested in the transport requests and the region'"'"'s second dimension represents the requested rate r_n defined as price of the chargeable weight cw, where

the amount of the chargeable weight cw is defined as follows;

if W_n=0 and the volume V_n=0, then cw=0,

if 0<

d_n≦

ds, then cw=W_n×

1000, and

if ds<

d_n≦

∞

, then cw=V_n×

1000/ds,

and in the two-dimensional region of the coordinate system formed by the coordinate axes, to each of the value pairs formed from the scaled volume weight sd_n of a requested n^th cargo unit and its requested rate r_n, assigning a corresponding value pair point and determining the distances between value pair points whose corresponding scaled volume weight sd_n are in the range 0<

sd_n<

0.5, as well as the distances between value pair points whose corresponding scaled volume weight sd_n is in the range 0.5<

sd_n≦

1, and value pair points within these limits, in particular those at a small distance from one another, are grouped to form clusters and each assigned to a subregion i (r/sd class) with region limits within which there are value pairs of a cluster.

15. The method according to claim 1, further comprising:

defining forecasted cargo quantities with regard to their volume V_m, their weight W_m, their requested price r_m expressed as price of the chargeable weight cw, their volume weight d_m, and their scaled volume weight sd_m,

determining the volume weight d_m of the cargo units, where

if the weight W_m of the cargo quantity m>

0 and the volume V_m of the cargo quantity m≧

0, then the volume weight d_m=(V_m/W_m),

if the weight W_m of the cargo quantity m=0 and the volume V_m of the cargo quantity m>

0, then the volume weight d_m=∞

, and

if the weight W_m of the cargo quantity m=0 and the volume V_m of the cargo quantity m=0, then the volume weight d_m is indeterminate,

based on the determined volume weight d_m, determining the scaled volume weight sd_m, where,

if d_m=0, then sd_m=0,

if 0<

d_m≦

ds, then sd_m=d_m/2ds,

if ds<

d_m<

∞

, then sd_m=1−

ds/2d_m, and

if d_m=∞

, then sd_m=1,

where ds is a given standard volume weight,

defining a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd requested in the transport requests and the region'"'"'s second dimension represents the requested rate r defined as price of the chargeable weight cw, where the chargeable or billing weight cw is defined as follows;

if W_m=0 and the volume V_m=0, then cw=0,

if 0<

d_m≦

ds, then cw=W_m×

1000, and

if ds<

d_m≦

∞

, then cw=V_m×

1000/ds,

and in the two-dimensional region of the coordinate system formed by the coordinate axes, to each of the value pairs formed from the scaled volume weight sd_m of a forecasted cargo quantity m and its forecasted rate r_m, assigning a corresponding value pair point and determining the distances between value pair points whose corresponding scaled volume weight sd_n is in the range 0<

sd_m≦

0.5, as well as the distances between value pair points whose corresponding scaled volume weight sd_m is in the range 0.5<

sd_n<

1, and value pair points within these limits, in particular those at a small distance from one another, are grouped to form clusters and each assigned to a subregion (r/sd class) i with region limits within which there are value pairs of a cluster.

16. The method according to claim 10, wherein for a cargo unit n or a cargo quantity m with a weight W_n or W_m and a volume V_n or V_m, as chargeable weight cw of that value, is set, which, in amount, is the greater of the following two values

W_n/m×

1000 and 

 

(1)
V_n/m×

1000/ds, 

 

(2)

where ds is a standard volume weight.

17. The method according to claim 1, further comprising:

defining a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd requested in the transport requests and the region'"'"'s second dimension represents the requested rate r defined as price of the chargeable weight cw,

forming adjacent regions i with common boundary section in the two-dimensional region which form a continuous surface which is bounded along two sides by the intersecting coordinate axes, where the subregions i are, with regard to their values for the scaled volume weight sd, within the range 0<

sd≦

0.5 or in the range 0.5<

sd<

1, and

assigning an expected total value D_i in chargeable weight cw to each of the subregions i, said expected total value being the sum of the expected individual cargo transport requests whose corresponding value pairs, formed by the rate r per chargeable weight cw and the scaled volume weight sd, can be assigned to the scaled volume weight sd.

19. The method according to claim 1, further comprising:

accepting an incoming transport request for a cargo unit n if the rate to be expected r_n is greater than the expected associated lost profit bp_n, that is, the bid price, insofar as the maximum capacity of cargo volume V_max or the remaining volume capacity V_rem and the maximum capacity of cargo weight W_max or the remaining weight capacity W_rem will not be exceeded on acceptance of the transport request, and otherwise rejected, where the lost profit bp_n is determined or estimated via the equation

bp_n=w_n×

bpw+v_n×

pbv,

where

bp_n stands for the bid price of a unit of a chargeable weight cw of the requested cargo unit, bpw stands for the price of a chargeable weight cw which consists only of weight, that is, has a volume weight d=0, bpv stands for the price of a unit of a chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, w_n stands for the specific weight consumption and v_n for the specific volume consumption, where the specific weight consumption or volume consumption is defined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/d_s,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1, and

if d_n=∞

, then w_n=0 and v_n=1,

where d_n represents the volume weight of a cargo unit and ds represents the standard volume weight, and where bpw and bpv are determined by solving of the following problem, in particular by means of linear programming;

minimize

$R_F=W_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpw}+V_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpv}+\underset{i}{\sum <br><br>}<br><br>D_i\times <br><br>p_i$

subject to

w_i×

bpw+v_i×

bpv+p_i≧

r_i,

for all the (i)

bpv, bpw, p_i≧

0,

for all the (i)

where R_F stands for the revenue, W_rem stands for the still available weight capacity expressed in chargeable weight cw which consists only of weight, that is, has a volume weight d=0, V_rem stands for the still available volume capacity, expressed in a chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, D_i specifies the forecasted demand for the forecast domain or the subregion (r/sd class) i, expressed in chargeable weight cw, p_i specifies the profitability of the forecast domain i, expressed in currency unit per chargeable weight cw, and r_i expressed as price per chargeable weight cw specifies the rate of the forecast domain i, and where

the weight and volume coefficient w_i and v;

are defined as follows;

if 0<

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=d_i/ds and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

20. The method according to claim 19, further comprising applying the bid price bp_n of a transport request n as follows:

if r_n≧

bp_n, then the transport request n is to be accepted insofar as the maximum capacity of cargo volume V_max or the remaining volume capacity V_rem and the maximum capacity of cargo weight W_max or the remaining weight capacity W_rem will not be exceeded on acceptance of the n^th transport request, and

if r_n<

bp_n, then the transport request n is to be rejected,

where the bid price bp_n is derived as follows;

w_n×

bpw+v_n×

bpv, and

where r_n specifies the rate expressed as price per unit of chargeable weight cw, w_n specifies the specific weight consumption or the weight coefficients of a transport request, v_n specifies the specific volume consumption or the volume coefficients of a transport request, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, and bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, and where the weight and volume coefficients are determined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/d_s,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1, and

if d_n=∞

, then w_n=0 and v_n=1.

21. The method according to claim 19, wherein the bid price bp is represented as a function of the volume weight as follows:

if 0≦

d≦

ds, then bp=bpw+(d/ds×

bpv),

if ds<

d<

∞

, then bp=ds×

bpw/d+bpv, and

if d=∞

, then bp=bpv,

where bp specifies the bid price of a unit of a chargeable weight cw of the requested cargo unit, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, d specifies the volume weight, and ds specifies the standard volume weight.

22. The method according to claim 19, wherein the bid price bp is represented as a function of the scaled volume weight as follows:

if 0≦

sd≦

0.5, then bp=bpw+2sd ×

bpv,

if 0.5<

sd<

1, then bp=2(1−

sd)bpw+bpv, and

if sd=1, then bp=bpv,

where bp specifies the bid price, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, sd specifies the scale volume weight, and ds specifies the standard volume weight.

23. The method according to any one of claims 19-22, wherein the revenue R_F of a transport is maximized with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>r_i<br><br>x_i$

subject to

$\underset{i}{\sum <br><br>}<br><br>w_i<br><br>x_i\le <br><br>W_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$$\underset{i}{\sum <br><br>}<br><br>v_i<br><br>x_i\le <br><br>V_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$

x_i≦

D_i, for all the (i) and

x_i≧

0 for all the (i),

where the index i specifies the forecast domain or the subregion (r/sd class), x_i specifies to request to be accepted for the forecast domain i expressed in chargeable weight cw, D_i specifies the forecasted demand for the forecast domain i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, W_rem specifies the still available weight capacity expressed in chargeable weight cw which consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, and r_i specifies the rate of the forecast domain i, in particular in the form of an average value or weighted average value expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

24. The method according to any one of claims 19-22, wherein the revenue R_F and/or the remaining capacity which is expected to be unused, in particular the volume capacity and/or weight capacity which is expected to be unused, of a leg for a transport is determined with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>r_i<br><br>x_i$

subject to

$\underset{i}{\sum <br><br>}<br><br>w_i<br><br>x_i+\mathrm{sw}=W_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}$$\underset{i}{\sum <br><br>}<br><br>v_i<br><br>x_i+\mathrm{sv}=V_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}$

x_i+s_i=D_i,

for all the (i) and

s_i, sv, sw, x_i≧

0

for all the (i),

where R_F specifies the revenue over one leg of a transport, the index i specifies the forecast domain or the subregion (r/sd class), x_i specifies to request to be accepted for the forecast domain i expressed in chargeable weight cw, D_i specifies the forecasted demand for the forecast domain i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, W_rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in a chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, s_i, sv, and sw specify the slack variables for the request for the forecast domain i of the volume, in particular in the form of a chargeable weight which preferably consists only of volume, that is, has a volume weight d=∞

, or of the weight, in particular in the form of a chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, and r_i specifies the rate of the forecast domain i, in particular in the form of an average value or weighted average value expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

25. The method according to claim 24, wherein the expected demand for transport at a certain rate/volume weight class i is represented by D_i and the rate and volume weight which correspond to the rate/volume weight class i are represented by r_i and d_i, respectively.

26. The method according to claim 1, further comprising determining the revenue R_F for a leg for a transport, and/or the bid price bpw for a unit of a chargeable weight cw which consists only of weight, and/or the bid price bpv for a unit of a chargeable weight cw which consists only of volume, with the aid of linear optimization as follows:

minimize

$R_F=W_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpw}+V_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpv}+\underset{i}{\sum <br><br>}<br><br>D_i\times <br><br>p_i$

subject to

w_i×

bpw+v_i×

bpv+p_i≧

r_i,

for all the (i)

bpv, bpw, p_i≧

0,

for all the (i)

where R_F specifies the revenue, W_rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, D_i specifies the forecasted demand for the forecast domain or the subregion (r/sd class) i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, p_i specifies the profitability of the forecast domain i expressed in currency unit per chargeable weight cw, and r_i, expressed as price per chargeable weight cw specifies the rate of the forecast domain i, where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

27. The method according to claim 19, further comprising determining the revenue R_F and/or the remaining capacity which is expected to be unused, in particular volume capacity and/or weight capacity which is expected to be unused, for a transport with at least one segment by solving the following problems with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>r_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}$

subject to

$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>w_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+{\mathrm{sw}}_k=W_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>v_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+{\mathrm{sv}}_k=V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$

x_ij+s_ij=D_ij,

for all the (i, j) and

s_ij, sv_k, sw_k, x_ij>

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, the index k specifies the leg of a transport, j specifies the segment of a transport, i specifies the forecast domain or the subregion (r/sd class) of a segment, x_ij specifies the request to be accepted for the forecast domain i of the segment j expressed in chargeable weight cw, D_ij specifies the forecasted demand for the forecast domain i of the segment j expressed in chargeable weight cw, a_kj represents the index coefficient of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j, and where a_kj=1 if the leg k is a component of the segment j, w_ij specifies the weight coefficients for the forecast domain i of the segment j, v_ij specifies the volume coefficients for the forecast domain i, W_k-rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, of the leg k and V_k-rem specifies the still available volume capacity expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, of the leg k, s_ij, sv_k, and sw_k specify the slack variables for the request for the forecast domain i on the segment j of the volume of the leg k in the form of a chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, or of the weight of the leg k in the form of a chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, and r_ij specifies the rate of the forecast domain i of the segment j expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_ij and v_ij are defined as follows;

if 0<

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents the volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

28. The method according to claim 1, further comprising determining the revenue R_F and/or the bid price, in particular the volume-specific bid price bpv and/or the weight-specific bid price bpw, for a transport with at least one segment with the aid of linear optimization as follows:

minimize

$R_F=\underset{k}{\sum <br><br>}<br><br>W_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>{\mathrm{bpw}}_k+\underset{k}{\sum <br><br>}<br><br>V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>{\mathrm{bvp}}_k+\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>D_{\mathrm{ij}}\times <br><br>p_{\mathrm{ij}}$

subject to

Σ

a_kj w_ij×

bpw_k+Σ

a_kj v_ij×

bpv_k+p_ij≧

r_ij,

for all the (i, j)

bpv_k, bpw_k, p_ij>

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, W_k-rem specifies the still available weight capacity of the leg k expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_k-rem specifies the still available volume capacity of the leg k expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, bpw_k specifies the bid price of the weight capacity of the leg k, bpv_k specifies the bid price of the volume capacity of the leg k, D_ij specifies the forecasted demand for the forecast domain or the subregion (r/d class) i of the segment j expressed in chargeable weight cw, w_ij specifies the weight coefficients of the forecast domain i of the segment j, v_ij specifies the volume coefficients of the forecast domain i of the segment j, a_kj represents the index coefficient of the leg k on the segment j where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, and p_ij specifies the profitability of the forecast domain i of the segment j expressed in chargeable weight cw, and r_ij specifies the rate of the forecast domain i of the segment j, expressed as price per chargeable weight cw, where

the weight and volume coefficients w_ij and v_ij are determined as follows;

if 0≦

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents the volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

30. The method according to claim 1, wherein the cargo transport comprises at least one segment j with at least one leg k, the method further comprising determining the free capacity for a cargo transport relative to the volume weight of a cargo unit, including:

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, and the volume weight d_n, first determining the free capacity fc_j of a segment j as a function of the volume weight d_n via;

if 0<

sw_j≦

sv_j and 0≦

d_n≦

ds, then fc_j=sw_j,

if 0<

sw_j≦

sv_j and ds<

d_n≦

ds×

(sv_j/sw_j), then fc_j=(d/ds)×

sw_j,

0<

sw_j≦

sv_j and ds×

(sv_j/sw_j)<

d_n≦

∞

, then fc_j=sv_j,

if sw_j>

sv_j>

0 and 0≦

d_n≦

ds×

(sv_j/sw_j), then fc_j=sw_j,

if sw_j>

sv_j>

0 and ds×

(sv_j/sw_j)<

d_n≦

ds, then fc_j=(ds/d_n)×

sv_j,

if sw_j>

sv_j>

0 and ds<

d_n≦

∞

, then fc_j=sv_j,

if sw_j=0 and sv_j>

0 and 0≦

d_n<

∞

, then fc_j=0,

if sw_j=0 and sv_j>

0 and d_n=∞

, then fc_j=sv_j,

if sw_j>

0 and sv_j=0 and d_n=0, then fc_j=sw_j,

if sw_j>

0 and sv_j=0 and 0<

d_n≦

∞

, then fc_j=0, and

if sw_j=0 and sv_j=0, then fc_j=0,

where the preceding parameters have the following meanings;

sw_j represents the expected unused weight capacity of a segment j expressed in chargeable weight cw with the volume weight d=0, where sw_j is defined as Min {sw_k, for all k, for which ak_j=1},

sv_j represents the expected unused volume capacity of a segment j expressed in chargeable weight cw with the volume weight d=∞

, where sv_j is defined as Min {sv_k, for all k, for which ak_j=1 }, where

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j, and where

cw_n represents the chargeable weight cw of the transport request n,

fc_j represents the free available capacity with the volume weight d_n, expressed in chargeable weight cw, and

d represents the volume weight,

d_n represents the volume weight of a cargo unit n which is determined as follows;

if the weight W_n of the cargo unit n>

0 and the volume V_n of the cargo unit n≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

, and

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

ds represents the standard volume weight;

b) determining the chargeable weight cw_n of the transport request n according to;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

d_n≦

ds, then cw_n=W_n×

1000 and

if ds<

d_n≦

∞

, then cw_n=V_n1000/ds; and

c) if the chargeable weight cw_n<

fc_j, the transport request is accepted and, if the chargeable weight cw_n>

fc_j, the transport request is accepted, if, for the transport request of a cargo unit n, the bid price bp_n≦

r_n, and if V_n≦

V_rem and W_n≦

W_rem, and otherwise the transport request is rejected.

31. The method according to claim 30, wherein the bid price bp_j is determined via the equation

bp_j=w_n×

bpw_j+v_n×

bpv_j,

where

bp_j stands for the bid price of a unit of the chargeable weight cw, in particular of a chargeable kg, of the requested cargo unit or cargo amounts for a segment j with a volume weight d_n, bpw_j stands for the weight capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg, with the volume weight d_n=0, bpv_j stands for the volume capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg, with the volume weight d_n=∞

, where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k a_kj×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_kj×

a_kj×

bpv_k, where ak_j=1, if the leg k is contained in the segment j and where ak_j=0, if the leg k is not contained in the segment j, and where w_n stand for the specific weight consumption and where v_n stand for the specific volume consumption, where the specific weight consumption or the specific volume consumption is defined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/ds,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1,

if d_n=∞

, then w_n=0 and v_n=1 and

d_n represents the volume weight of a cargo unit or cargo amount and ds represents the standard volume weight, and where the bpw_k and bpv_k are determined by solving the following problem, in particular by means of linear programming;

minimize

$R_F=\underset{k}{\sum <br><br>}<br><br>W_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>{\mathrm{bpw}}_k+\underset{k}{\sum <br><br>}<br><br>V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>{\mathrm{bvp}}_k+\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>D_{\mathrm{ij}}\times <br><br>p_{\mathrm{ij}}$

subject to

Σ

a_kj w_ij×

bpw_k+Σ

a_kj v_ij×

bpv_k+p_ij≧

r_ij,

for all the (i, j)

bpv_k, bpw_k, p_ij≧

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, W_k-rem specifies the still available weight capacity of the leg k expressed in chargeable weight cw which only consists of weight, that is, has a volume weight d=0, and V_k-rem specifies the still available volume capacity of the leg k expressed in chargeable weight cw which only consists of volume, that is, has a volume weight d=∞

, bpw_k specifies for the bid price of the weight capacity of the leg k, bpv_k specifies the bid price of the volume capacity of the leg k, D_ij specifies the forecasted demand for the forecast domain or the subregion (r/d class) i of segment the j expressed in chargeable weight cw, w_ij specify the weight coefficients of the forecast domain i of the segment j, v_ij specify the volume coefficients of the forecast domain i of the segment j, a_kj represents the index coefficient of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, and p_ij specifies the profitability of the forecast domain i of the segment j, expressed in chargeable weight cw, and r_ij, in particular in the form of an average value or weighted average value, specifies the rate of the forecast domain i of the segment j expressed as price per chargeable weight cw, where

the weight and volume coefficients w_ij and v_ij are defined as follows;

if 0≦

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents a volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

32. The method according to claim 30, wherein the expected unused weight capacity sw_j of a segment j expressed in chargeable weight cw with the volume weight d=0, and the expected unused volume capacity sv_j of a segment j expressed in chargeable weight cw with the volume weight d=∞

are determined via Min {sw_k, for all k, for which ak_j=1 } and Min {sv_k, for all k, for which ak_j=1 }, and where the values for sw_k and sv_k are determined by solving the following problems with the aid of linear optimization;

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>r_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}$

subject to

$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>w_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+{\mathrm{sw}}_k=W_{k-\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>v_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+{\mathrm{sv}}_k=V_{k-\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$$x_{\mathrm{ij}}+s_{\mathrm{ij}}=D_{\mathrm{ij}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>\left(i,j\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{and}$$s_{\mathrm{ij}},{\mathrm{sv}}_k,{\mathrm{sw}}_k,x_{\mathrm{ij}}\ge <br><br>0,\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>\left(i,j\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{and}<br><br>\text{\hspace{1em}<br><br>}<br><br>k,$

where R_F specifies the revenue over a transport, the index k specifies the leg of a transport, j specifies the segment of a transport, i specifies the forecast domain and/or the subregion (r/d class) of a segment, x_ij specifies the request to be accepted for the forecast domain i of the segment j expressed in chargeable weight cw, D_ij specifies the forecast demand for the forecast domain i of the segment j expressed in chargeable weight cw, a_kj represents the index coefficients of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, w_ij specifies the weight coefficients for the forecast domain i of the segment j, v_ij specifies the volume coefficients for the forecast domain i, W_k-rem specifies the still available weight capacity expressed in chargeable weight cw which only consists of weight, that is, has a volume weight d=0 of the leg k, and V_k-rem specifies the still available volume capacity expressed in chargeable weight cw which only consists of volume, that is, has a volume weight d=∞

, of the leg k, and s_ij, sv_k, and sw_k specify the slack variables for the request for the forecast domain i on the segment j of the volume of the leg k, in particular in the form of a chargeable weight cw which only consists of volume, that is, has a volume weight of d=∞

, or of the weight of the leg k, in particular in the form of a chargeable weight cw which only consists of weight, that is, has a volume weight d=0, and r_ij specify the rate of the forecast domain i of the segment j, in particular in the form of an average value or weighted average value, expressed as a price per chargeable weight cw, where the weight and volume coefficients w_ij and v_ij are defined as follows;

if 0≦

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents a volume weight value from the domain i of the segment j in particular an average value or weighted average value.

33. The method according to claim 1, wherein the cargo transport comprises at least one segment j with at least one leg k, the method further comprising determining the free capacity for a cargo transport relative to the scaled volume weight of a cargo unit, including:

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, the chargeable weight cw_n, the volume weight d_n, and the scaled volume weight sd_n, first determining the free capacity fc_j of a segment j as a function of the scaled volume weight sd_n via;

if 0<

sw_j≦

sv_j and 0≦

sd_n≦

0.5, then fc_j=sw_j,

if 0<

sw_j≦

sv_j and 0.5<

sd_n≦

0.5×

(sv_j/sw_j), then fc_j=sw_j/(2(1−

sd_n)),

if 0<

sw_j≦

sv_j and 0.5×

(sv_j/sw_j)<

sd_n≦

1, then fc_j=sv_j,

if sw_j>

sv_j>

0 and 0≦

sd_n<

0.5×

(sv_j/sw_j), then fc_j=sw_j,

if sw_j>

sv_j>

0 and 0.5×

(sv_j/sw_j)<

sd_n≦

0.5, then fc_j=sv_j/2 sd_n,

if sw_j>

sv_j>

0 and 0.5<

sd_n≦

1, then fc_j=sv_j,

if sw_j=0 and sv_j>

0 and 0≦

sd_n<

1, then fc_j=0,

if sw_j=0 and sv_j>

0 and sd_n=1, then fc_j=sv_j,

if sw_j>

0 and sv_j=0 and sd_n=0, then fc_j=sw_j,

if sw_j>

0 and sv_j=0 and 0<

sd_n≦

1, then fc_j=0, and

if sw_j=0 and sv_j=0, then fc_j=0,

where the preceding parameters have the following meanings;

sw_j represents the expected unused weight capacity of a segment j expressed in chargeable weight cw with the volume weight d=0, where sw_j is defined as Min {sw_k, for all k, for which ak_j=1},

sv_j represents the expected unused volume capacity of a segment j expressed in chargeable weight cw with the volume weight d=∞

, where sv_j is defined as Min {sv_k, for all k, for which ak_j=1}, where

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j, and where

cw_n represents the chargeable weight cw of the transport request n,

fc_j represents the free available capacity with the scaled volume weight sd_n, expressed in chargeable weight cw, and

d_n represents the volume weight of a cargo unit n which is determined as follows;

if the weight W_n of the cargo unit n>

0 and the volume V_n of the cargo unit n≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=0 and

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determining the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

b) the chargeable weight cw is determined according to;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

sd_n≦

0.5, then cw_n=W_n×

1000 and

if 0.5<

sd_n≦

1, then cw_n=V_n1000/ds; and

c) if the chargeable weight cw_n≦

fc_j, the transport request is accepted and, if the chargeable weight cw_n>

fc_j, the transport request is accepted, if, the bid price determined for the transport request of a cargo unit n, bp_n, ≦

r_n, and if V_n≦

V_rem and W_n≦

W_rem, and otherwise the transport request is rejected.

35. The method according to claim 1, wherein the cargo transport comprises at least one segment j with at least one leg k, the method further comprising determining the revenue from the lowest-valued subregion of expected transport request (bid price) for a segment as a function of the volume weight d, wherein

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, and the volume weight d_n, the bid price bp_j is determined as follows:

if 0≦

d_n≦

ds, then bp_j=bpw_j+(d_n/ds)×

bpv_j,

if ds<

d_n<

∞

, then bp_j=(ds/d_n)×

bpw_j+bpv_j, and

if d_n=∞

, then bp_j=bpv_j,

where the preceding parameters have the following meaning;

d_n volume weight of the transport request,

ds standard volume weight,

bp_j bid price of the segment j at a volume weight d_n,

bpw_j weight capacity access price of the segment j expressed in price per chargeable weight cw with the volume weight d_n=0 (price of the weight capacity of the segment i),

bpv_j volume capacity access price of the segment j expressed in price per chargeable weight cw with the volume weight d_n=∞

(price of the volume capacity of the segment j),

where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k a_kj×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_k a_kj×

bpv_k,

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j, and where

the volume weight of a cargo unit n is determined as follows;

if the weight W_n of the cargo unit>

0 and the volume V_n of the cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

,

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

b) the chargeable weight cw_n of the transport request n is determined as follows;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

d_n≦

ds, then cw_n=W_n×

1000 and

if ds<

d_n≦

∞

, then cw_n=V_n×

1000/ds;

c) if the rate r_n≧

bp_j and if V_n≦

V_rem and W_n≦

W_rem, the transport request is accepted and, if the rate r_n<

bp_j, the transport request is rejected.

36. The method according to claim 1, wherein the cargo transport comprises at least one segment j with at least one leg k, the method further comprising determining the revenue from the lowest-valued subregion of expected transport request (bid price) for a segment as a function of the scaled volume weight sd, wherein

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, the volume weight d_n, and the scaled volume weight sd_n, the bid price bp_j is determined as follows:

if 0≦

sd_n<

0.5, then bp_j=bpw_j+2 sd_n×

bpv_j,

if 0.5<

sd_n<

1, then bp_j=2(1−

sd_n)×

bpw_j+bpv_j, and

if d_n=1, then bp_j=bpv_j,

where the preceding parameters have the following meaning;

d_n volume weight of the transport request

sd_n scaled volume weight of the transport request

bp_j bid price of the segment j at a scaled volume weight sd_n

bpw_j weight capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg with the volume weight d_n=0 (price of the weight capacity of the segment j),

bpv_j volume capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg with the volume weight d_n=∞

(price of the volume capacity of the segment j),

where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k a_kj×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_k ak_j×

bpv_k,

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j,

and where

the volume weight of a cargo unit n is determined as follows;

if the weight W_n of the cargo unit>

0 and the volume V_n of the cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

,

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d, determining the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

b) the chargeable weight cw_n of the transport request n is determined as follows;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0, if 0≦

sd_n≦

0.5, then cw_n=W_n×

1000 and

if 0.5<

sd_n≦

1, then cw_n=V_n×

1000/ds; and

c) if the rate r_n≧

2bp_j and if V_n≦

V_rem and W_n≦

W_rem, the transport request is accepted and, if the rate r_n<

bp_j, the transport request is rejected.

73. An article of manufacture comprising a computer-readable medium on which program instructions are stored, wherein when said program instructions are executed by a computer, the computer carries out all steps according to claim 1.

74. The method of claim 1, wherein determining whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd, comprises determining if sd_n is in a range of 0≦

sd_n<

0.4 or of 0.6<

sd_n≦

1.

75. The method of claim 1, wherein determining whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd_n comprises determining if sd_n is in a range of 0≦

sd_n≦

0.2 or of 0.8≦

sd_n≦

1.

76. The method of claim 3, wherein

if sd_k<

0.5, the transport request is accepted if sd_n<

sd_k or if 0≦

sd_n≦

0.4,

if sd_k>

0.5, the transport request is accepted if sd_n>

sd_k or if 0.6≦

sd_n≦

1, and

if sd_k=0.5, the transport request is accepted if 0≦

sd_n≦

0.4 or 0.6≦

sd_n≦

1.

77. The method of claim 3, wherein

if sd_k<

0.5, the transport request is accepted if sd_n<

sd_k or if 0≦

sd_n≦

0.2,

if sd_k>

0.5, the transport request is accepted if sd_n>

sd_k or if 0.8≦

d_n≦

1, and

if sd_k=0.5, the transport request is accepted if 0≦

sd_n≦

0.2 or 0.8≦

sd_n≦

1.

2. (canceled)

4-5. -5. (canceled)

8-9. -9. (canceled)

11-14. -14. (canceled)

18. (canceled)

29. (canceled)

34. (canceled)

37. A system for optimizing the utilization of and/or maximizing revenue from a cargo space for a cargo transport, said system comprising a processor configured to:

record incoming transport requests for cargo units n, and for each transport request, with regard to its volume V_n, its weight W_n, and, in given cases its rate r_n as price per chargeable weight unit cw,

determine the volume weights d_n of the cargo units n, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

determine whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd_n which is in a range of 0≦

sd_n<

0.5 or of 0.5<

sd_n≦

1, and

accept the transport request if it has an extreme scaled volume weight sd_n, insofar as the maximum capacity of cargo volume V_max and the maximum capacity of cargo weight W_max will not be exceeded on acceptance of the n^th transport request.

39. The system according to claim 37, wherein the processor is further configured to:

record incoming transport requests for cargo units n, and for each transport request, with regard to its volume V_n, its weight W_n, and, in given cases, its rate r_n as price per chargeable weight unit cw,

determine the volume weights d_n of the cargo units, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n<

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

determine a still available capacity of volume V_rem, taking into account the maximum capacity of cargo volume V_max, and the still available capacity of weight W_rem, taking into account the maximum capacity of cargo weight W_max,

calculate the volume weight d_k of the still available capacity via d_k=V_rem/W_rem, and

if d_k=0, then sd_k=0,

if 0<

d_k≦

ds, then sd_k=d_k/2ds,

if ds<

d_k<

∞

, then sd_k=1−

ds/2d_k, and

if d_k=∞

, then sd_k=1, in which sd_k represents the scaled volume weight of the still available capacity d_k and where

if the weight W_rem>

0 and the volume V_rem>

0, then the volume weight d_k=(V_rem/W_rem),

if the weight W_rem=0 and the volume V_rem>

0, then the volume weight d_k=∞

, and

if the weight W_rem=0 and the volume V_rem=0, then the volume weight d_k is indeterminate,

determine whether the scaled volume weight sd_k of the available capacity is smaller than, greater than, or the same as 0.5, and

if sd_k<

0.5, accept the transport request if sd_n<

sd_k or if 0≦

sd_n≦

0.5,

if sd_k>

0.5, accept the transport request if sd_n>

sd_k or if 0.5≦

sd_n≦

1, and

if sd_k=0.5, accept the transport request if 0≦

sd_n<

0.5 or 0.5<

sd_n≦

1,

insofar as the maximum capacity of cargo volume V_max and the maximum capacity of cargo weight W_max will not be exceeded on acceptance of the n^th transport request.

42. The system according to claim 37, wherein the processor is further configured to:

record incoming transport requests for cargo units n with regard to their volume V_n, their weight W_n, their chargeable weight unit cw, and their rate r_n per chargeable weight unit cw of the cargo unit n,

determine the volume weight d_n of the cargo units, where

if the weight W_n of the n^th cargo unit≧

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n, determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if d_s<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a standard volume weight,

on the basis of the determined amount of scaled volume weights sd_n, form at least two volume weight classes K_x with lower and upper classes limits d_g, where no class K_x is formed which has a lower limit with an sd value<

0.5 and an upper limit with an sd value>

0.5,

calculate the volume weights of the class limits d_g in such a manner that

if sd_g=0, then d_g=0,

if 0<

sd_g<

0.5, then d_g=2 sd_g×

ds,

if 0.5<

sd_g<

1, then d_g=ds/(2−

2 sd_g), and

if sd_g=1, then d_g=∞

, and

assign the cargo units n to the volume weight classes K_x(d_n).

43. The system according to claim 37, wherein the processor is further configured to:

record forecasted cargo quantities with regard to their volume V_m, their weight W_m, their requested price r_m for the chargeable weight cw, of the cargo quantity m,

determine the volume weight d_m of the cargo units, where

if the weight W_m of the cargo quantity m≧

0 and the volume V_m of the cargo quantity m≧

0, then the volume weight d_m=(V_m/W_m),

if the weight W_m of the cargo quantity m=0 and the volume V_m>

0, then the volume weight d_m=∞

, and

if the weight W_m of the cargo quantity m=0 and the volume V_m=0, then the volume weight d_m is indeterminate,

based on the determined volume weight d_m, determine the scaled volume weight sd_m, where,

if d_m=0, then sd_m=0,

if 0<

d_m≦

ds, then sd_m=d_m/2ds,

if ds<

d_m<

∞

, then sd_m=1−

ds/2d_m, and

if d_m=∞

, then sd_m=1,

where ds is a given standard volume weight,

on the basis of the forecasted amount with the scaled volume weights sd_m, form at least two volume weight classes K_z with lower and upper classes limits d_f, where no class K_z is formed which has a lower limit with an sd value<

0.5 and an upper limit with an sd value>

0.5,

calculate the volume weights d_f of the class limits in such a manner that

if sd_f=0, then d_f=0,

if 0<

sd_f≦

0.5, then d_f=2 sd_f×

ds,

if 0.5<

sd_f<

1, then d_f=ds/(2−

2 sd_f), and

if sd_f=1, then d_f=∞

, and

assign the cargo amounts m to the volume weight classes K_z(d_m).

46. The system according to claim 37, wherein the processor is further configured to:

define an amount of incoming cargo transport requests via their respective requested volumes V_n, requested weights W_n, their attainable rates r_n expressed as price per chargeable weight unit cw, the volume weight d_n, and the scaled volume weight sd_n,

determine the volume weight d_n of a cargo unit n as follows, where

if the weight W_n of the n^th cargo unit>

0 and the volume V_n of the n^th cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit>

0, then the volume weight d_n=∞

, and

if the weight W_n of the n^th cargo unit=0 and the volume V_n of the n^th cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d_n determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight,

define a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd_n requested in the transport requests and the region'"'"'s second dimension represents the requested rate r_n defined as price of the chargeable weight cw, where

the amount of the chargeable weight cw is defined as follows;

if W_n=0 and the volume V_n=0, then cw=0,

if 0<

d_n≦

ds, then cw=W_n×

1000, and

if ds<

d_n≦

∞

, then cw=V_n×

1000/ds,

and in the two-dimensional region of the coordinate system formed by the coordinate axes, to each of the value pairs formed from the scaled volume weight sd_n of a requested n^th cargo unit and its requested rate r_n, assign a corresponding value pair point and determine the distances between value pair points whose corresponding scaled volume weight sd_n are in the range 0<

sd_n≦

0.5, as well as the distances between value pair points whose corresponding scaled volume weight sd, is in the range 0.5<

sd_n≦

1, and group value pair points within these limits, in particular those at a small distance from one another, to form clusters and each assigned to a subregion i (r/sd class) with region limits within which there are value pairs of a cluster.

51. The system according to claim 37, wherein the processor is further configured to:

define forecasted cargo quantities with regard to their volume V_m, their weight W_m, their requested price r_m expressed as price of the chargeable weight cw, their volume weight d_m, and their scaled volume weight sd_m,

determine the volume weight d_m of the cargo units, where

if the weight W_m of the cargo quantity m>

0 and the volume V_m of the cargo quantity m≧

0, then the volume weight d_m=(V_m/W_m),

if the weight W_m of the cargo quantity m=0 and the volume V_m of the cargo quantity m>

0, then the volume weight d_m=∞

, and

if the weight W_m of the cargo quantity m=0 and the volume V_m of the cargo quantity m=0, then the volume weight d_m is indeterminate,

based on the determined volume weight d_m, determine the scaled volume weight sd_m, where,

if d_m=0, then sd_m=0,

if 0<

d_m≦

ds, then sd_m=d_m/2ds,

if ds<

d_m<

∞

, then sd_m=1−

ds/2d_m, and

if d_m=∞

, then sd_m=1,

where ds is a given standard volume weight,

define a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd requested in the transport requests and the region'"'"'s second dimension represents the requested rate r defined as price of the chargeable weight cw, where the chargeable weight cw is defined as follows;

if W_m=0 and the volume V_m=0, then cw=0,

if 0<

d_m≦

ds, then cw=W_m×

1000, and

if ds<

d_m≦

∞

, then cw=V_m×

1000/ds,

and in the two-dimensional region of the coordinate system formed by the coordinate axes, to each of the value pairs formed from the scaled volume weight sd_m of a forecasted cargo quantity m and its forecasted rate r_m, assign a corresponding value pair point and determine the distances between value pair points whose corresponding scaled volume weight sd_n is in the range 0<

sd_m≦

0.5, as well as the distances between value pair points whose corresponding scaled volume weight sd_m is in the range 0.5<

sd_n<

1, and group value pair points within these limits, in particular those at a small distance from one another, to form clusters and each assigned to a subregion (r/sd class) i with region limits within which there are value pairs of a cluster.

52. The system according to claims 46, wherein for a cargo unit n or a cargo quantity m with a weight W_n or W_m and a volume V_n or V_m, as chargeable weight cw of that value, is set, which, in amount, is the greater of the following two values

W_n/m×

1000  

 

(1)

and

V_n/m×

1000/ds, 

 

(2)

where ds is a standard volume weight.

53. The system according to claim 37, wherein the processor is further configured to:

define a two-dimensional region including two intersecting coordinate axes, where the region'"'"'s first dimension indirectly or directly represents the range of the scaled volume weight sd requested in the transport requests and the region'"'"'s second dimension represents the requested rate r defined as price of the chargeable weight cw,

form adjacent regions i with common boundary section in the two-dimensional region which form a continuous surface which is bounded along two sides by the intersecting coordinate axes, where the subregions i are, with regard to their values for the scaled volume weight sd, within the range 0<

sd≦

0.5 or in the range 0.5<

sd<

1, and

assign an expected total value D_i in chargeable weight cw to each of the subregions i, said expected total value being the sum of the expected individual cargo transport requests whose corresponding value pairs, formed by the rate r per chargeable weight cw and the scaled volume weight sd, can be assigned to the scaled volume weight sd.

55. The system according to claim 37, wherein the processor is further configured to:

accept an incoming transport request for a cargo unit n if the rate to be expected r_n is greater than the expected associated lost profit bp_n, that is, the bid price, insofar as the maximum capacity of cargo volume V_max or the remaining volume capacity V_rem and the maximum capacity of cargo weight W_max or the remaining weight capacity W_rem will not be exceeded on acceptance of the transport request, and otherwise rejected, where the lost profit bp_n is determined or estimated via the equation

bp_n=w_n×

bpw+v_n×

pbv,

where

bp_n stands for the bid price of a unit of a chargeable weight cw of the requested cargo unit, bpw stands for the price of a chargeable weight cw which consists only of weight, that is, has a volume weight d=0, bpv stands for the price of a unit of a chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, w_n stands for the specific weight consumption and v_n for the specific volume consumption, where the specific weight consumption or volume consumption is defined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/ds,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1, and

if d_n=∞

, then w_n=0 and v_n=1,

where d_n represents the volume weight of a cargo unit and ds represents the standard volume weight, and where bpw and bpv are determined by solving of the following problem, in particular by means of linear programming;

minimize

$R_F=W_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>\mathrm{bpw}+V_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpv}+\underset{i}{\sum <br><br>}<br><br>D_i\times <br><br>p_i$

subject to

w_i×

bpw+v_i×

bpv+p_i≧

r_i,

for all the (i)

bpv, bpw, p_i≧

0,

for all the (i)

where R_F stands for the revenue, W_rem stands for the still available weight capacity expressed in chargeable weight cw which consists only of weight, that is, has a volume weight d=0, V_rem stands for the still available volume capacity, expressed in a chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, D_i specifies the forecasted demand for the forecast domain or the subregion (r/sd class) i, expressed in chargeable weight cw, p_i specifies the profitability of the forecast domain i, expressed in currency unit per chargeable weight cw, and r_i expressed as price per chargeable weight cw specifies the rate of the forecast domain i, and where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0<

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=d_i/ds and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

56. The system according to claim 55, wherein the processor is further configured to apply the bid price bp_n of a transport request n as follows:

if r_n≧

bp_n, then accept the transport request n insofar as the maximum capacity of cargo volume V_max or the remaining volume capacity V_rem and the maximum capacity of cargo weight W_max or the remaining weight capacity W_rem will not be exceeded on acceptance of the n^th transport request, and

if r_n<

bp_n, then reject the transport request n,

where the bid price bp_n is derived as follows;

w_n×

bpw+v_n×

bpv, and

where r_n specifies the rate expressed as price per unit of chargeable weight cw, w_n specifies the specific weight consumption or the weight coefficients of a transport request, v_n specifies the specific volume consumption or the volume coefficients of a transport request, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, and bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, and where the weight and volume coefficients are determined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/ds,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1, and

if d_n=∞

, then w_n=0 and v_n=1.

57. The system according to claim 55, wherein the bid price bp is represented as a function of the volume weight as follows:

if 0≦

d≦

ds, then bp=bpw+(d/ds×

bpv),

if ds<

d<

∞

, then bp=ds×

bpw/d+bpv, and

if d=∞

, then bp=bpv,

where bp specifies the bid price of a unit of a chargeable weight cw of the requested cargo unit, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, d specifies the volume weight, and ds specifies the standard volume weight.

58. The system according to claim 55, wherein the bid price bp is represented as a function of the scaled volume weight as follows:

if 0≦

sd≦

0.5, then bp=bpw+2 sd×

bpv,

if 0.5<

sd<

1, then bp=2(1−

sd)bpw+bpv, and

if sd=1, then bp=bpv,

where bp specifies the bid price, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, sd specifies the scale volume weight, and ds specifies the standard volume weight.

59. The system according to any one of claims 55-58, wherein the processor is further configured to maximize the revenue R_F of a transport with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>r_i<br><br>x_i$

subject to

$\underset{i}{\sum <br><br>}<br><br>w_i<br><br>x_i\le <br><br>W_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$$\underset{i}{\sum <br><br>}<br><br>v_i<br><br>x_i\le <br><br>V_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$$x_i\le <br><br>D_i,\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>\left(i\right)<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{and}$$x_i\ge <br><br>0<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>\left(i\right),$

where the index i specifies the forecast domain or the subregion (r/sd class), x_i specifies to request to be accepted for the forecast domain i expressed in chargeable weight cw, D_i specifies the forecasted demand for the forecast domain i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, W_rem specifies the still available weight capacity expressed in chargeable weight cw which consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in chargeable weight cw which consists only of volume, that is, has a volume weight d=∞

, and r_i specifies the rate of the forecast domain i, in particular in the form of an average value or weighted average value expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

d_i≦

ds, then w_i=1 and v_{i =di}/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

60. The system according to any one of claims 55-58, wherein the processor is further configured to determine the revenue R_F and/or the remaining capacity which is expected to be unused, in particular the volume capacity and/or weight capacity which is expected to be unused, of a leg for a transport, with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>r_i<br><br>x_i$

subject to

$\underset{i}{\sum <br><br>}<br><br>w_i<br><br>x_i+\mathrm{sw}=W_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$$\underset{i}{\sum <br><br>}<br><br>v_i<br><br>x_i+\mathrm{sv}=V_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}$

x_i+s_i=D_i,

for all the (i) and

s_i, sv, sw, x_i23 0

for all the (i)

where R_F specifies the revenue over one leg of a transport, the index i specifies the forecast domain or the subregion (r/sd class), x_i specifies to request to be accepted for the forecast domain i expressed in chargeable weight cw, D_i specifies the forecasted demand for the forecast domain i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, W_rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in a chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, s_i, sv, and sw specify the slack variables for the request for the forecast domain i of the volume, in particular in the form of a chargeable weight which preferably consists only of volume, that is, has a volume weight d=∞

, or of the weight, in particular in the form of a chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, and r_i specifies the rate of the forecast domain i, in particular in the form of an average value or weighted average value expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

di≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

61. The system according to claim 60, wherein the expected demand for transport at a certain rate/volume weight class i is represented by D_i and the rate and volume weight which correspond to the rate/volume weight class i are represented by r_i and d_i, respectively.

62. The system according to claim 37, wherein the processor is further configured to determine the revenue R_F for a leg for a transport, and/or the bid price bpw for a unit of a chargeable weight cw which consists only of weight, and/or the bid price bpv for a unit of a chargeable weight cw which consists only of volume, with the aid of linear optimization as follows:

minimize

$R_F=W_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>\mathrm{bpw}+V_{\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>\mathrm{bpv}+\underset{i}{\sum <br><br>}<br><br>D_i\times <br><br>p_i$

subject to

w_i×

bpw+v_i×

bpv+p_i≧

r_i,

for all the (i)

bpv, bpw, p_i≧

0,

for all the (i)

where R_F specifies the revenue, W_rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_rem specifies the still available volume capacity expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, bpw specifies the price of a unit of a chargeable weight cw which consists only of weight, bpv specifies the price of a unit of a chargeable weight cw which consists only of volume, D_i specifies the forecasted demand for the forecast domain or the subregion (r/sd class) i expressed in chargeable weight cw, w_i specifies the weight coefficients of the forecast domain i, v_i specifies the volume coefficients of the forecast domain i, p_i specifies the profitability of the forecast domain i expressed in currency unit per chargeable weight cw, and r_i, expressed as price per chargeable weight cw specifies the rate of the forecast domain i, where

the weight and volume coefficient w_i and v_i are defined as follows;

if 0≦

d_i≦

ds, then w_i=1 and v_i=d_i/ds,

if ds<

d_i<

∞

, then w_i=ds/d_i and v_i=1, and

if d_i=∞

, then w_i=0 and v_i=1, where

d_i represents the volume weight value from the domain i, in particular an average value or weighted average value.

63. The system according to claim 55, wherein the processor is further configured to determine the revenue R_F and/or the remaining capacity which is expected to be unused, in particular volume capacity and/or weight capacity which is expected to be unused, for a transport with at least one segment, by solving the following problems with the aid of linear optimization as follows:

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>r_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}$

subject to

$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>w_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+s<br><br>\text{\hspace{1em}<br><br>}<br><br>w_k=W_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>v_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+s<br><br>\text{\hspace{1em}<br><br>}<br><br>v_k=V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$

x_ij+s_ij=D_ij,

for all the (i, j) and

s_ij, sv_k, sw_k, x_ij≧

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, the index k specifies the leg of a transport, j specifies the segment of a transport, i specifies the forecast domain or the subregion (r/sd class) of a segment, x_ij specifies the request to be accepted for the forecast domain i of the segment j expressed in chargeable weight cw, D_ij specifies the forecasted demand for the forecast domain i of the segment j expressed in chargeable weight cw, a_kj represents the index coefficient of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j, and where a_kj=1 if the leg k is a component of the segment j, w_ij specifies the weight coefficients for the forecast domain i of the segment j, v_ij specifies the volume coefficients for the forecast domain i, W_k-rem specifies the still available weight capacity expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, of the leg k and V_k-rem specifies the still available volume capacity expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, of the leg k, s_ij, sv_k, and sw_k specify the slack variables for the request for the forecast domain i on the segment j of the volume of the leg k in the form of a chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

, or of the weight of the leg k in the form of a chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, and r_ij specifies the rate of the forecast domain i of the segment j expressed as price per chargeable weight cw, and where

the weight and volume coefficient w_ij and v_ij are defined as follows;

if 0<

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

m then w_ij=0 and v_ij=1, where

d_ij represents the volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

64. The system according to claim 37, wherein the processor is further configured to determine the revenue R_F and/or the bid price, in particular the volume-specific bid price bpv and/or the weight-specific bid price bpw, for a transport with at least one segment, with the aid of linear optimization as follows:

minimize

$R_F=\underset{k}{\sum <br><br>}<br><br>W_{k-\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>b<br><br>\text{\hspace{1em}<br><br>}<br><br>p<br><br>\text{\hspace{1em}<br><br>}<br><br>w_k+\underset{k}{\sum <br><br>}<br><br>V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>b<br><br>\text{\hspace{1em}<br><br>}<br><br>p<br><br>\text{\hspace{1em}<br><br>}<br><br>v_k+\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>D_{\mathrm{ij}}\times <br><br>p_{\mathrm{ij}}$

subject to

Σ

a_kj w_ij×

bpw_k+Σ

a_kj v_ij×

bpv_k+p_ij≧

r_ij,

for all the (i, j)

bpv_k, bpw_k, p_ij≧

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, W_k-rem specifies the still available weight capacity of the leg k expressed in chargeable weight cw which preferably consists only of weight, that is, has a volume weight d=0, V_k-rem specifies the still available volume capacity of the leg k expressed in chargeable weight cw which preferably consists only of volume, that is, has a volume weight d=∞

,1 bpw_k specifies the bid price of the weight capacity of the leg k, bpv_k specifies the bid price of the volume capacity of the leg k, D_ij specifies the forecasted demand for the forecast domain or the subregion (r/d class) i of the segment j expressed in chargeable weight cw, w_ij specifies the weight coefficients of the forecast domain i of the segment j, v_ij specifies the volume coefficients of the forecast domain i of the segment j, a_kj represents the index coefficient of the leg k on the segment j where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, and p_ij specifies the profitability of the forecast domain i of the segment j expressed in chargeable weight cw, and r_ij specifies the rate of the forecast domain i of the segment j, expressed as price per chargeable weight cw, where

the weight and volume coefficients w_ij and v_ij are determined as follows;

if 0≦

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents the volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

66. The system according to claim 37, wherein the cargo transport comprises at least one segment j with at least one leg k, in which the processor is further configured to determine the free capacity for a cargo transport relative to the volume weight of a cargo unit, in which the processor is configured to:

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, and the volume weight d_n, first determine the free capacity fc_j of a segment j as a function of the volume weight d_n via;

if 0<

sw_j≦

sv_j and 0≦

d_n≦

ds, then fc_j=sw_j,

if 0<

sw_j≦

sv_j and ds<

d_n≦

ds×

(sv_j/sw_j), then fc_j=(d/ds)×

sw_j,

if 0<

sw_j≦

sv_j and ds×

(sv_j/sw_j)<

d_n≦

∞

, then fc_j=sv_j,

if sw_j>

sv_j>

0 and 0≦

d_n≦

ds×

(sv_j/sw_j), then fc_j=sw_j,

if sw_j>

sv_j>

0 and ds×

(sv_j/sw_j)<

d_n≦

ds, then fc_j=(ds/d_n)×

sv_j,

if sw_j>

sv_j>

0 and ds<

d_n≦

∞

, then fc_j=sv_j,

if sw_j=0 and sv_j>

0 and 0≦

d_n<

∞

, then fc_j=0,

if sw_j=0 and sv_j>

0 and d_n=∞

, then fc_j=sv_j,

if sw_j>

0 and sv_j=0 and d_n=0, then fc_j=sw_j,

if sw_j>

0 and sv_j=0 and 0<

d_n≦

∞

, then fc_j=0, and

if sw_j=0 and sv_j=0, then fc_j=0,

where the preceding parameters have the following meanings;

sw_j represents the expected unused weight capacity of a segment j expressed in chargeable weight cw with the volume weight d=0, where sw_j is defined as Min {sw_k, for all k, for which ak_j=1},

sv_j represents the expected unused volume capacity of a segment j expressed in chargeable weight cw with the volume weight d=∞

, where sv_j is defined as Min {sv_k, for all k, for which ak_j=1 }, where

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j,

cw_n represents the chargeable weight cw of the transport request n,

fc_j represents the free available capacity with the volume weight d_n, expressed in chargeable weight cw,

d represents the volume weight,

d_n represents the volume weight of a cargo unit n which is determined as follows;

if the weight W_n of the cargo unit n>

0 and the volume V_n of the cargo unit n≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n≧

0, then the volume weight d_n=∞

, and

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

ds represents the standard volume weight;

b) determine the chargeable weight cw_n of the transport request n according to;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

d_n≦

ds, then cw_n=W_n×

1000 and

if ds<

d_n≦

∞

, then cw_n=V_n×

1000/ds; and

c) if the chargeable weight cw_n≦

fc_j, accept the transport request and, if the chargeable weight cw_n>

fc_j, accept the transport request if, for the transport request of a cargo unit n, the bid price bp_n≦

r_n, and if V_n≦

V_rem and W_n≦

W_rem, and otherwise reject the transport request.

67. The system according to claim 66, wherein the bid price bp_j is determined via the equation

bp_j=w_n×

bpw_j+v_n×

bpv_j,

where

bp_j stands for the bid price of a unit of the chargeable weight cw, in particular of a chargeable kg, of the requested cargo unit or cargo amounts for a segment j with a volume weight d_n, bpw_j stands for the weight capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg, with the volume weight d_n=0, bpv_j stands for the volume capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg, with the volume weight d_n=∞

, where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k ak_j×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_k a_kj×

bpv_k, where ak_j=1, if the leg k is contained in the segment j and where ak_j=0, if the leg k is not contained in the segment j, and where w_n stand for the specific weight consumption and where v_n stand for the specific volume consumption, where the specific weight consumption or the specific volume consumption is defined as follows;

if 0≦

d_n≦

ds, then w_n=1 and v_n=d_n/d_s,

if ds<

d_n<

∞

, then w_n=ds/d_n and v_n=1,

if d_n=∞

, then w_n=0 and v_n=1 and

d_n represents the volume weight of a cargo unit or cargo amount and ds represents the standard volume weight, and where the bpw_k and bpv_k are determined by solving the following problem, in particular by means of linear programming;

minimize

$R_F=\underset{k}{\sum <br><br>}<br><br>W_{k-\mathrm{re}<br><br>\text{\hspace{1em}<br><br>}<br><br>m}\times <br><br>b<br><br>\text{\hspace{1em}<br><br>}<br><br>p<br><br>\text{\hspace{1em}<br><br>}<br><br>w_k+\underset{k}{\sum <br><br>}<br><br>V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}}\times <br><br>b<br><br>\text{\hspace{1em}<br><br>}<br><br>p<br><br>\text{\hspace{1em}<br><br>}<br><br>v_k+\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>D_{\mathrm{ij}}\times <br><br>p_{\mathrm{ij}}$

subject to

Σ

ak_j w_ij×

bpw_k+Σ

a_kj v_ij×

bpv_k+p_ij≧

r_ij,

for all the (i, j)

bpv_k, bpw_k, p_ij≧

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, W_k-rem specifies the still available weight capacity of the leg k expressed in chargeable weight cw which only consists of weight, that is, has a volume weight d=0, and V_k-rem specifies the still available volume capacity of the leg k expressed in chargeable weight cw which only consists of volume, that is, has a volume weight d=∞

, bpw_k specifies for the bid price of the weight capacity of the leg k, bpv_k specifies the bid price of the volume capacity of the leg k, D_ij specifies the forecasted demand for the forecast domain or the subregion (r/d class) i of segment the j expressed in chargeable weight cw, w_ij specify the weight coefficients of the forecast domain i of the segment j, v_ij specify the volume coefficients of the forecast domain i of the segment j, a_kj represents the index coefficient of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, and p_ij specifies the profitability of the forecast domain i of the segment j, expressed in chargeable weight cw, and r_ij, in particular in the form of an average value or weighted average value, specifies the rate of the forecast domain i of the segment j expressed as price per chargeable weight cw, where

the weight and volume coefficients w_ij and v_ij are defined as follows;

if 0≦

d_ij≦

ds, then w_j=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents a volume weight value from the domain i of the segment j, in particular an average value or weighted average value.

68. The system according to claim 66, wherein the expected unused weight capacity sw_j of a segment j expressed in chargeable weight cw with the volume weight d=0, and the expected unused volume capacity sv_j of a segment j expressed in chargeable weight cw with the volume weight d=∞

are determined via Min {sw_k, for all k, for which ak_j=1} and Min {sv_k, for all k, for which ak_j=1}, and where the values for sw_k and sv_k are determined by solving the following problems with the aid of linear optimization;

maximize

$R_F=\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>r_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}$

subject to

$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>w_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+s<br><br>\text{\hspace{1em}<br><br>}<br><br>w_k=W_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$$\underset{i}{\sum <br><br>}<br><br>\underset{j}{\sum <br><br>}<br><br>a_{\mathrm{kj}}<br><br>v_{\mathrm{ij}}<br><br>x_{\mathrm{ij}}+s<br><br>\text{\hspace{1em}<br><br>}<br><br>v_k=V_{k-r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{em}},\mathrm{for}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{all}<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{the}<br><br>\text{\hspace{1em}<br><br>}<br><br>k$

x_ij+s_ij=D_ij,

for all the (i, j) and

s_ij, sv_k, sw_k, x_ij≧

0,

for all the (i, j) and k,

where R_F specifies the revenue over a transport, the index k specifies the leg of a transport, j specifies the segment of a transport, i specifies the forecast domain and/or the subregion (r/d class) of a segment, x_ij specifies the request to be accepted for the forecast domain i of the segment j expressed in chargeable weight cw, D_ij specifies the forecast demand for the forecast domain i of the segment j expressed in chargeable weight cw, a_kj represents the index coefficients of the leg k on the segment j, where a_kj=0 if the leg k is not a component of the segment j and where a_kj=1 if the leg k is a component of the segment j, w_ij specifies the weight coefficients for the forecast domain i of the segment j, v_ij specifies the volume coefficients for the forecast domain i, W_k-rem specifies the still available weight capacity expressed in chargeable weight cw which only consists of weight, that is, has a volume weight d=0 of the leg k, and V_k-rem specifies the still available volume capacity expressed in chargeable weight cw which only consists of volume, that is, has a volume weight d=∞

, of the leg k, and s_ij, sv_k, and sw_k specify the slack variables for the request for the forecast domain i on the segment j of the volume of the leg k, in particular in the form of a chargeable weight cw which only consists of volume, that is, has a volume weight of d=∞

, or of the weight of the leg k, in particular in the form of a chargeable weight cw which only consists of weight, that is, has a volume weight d=0, and r_ij specify the rate of the forecast domain i of the segment j, in particular in the form of an average value or weighted average value, expressed as a price per chargeable weight cw, where the weight and volume coefficients w_ij and v_ij are defined as follows;

if 0≦

d_ij≦

ds, then w_ij=1 and v_ij=d_ij/ds,

if ds<

d_ij<

∞

, then w_ij=ds/d_ij and v_ij=1, and

if d_ij=∞

, then w_ij=0 and v_ij=1, where

d_ij represents a volume weight value from the domain i of the segment j in particular an average value or weighted average value.

69. The system according to claim 37, wherein the cargo transport comprises at least one segment j with at least one leg k, in which the processor is further configured to determine the free capacity for a cargo transport relative to the scaled volume weight of a cargo unit, in which the processor is configured to:

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, the chargeable weight cw_n, the volume weight d_n, and the scaled volume weight sd_n, first determine the free capacity fc_j of a segment j as a function of the scaled volume weight sd_n via;

if 0<

sw_j≦

sv_j and 0≦

sd_n≦

0.5, then fc_j=sw_j,

if 0<

sw_j≦

sv_j and 0.5<

sd_n≦

0.5×

(sv_j/sw_j), then fc_j=sw_j/(2(1−

sd_n)),

if 0<

sw_j≦

sv_j and 0.5×

(sv_j/sw_j)<

sd_n≦

1, then fc_j=sv_j,

if sw_j>

sv_j>

0 and 0≦

sd_n≦

0.5×

(sv_j/sw_j), then fc_j=sw_j,

if sw_j>

sv_j>

0 and 0.5×

(sv_j/sw_j)<

sd_n≦

0.5, then fc_j=sv_j/2 sd_n,

if sw_j>

sv_j>

0 and 0.5<

sd_n≦

1, then fc_j=sv_j,

if sw_j=0 and sv_j>

0 and 0≦

sd_n<

1, then fc_j=0,

if sw_j=0 and sv_j>

0 and sd_n=1, then fc_j=sv_j,

if sw_j>

0 and sv_j=0 and sd_n=0, then fc_j=sw_j,

if sw_j>

0 and sv_j=0 and 0<

sd_n≦

1, then fc_j=0, and

if sw_j=0 and sv_j=0, then fc_j=0,

where the preceding parameters have the following meanings;

sw_j represents the expected unused weight capacity of a segment j expressed in chargeable weight cw with the volume weight d=0, where sw_j is defined as Min {sw_k, for all k, for which ak_j=1},

sv_j represents the expected unused volume capacity of a segment j expressed in chargeable weight cw with the volume weight d=∞

, where sv_j is defined as Min {sv_k, for all k, for which ak_j=1}, where

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j,

cw_n represents the chargeable weight cw of the transport request n,

fc_j represents the free available capacity with the scaled volume weight sd_n, expressed in chargeable weight cw,

d_n represents the volume weight of a cargo unit n which is determined as follows;

if the weight W_n of the cargo unit n>

0 and the volume V_n of the cargo unit n≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

, and

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d, is indeterminate,

based on the determined volume weight d_n, determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

b) determine the chargeable weight cw according to;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

d_n≦

0.5, then cw_n=W_n×

1000 and

if 0.5<

sd_n≦

1, then cw_n=V_n×

1000/ds; and

c) if the chargeable weight cw_n≦

fc_j, accept the transport request and, if the chargeable weight cw_n>

fc_j, accept the transport request if the bid price determined for the transport request of a cargo unit n, bp_n,≦

r_n, and if V_n≦

V_rem and W_n≦

W_rem, and otherwise reject the transport request.

71. The system according to claim 37, wherein the cargo transport comprises at least one segment j with at least one leg k, in which the processor is further configured to determine the revenue from the lowest-valued subregion of expected transport request (bid price) for a segment as a function of the volume weight d, in which the processor is configured to:

a) for incoming transport requests for cargo units n with the rate r_n, determine the volume V_n, the weight W_n, and the volume weight d_n, the bid price bp_j as follows;

if 0≦

d_n≦

ds, then bp_j=bpw_j+(d_n/ds)×

bpv_j,

if ds<

d_n<

∞

, then bp_j=(ds/d_n)×

bpw_j+bpv_j, and

if d_n=∞

, then bp_j=bpv_j,

where the preceding parameters have the following meaning;

d_n volume weight of the transport request,

ds standard volume weight,

bp_j bid price of the segment j at a volume weight d_n,

bpw_j weight capacity access price of the segment j expressed in price per chargeable weight cw with the volume weight d_n=0 (price of the weight capacity of the segment

bpv_j volume capacity access price of the segment j expressed in price per chargeable weight cw with the volume weight d_n=∞

(price of the volume capacity of the segment j),

where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k a_kj×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_k ak_j×

bpv_k,

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j,

the volume weight of a cargo unit n is determined as follows;

if the weight W_n of the cargo unit>

0 and the volume V_n of the cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

,

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

b) determine the chargeable weight cw_n of the transport request n as follows;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

d_n≦

ds, then cw_n=W_n×

1000 and

if ds<

d_n≦

∞

, then cw_n=V_n×

1000/ds; and

c) if the rate r_n≧

bp_j and if V_n≦

V_rem and W_n≦

W_rem, accept the transport request and, if the rate r_n<

b_pj, reject the transport request.

72. The system according to claim 37, wherein the cargo transport comprises at least one segment j with at least one leg k, in which the processor is further configured to determine the revenue from the lowest-valued subregion of expected transport request (bid price) for a segment as a function of the scaled volume weight sd, in which the processor is configured to:

a) for incoming transport requests for cargo units n with the rate r_n, the volume V_n, the weight W_n, the volume weight d_n, and the scaled volume weight sd_n, determine the bid price bp_j as follows;

if 0≦

sd_n≦

0.5, then bp_j=bpw_j+2 sd_n×

bpv_j,

if 0.5<

sd_n<

1, then bp_j=2(1−

sd_n)×

bpw_j+bpv_j, and

if d_n=1, then bp_j=bpv_j,

where the preceding parameters have the following meaning;

d_n volume weight of the transport request

sd_n scaled volume weight of the transport request

bp_j bid price of the segment j at a scaled volume weight sd_n

bpw_j weight capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg with the volume weight d_n=0 (price of the weight capacity of the segment j),

bpv_j volume capacity access price of the segment j, expressed in price per chargeable weight cw, in particular per chargeable kg with the volume weight d_n=∞

(price of the volume capacity of the segment j),

where bpw_j is defined as the sum of the weight bid prices of all the legs k which are on the segment j, that is, bpw_j=Σ

_k a_kj×

bpw_k, and where bpv_j is defined as the sum of the volume bid prices of all the legs k which are on the segment j, that is, bpv_j=Σ

_k ak_j×

bpv_k,

ak_j=1 if the leg k is contained in the segment j and where

ak_j=0 if the leg k is not contained in the segment j,

and where

the volume weight of a cargo unit n is determined as follows;

if the weight W_n of the cargo unit>

0 and the volume V_n of the cargo unit≧

0, then the volume weight d_n=(V_n/W_n),

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit n>

0, then the volume weight d_n=∞

,

if the weight W_n of the cargo unit=0 and the volume V_n of the cargo unit=0, then the volume weight d_n is indeterminate,

based on the determined volume weight d, determine the scaled volume weight sd_n, where,

if d_n=0, then sd_n=0,

if 0<

d_n≦

ds, then sd_n=d_n/2ds,

if ds<

d_n<

∞

, then sd_n=1−

ds/2d_n, and

if d_n=∞

, then sd_n=1,

where ds is a given standard volume weight;

b) determine the chargeable weight cw_n of the transport request n as follows;

if the weight W_n in t is equal to 0 and the volume V_n in m³ is equal to 0, then cw_n=0,

if 0≦

sd_n≦

0.5, then cw_n=W_n×

1000 and

if 0.5<

sd_n≦

1, then cw_n=V_n×

1000/ds; and

c) if the rate r_n≧

bp_j and if V_n≦

V_rem and W_n≦

W_rem, accept the transport request and, if the rate r_n<

bp_j, reject the transport request.

78. The system of claim 37, wherein the processor is configured to determine whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd_n in a range of 0≦

sd_n<

0.4 or of 0.6<

sd_n≦

1.

79. The system of claim 37, wherein the processor is configured to determine whether the scaled volume weight sd_n of the transport request for the n^th cargo unit has an extreme scaled volume weight sd_n in a range of 0≦

sd_n≦

0.2 or of 0.8≦

sd_n≦

1.

80. The system of claim 39, wherein

if sd_k<

0.5, the processor is configured to accept the transport request if sd_n<

sd_k or if 0≦

sd_n≦

0.4,

if sd_k>

0.5, the processor is configured to accept the transport request if sd_n>

sd_k or if 0.6≦

sd_n≦

1, and

if sd_k=0.5, the processor is configured to accept the transport request if 0≦

sd_n≦

0.4 or 0.6≦

sd_n≦

1.

81. The system of claim 39, wherein

if sd_k<

0.5, the processor is configured to accept the transport request if sd_n<

sd_k or if 0≦

sd_n≦

0.2,

if sd_k>

0.5, the processor is configured to accept the transport request if sd_n>

sd_k or if 0.8≦

d_n≦

1 and

if sd_k=0.5, the processor is configured to accept the transport request if 0≦

sd_n≦

0.2 or 0.8≦

sd_n≦

1.

38. (canceled)

40-41. -41. (canceled)

44-45. -45. (canceled)

47-50. -50. (canceled)

54. (canceled)

65. (canceled)

70. (canceled)