An exact algorithm for a single-vehicle routing problem with time windows and multiple routes

2007 ◽  
Vol 178 (3) ◽  
pp. 755-766 ◽  
Author(s):  
Nabila Azi ◽  
Michel Gendreau ◽  
Jean-Yves Potvin
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Multiple Routes ◽  
Single Vehicle

scholarly journals Program Dinamis Pada Penentuan Rute Kendaraan Dengan Time Windows

2018 ◽  
Vol 3 (2) ◽  
pp. 135-141
Author(s):  
Mirta Fera ◽  
Irwan Endrayanto
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problem ◽  
Time Windows ◽  
Exact Algorithm ◽  
Blood Products ◽  
Routing Problem ◽  
Dynamic Programs ◽  
Single Vehicle ◽  
Combinatoric Optimization

Penentuan rute armada merupakan salah satu permasalahan optimisasi kombinatorik yang memiliki pengaruh pada distribusi barang. Pengiriman barang cepat busuk (perishable good) seperti produk darah, dengan karakteristik jarak tempuh yang pendek memungkinkan untuk dilakukan dengan satu kendaraan. Terdapat kendala time windows pada pelanggan dan depot yang membatasi pengiriman. Masalah penentuan rute dalam penelitian ini dipandang sebagai single vehicle routing problem dengan time windows. Penelitian ini bertujuan untuk mendeskripsikan algoritma yang ditulis berdasarkan program dinamis untuk masalah penentuan rute kendaraan dengan time windows. Pada algoritma diterapkan tes yang bertujuan meningkatkan performa algoritma. Pada bagian akhir diberikan contoh penyelesaian masalah penentuan rute kendaraan dengan time windows menggunakan algoritma. Kata kunci: penentuan rute kendaraan; program dinamis; algoritma eksak Routing problem is kind of combinatoric optimization problem that has an influence on the distribution of goods. Delivery of perishable good such as blood products with short travel characteristics makes it possible to do with one vehicle. There are time-windows constraints on customer and depots that limit delivery. This research aims to describe algorithms written based on dynamic programs for the problem of determining vehicle routes with time windows. In the algorithm applied a test that aims to improve the performance of the algorithm. In the end, given an example of solving the problem of determining a vehicle route with time windows using an algorithm. Keywords: vehicle routing problem; dynamic programming; exact algorithm

Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model

2011 ◽  
Vol 214 (3) ◽  
pp. 536-545 ◽  
Author(s):  
Rita Macedo ◽  
Cláudio Alves ◽  
J.M. Valério de Carvalho ◽  
François Clautiaux ◽  
Saïd Hanafi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Polynomial Model ◽  
Routing Problem ◽  
Multiple Routes

scholarly journals Column Generation for a Multitrip Vehicle Routing Problem with Time Windows, Driver Work Hours, and Heterogeneous Fleet

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Michel Povlovitsch Seixas ◽  
André Bergsten Mendes
Keyword(s):  
Vehicle Routing ◽  
Column Generation ◽  
Vehicle Routing Problem ◽  
Resource Constraints ◽  
Time Windows ◽  
Planning Horizon ◽  
Work Hours ◽  
Start Time ◽  
Routing Problem ◽  
Multiple Routes

This study addresses a vehicle routing problem with time windows, accessibility restrictions on customers, and a fleet that is heterogeneous with regard to capacity and average speed. A vehicle can perform multiple routes per day, all starting and ending at a single depot, and it is assigned to a single driver whose total work hours are limited. A column generation algorithm is proposed. The column generation pricing subproblem requires a specific elementary shortest path problem with resource constraints algorithm to address the possibility for each vehicle performing multiple routes per day and to address the need to set the workday’s start time within the planning horizon. A constructive heuristic and a metaheuristic based on tabu search are also developed to find good solutions.

scholarly journals A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration

4OR ◽  
2013 ◽  
Vol 12 (3) ◽  
pp. 235-259 ◽  
Author(s):  
F. Hernandez ◽  
D. Feillet ◽  
R. Giroudeau ◽  
O. Naud
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Exact Algorithm ◽  
Routing Problem ◽  
Limited Duration

scholarly journals A hybrid ant colony algorithm based on multiple strategies for the vehicle routing problem with time windows

2021 ◽  
Author(s):  
Hongguang Wu ◽  
Yuelin Gao ◽  
Wanting Wang ◽  
Ziyu Zhang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Ant Colony ◽  
Routing Problem ◽  
Multiple Strategies ◽  
Hard Time ◽  
Mutation Operation

AbstractIn this paper, we propose a vehicle routing problem with time windows (TWVRP). In this problem, we consider a hard time constraint that the fleet can only serve customers within a specific time window. To solve this problem, a hybrid ant colony (HACO) algorithm is proposed based on ant colony algorithm and mutation operation. The HACO algorithm proposed has three innovations: the first is to update pheromones with a new method; the second is the introduction of adaptive parameters; and the third is to add the mutation operation. A famous Solomon instance is used to evaluate the performance of the proposed algorithm. Experimental results show that HACO algorithm is effective against solving the problem of vehicle routing with time windows. Besides, the proposed algorithm also has practical implications for vehicle routing problem and the results show that it is applicable and effective in practical problems.

Sign in / Sign up

Export Citation Format

Share Document