Development of algorithms for solving routing problems in the people and parcel transportation

−

E21 − − − − −1 2 4 6 5

E21 − − − − −1 2 4 6 5

RG − − − − −1 2 2 2 6 RG − − − − −2 2 2 2 6

RG− − − − −1 2 2 2 6 RG− − − − −2 2 2 2 6

E21

NP

X( ) i,j ∈E

ci,jxi,j

X( ) i,j ∈σ i ( )

xi,j = 2, i∀ ∈V \ { },0

X( ) i,j ∈σ (0)

ci,jxki,j

i + si + t i,n i+ ≤ kn i+ , i∀ ∈O,k

2 +1 n − k0 ≤ Rk, k∀ ∈K,

ei ≤ ki ≤ li, i∀ ∈V, k∀ ∈K,max 0{ , di} ≤ Wik ≤min C{ k, Ck+ di} ∀ ∈, i V, k∀ ∈K,

xki,j ∈ {0 1, } ∀ ∈, i V, j∀ ∈V, k∀ ∈K

η =m n+ mn

N s( ) s N S: →

⟨3 4 5, , ⟩

[70 110],

G= (V, E) V

E

ti,j di,j( )i, j ∈ E

xk,qi,j = X

j δ ∈ − ( ) i

q k ( )Xq=1

k K ∈

q k ( )Xq=1

X

j δ ∈ −( ) i

xk,qj,i , k∀ ∈K, i∀ ∈C

dp

i j

nx i( ) = j

R∗(θη, γη] 0< θ < γ <1

[0, θη]

π1 > π2 > 0 > π 3 π3 < 0

|costh( )c − cost1( )c |

H = 2

c

l c( ) − ( )e cc

x

y

w

| | = 1, D = 1, t| | wait ( ) = 0dp , t unit ( ) = 0dp tunit( ) = 0c twait( )c

c ∀ ∈c C, dp∀ ∈D

f = 6 × × maxη ( ) i,j ∈E di,j fk =

E21

t

E 21

θ = 0 2.

γ = 0 3 π 1= 10 π2= 0 π3 = 10−

Tinit = 200, η1 = 0 5 , η2= 0 2 , η3=

0 1 , τ = 0 1 η

θ γ π 1 π 2 π 3 g c g r g v θ γ π 1 π 2 π 3 g c g r g v

ρ1 = (#cus avg− gr)100 #/ cus

std gr ρ2 = (max gr−min gr)100 #/ cus

Fc

ρ3 = (gr − avg gr)100/gr

avg gr

G = (P ∗, E) P∗

E

D i ×T j = P C

d=1 ZD( )di×TjC

first(Sk, j) j Sk

klast(Sk, j) j

l k −1X

i j = +1

d(o∗

i, o∗ i+1)

sk

last(S k, j)last(Sk, j)

j + 1 Sk

f ∈ [1 ], αscore(f, pe) = G(f, p e) H( +1/ f , p e) G(f, pe)

pe[1 ], f H( +1f , p e)

k klk k = 1, Lk

i−1Yj=1

Q c( ) = 39 q ∀ ∈ q Q L

1 2 3 2 3 2 3 2 3

×

6

p2

ρ= (p2− p1)100/p1

p 1 p 2 ρ (%) p 1 p 2 ρ(%)