A GRASP algorithm with path relinking for the multi-depot location routing problem with stochastic customersA GRASP algorithm with path relinking for the multi-depot location routing problem with stochastic customers
Περίληψη Δημοσίευσης σε Συνέδριο
Conference Paper Abstract
2015-11-062014enIn this paper, a Stochastic Location Routing Problem is formulated using a number of capacitated depots, each one having one vehicle with no capacities restriction. We use a two phase algorithm based on GRASP for solving the problem. In the first phase, the open depots are determined and in the second phase, an a priori route is constructed for each one of the depots. The cost is the sum of the set up cost of the depots and the expected length of the routes. Different scenarios are examined in which each customer has either a homogeneous or a heterogeneous probability of requiring a visit.http://creativecommons.org/licenses/by/4.0/20th Conference of the International Federation of Operational Research Societies
Marinakis Ioannis
Μαρινακης Ιωαννης
Marinaki Magdalini
Μαρινακη Μαγδαληνη