Artikel

Solving the vehicle routing problem by a hybrid meta-heuristic algorithm

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW, and at the second stage, the ACS and 3-opt local search are used for improving the solutions. Extensive computational tests on standard instances from the literature confirm the effectiveness of the presented approach.

Sprache
Englisch

Erschienen in
Journal: Journal of Industrial Engineering International ; ISSN: 2251-712X ; Volume: 8 ; Year: 2012 ; Pages: 1-9 ; Heidelberg: Springer

Klassifikation
Management
Thema
ant colony system
NP-hard problems
sweep algorithm
vehicle routing problem

Ereignis
Geistige Schöpfung
(wer)
Yousefikhoshbakht, Majid
Khorram, Esmaile
Ereignis
Veröffentlichung
(wer)
Springer
(wo)
Heidelberg
(wann)
2012

DOI
doi:10.1186/2251-712X-8-11
Handle
Letzte Aktualisierung
10.03.2025, 11:43 MEZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Objekttyp

  • Artikel

Beteiligte

  • Yousefikhoshbakht, Majid
  • Khorram, Esmaile
  • Springer

Entstanden

  • 2012

Ähnliche Objekte (12)