•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • ProfDoc
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

A Bi-Level Programming For Reverse Logistics Network Design

Author:
فرزاد دهقانیان
,
فاطمه مهدوی جعفری
,
وحید عدالت پور
,
Farzad Dehghanian
,
fatemeh mahdavi mahdavi
,
vahid edalat pour
Year
: 2012
Abstract: In this paper a nonlinear mixed integer bi-level programming model for designing a reverse logistics network is presented. The main goal for designing this network is to collect the End-of-Life (EOL) products and sending them for recycling in the supervision of the government. So the government purchased the EOLs from the customer zones and collects them in collection centers and then sells them to private sector for recycling. Government is the leader in this model and minimizes the total costs of purchasing and transportation of EOLs and defines the optimal price for purchasing and selling of EOLs. Private sector is considered as the follower and seeks to maximize its profit via recycling. Since the bi-level programming models are NP-hard, a heuristic approach based on the genetic algorithm has been applied to solve the presented bi-level model. Finally in this paper, results are given for an illustrative example.
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/3383203
Keyword(s): Bi-level programming,reverse logistics,End-Of-Life(EOL) product,Genetic algorithm
Collections :
  • ProfDoc
  • Show Full MetaData Hide Full MetaData
  • Statistics

    A Bi-Level Programming For Reverse Logistics Network Design

Show full item record

contributor authorفرزاد دهقانیانen
contributor authorفاطمه مهدوی جعفریen
contributor authorوحید عدالت پورen
contributor authorFarzad Dehghanianfa
contributor authorfatemeh mahdavi mahdavifa
contributor authorvahid edalat pourfa
date accessioned2020-06-06T14:07:13Z
date available2020-06-06T14:07:13Z
date copyright7/3/2012
date issued2012
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/3383203?locale-attribute=en
description abstractIn this paper a nonlinear mixed integer bi-level programming model for designing a reverse logistics network is presented. The main goal for designing this network is to collect the End-of-Life (EOL) products and sending them for recycling in the supervision of the government. So the government purchased the EOLs from the customer zones and collects them in collection centers and then sells them to private sector for recycling. Government is the leader in this model and minimizes the total costs of purchasing and transportation of EOLs and defines the optimal price for purchasing and selling of EOLs. Private sector is considered as the follower and seeks to maximize its profit via recycling. Since the bi-level programming models are NP-hard, a heuristic approach based on the genetic algorithm has been applied to solve the presented bi-level model. Finally in this paper, results are given for an illustrative example.en
languageEnglish
titleA Bi-Level Programming For Reverse Logistics Network Designen
typeConference Paper
contenttypeExternal Fulltext
subject keywordsBi-level programmingen
subject keywordsreverse logisticsen
subject keywordsEnd-Of-Life(EOL) producten
subject keywordsGenetic algorithmen
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1029982.html
conference titleInternational Conference on Industrial Engineering and Operations Managementen
conference locationاستانبولfa
identifier articleid1029982
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace