Combinatorial neighborhood topology bumble bees mating optimization for the vehicle routing problem with stochastic demands
Gespeichert in:
Verfasser / Beitragende:
[Yannis Marinakis, Magdalene Marinaki]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/2(2015-02-01), 353-373
Format:
Artikel (online)
Online Zugang:
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605470693 | ||
| 003 | CHVBK | ||
| 005 | 20210128100329.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1257-1 |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1257-1 | ||
| 245 | 0 | 0 | |a Combinatorial neighborhood topology bumble bees mating optimization for the vehicle routing problem with stochastic demands |h [Elektronische Daten] |c [Yannis Marinakis, Magdalene Marinaki] |
| 520 | 3 | |a The bumble bees mating optimization (BBMO) algorithm is a relatively new swarm intelligence algorithm that simulates the mating behavior that a swarm of bumble bees performs. In this paper, this nature inspired algorithm is used in a hybrid scheme with other metaheuristic algorithms for successfully solving the vehicle routing problem with stochastic demands (VRPSD). More precisely, the proposed algorithm for the solution of the VRPSD, the combinatorial neighborhood topology bumble bees mating optimization, combines a BBMO algorithm, the variable neighborhood search algorithm and a path relinking procedure. The algorithm is evaluated on a set of benchmark instances (40 instances) from the literature and 16 new best solutions are found. The algorithm is compared with a number of algorithms from the literature (two versions of a particle swarm optimization algorithm, the classic one and the combinatorial expanding neighborhood topology particle swarm optimization algorithm, a differential evolution algorithm, a genetic algorithm and a honey bees mating optimization) and with the initial version of the BBMO algorithm. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Vehicle routing problem with stochastic demands |2 nationallicence | |
| 690 | 7 | |a Bumble bees mating optimization |2 nationallicence | |
| 690 | 7 | |a Combinatorial neighborhood topology |2 nationallicence | |
| 700 | 1 | |a Marinakis |D Yannis |u Decision Support Systems Laboratory, School of Production Engineering and Management, Technical University of Crete, University Campus, 73100, Chania, Crete, Greece |4 aut | |
| 700 | 1 | |a Marinaki |D Magdalene |u Computational Mechanics and Optimization Laboratory, School of Production Engineering and Management, Technical University of Crete, University Campus, 73100, Chania, Crete, Greece |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/2(2015-02-01), 353-373 |x 1432-7643 |q 19:2<353 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1257-1 |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1257-1 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Marinakis |D Yannis |u Decision Support Systems Laboratory, School of Production Engineering and Management, Technical University of Crete, University Campus, 73100, Chania, Crete, Greece |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Marinaki |D Magdalene |u Computational Mechanics and Optimization Laboratory, School of Production Engineering and Management, Technical University of Crete, University Campus, 73100, Chania, Crete, Greece |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/2(2015-02-01), 353-373 |x 1432-7643 |q 19:2<353 |1 2015 |2 19 |o 500 | ||