Publication:
Location and selective routing problem with pricing for the collection of used products

dc.contributor.coauthorAras, Necati
dc.contributor.coauthorTekin, Tugrul
dc.contributor.departmentDepartment of Business Administration
dc.contributor.kuauthorAksen, Deniz
dc.contributor.schoolcollegeinstituteCollege of Administrative Sciences and Economics
dc.date.accessioned2024-11-09T23:29:02Z
dc.date.issued2010
dc.description.abstractOne of the key concerns of the companies involved in product recovery is used product (core) acquisition. In this paper, we consider a firm that aims to locate facilities which serve as collection centers (CCs) for the cores to be collected from the dealers. The dealer addresses as well as the amount of cores piled up at each dealer are known. Also, each dealer has a reservation price for the cores, and if the offered acquisition price by the firm is less than this reservation price, the dealer will not return its cores. The collection operation is performed by vehicles that must start and end their routes at the same CC without visiting another one in the route. The objective of the firm is to maximize its profit by determining the locations of the CCs, the acquisition price offered for each core, the number of vehicles allocated to each opened CC and the route of each vehicle. The source of the revenue is the cost savings that results from using the components of the cores in remanufacturing as-good-as-new products. For the solution of this problem, we develop a mixed-integer linear programming formulation, which is an extension of the classical location-routing problem where (i) there is a profit associated with each dealer visited and not all dealers have to be visited, and (ii) an acquisition price has to be paid to the dealers for each core. Since this problem is NP-hard, we develop a tabu search heuristic for solving large instances.
dc.description.indexedbyScopus
dc.description.openaccessYES
dc.description.publisherscopeInternational
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipComputers and Industrial Engineering: An International Journal
dc.description.sponsorshipJapan Federation of Management Related Academies (JFMA)
dc.description.sponsorshipJapan Industrial Management Association (JIMA)
dc.description.sponsorshipThe Operational Research Society of Japan (ORSJ)
dc.description.sponsorshipThe Japan Institute of Industrial Engineering (JIIE)
dc.identifier.doi10.1109/ICCIE.2010.5668217
dc.identifier.isbn9781-4244-7295-6
dc.identifier.quartileN/A
dc.identifier.scopus2-s2.0-78651445640
dc.identifier.urihttps://doi.org/10.1109/ICCIE.2010.5668217
dc.identifier.urihttps://hdl.handle.net/20.500.14288/11971
dc.keywordsAcquisition price
dc.keywordsCost saving
dc.keywordsLocation routing problem
dc.keywordsMixed integer linear programming
dc.keywordsNew product
dc.keywordsNP-hard
dc.keywordsNumber of vehicles
dc.keywordsProduct recovery
dc.keywordsReservation price
dc.keywordsRouting problems
dc.keywordsTabu Search heuristic
dc.keywordsUsed product
dc.keywordsCosts
dc.keywordsEconomics
dc.keywordsHeuristic algorithms
dc.keywordsIndustrial engineering
dc.keywordsInteger programming
dc.keywordsProfitability
dc.keywordsSoft computing
dc.keywordsTabu search
dc.keywordsMergers and acquisitions
dc.language.isoeng
dc.publisherIEEE
dc.relation.ispartof40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010
dc.subjectBusiness administration
dc.subjectEngineering
dc.titleLocation and selective routing problem with pricing for the collection of used products
dc.typeConference Proceeding
dspace.entity.typePublication
local.contributor.kuauthorAksen, Deniz
local.publication.orgunit1College of Administrative Sciences and Economics
local.publication.orgunit2Department of Business Administration
relation.isOrgUnitOfPublicationca286af4-45fd-463c-a264-5b47d5caf520
relation.isOrgUnitOfPublication.latestForDiscoveryca286af4-45fd-463c-a264-5b47d5caf520
relation.isParentOrgUnitOfPublication972aa199-81e2-499f-908e-6fa3deca434a
relation.isParentOrgUnitOfPublication.latestForDiscovery972aa199-81e2-499f-908e-6fa3deca434a

Files