Change search

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
An Adaptive Particle Swarm Optimization Algorithm for the Vehicle Routing Problem with Time Window
School of Production Engineering and Management, Technical University of Crete, Decision Support Systems Laboratory, Department of Production Engineering and Management, Technical University of Crete.
School of Production Engineering and Management, Technical University of Crete.
Luleå University of Technology, Department of Business Administration, Technology and Social Sciences, Business Administration and Industrial Engineering.ORCID iD: 0000-0001-8473-3663
2014 (English)Conference paper, Oral presentation only (Refereed)
Abstract [en]

A new hybridized algorithm based on Particle Swarm Optimization is proposed for the solution of the Vehicle Routing Problem with Time Windows. The algorithm uses a relative new topology, the Combinatorial Neighborhood Topology and, thus, a solution is not needed to be transformed in continuous values during the iterations, which makes Particle Swarm Optimization a competitive algorithm in solving routing problems. Also, in the proposed algorithm all the parameters (acceleration coefficients, iterations, local search iterations, upper and lower bounds of the velocities and of the positions and number of particles) are optimized during the procedure and, thus, the algorithm works independently and without any interference from the user. All parameters are randomly initialized and, afterwards, during the iterations the parameters are adapted based on a number of different conditions. The algorithm uses a number of different velocities’ equations and each particle selects randomly its velocity equation and during the iterations the particle has the possibility to change the velocity equation based on the produced quality of the solution. The algorithm is tested in known benchmark instances from the literature and gives very good results. It is also compared with other algorithms from the literature.

2014.
National Category
Production Engineering, Human Work Science and Ergonomics
Research subject
Industrial Logistics
Identifiers
Local ID: 92d5694a-2db8-442a-91c6-c0fba197cda0OAI: oai:DiVA.org:ltu-34867DiVA, id: diva2:1008119
Conference
Conference LOT 2014 : Logistics, optimization and transportation 01/09/2014 - 02/09/2014
Note
Godkänd; 2014; 20141124 (athmig)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2018-04-11Bibliographically approved

Open Access in DiVA

File information
File name FULLTEXT01.pdfFile size 37 kBChecksum SHA-512
61d1afe36730f5da3a0e9d1c68ba535c73da999a644e7c9d4738b8b6d6f6d448a06240ef5d044690579b61439f4cbdb8f85394e647ccc0411049a0af5831cb1d
Type fulltextMimetype application/pdf

http://kursinfo.himolde.no/forskningsgrupper/optimering/LOT2014/index.htm

Search in DiVA

By author/editor
Migdalas, Athanasios
On the subject
Production Engineering, Human Work Science and Ergonomics

Search outside of DiVA

The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
urn-nbn

Altmetric score

urn-nbn
Total: 96 hits

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
v. 2.35.2
|