Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows

Abstract

Abstract. The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous fleet of vehicles with limited capacity. In this paper, we propose and analyze the performance of an improved multi-objective evolutionary algorithm, that simultaneously minimizes the number of routes, the total travel distance, and the delivery time. Empirical results indicate that the simultaneous minimization of all three objectives leads the algorithm to find similar or better results than any combination of only two objectives. These results, although not the best in all respects, are better in some aspects than all previously published approaches, and fully multi-objective comparisons show clear improvement over the popular NSGA-II algorithm.

Multi objective ant Colony Optimisation to obtain efficient metro speed profiles

“…This variant modifies the basic mechanism of ACO to search through continuous variables by means of a probability density function. Conversely, Garcia-Najera and Bullinaria 24 proposed adding an archive to store the best, non-dominated solutions after each iteration in order to cope with multi-objective problems. These two developments are the source of the MOACOr algorithm used in this study.…”

“…In this context, this paper aims to assess the performance of a relatively new variant of the well-known ACO algorithm, modified to address multi-objective problems with continuous variables. This variant, called MOACOr (Multi-Objective Ant Colony Optimisation for continuous domains), was first introduced by Garcia-Najera and Bullinaria 24 and has been already tested in other fields, 13,25 but has not yet been used to address railways eco-driving. By testing MOACOr, we aim to expand the range of tools available for railways researchers in a field that it is still somewhat limited to the use of NSGA-II and other GA.…”

Multi Objective Vehicle Routing Problem: A Survey

“…This method is becoming more and more popular and is frequently used with EAs. [6,[8][9][10][11][12][13][17][18][19]22] uses pareto method for providing solution to the problem.…”

Untitled

“…Beside this, an objective related to goods can be minimization of damage of goods. Work done in [4][5][6][7][8][9][10][11]15,[17][18][19][20][21][22]24] focuses on minimization of vehicles.…”

“…In addition to find lowest distance traveled other two parameters, total travel time and total vehicle used were also considered for minimization. Though the presented scheme proves effective for the problem but it works only on arcs and not the sequence of them.In addition to this Abel Garcia Najera [17] also applied EA approach to solve one variant called MOVRP with back hauls. Again three objectives were considered for minimization of total distance, uncollected backhauls and the total number of vehicles.…”