A GRASP algorithm with path relinking for the multi-depot location routing problem with stochastic customers

URI	http://purl.tuc.gr/dl/dias/AB7D33DE-40C3-4167-940D-0B9C84F9608D	-
Language	en	-
Title	A GRASP algorithm with path relinking for the multi-depot location routing problem with stochastic customers	en
Creator	Marinakis Ioannis	en
Creator	Μαρινακης Ιωαννης	el
Creator	Marinaki Magdalini	en
Creator	Μαρινακη Μαγδαληνη	el
Content Summary	In 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.	en
Type of Item	Περίληψη Δημοσίευσης σε Συνέδριο	el
Type of Item	Conference Paper Abstract	en
License	http://creativecommons.org/licenses/by/4.0/	en
Date of Item	2015-11-06	-
Date of Publication	2014	-
Bibliographic Citation	Y. Marinakis ,M. Marinaki ,"A GRASP algorithm with path relinking for the multi-depot location routing problem with stochastic customers,in 20th Conference of the International Federation of Operational Research Societies, 2014.	en

Export

Metadata & Content in a METS Package:

Metadata in Format: