Multi-Criteria Decision Making With Machine Learning for Vehicle Routing Problem

Multi-Criteria Decision Making With Machine Learning for Vehicle Routing Problem

Fatma Demircan Keskin
DOI: 10.4018/978-1-7998-8040-0.ch011
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This chapter addresses vehicle routing problem with time windows (VRPTW), one of the most well-known combinatorial optimization problems with many real-world applications in the transportation sector. This chapter proposes a three-stage approach for VRPTW and presents an application of this approach to a real-life problem. The stages of the approach include clustering of customers, determining feasible routes and their criteria values for each cluster, and selecting the best routes for each cluster based on multi-criteria decision analysis. In the first stage of the proposed approach, a fuzzy c-means (FCM) clustering-based assignment algorithm is used. The second stage includes predicting travel times between nodes based on GPS data with support vector regression (SVR) and applying the proposed feasible route determination and criteria value calculation algorithm using these predictions and other inputs. In the last stage, routes are selected with the analytic hierarchy process (AHP) and the technique for order of preference by similarity to ideal solution (TOPSIS) for each cluster.
Chapter Preview
Top

Introduction

In the era that we have been witnessing, the rapid developments in digital technologies enable us to collect real-time data from so many sources, store and process them to create value by applying advanced analytical techniques. Among these methods, machine learning methods have attracted great interest in the literature, especially in recent times. In previous studies, though researchers frequently apply machine learning methods in speech recognition, error prediction, fault detection, and predictive maintenance, they have started developing machine learning-based approaches to solving combinatorial optimization problems recently (Khalil et al., 2017; Lu et al., 2019).

VRPTW, one of the variants of the classical VRP, is one of the most well-known combinatorial optimization problems with many real-world applications in the transportation sector. This variant includes hard and/or soft time window constraints in addition to the constraints of the classical VRP. In VRPTW, a number of limited capacity vehicles are routed to start and finish their travels at a central depot to customer points without violating the customers' specific time intervals and capacity constraints of the vehicles (Ghoseiri and Ghannadpour, 2010). The appropriate routes are determined in accordance with the problem's objectives by satisfying the capacity and time interval constraints. Time windows represent the lower and upper time limits at which customers can be served. Hard-time windows seem to be more appropriate to maintain customer satisfaction, but for the companies that distribute the orders to their customers, complying with these windows can cause more vehicle use, more distance to travel, not being able to load vehicles fully, and more air pollution. Soft-time windows provide advantages in terms of flexibility and cost for the companies (Xia and Fu, 2019).

Time dependent VRP, which is set forth from the point that the travel times between nodes can be time-varying depending on many factors such as congestion, vehicle breakdowns, road works, road accident, has been studied by many researchers in the literature to deal with the problem more realistically, with or without time windows (e.g., Malandraki and Daskin, 1992; Figliozzi, 2012; Wen and Eglese, 2015; Liu et al., 2020).

The VRPTW has received a great deal of attention in the literature. Usually, the models in the literature for the VRPTW are concerned with the objective of minimization of the travel distance or related cost with it as the objective function. But most of the real-life applications of VRPTW have both consistent and contradictory objectives or criteria that need to be taken into consideration. From this perspective, addressing the VRPTW as a multi-objective and multi-criteria problem has become more attractive in recent years (e.g., Guo et al., 2017; Sawik et al., 2017; Zhang et al., 2019).

Key Terms in this Chapter

Time Windows: The time interval that indicates the earliest and latest service start times for customers.

Machine Learning: The process of learning from data to make accurate predictions.

Travel Time Prediction: To estimate the duration of travel between two nodes considering the explanatory variables.

Load-Distance Factor: The route criterion related to fuel consumption, whose value depends on load and distance.

Multi-Criteria Decision Making: To select an alternative among a list of them based on the evaluation of multiple criteria.

Clustering: To group items based on geographic properties or similarities.

Vehicle Routing Problem: To determine routes that start and end at a depot to meet all customers’ demands by visiting them once.

Complete Chapter List

Search this Book:
Reset