Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm

Hongtao Lei, Rui Wang, Gilbert Laporte

Research output: Contribution to journalArticlepeer-review

62 Citations (SciVal)

Abstract

This study considers a multi-objective dynamic stochastic districting and routing problem in which the customers of a territory stochastically evolve over several periods of a planning horizon, and where the number of service vehicles, the compactness of the districts, the dissimilarity measure of the districts and an equity measure of vehicles profit are considered as objectives. The problem is modeled and solved as a two-stage stochastic program, where in each period, districting decisions are made in the first stage, and the Beardwood-Halton-Hammersley formula is used to approximate the expected routing cost of each district in the second stage. An enhanced multi-objective evolutionary algorithm (MOEA), i.e., the preference-inspired co-evolutionary algorithm using mating restriction, is developed for the problem. The algorithm is tested on randomly generated instances and is compared with two state-of-the-art MOEAs. Computational results confirm the superiority and effectiveness of the proposed algorithm. Moreover, a procedure for selecting a preferred design for the proposed problem is described.

Original languageEnglish
Pages (from-to)12-24
Number of pages13
JournalComputers and Operations Research
Volume67
DOIs
Publication statusPublished - 1 Mar 2016

Funding

This work was partly supported by the Chinese National Natural Science Foundation under grants 71201170 and 61403404 , and by the Hunan Provincial Natural Science Foundation of China under grant 13JJ4010 , by the Specialized Research Fund for the Doctoral Program of Higher Education of China under grant 20124307120024 , by the Research Plan of National University of Defense Technology under grant JC14-05-01 , and by the Canadian Natural Sciences and Engineering Research Council under grant 39682-10 . This support is gratefully acknowledged. Thanks are due to the referees for their valuable comments.

Keywords

  • Co-evolutionary algorithm
  • Districting
  • Mating restriction
  • Multi-objective optimization
  • Routing

ASJC Scopus subject areas

  • General Computer Science
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm'. Together they form a unique fingerprint.

Cite this