A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem

Israel López-Plata; Christopher Expósito-Izquierdo; Eduardo Lalla-Ruiz; Belén Melián-Batista; J. Marcos Moreno-Vega

doi:10.1007/978-3-319-27340-2_33

A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem

Israel López-Plata, Christopher Expósito-Izquierdo, Eduardo Lalla-Ruiz, Belén Melián-Batista, J. Marcos Moreno-Vega

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

1 Citation (Scopus)

Abstract

The Uncapacitated Plant Cycle Problem seeks to select a subset of potential locations in which to open plants dedicated to provide service to customers scattered abroad upon the field. The locations are known and each plant can serve an unlimited number of customers through a vehicle route. The objective of this problem is to (i) determine the number of plants to open, (ii) select the subset of locations in which to open the plants, (iii) assign a non-empty subset of customers to each plant, and (iv) determine a vehicle route dedicated to serve the subset of customers assigned to each plant. With the goal of solving this problem from an approximate point of view, a Greedy Randomized Adaptive Search Procedure is proposed in this paper. The computational experiments disclose the suitable performance of this algorithmic approach, which allows to reach high-quality solutions in reasonable computational times.

Original language	English
Title of host publication	Computer Aided Systems Theory – EUROCAST 2015
Subtitle of host publication	15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers
Place of Publication	Cham
Publisher	Springer
Pages	263-270
Number of pages	8
ISBN (Electronic)	978-3-319-27340-2
ISBN (Print)	978-3-319-27339-6
DOIs	https://doi.org/10.1007/978-3-319-27340-2_33
Publication status	Published - 17 Dec 2015
Externally published	Yes
Event	15th International Conference on Computer Aided Systems Theory, EUROCAST 2015 - Las Palmas de Gran Canaria, Spain Duration: 8 Feb 2015 → 13 Feb 2015 Conference number: 15

Publication series

Name	Lecture Notes in Computer Science
Volume	9520
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	15th International Conference on Computer Aided Systems Theory, EUROCAST 2015
Abbreviated title	EUROCAST
Country/Territory	Spain
City	Las Palmas de Gran Canaria
Period	8/02/15 → 13/02/15

Access to Document

10.1007/978-3-319-27340-2_33

Cite this

López-Plata, I., Expósito-Izquierdo, C., Lalla-Ruiz, E., Melián-Batista, B., & Moreno-Vega, J. M. (2015). A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. In Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers (pp. 263-270). (Lecture Notes in Computer Science; Vol. 9520). Springer. https://doi.org/10.1007/978-3-319-27340-2_33

López-Plata, Israel ; Expósito-Izquierdo, Christopher ; Lalla-Ruiz, Eduardo ; Melián-Batista, Belén ; Moreno-Vega, J. Marcos. / A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers. Cham : Springer, 2015. pp. 263-270 (Lecture Notes in Computer Science).

@inbook{5b81a977289544b98e623c0e24cd4755,

title = "A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem",

abstract = "The Uncapacitated Plant Cycle Problem seeks to select a subset of potential locations in which to open plants dedicated to provide service to customers scattered abroad upon the field. The locations are known and each plant can serve an unlimited number of customers through a vehicle route. The objective of this problem is to (i) determine the number of plants to open, (ii) select the subset of locations in which to open the plants, (iii) assign a non-empty subset of customers to each plant, and (iv) determine a vehicle route dedicated to serve the subset of customers assigned to each plant. With the goal of solving this problem from an approximate point of view, a Greedy Randomized Adaptive Search Procedure is proposed in this paper. The computational experiments disclose the suitable performance of this algorithmic approach, which allows to reach high-quality solutions in reasonable computational times.",

author = "Israel L{\'o}pez-Plata and Christopher Exp{\'o}sito-Izquierdo and Eduardo Lalla-Ruiz and Bel{\'e}n Meli{\'a}n-Batista and Moreno-Vega, {J. Marcos}",

year = "2015",

month = dec,

day = "17",

doi = "10.1007/978-3-319-27340-2_33",

language = "English",

isbn = "978-3-319-27339-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "263--270",

booktitle = "Computer Aided Systems Theory – EUROCAST 2015",

address = "Netherlands",

note = "15th International Conference on Computer Aided Systems Theory, EUROCAST 2015, EUROCAST ; Conference date: 08-02-2015 Through 13-02-2015",

}

López-Plata, I, Expósito-Izquierdo, C, Lalla-Ruiz, E, Melián-Batista, B & Moreno-Vega, JM 2015, A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. in Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers. Lecture Notes in Computer Science, vol. 9520, Springer, Cham, pp. 263-270, 15th International Conference on Computer Aided Systems Theory, EUROCAST 2015, Las Palmas de Gran Canaria, Spain, 8/02/15. https://doi.org/10.1007/978-3-319-27340-2_33

A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. / López-Plata, Israel; Expósito-Izquierdo, Christopher; Lalla-Ruiz, Eduardo; Melián-Batista, Belén; Moreno-Vega, J. Marcos.

Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers. Cham : Springer, 2015. p. 263-270 (Lecture Notes in Computer Science; Vol. 9520).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review

TY - CHAP

T1 - A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem

AU - López-Plata, Israel

AU - Expósito-Izquierdo, Christopher

AU - Lalla-Ruiz, Eduardo

AU - Melián-Batista, Belén

AU - Moreno-Vega, J. Marcos

N1 - Conference code: 15

PY - 2015/12/17

Y1 - 2015/12/17

N2 - The Uncapacitated Plant Cycle Problem seeks to select a subset of potential locations in which to open plants dedicated to provide service to customers scattered abroad upon the field. The locations are known and each plant can serve an unlimited number of customers through a vehicle route. The objective of this problem is to (i) determine the number of plants to open, (ii) select the subset of locations in which to open the plants, (iii) assign a non-empty subset of customers to each plant, and (iv) determine a vehicle route dedicated to serve the subset of customers assigned to each plant. With the goal of solving this problem from an approximate point of view, a Greedy Randomized Adaptive Search Procedure is proposed in this paper. The computational experiments disclose the suitable performance of this algorithmic approach, which allows to reach high-quality solutions in reasonable computational times.

AB - The Uncapacitated Plant Cycle Problem seeks to select a subset of potential locations in which to open plants dedicated to provide service to customers scattered abroad upon the field. The locations are known and each plant can serve an unlimited number of customers through a vehicle route. The objective of this problem is to (i) determine the number of plants to open, (ii) select the subset of locations in which to open the plants, (iii) assign a non-empty subset of customers to each plant, and (iv) determine a vehicle route dedicated to serve the subset of customers assigned to each plant. With the goal of solving this problem from an approximate point of view, a Greedy Randomized Adaptive Search Procedure is proposed in this paper. The computational experiments disclose the suitable performance of this algorithmic approach, which allows to reach high-quality solutions in reasonable computational times.

U2 - 10.1007/978-3-319-27340-2_33

DO - 10.1007/978-3-319-27340-2_33

M3 - Chapter

SN - 978-3-319-27339-6

T3 - Lecture Notes in Computer Science

SP - 263

EP - 270

BT - Computer Aided Systems Theory – EUROCAST 2015

PB - Springer

CY - Cham

T2 - 15th International Conference on Computer Aided Systems Theory, EUROCAST 2015

Y2 - 8 February 2015 through 13 February 2015

ER -

López-Plata I, Expósito-Izquierdo C, Lalla-Ruiz E, Melián-Batista B, Moreno-Vega JM. A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem. In Computer Aided Systems Theory – EUROCAST 2015 : 15th International Conference, Las Palmas de Gran Canaria, Spain, February 8-13, 2015, Revised Selected Papers. Cham: Springer. 2015. p. 263-270. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-27340-2_33

A Greedy Randomized Adaptive Search Procedure for Solving the Uncapacitated Plant Cycle Problem

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this