Volume 8 Number 10 (Oct. 2013)
Home > Archive > 2013 > Volume 8 Number 10 (Oct. 2013) >
JCP 2013 Vol.8(10): 2558-2564 ISSN: 1796-203X
doi: 10.4304/jcp.8.10.2558-2564

Multi-Objective Distribution Model and Algorithm for Online Shopping Express Logistics

Jianjie Yang1, Jin Li, Yun Chen1, 2, and Xintong Liu1
1 School of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou, China
2 Contemporary Business and Trade Research Center of Zhejiang Gongshang University, Hangzhou, China


Abstract—The multi-objective distribution problem with time windows for online shopping express logistics (OSEDP) is an extension of the vehicle routing problem with time windows (VRPTW). In additional to the time windows, we also take the customers’ satisfaction degree (CSD), the cost, and both integrated conditions into consideration. To solve this problem, we design a modified particle swarm optimization algorithm (PSO) which can enhance the quality of the particle evolution and the speed of the original algorithm. This algorithm begins with random solutions, uses the fitness degree as the evaluation function, and searches for optimal solution by the iterative steps. The simulation experimental results also show that the proposed model and algorithm are efficient and effective for online shopping express logistics distribution problem.

Index Terms—customers’ satisfaction degree, time windows, penalty function, particle swarm algorithm

[PDF]

Cite: Jianjie Yang, Jin Li, Yun Chen, and Xintong Liu, " Multi-Objective Distribution Model and Algorithm for Online Shopping Express Logistics," Journal of Computers vol. 8, no. 10, pp. 2558-2564, 2013.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>