Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6903355 | Applied Soft Computing | 2018 | 34 Pages |
Abstract
This paper introduces a multi-objective vehicle routing problem with hard time windows and stochastic travel and service times. This problem has two practical objectives: minimizing the operational costs, and maximizing the service level. These objectives are usually conflicting. Thus, we follow a multi-objective approach, aiming to compute a set of Pareto-optimal alternatives with different trade-offs for a decision maker to choose from. We propose two algorithms (a Multi-Objective Memetic Algorithm and a Multi-Objective Iterated Local Search) and compare them to an evolutionary multi-objective optimizer from the literature. We also propose a modified statistical method for the service level calculation. Experiments based on an adapted version of the 56 Solomon instances demonstrate the effectiveness of the proposed algorithms.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Douglas M. Miranda, Juergen Branke, Samuel V. Conceição,