Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)

A. B. Pratiwi; A. Sasmito; Q. S. Istiqomah; M. R. Kurniawan; H. Suprajitno

doi:10.1088/1742-6596/1306/1/012021

Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)

A. B. Pratiwi, A. Sasmito, Q. S. Istiqomah, M. R. Kurniawan, H. Suprajitno

Research output: Contribution to journal › Conference article › peer-review

2 Citations (Scopus)

Abstract

Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW) is problem of determining vehicles routes involving depot and number of customers in order to minimize the number of vehicles used and travel time. MTVRPTW has objective to minimize the total costs of transportation which are the number of tours, total tour duration time and range of duration time. This paper provides metaheuristic algorithms to solve the MTVRPTW. Firefly Algorithm, Cuckoo Search Algorithm and Flower Pollination Algorithm are applied and compared in exchange for having the performances. Based on the experimental results using different size of data shows that Firefly Algorithm performs better than Cuckoo Search Algorithm and Flower Pollination Algorithm in solving MTVRPTW.

Original language	English
Article number	012021
Journal	Journal of Physics: Conference Series
Volume	1306
Issue number	1
DOIs	https://doi.org/10.1088/1742-6596/1306/1/012021
Publication status	Published - 9 Sept 2019
Event	2nd International Conference on Mathematics: Education, Theory, and Application, ICMETA 2018 - Sukoharjo, Indonesia Duration: 30 Oct 2018 → 31 Oct 2018

Access to Document

10.1088/1742-6596/1306/1/012021

Cite this

@article{d318cf8c128146b4968949458b3d21b1,

title = "Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)",

abstract = "Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW) is problem of determining vehicles routes involving depot and number of customers in order to minimize the number of vehicles used and travel time. MTVRPTW has objective to minimize the total costs of transportation which are the number of tours, total tour duration time and range of duration time. This paper provides metaheuristic algorithms to solve the MTVRPTW. Firefly Algorithm, Cuckoo Search Algorithm and Flower Pollination Algorithm are applied and compared in exchange for having the performances. Based on the experimental results using different size of data shows that Firefly Algorithm performs better than Cuckoo Search Algorithm and Flower Pollination Algorithm in solving MTVRPTW.",

author = "Pratiwi, {A. B.} and A. Sasmito and Istiqomah, {Q. S.} and Kurniawan, {M. R.} and H. Suprajitno",

note = "Publisher Copyright: {\textcopyright} 2019 IOP Publishing Ltd. All rights reserved.; 2nd International Conference on Mathematics: Education, Theory, and Application, ICMETA 2018 ; Conference date: 30-10-2018 Through 31-10-2018",

year = "2019",

month = sep,

day = "9",

doi = "10.1088/1742-6596/1306/1/012021",

language = "English",

volume = "1306",

journal = "Journal of Physics: Conference Series",

issn = "1742-6588",

publisher = "IOP Publishing Ltd.",

number = "1",

}

TY - JOUR

T1 - Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)

AU - Pratiwi, A. B.

AU - Sasmito, A.

AU - Istiqomah, Q. S.

AU - Kurniawan, M. R.

AU - Suprajitno, H.

PY - 2019/9/9

Y1 - 2019/9/9

N2 - Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW) is problem of determining vehicles routes involving depot and number of customers in order to minimize the number of vehicles used and travel time. MTVRPTW has objective to minimize the total costs of transportation which are the number of tours, total tour duration time and range of duration time. This paper provides metaheuristic algorithms to solve the MTVRPTW. Firefly Algorithm, Cuckoo Search Algorithm and Flower Pollination Algorithm are applied and compared in exchange for having the performances. Based on the experimental results using different size of data shows that Firefly Algorithm performs better than Cuckoo Search Algorithm and Flower Pollination Algorithm in solving MTVRPTW.

AB - Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW) is problem of determining vehicles routes involving depot and number of customers in order to minimize the number of vehicles used and travel time. MTVRPTW has objective to minimize the total costs of transportation which are the number of tours, total tour duration time and range of duration time. This paper provides metaheuristic algorithms to solve the MTVRPTW. Firefly Algorithm, Cuckoo Search Algorithm and Flower Pollination Algorithm are applied and compared in exchange for having the performances. Based on the experimental results using different size of data shows that Firefly Algorithm performs better than Cuckoo Search Algorithm and Flower Pollination Algorithm in solving MTVRPTW.

UR - http://www.scopus.com/inward/record.url?scp=85072679365&partnerID=8YFLogxK

U2 - 10.1088/1742-6596/1306/1/012021

DO - 10.1088/1742-6596/1306/1/012021

M3 - Conference article

AN - SCOPUS:85072679365

SN - 1742-6588

VL - 1306

JO - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

IS - 1

M1 - 012021

T2 - 2nd International Conference on Mathematics: Education, Theory, and Application, ICMETA 2018

Y2 - 30 October 2018 through 31 October 2018

ER -

Metaheuristic Algorithms for Solving Multiple-Trips Vehicle Routing Problem with Time Windows (MTVRPTW)

Abstract

Access to Document

Fingerprint

Cite this