In　the　form　of　unattended　Collection-and-Delivery　Points　(CDP),　the　fixed　parcel　lockers　can　save　courier　miles　and　improve　the　delivery　efficiency.　However,　due　to　the　fixed　location　and　combination,　the　fixed　parcel　locker　cannot　accommodate　the　change　of　demands　ef-fectively.　In　this　paper,　an　approach　to　supplementing　fixed　lockers　by　mobile　parcel　lockers　to　meet　the　demands　of　the　last　mile　delivery　has　been　proposed.　With　the　goal　of　minimizing　the　operating　cost,　the　location　and　route　optimization　problems　of　mobile　parcel　lockers　are　integrated　into　a　non-linear　integer　programming　model.　An　embedded　GA　has　been　developed　to　optimally　determine　the　locations　of　distribution　points,　the　number　of　mobile　parcel　lockers　needed　by　each　distribution　point　and　the　schedules　and　routes　of　mobile　parcel　lockers,　simultaneously.　Finally,　a　numerical　example　is　given　to　compare　the　optimization　results　of　the　schemes　with　and　without　the　aggregation　problem.　The　results　show　that　the　scheme　with　the　aggregation　problem　can　greatly　save　the　delivery　time.　However,　for　the　scheme　without　the　aggregation　problem,　time　windows　are　more　continuous,　so　it　saves　the　number　of　vehicles.　©　2020,　Faculty　of　Transport　and　Traffic　Engineering.　All　rights　reserved.