Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach

Basit Öğe Kaydı
dc.contributor.authorCetinkaya, Cihan
dc.contributor.authorKaraoglan, Ismail
dc.contributor.authorGokcen, Hadi
dc.date.accessioned2020-03-26T18:44:19Z
dc.date.available2020-03-26T18:44:19Z
dc.date.issued2013
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractIn this paper, we introduce a new variant of the Vehicle Routing Problem (VRP), namely the Two-Stage Vehicle Routing Problem with Arc Time Windows (TS_VRP_ATWs) which generally emerges from both military and civilian transportation. The TS_VRP_ATW is defined as finding the vehicle routes in such a way that each arc of the routes is available only during a predefined time interval with the objective of overall cost minimization. We propose a Mixed Integer Programming (MIP) formulation and a heuristic approach based on Memetic Algorithm (MA) to solve the TS_VRP_ATW. The qualities of both solution approaches are measured by using the test problems in the literature. Experimental results show that the proposed MIP formulation provides the optimal solutions for the test problems with 25 and 50 nodes, and some test problems with 100 nodes. Results also show that the proposed MA is promising quality solutions in a short computation time. (C) 2013 Elsevier B.V. All rights reserved.en_US
dc.identifier.doi10.1016/j.ejor.2013.05.001en_US
dc.identifier.endpage550en_US
dc.identifier.issn0377-2217en_US
dc.identifier.issue3en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage539en_US
dc.identifier.urihttps://dx.doi.org/10.1016/j.ejor.2013.05.001
dc.identifier.urihttps://hdl.handle.net/20.500.12395/29976
dc.identifier.volume230en_US
dc.identifier.wosWOS:000322055400009en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherELSEVIER SCIENCE BVen_US
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCHen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectLogisticsen_US
dc.subjectVehicle routing problem with arc time windowsen_US
dc.subjectMemetic algorithmen_US
dc.subjectMathematical formulationen_US
dc.titleTwo-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approachen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu