The green location-routing problem

Simple item page
buir.contributor.authorDükkancı, Okan
buir.contributor.authorKara, Bahar Y.
buir.contributor.authorBektaş, Tolga
dc.citation.epage202en_US
dc.citation.spage187en_US
dc.citation.volumeNumber105en_US
dc.contributor.authorDükkancı, Okanen_US
dc.contributor.authorKara, Bahar Y.en_US
dc.contributor.authorBektaş, Tolgaen_US
dc.date.accessioned2020-01-28T07:48:35Z
dc.date.available2020-01-28T07:48:35Z
dc.date.issued2019
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractThis paper introduces the Green Location-Routing Problem (GLRP), a combination of the classical Location-Routing Problem (LRP) and the Pollution-Routing Problem (PRP). The GLRP consists of (i) locating depots on a subset of a discrete set of points, from where vehicles of limited capacity will be dispatched to serve a number of customers with service requirements, (ii) routing the vehicles by determining the order of customers served by each vehicle and (iii) setting the speed on each leg of the journey such that customers are served within their respective time windows. The objective of the GLRP is to minimize a cost function comprising the fixed cost of operating depots, as well as the costs of the fuel and CO2 emissions. The amount of fuel consumption and emissions is measured by a widely used comprehensive modal emission model. The paper presents a mixed integer programming formulation and a set of preprocessing rules and valid inequalities to strengthen the formulation. Two solution approaches; an integer programming based algorithm and an iterated local search algorithm are also presented. Computational analyses are carried out using adaptations of literature instances to the GLRP in order to analyze the effects of a number parameters on location and routing decisions in terms of cost, fuel consumption and emission. The performance of the heuristic algorithms are also evaluated.en_US
dc.description.provenanceSubmitted by Onur Emek (onur.emek@bilkent.edu.tr) on 2020-01-28T07:48:34Z No. of bitstreams: 1 Bilkent-research-paper.pdf: 268963 bytes, checksum: ad2e3a30c8172b573b9662390ed2d3cf (MD5)en
dc.description.provenanceMade available in DSpace on 2020-01-28T07:48:35Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 268963 bytes, checksum: ad2e3a30c8172b573b9662390ed2d3cf (MD5) Previous issue date: 2019en
dc.embargo.release2022-05-01
dc.identifier.doi10.1016/j.cor.2019.01.011en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/52863
dc.language.isoEnglishen_US
dc.publisherElsevieren_US
dc.relation.isversionofhttps://dx.doi.org/10.1016/j.cor.2019.01.011en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectVehicle routingen_US
dc.subjectDepot locationen_US
dc.subjectFuel consumptionen_US
dc.subjectCO2 emissionsen_US
dc.subjectInteger programmingen_US
dc.titleThe green location-routing problemen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
The_green_location-routing_problem.pdf
Size:
1.63 MB
Format:
Adobe Portable Document Format
Description:
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