A genetic algorithm for the freight consolidation problem with one-dimensional container loading

  • Authors:
  • Zizhen Zhang;Hu Qin;Andrew Lim

  • Affiliations:
  • City University, Hong Kong, Hong Kong;Huazhong University of Science and Technology, Wuhan, China;City University, Hong Kong, Hong Kong

  • Venue:
  • Proceedings of the 13th annual conference on Genetic and evolutionary computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In today's global free market, third-party logistics providers (3PLs) are becoming increasingly important. This paper studies a problem faced by a 3PL operating a warehouse in Shanghai, China, under contract with a major company for children's clothing based in the United States. The problem involves the allocation of textile parcel shipments at the warehouse to shipping routes with different destination ports, where the shipments are destined for different retail stores. The shipments must be loaded into containers of varying sizes and costs, and the objective is to find an allocation that minimizes the total container transportation and parcel delivery costs. We formulate the problem into an integer linear programming model, and also propose a genetic algorithm approach to solve the problem practically. A demonstration of a good solution to this problem was a decisive factor in the awarding of the contract to the 3PL in question.