Simulation-based optimization of a complex mail transportation network

  • Authors:
  • Anna Syberfeldt;Henrik Grimm;Amos Ng;Martin Andersson;Ingemar Karlsson

  • Affiliations:
  • University of Skövde, Skövde, Sweden;University of Skövde, Skövde, Sweden;University of Skövde, Skövde, Sweden;University of Skövde, Skövde, Sweden;University of Skövde, Skövde, Sweden

  • Venue:
  • Proceedings of the 40th Conference on Winter Simulation
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in a transportation network comprising a huge number of possible routes. For testing and analysis of different transport solutions, a discrete-event simulation model of the transportation network has been developed. This paper describes the optimization of transport solutions using evolutionary algorithms coupled with the simulation model. The vast transportation network in combination with a large number of possible transportation configurations and conflicting optimization criteria make the optimization problem very challenging. A large number of simulation evaluations are needed before an acceptable solution is found, making the computational cost of the problem severe. To address this problem, a computationally cheap surrogate model is used to offload the optimization process.