Used Product Collection Optimization Using Genetic Algorithms

Used Product Collection Optimization Using Genetic Algorithms

Copyright: © 2014 |Pages: 16
DOI: 10.4018/978-1-4666-4908-8.ch004
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

This chapter addresses the collected used products transportation issue (i.e., used products are first transported from a set of collection points to a sorting centre and then returned to a facility for remanufacturing). The chapter starts with an introduction about the importance of transporting these collected returns in used products remanufacturing. Then, the related studies dealing with this issue are discussed in the background section. Next, the focal problem of this chapter (by considering timing and fuel consumption constraints) is stated in the problem statement section. A detailed description about the authors’ approach (i.e., first, formulating the targeted problem as a multiple travelling salesmen problem and then employing genetic algorithms to solve it) can be found in the proposed methodology section. Right after this, an illustrative example is explained in the experimental study section. The potential research directions regarding the main problem considered in this chapter are highlighted in the future trends section. Finally, the conclusion drawn in the last section closes this chapter.
Chapter Preview
Top

Background

Collection/Transportation

Collection/transportation has come up as a new research paradigm in operations management (Dekker, Bloemhof, & Mallidis, 2012; Fleischmann et al., 1997; Guide & Jayaraman, 2000). For example, in (Aksen, Aras, & Karaarslan, 2009; Kulshreshtha & Sarangi, 2001; Sheu, Chou, & Hu, 2005), the authors studied the subsidization agreement between the government and a company engaged in collection and recovery operations; in (Ferguson & Toktay, 2006; Mitra & Webster, 2008), the authors focused their research on using collection to limit the availability of used products for competitors; in (Barros, Dekker, & Scholten, 1998; Jayaraman, Patterson, & Rolland, 2003; Louwers, Kip, Peters, Souren, & Flapper, 1999; Min, Ko, & Ko, 2006), the authors considered discrete facility location-allocation models with deterministic collection quantities; in (Alinovi, Bottani, & Montanari, 2012; Aras & Aksen, 2008; Aras, Aksen, & Tanugur, 2008; Guide, Teunter, & Wassenhove, 2003; Ray, Boyaci, & Aras, 2005), the authors studied on incentive-dependent modelling of collection; in addition Wojanowski, Verter, and Boyaci (2007) studied the issues of network design under deposit-refund; and Savaskan and Wassenhove (2006) considered the tradeoffs between two collection channel structure (i.e., direct and indirect).

Complete Chapter List

Search this Book:
Reset