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, 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 Nis.

[1]  Nemanja Marković,et al.  CASTING IMPROVEMENT BASED ON METAHEURISTIC OPTIMIZATION AND NUMERICAL SIMULATION , 2017 .

[2]  Bülent Çatay,et al.  A robust enhancement to the Clarke–Wright savings algorithm , 2011, J. Oper. Res. Soc..

[3]  Gerrit K. Janssens,et al.  Iterated local search for the capacitated vehicle routing problem with sequence‐based pallet loading and axle weight constraints , 2017, Networks.

[4]  Erfan Babaee Tirkolaee,et al.  Developing an applied algorithm for multi-trip vehicle routing problem with time windows in urban waste collection: A case study , 2019, Waste management & research : the journal of the International Solid Wastes and Public Cleansing Association, ISWA.

[5]  Dragan Pamučar,et al.  VEHICLE ROUTE SELECTION WITH AN ADAPTIVE NEURO FUZZY INFERENCE SYSTEM IN UNCERTAINTY CONDITIONS , 2018 .

[6]  Juan José Salazar González,et al.  The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time , 2019, Eur. J. Oper. Res..

[7]  LaporteGilbert,et al.  Vehicle routing with backhauls , 2018 .

[8]  Seyda Topaloglu,et al.  A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery , 2016, Expert Syst. Appl..

[9]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[10]  Mahdi Alinaghian,et al.  Solving a robust capacitated arc routing problem using a hybrid simulated annealing algorithm: A waste collection application , 2016 .

[11]  Richard F. Hartl,et al.  A survey on dynamic and stochastic vehicle routing problems , 2016 .

[12]  Magdalene Marinaki,et al.  A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands , 2016, Expert Syst. Appl..

[13]  Rodrigo Linfati,et al.  A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem , 2018 .

[14]  Yang Peng,et al.  A Particle Swarm Optimization to Vehicle Routing Problem with Fuzzy Demands , 2010, J. Convergence Inf. Technol..

[15]  Maged M. Dessouky,et al.  A two‐stage vehicle routing model for large‐scale bioterrorism emergencies , 2009, Networks.

[16]  Zhenzhen Zhang,et al.  A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints , 2018, Eur. J. Oper. Res..

[17]  A. Lanzon,et al.  Design and control of novel tri-rotor UAV , 2012, Proceedings of 2012 UKACC International Conference on Control.

[18]  Louis-Martin Rousseau,et al.  A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints , 2016, J. Heuristics.

[19]  Nubia Velasco,et al.  A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands , 2008, Comput. Oper. Res..

[20]  S. Travis Waller,et al.  A Chance-Constrained Based Stochastic Dynamic Traffic Assignment Model: Analysis, Formulation and Solution Algorithms , 2006 .

[21]  Nubia Velasco,et al.  A multi population memetic algorithm for the vehicle routing problem with time windows and stochastic travel and service times , 2016 .

[22]  Pedro Amorim,et al.  The time window assignment vehicle routing problem with product dependent deliveries , 2018 .

[23]  Arindam Roy,et al.  A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique , 2019, Decision Making: Applications in Management and Engineering.

[24]  Günther R. Raidl,et al.  A Genetic Algorithm in Combination with a Solution Archive for Solving the Generalized Vehicle Routing Problem with Stochastic Demands , 2018, Transp. Sci..

[25]  Chandrasekharan Rajendran,et al.  Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain , 2018, Comput. Oper. Res..