scholarly journals On the Development of a Multi-Layered Agent-Based Heurisitc System for Vehicle Routing Problem under Random Vehicle Breakdown

2021 ◽  
Vol 5 (1) ◽  
pp. 1-10
Author(s):  
Anees M. Abu- Monshar ◽  
Ammar F. Al-Bazi ◽  
Qusay H. Alsalami
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Static Problem ◽  
Technological Advancement ◽  
Dynamic Vehicle Routing ◽  
Routing Problem ◽  
Agent Based ◽  
Modelling Framework ◽  
Good Order ◽  
Almost All

With the recent technological advancement, the Dynamic Vehicle Routing Problem (DVRP) is becoming more applicable but almost all of the research in this field limited the source of dynamism from the order side rather from the vehicle, in addition to the adoption of inflexible tools that are mainly designed for the static problem. Considering multiple random vehicle breakdowns complicates the problem of how to adapt and distribute the workload to other functioning vehicles. In this ongoing PhD research, a proposed multi-layered Agent-Based Model (ABM) along with a modelling framework on how to deal with such disruptive events in a reactive continuous manner. The model is partially constructed and experimented, with a developed clustering rule, on two randomly generated scenario for the purpose of validation. The rule achieved good order allocation to vehicles and reacted to different problem sizes by rejecting orders that are over the model capacity. This shows a promising path in fully adopting the ABM model in this dynamic problem.

scholarly journals Collective decision making in dynamic vehicle routing problem

2019 ◽  
Vol 252 ◽  
pp. 03003 ◽  
Author(s):  
Edyta Kucharska ◽  
Katarzyna Grobler-Dębska ◽  
Radosław Klimek
Keyword(s):  
Decision Making ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Static Problem ◽  
Collective Decision ◽  
Collective Decision Making ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Collective Decisions

The paper presents a collective decision making in dynamic vehicle routing problem. In contrast to the static problem, a part or all of the customers’ companies are revealed dynamically during the design or execution of the routes. The problem is modelled using the algebraic-logical meta-model (ALMM) methodology, which enables making collective decisions in successive process stages, not separately for individual vehicles. ALMM is considered to be the rule according to which the availability of companies is determined. The steps and schematics of the general algorithm that take into account the dynamic appearance of new companies are shown. The proposed approach belongs to trajectory-based metaheuristics methods.

Dynamic Vehicle Routing Problem with Multiple Objectives

2005 ◽  
Vol 1923 (1) ◽  
pp. 199-207 ◽  
Author(s):  
Hao Tang ◽  
Mingwei Hu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Static Problem ◽  
Multiple Objectives ◽  
Benchmark Problems ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Single Objective

This paper addresses a dynamic vehicle routing problem related to courier mail services with explicit consideration of multiple objectives. This problem is modeled as a dynamic traveling repairman problem with time windows, and with three objectives considered: maximization of the number of serviced customers, minimization of customer waiting, and minimization of total travel time. A solution (simulation) framework, extending techniques developed for single-objective dynamic routing problems in the literature, is proposed to tackle this multiobjective problem. An efficient chained local search heuristic is embedded in this solution framework to solve the underlying static problem, the traveling salesman problem with time windows. Comprehensive simulation experiments conducted on data sets derived from benchmark problems show that the proposed algorithmic approach is able to provide high-quality solutions with limited computing effort. These experiments also indicate that the multiobjective model proposed in this study can offer much more attractive solutions to decision makers than single-objective models.

scholarly journals A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows

2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Shifeng Chen ◽  
Rong Chen ◽  
Jian Gao
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Time Windows ◽  
Harmony Search ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem

The Vehicle Routing Problem (VRP) is a classical combinatorial optimization problem. It is usually modelled in a static fashion; however, in practice, new requests by customers arrive after the initial workday plan is in progress. In this case, routes must be replanned dynamically. This paper investigates the Dynamic Vehicle Routing Problem with Time Windows (DVRPTW) in which customers’ requests either can be known at the beginning of working day or occur dynamically over time. We propose a hybrid heuristic algorithm that combines the harmony search (HS) algorithm and the Variable Neighbourhood Descent (VND) algorithm. It uses the HS to provide global exploration capabilities and uses the VND for its local search capability. In order to prevent premature convergence of the solution, we evaluate the population diversity by using entropy. Computational results on the Lackner benchmark problems show that the proposed algorithm is competitive with the best existing algorithms from the literature.

Sign in / Sign up

Export Citation Format

Share Document