RT info:eu-repo/semantics/conferenceObject
T1 A greedy randomized adaptive search procedure for solving the uncapacitated plant cycle problem
A1 López Plata, Israel
A1 Expósito Izquierdo, Cristofer Juan
A1 Lalla Ruiz, Eduardo
A1 Melián Batista, María Belén
A1 Moreno Vega, José Marcos
A2 Ingeniería Informática y de Sistemas
K1 Greedy randomized adaptive search procedure
K1 Uncapacitated plant cycle problem
K1 Logistics
AB The Uncapacitated Plant Cycle Problem seeks to select asubset of potential locations in which to open plants dedicated to provideservice to customers scattered abroad upon the field. The locationsare known and each plant can serve an unlimited number of customersthrough a vehicle route. The objective of this problem is to (i) determinethe number of plants to open, (ii) select the subset of locations in whichto open the plants, (iii) assign a non-empty subset of customers to eachplant, and (iv) determine a vehicle route dedicated to serve the subsetof customers assigned to each plant. With the goal of solving this problemfrom an approximate point of view, a Greedy Randomized AdaptiveSearch Procedure is proposed in this paper. The computational experimentsdisclose the suitable performance of this algorithmic approach,which allows to reach high-quality solutions in reasonable computationaltimes.
YR 2015
FD 2015
LK http://riull.ull.es/xmlui/handle/915/40626
UL http://riull.ull.es/xmlui/handle/915/40626
LA en
DS Repositorio institucional de la Universidad de La Laguna
RD 20-ene-2025