A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

Rincón-García, Nicolás; Waterson, Ben; Cherrett, Tom

doi:10.5267/j.ijiec.2016.6.002

Cited by 16 publications

(11 citation statements)

References 40 publications

(98 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Dynamic Programming has been tested to solve the VRPTW, Gromicho, van Hoorn, Kok, and Schutten (2012) tested an implementation with 6 of the 56 Solomon's instances for 100 customers, obtaining solutions with 1.7 more vehicles and 11.0% more distance. The TDVRP-UEC is a generalization of the VRPTW and the TDVRPTW, and therefore the need of testing an approach that has been proven to reach best-known values for the VRPTW and improve best-known values for the TDVRPTW, such as the case of LNS metaheuristic (Gromicho et al, 2012;Rincon-Garcia et al, 2017) to provide routing solutions that comply with the driving hours regulations. In this research, LNS movements always produce solutions that comply with the European regulations on driving and working hours due to the use of the proposed Scheduler algorithm.…”

Section: Analysis Of Experimental Results From Theoretical Instancesmentioning

confidence: 99%

A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics

Rincón-García

Waterson

Cherrett

et al. 2020

Transportation Research Part A: Policy and Practice

View full text Add to dashboard Cite

New retail trends show the increasing importance of providing cost efficient deliveries in cities, where congestion and compliance with driving hours regulations should be incorporated into routing software. This paper introduces a large neighbourhood search algorithm that substantially improves the benchmark solutions for the vehicle routing problem variant considering time windows, time-dependent travel times and driving hours regulations (EC) 561/2006 that apply to vehicles over 3.5 tons in European cities in terms of required number of vehicles, travelled distance and duty time. Additionally, instances for The Road Transport (Working Time) Regulation 2005 that applies to drivers in the United Kingdom are introduced. The proposed algorithm is also used in scenarios that represent home delivery conditions to evaluate the impacts of the length of time windows, customer density, congestion and regulations in terms of cost and environmental impact.

show abstract

Section: Analysis Of Experimental Results From Theoretical Instancesmentioning

confidence: 99%

A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics

Rincón-García

Waterson

Cherrett

et al. 2020

Transportation Research Part A: Policy and Practice

View full text Add to dashboard Cite

show abstract

“…Many metaheuristic algorithms have been developed by impersonating the process that happens in real nature such as biological systems, chemical and physical process. Some implementations have facilitated logistics planners to carry out their dayto-day activities by using the approach realistically because able to obtain excellent results based on the execution times (Rincon-Garcia, Waterson, & Cherrett, 2017).…”

Section: Metaheuristics Methodsmentioning

confidence: 99%

A Review of Single and Population-Based Metaheuristic Algorithms Solving Multi Depot Vehicle Routing Problem

Samsuddin

Othman

Yusuf

2018

IJSECS

View full text Add to dashboard Cite

Multi-Depot Vehicle Routing Problem (MDVRP) arises with rapid development in the logistics and transportation field in recent years. This field, mainly, faces challenges in arranging their fleet efficiently to distribute the goods to customers by minimizing distance and cost. Therefore, the decision maker needs to specify the vehicles to reach the particular depot which, serves the customers with the predetermined capacity. Hence, to solve the stated problems, there is a need to apply metaheuristic methods to get minimal transportation costs. This article reviews on single and population-based metaheuristic methods solving MDVRP from the year 2013 until 2018. The methods discussed were simulated annealing (SA), variable neighborhood search (VNS), ant colony algorithm (ACO), particle swarm optimization (PSO) and genetic algorithm (GA). From the previous works, it can be concluded that the application of populationbased metaheuristic gives better solutions in solving MDVRPs.

show abstract

“…More details on VNS can be found in Hansen and Mladenovic [21]. VNS has been previously applied in a variety of combinatorial problems [29].…”

Section: Variable Neighborhood Search (Vns)mentioning

confidence: 99%

A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem

Othman¹,

Othman²,

Srour³

et al. 2019

Int. J. Adv. Sci. Eng. Inf. Technol.

View full text Add to dashboard Cite

Various metaheuristic methods have been proposed earlier and applied for solving the Travelling Salesman Problem (TSP). Water Flow Algorithm (WFA) is one of the recent population-based metaheuristic optimization techniques used for solving this problem. Past research has shown that improving WFA local search strategy has a significant impact on the algorithm performance. Therefore, this paper aims to solve TSP by enhancing WFA searching strategy based on a Variable Neighbourhood Search (VNS) known as hybrid WFA-VNS. It is a mixture of the exploration of WFA and the exploitation capability of VNS. This study is conducted in two stages: Pre-experiment and initial experiment. The objective of doing pre-experiment is to select four neighborhood structures to be used for the initial experiment. At the first stage, three instances are used, and there are five neighborhood structures involved. Those neighborhood structures are two opt, three opt, four opt, swapping, and insertion move. Because of pre-experiment, it discovers four best neighborhood structures, which are two opt, three opt, exchanging and insertion move. These neighborhood structures will be used in the initial experiment, which an improvement approach is employed. In an initial experiment, the performance of the proposed hybrid WFA-VNS is further studied and tested on 26 established benchmarked symmetric TSP datasets using four neighborhood structures selected in pre-experiment earlier. The TSP datasets involved are categorized into three types: small datasets, medium datasets, and large datasets. Selected neighborhood structures obtained in pre-experiment are applied and generated randomly to intensify the initial solution achieved at an earlier stage of hybrid WFA-VNS. The results of the comparison show that this hybrid approach represents an improvement and able to produce competitive results.

show abstract

A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

Cited by 16 publications

References 40 publications

A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics

A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics

A Review of Single and Population-Based Metaheuristic Algorithms Solving Multi Depot Vehicle Routing Problem

A Hybrid Water Flow-Like Algorithm and Variable Neighbourhood Search for Traveling Salesman Problem

Contact Info

Product

Resources

About