A branch-and-cut algorithm for the alternative fuel refueling station location problem with routing

Simple item page
buir.contributor.authorKaraşan, Oya Ekin
buir.contributor.authorYaman, Hande
dc.citation.epage1125en_US
dc.citation.issueNumber4en_US
dc.citation.spage1107en_US
dc.citation.volumeNumber53en_US
dc.contributor.authorArslan, O.en_US
dc.contributor.authorKaraşan, Oya Ekinen_US
dc.contributor.authorMahjoub, A. R.en_US
dc.contributor.authorYaman, Handeen_US
dc.date.accessioned2020-02-18T11:44:10Z
dc.date.available2020-02-18T11:44:10Z
dc.date.issued2019
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractBecause of the limited range of alternative fuel vehicles (AFVs) and the sparsity of the available alternative refueling stations (AFSs), AFV drivers cooperatively deviate from their paths to refuel. This deviation is bounded by the drivers’ tolerance. Taking this behavior into account, the refueling station location problem with routing (RSLP-R) is defined as maximizing the AFV flow that can be accommodated in a road network by locating a given number of AFSs while respecting the range limitation of the vehicles and the deviation tolerance of the drivers. In this study, we develop a natural model for the RSLP-R based on the notion of length-bounded cuts, analyze the polyhedral properties of this model, and develop a branch-and-cut algorithm as an exact solution approach. Extensive computational experiments show that the algorithm significantly improves the solution times with respect to previously developed exact solution methods and extends the size of the instances solved to optimality. Using our methodology, we investigate the tradeoffs between covered vehicle flow and deviation tolerance of the drivers and present insights on deviation characteristics of drivers in a case study in California.en_US
dc.description.provenanceSubmitted by Zeynep Aykut (zeynepay@bilkent.edu.tr) on 2020-02-18T11:44:10Z No. of bitstreams: 1 A_branch_and_cut_algorithm_for_the_alternative_fuel_refueling_station_location_problem_with_routing.pdf: 1096156 bytes, checksum: 9c8a6172baef85b673ff9a4b2c553261 (MD5)en
dc.description.provenanceMade available in DSpace on 2020-02-18T11:44:10Z (GMT). No. of bitstreams: 1 A_branch_and_cut_algorithm_for_the_alternative_fuel_refueling_station_location_problem_with_routing.pdf: 1096156 bytes, checksum: 9c8a6172baef85b673ff9a4b2c553261 (MD5) Previous issue date: 2019en
dc.identifier.doi10.1287/trsc.2018.0869en_US
dc.identifier.issn0041-1655
dc.identifier.urihttp://hdl.handle.net/11693/53406
dc.language.isoEnglishen_US
dc.publisherINFORMSen_US
dc.relation.isversionofhttps://dx.doi.org/10.1287/trsc.2018.0869en_US
dc.source.titleTransportation Scienceen_US
dc.subjectAlternative fuel vehiclesen_US
dc.subjectRefueling stationen_US
dc.subjectLocationen_US
dc.subjectRoutingen_US
dc.subjectBranch-and-cuten_US
dc.subjectLength-bounded cuten_US
dc.titleA branch-and-cut algorithm for the alternative fuel refueling station location problem with routingen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_branch_and_cut_algorithm_for_the_alternative_fuel_refueling_station_location_problem_with_routing.pdf
Size:
1.05 MB
Format:
Adobe Portable Document Format
Description:
View / Download
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Industrial Engineering