• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      The green location-routing problem

      Thumbnail
      Embargo Lift Date: 2022-05-01
      View / Download
      1.6 Mb
      Author(s)
      Dükkancı, Okan
      Kara, Bahar Y.
      Bektaş, Tolga
      Date
      2019
      Source Title
      Computers and Operations Research
      Print ISSN
      0305-0548
      Publisher
      Elsevier
      Volume
      105
      Pages
      187 - 202
      Language
      English
      Type
      Article
      Item Usage Stats
      217
      views
      97
      downloads
      Abstract
      This 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.
      Keywords
      Vehicle routing
      Depot location
      Fuel consumption
      CO2 emissions
      Integer programming
      Permalink
      http://hdl.handle.net/11693/52863
      Published Version (Please cite this version)
      https://dx.doi.org/10.1016/j.cor.2019.01.011
      Collections
      • Department of Industrial Engineering 758
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy