Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem

2016 ◽  
Vol 249 (1) ◽  
pp. 93-104 ◽  
Author(s):  
Juan Carlos Rivera ◽  
H. Murat Afsar ◽  
Christian Prins
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Exact Algorithm ◽  
Routing Problem ◽  
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

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations

1995 ◽  
Vol 61 (1) ◽  
pp. 21-43 ◽  
Author(s):  
Eleni Hadjiconstantinou ◽  
Nicos Christofides ◽  
Aristide Mingozzi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Shortest Paths ◽  
Exact Algorithm ◽  
Routing Problem

Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers

2014 ◽  
Vol 61 (2) ◽  
pp. 463-487 ◽  
Author(s):  
Prasanna Balaprakash ◽  
Mauro Birattari ◽  
Thomas Stützle ◽  
Marco Dorigo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Stochastic Demands ◽  
Single Vehicle
Sign in / Sign up

Export Citation Format

Share Document