THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMANDS IN AN URBAN AREA – A CASE STUDY

The vehicle routing problem with stochastic demands (VRPSD) is a combinatorial optimization problem. The VRPSD looks for vehicle routes to connect all customers with a depot, so that the total distance is minimized, each customer visited once by one vehicle, every route starts and ends at a depot, a...

Full description

Saved in:
Bibliographic Details
Published in:Facta Universitatis. Series: Mechanical Engineering 2020-04, Vol.18 (1), p.107-120
Main Authors: Marković, Danijel, Petrovć, Goran, Ćojbašić, Žarko, Stanković, Aleksandar
Format: Article
Language:English
Subjects:
Combinatorial analysis
Customers
Garbage collection
Heuristic methods
Optimization
Route planning
Urban areas
Vehicle routing
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The vehicle routing problem with stochastic demands (VRPSD) is a combinatorial optimization problem. The VRPSD looks for vehicle routes to connect all customers with a depot, so that the total distance is minimized, each customer visited once by one vehicle, every route starts and ends at a depot, and the travelled distance and capacity of each vehicle are less than or equal to the given maximum value. Contrary to the classical VRP, in the VRPSD the demand in a node is known only after a vehicle arrives at the very node. This means that the vehicle routes are designed in uncertain conditions. This paper presents a heuristic and meta-heuristic approach for solving the VRPSD and discusses the real problem of municipal waste collection in the City of Niš.
ISSN:0354-2025
2335-0164
DOI:10.22190/FUME190318021M