A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows

Tsung Che Chiang, Wei Huai Hsu

Research output: Contribution to journalArticle

38 Citations (Scopus)

Abstract

This paper addresses the multiobjective vehicle routing problem with time windows (MOVRPTW). The objectives are to minimize the number of vehicles and the total distance simultaneously. Our approach is based on an evolutionary algorithm and aims to find the set of Pareto optimal solutions. We incorporate problem-specific knowledge into the genetic operators. The crossover operator exchanges one of the best routes, which has the shortest average distance, the relocation mutation operator relocates a large number of customers in non-decreasing order of the length of the time window, and the split mutation operator breaks the longest-distance link in the routes. Our algorithm is compared with 10 existing algorithms by standard 100-customer and 200-customer problem instances. It shows competitive performance and updates more than 1/3 of the net set of the non-dominated solutions.

Original languageEnglish
Pages (from-to)25-37
Number of pages13
JournalComputers and Operations Research
Volume45
DOIs
Publication statusPublished - 2014 May 1

Keywords

  • Evolutionary algorithm
  • Multiobjective
  • Pareto optimal
  • Time windows
  • Vehicle routing problem

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows'. Together they form a unique fingerprint.

  • Cite this