Model and algorithm for the multi-task routing optimization problem in 4PL

  • Authors:

  • Min Huang;Yan Cui;Xin Xu;W. H. Ip;Xingwei Wang

  • Affiliations:

  • Faculty of Information Science and Engineering, Northeastern University, Shenyang, P.R. China and Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Ministry of ...;Faculty of Information Science and Engineering, Northeastern University, Shenyang, P.R. China and Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Ministry of ...;Faculty of Information Science and Engineering, Northeastern University, Shenyang, P.R. China and Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Ministry of ...;Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Faculty of Information Science and Engineering, Northeastern University, Shenyang, P.R. China and Key Laboratory of Integrated Automation of Process Industry, Northeastern University, Ministry of ...

  • Venue:
  • CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the developing supply chain, fourth Party Logistics (4PL) has been attracting more and more attention from researches. Routing optimization is one of the important issues in 4PL. Based on the analysis of practical problems, considered the cost and time two properties of each node and edge, a mathematical model of the point to point multitask without edge reuse routing optimization of 4PL is established. Considering the characteristics of the problem, the Ant Colony Optimization (ACO) algorithm is designed for the problem. The algorithm is tested by numerical analysis with different scale of problems. The results suggested that the algorithm is effective and efficient.