The formulation of a linear programming model for the vehicle routing problem in order to minimize idle time

Basit Öğe Kaydı
dc.contributor.authorÇam, Ömer Nuri
dc.contributor.authorSezen, Hayrettin Kemal
dc.date.accessioned2025-02-06T18:01:19Z
dc.date.available2025-02-06T18:01:19Z
dc.date.issued2020
dc.departmentAltınbaş Üniversitesien_US
dc.description.abstractThe paper deals with the question, "What is the Vehicle Routing Problem, Which Is Minimized Idle Time, and How Its Linear Programming Model Is Written?" In this study, a linear programming (LP) model has been developed for the vehicle routing problem (VRP) in order to minimize the total idle time (MIT). This problem was realized while managing the route operations of a company transporting long-distance passengers by bus in Turkey. The differences between this problem and other VRPs first arise from its objective function. It suggests that vehicles should work more because they make profit if they work. So, its objective function should be defined so as to minimize the sum of the idle time of those vehicles. Contrary to the VR problems examined so far, vehicles should work more, sometimes preferring long-distance routes as well. The other two differences pertain to constraints: Some locations should be visited more than once in different time periods, and subtours could be allowed in some situations. In order to present the problem, a total of 34 routes of the company which belongs to one of the five subgroups were chosen for the samples. To solve this kind of problems, it is very important that exact methods, such as linear programming or branch and bound, should be used. © 2020 Regional Association for Security and crisis management. All rights reserved.en_US
dc.identifier.doi10.31181/dmame2003132h
dc.identifier.endpage29en_US
dc.identifier.issn2560-6018
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85086726578
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage22en_US
dc.identifier.urihttps://doi.org/10.31181/dmame2003132h
dc.identifier.urihttps://hdl.handle.net/20.500.12939/5303
dc.identifier.volume3en_US
dc.indekslendigikaynakScopus
dc.language.isoenen_US
dc.publisherRegional Association for Security and crisis managementen_US
dc.relation.ispartofDecision Making: Applications in Management and Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmzKA_Scopus_20250206
dc.subjectLinear programmingen_US
dc.subjectLocation and time pointen_US
dc.subjectMinimizing idle timeen_US
dc.subjectVehicle routing problemen_US
dc.titleThe formulation of a linear programming model for the vehicle routing problem in order to minimize idle timeen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu