doi:10.3969/j.issn.1005-152X.2009.07.

054

100085

] NCL

[ ]
[ ]F224.0;F540.33

[ ]1005- 152X200907- 0171- 03

[ ]A

Vehicle Routing Optimization Based on Mixed Set Programming

BAI Xiao- yong, ZHOU Jian- yang
(Beijing Enginest Technology Co. Ltd, Beijing 100085, China)

Abstract: The paper establishes a vehicle routing optimization model in NCL (Natural Constraint Language), uses Mixed Set Programming of NCL to solve multi- objective vehicle routing problems with complex constraints. To illustrate the method, the paper presents a solution to a hard routing problem (the pick- up and delevery problem with time windows) by mixed set programming.
Keywords: vehicle routing optimization; NCL; mixed set programming; time windows; pick- up and delivery

NP

NCL

NCL

NCL
[1]NCL
[2]

2.1 NCL
NCL
NCL

(Mixed Set Programming MSP)[2]

NCL

NCL

[ ]2009- 06- 20
[ ];

- 171 -

2009 28 7 202

2.2

NCL

?
1

3
3.1

NCL

7:00~8:00

-172-

iPICKUPORDER (
TimeOrderi TimeOrderidxDelivrOrderi,
truckOrderi=truckOrderidxDelivrOrderi
),

PICKUPORDER
idxDelivrOrderi i
truckOrderi i

3.1.3 NCL

3.1.1

i SOURCEORDER
TimeOrderi TimeOrdernextOrderi ,
ijSOURCEORDER
nextOrderi nextOrderj,

SOURCEORDER
ORDER
i sourceTrucki
sourceTrucki SOURCE ORDER SOURCE
SOURCEORDER
i i
TimeOrderi

nextOrderi i

2 i
TimeOrderi
i +

iSOURCEORDER (
#TimeOrderi=tOrderOrderi,nextOrderOrderi,
loadOrdernextOrderi=loadOrderi+demandOrdernextOrderi
),

tOrderOrderi,j i j
loadOrderi i
demandOrderi i
3

NCL (Constraint Programming)

NCL (MSP)

NCL (Constraint Cut)

(Depth- First Search) 1

3.1.2 NCL NCL

[4]
1

[4]

nextOrderi

i OrderTrucki
i nextOrderi
i t1Orderi

1 OrderTrucki

NCL
j i
dOrderTrucki,j kOrderTruckimax
(dOrderOrderj,k,dOrderOrderidxDelivrOrderj,k) j i
i
dOrderTrucki,j i
differenceDistTruckOrderi

OrderTrucki

j
j
i
mindOrderTrucki,j j
imin#OrderTruck
i
i

jOrderTrucki?
j i
2 nextOrderj
j, differenceDistSuccOrderj

nextOrderj

j
min
j
tOrderj,k k

nextOrderj=k?
j k

AMD Athlon 5600+( 2.8G)

POEM2.8 [3]
[5]
Solomon
[6]

NCL Li&Lim LR101

LRC101
NCL 1 638 1 702[3,4]
1 650 1 708 2 LC101LC201
LR101
LRC101 [3- 4]

NCL POEM

[ ]
[1] J Zhou. Introduction to the constraint language NCL [J]. 2000,JLP 45(1- 3):
71- 103 .
[2] J Zhou. A Note On Mixed Set Programming [A]. The 7th International Symposium on Operations Research and Its Applications [C].Lijiang, China,
October 2008:131- 140.
[3] J Zhou. The Manual of POEM- A Development Environment for The Natural Constraint Language [M]. Version 2.8. ENGINEST, May2008.
[4].[M]. :, 2009.
[5] Li H, Lim A. A Meta Heuristic for the Pick- up and Delivery Problem with
Time Windows[A]. The 13th International Conference on Tools with Artificial Intelligence[C]. Dallas, TX, USA, 2001.
[6] Solomon MM. The vehicle routing and scheduling problems with time windowconstraints [J].Operations research,1987, 35: 254- 265.

- 173 -