The rough set based approach to generic routing problems: case of reverse logistics supplier selection

Chun Che Huang, Wen Yau Liang, Tzu Liang Tseng, Ping Houa Chen

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In recent years, Reverse Logistics (RL) has been touted as one of the strategies of improving organization performance and generating a competitive advantage. In RL, the generic routing problem has become a focus since it provides a great flexibility in modeling, e.g., selection of suppliers by using a node as a supplier candidate in a network. To date, complicated networks make decision makers hard to search a desired routine. In addition, the traditional network defines and resolves such a problem only at one soot. The solution cannot be acquired from multiple perspectives like minimal cost, minimal delivery time, maximal reliability, and optimal “3Rs”—reduce, reuse, and recycle. In this study, rough set theory is applied to reduce complexity of the RL data sets and induct decision rules. Through incorporating the decision rules, the generic label correcting algorithm is used to solve generic routing problems by integrating various operators and comparators in the GLC algorithm. Consequently, the desired RL suppliers are selected.

Original languageEnglish
Pages (from-to)781-795
Number of pages15
JournalJournal of Intelligent Manufacturing
Volume27
Issue number4
DOIs
Publication statusPublished - 2016 Aug 1

Fingerprint

Logistics
Rough set theory
Soot
Mathematical operators
Labels
Costs

All Science Journal Classification (ASJC) codes

  • Software
  • Industrial and Manufacturing Engineering
  • Artificial Intelligence

Cite this

@article{b97d0019b13746a3956d0bb2cd9d9bf5,
title = "The rough set based approach to generic routing problems: case of reverse logistics supplier selection",
abstract = "In recent years, Reverse Logistics (RL) has been touted as one of the strategies of improving organization performance and generating a competitive advantage. In RL, the generic routing problem has become a focus since it provides a great flexibility in modeling, e.g., selection of suppliers by using a node as a supplier candidate in a network. To date, complicated networks make decision makers hard to search a desired routine. In addition, the traditional network defines and resolves such a problem only at one soot. The solution cannot be acquired from multiple perspectives like minimal cost, minimal delivery time, maximal reliability, and optimal “3Rs”—reduce, reuse, and recycle. In this study, rough set theory is applied to reduce complexity of the RL data sets and induct decision rules. Through incorporating the decision rules, the generic label correcting algorithm is used to solve generic routing problems by integrating various operators and comparators in the GLC algorithm. Consequently, the desired RL suppliers are selected.",
author = "Huang, {Chun Che} and Liang, {Wen Yau} and Tseng, {Tzu Liang} and Chen, {Ping Houa}",
year = "2016",
month = "8",
day = "1",
doi = "10.1007/s10845-014-0913-8",
language = "English",
volume = "27",
pages = "781--795",
journal = "Journal of Intelligent Manufacturing",
issn = "0956-5515",
publisher = "Springer Netherlands",
number = "4",

}

The rough set based approach to generic routing problems : case of reverse logistics supplier selection. / Huang, Chun Che; Liang, Wen Yau; Tseng, Tzu Liang; Chen, Ping Houa.

In: Journal of Intelligent Manufacturing, Vol. 27, No. 4, 01.08.2016, p. 781-795.

Research output: Contribution to journalArticle

TY - JOUR

T1 - The rough set based approach to generic routing problems

T2 - case of reverse logistics supplier selection

AU - Huang, Chun Che

AU - Liang, Wen Yau

AU - Tseng, Tzu Liang

AU - Chen, Ping Houa

PY - 2016/8/1

Y1 - 2016/8/1

N2 - In recent years, Reverse Logistics (RL) has been touted as one of the strategies of improving organization performance and generating a competitive advantage. In RL, the generic routing problem has become a focus since it provides a great flexibility in modeling, e.g., selection of suppliers by using a node as a supplier candidate in a network. To date, complicated networks make decision makers hard to search a desired routine. In addition, the traditional network defines and resolves such a problem only at one soot. The solution cannot be acquired from multiple perspectives like minimal cost, minimal delivery time, maximal reliability, and optimal “3Rs”—reduce, reuse, and recycle. In this study, rough set theory is applied to reduce complexity of the RL data sets and induct decision rules. Through incorporating the decision rules, the generic label correcting algorithm is used to solve generic routing problems by integrating various operators and comparators in the GLC algorithm. Consequently, the desired RL suppliers are selected.

AB - In recent years, Reverse Logistics (RL) has been touted as one of the strategies of improving organization performance and generating a competitive advantage. In RL, the generic routing problem has become a focus since it provides a great flexibility in modeling, e.g., selection of suppliers by using a node as a supplier candidate in a network. To date, complicated networks make decision makers hard to search a desired routine. In addition, the traditional network defines and resolves such a problem only at one soot. The solution cannot be acquired from multiple perspectives like minimal cost, minimal delivery time, maximal reliability, and optimal “3Rs”—reduce, reuse, and recycle. In this study, rough set theory is applied to reduce complexity of the RL data sets and induct decision rules. Through incorporating the decision rules, the generic label correcting algorithm is used to solve generic routing problems by integrating various operators and comparators in the GLC algorithm. Consequently, the desired RL suppliers are selected.

UR - http://www.scopus.com/inward/record.url?scp=84901581274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901581274&partnerID=8YFLogxK

U2 - 10.1007/s10845-014-0913-8

DO - 10.1007/s10845-014-0913-8

M3 - Article

AN - SCOPUS:84901581274

VL - 27

SP - 781

EP - 795

JO - Journal of Intelligent Manufacturing

JF - Journal of Intelligent Manufacturing

SN - 0956-5515

IS - 4

ER -