Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Clonal Selection Algorithm for Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem
School of Production Engineering and Management, Technical University of Crete, Chania, Greece.
School of Production Engineering and Management, Technical University of Crete, Chania, Greece.
School of Production Engineering and Management, Technical University of Crete, Chania, Greece.
School of Production Engineering and Management, Technical University of Crete, Chania, Greece.
Vise andre og tillknytning
2019 (engelsk)Inngår i: Machine Learning, Optimization, and Data Science: 4th International Conference, LOD 2018, Volterra, Italy, September 13-16, 2018, Revised Selected Papers / [ed] Giuseppe Nicosia, Panos Pardalos, Giovanni Giuffrida, Renato Umeton, Vincenzo Sciacca, Springer, 2019, s. 381-393Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Clonal Selection Algorithm is a very powerful Nature Inspired Algorithm that has been applied in a number of different kind of optimization problems since the time it was first published. Also, in recent years a growing number of optimization models have been proposed that are trying to reduce the energy consumption in vehicle routing. In this paper, a new variant of Clonal Selection Algorithm, the Parallel Multi-Start Multiobjective Clonal Selection Algorithm (PMS-MOCSA) is proposed for the solution of a Vehicle Routing Problem variant, the Multiobjective Energy Reduction Multi-Depot Vehicle Routing Problem (MERMDVRP). In the formulation four different scenarios are proposed where the distances between the customers and the depots are either symmetric or asymmetric and the customers have either demand or pickup. The algorithm is compared with two other multiobjective algorithms, the Parallel Multi-Start Non-dominated Sorting Differential Evolution (PMS-NSDE) and the Parallel Multi-Start Non-dominated Sorting Genetic Algorithm II (PMS-NSGA II) for a number of benchmark instances.

sted, utgiver, år, opplag, sider
Springer, 2019. s. 381-393
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 11331
Emneord [en]
Vehicle Routing Problem, Clonal Selection Algorithm, NSGA II, NSDE, VNS
HSV kategori
Forskningsprogram
Kvalitetsteknik och logistik
Identifikatorer
URN: urn:nbn:se:ltu:diva-73561DOI: 10.1007/978-3-030-13709-0_32Scopus ID: 2-s2.0-85063570552OAI: oai:DiVA.org:ltu-73561DiVA, id: diva2:1303763
Konferanse
The 4th International Conference on Machine Learning, Optimization, and Data Science (LOD 2018), 13-16 September, 2018, Volterra (Pisa), Italy
Merknad

ISBN för värdpublikation: 978-3-030-13708-3, 978-3-030-13709-0

Tilgjengelig fra: 2019-04-10 Laget: 2019-04-10 Sist oppdatert: 2025-10-22bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Migdalas, Athanasios

Søk i DiVA

Av forfatter/redaktør
Migdalas, Athanasios
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 741 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf