By Topic

A Bi-objective Programming Model and Algorithm for Reverse Logistics Network Design Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bo He ; Coll. of Econ. & Bus. Adm., Chongqing Univ., Chongqing, China

The design of network to collect the products is a very important problem in reverse logistics. Most models in research are single objective models which only minimize the cost of designing the network. However, there usually involves multiple and conflicting objectives in the problem such as cost and service level. This paper proposes a bi-objective integer programming which optimize the cost and service level simultaneously to design the reverse logistics network. To solve the model, we design an evolutionary algorithm which can find the set of Pareto-optimal solutions. Furthermore, a numerical example is presented to illustrate the effectiveness of the proposed model and algorithm. Additionally, sensitivity analysis is presented on the Pareto-optimal set.

Published in:

Computational Sciences and Optimization (CSO), 2011 Fourth International Joint Conference on

Date of Conference:

15-19 April 2011