A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem

Eduardo Lalla-Ruiz; Stefan Voß

doi:10.1007/978-3-319-19084-6_19

A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem

Eduardo Lalla-Ruiz
, Stefan Voß

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

9 Citations (Scopus)

Abstract

The Multiple Knapsack Assignment Problem (MKAP) is an extension of the Multiple Knapsack Problem, a well-known NP-hard combinatorial optimization problem. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.

Original language	English
Title of host publication	Learning and Intelligent Optimization
Subtitle of host publication	9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers
Editors	Clarisse Dhaenens, Laetitia Jourdan, Marie-Eléonore Marmion
Place of Publication	Cham
Publisher	Springer
Pages	218-222
Number of pages	5
ISBN (Electronic)	978-3-319-19084-6
ISBN (Print)	978-3-319-19083-9
DOIs	https://doi.org/10.1007/978-3-319-19084-6_19
Publication status	Published - 29 May 2015
Externally published	Yes
Event	9th International Conference on Learning and Intelligent Optimization, LION 2015 - Lille, France Duration: 12 Jan 2015 → 15 Jan 2015 Conference number: 9

Publication series

Name	Learning and Intelligent Optimization
Volume	8994
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	9th International Conference on Learning and Intelligent Optimization, LION 2015
Abbreviated title	LION
Country/Territory	France
City	Lille
Period	12/01/15 → 15/01/15

Access to Document

10.1007/978-3-319-19084-6_19

Cite this

Lalla-Ruiz, E., & Voß, S. (2015). A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem. In C. Dhaenens, L. Jourdan, & M.-E. Marmion (Eds.), Learning and Intelligent Optimization : 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers (pp. 218-222). (Learning and Intelligent Optimization; Vol. 8994). Springer. https://doi.org/10.1007/978-3-319-19084-6_19

Lalla-Ruiz, Eduardo ; Voß, Stefan. / A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem. Learning and Intelligent Optimization : 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers. editor / Clarisse Dhaenens ; Laetitia Jourdan ; Marie-Eléonore Marmion. Cham : Springer, 2015. pp. 218-222 (Learning and Intelligent Optimization).

@inproceedings{2228c9fd6cac4766bd0f1bdbc3a29b98,

title = "A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem",

abstract = "The Multiple Knapsack Assignment Problem (MKAP) is an extension of the Multiple Knapsack Problem, a well-known NP-hard combinatorial optimization problem. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.",

author = "Eduardo Lalla-Ruiz and Stefan Vo{\ss}",

year = "2015",

month = may,

day = "29",

doi = "10.1007/978-3-319-19084-6\_19",

language = "English",

isbn = "978-3-319-19083-9",

series = "Learning and Intelligent Optimization",

publisher = "Springer",

pages = "218--222",

editor = "Clarisse Dhaenens and Laetitia Jourdan and Marie-El{\'e}onore Marmion",

booktitle = "Learning and Intelligent Optimization",

address = "Germany",

note = "9th International Conference on Learning and Intelligent Optimization, LION 2015, LION ; Conference date: 12-01-2015 Through 15-01-2015",

}

Lalla-Ruiz, E & Voß, S 2015, A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem. in C Dhaenens, L Jourdan & M-E Marmion (eds), Learning and Intelligent Optimization : 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers. Learning and Intelligent Optimization, vol. 8994, Springer, Cham, pp. 218-222, 9th International Conference on Learning and Intelligent Optimization, LION 2015, Lille, France, 12/01/15. https://doi.org/10.1007/978-3-319-19084-6_19

A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem. / Lalla-Ruiz, Eduardo; Voß, Stefan.
Learning and Intelligent Optimization : 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers. ed. / Clarisse Dhaenens; Laetitia Jourdan; Marie-Eléonore Marmion. Cham: Springer, 2015. p. 218-222 (Learning and Intelligent Optimization; Vol. 8994).

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

TY - GEN

T1 - A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem

AU - Lalla-Ruiz, Eduardo

AU - Voß, Stefan

N1 - Conference code: 9

PY - 2015/5/29

Y1 - 2015/5/29

N2 - The Multiple Knapsack Assignment Problem (MKAP) is an extension of the Multiple Knapsack Problem, a well-known NP-hard combinatorial optimization problem. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.

AB - The Multiple Knapsack Assignment Problem (MKAP) is an extension of the Multiple Knapsack Problem, a well-known NP-hard combinatorial optimization problem. The MKAP is a hard problem even for small-sized instances. In this paper, we propose an approximate approach for the MKAP based on a biased random key genetic algorithm. Our solution approach exhibits competitive performance when compared to the best approximate approach reported in the literature.

U2 - 10.1007/978-3-319-19084-6_19

DO - 10.1007/978-3-319-19084-6_19

M3 - Conference contribution

SN - 978-3-319-19083-9

T3 - Learning and Intelligent Optimization

SP - 218

EP - 222

BT - Learning and Intelligent Optimization

A2 - Dhaenens, Clarisse

A2 - Jourdan, Laetitia

A2 - Marmion, Marie-Eléonore

PB - Springer

CY - Cham

T2 - 9th International Conference on Learning and Intelligent Optimization, LION 2015

Y2 - 12 January 2015 through 15 January 2015

ER -

Lalla-Ruiz E, Voß S. A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem. In Dhaenens C, Jourdan L, Marmion ME, editors, Learning and Intelligent Optimization : 9th International Conference, LION 9, Lille, France, January 12-15, 2015. Revised Selected Papers. Cham: Springer. 2015. p. 218-222. (Learning and Intelligent Optimization). doi: 10.1007/978-3-319-19084-6_19

A Biased Random-Key Genetic Algorithm for the Multiple Knapsack Assignment Problem

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this