Unified heuristics to solve routing problem of reverse logistics in sustainable supply chain

International Journal of Systems Science (Impact Factor: 2.1). 03/2010; 41(3):337-351. DOI: 10.1080/00207720903326944
Source: DBLP


A reverse logistics problem, motivated by many real-life applications, is examined where bottles/cans in which products are delivered from a processing depot to customers in one period are available for return to the depot in the following period. The picked-up bottles/cans need to be adjusted in the place of delivery load. This problem is termed as simultaneous delivery and pick-up problem with constrained capacity (SDPC). We develop three unified heuristics based on extended branch and bound heuristic, genetic algorithm and simulated annealing to solve SDPC. These heuristics are also designed to solve standard travelling salesman problem (TSP) and TSP with simultaneous delivery and pick-up (TSDP). We tested the heuristics on standard, derived and randomly generated datasets of TSP, TSDP and SDPC and obtained satisfying results with high convergence in reasonable time.

19 Reads
  • Source
    • "The major challenging areas under these primary operations are vehicle routing, network design, and location /allocation. Vehicle routing, location and allocation of various logistics problems has been the focus of many recent researches (Anbuudayasankar et al., (2012), Sivakumar et al., (2012), Anbuudayasankar et al., (2010),). But most of these researches are applicable only in ordinary logistics problems. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Most of the disasters occur unexpectedly with respect to time, place and intensity. Due to these reasons, humanitarian logistics has attracted considerable research attention in the recent past. This paper reviews modeling parameters for objective functions and constraints in humanitarian logistics distribution. The objective functions that are realized in various humanitarian emergency operations aim to increase the supply of relief aid. In this paper, a classification based review methodology is employed to identify various cost functions and constraints for primary emergency operations in logistics viz. casualty transportation and relief distribution problems. Based on the classification, areas of future research are discussed that would be useful for key decision makers in planning logistics activities in emergency situations. The paper also serves to delineate the recent trends, challenges and research gaps in the area of Humanitarian Logistics.
    Procedia Engineering 12/2014; 97. DOI:10.1016/j.proeng.2014.12.469
  • [Show abstract] [Hide abstract]
    ABSTRACT: From the perspective of supply chain management, the selected carrier plays an important role in freight delivery. This article proposes a new criterion of multi-commodity reliability and optimises the carrier selection based on such a criterion for logistics networks with routes and nodes, over which multiple commodities are delivered. Carrier selection concerns the selection of exactly one carrier to deliver freight on each route. The capacity of each carrier has several available values associated with a probability distribution, since some of a carrier's capacity may be reserved for various orders. Therefore, the logistics network, given any carrier selection, is a multi-commodity multi-state logistics network. Multi-commodity reliability is defined as a probability that the logistics network can satisfy a customer's demand for various commodities, and is a performance indicator for freight delivery. To solve this problem, this study proposes an optimisation algorithm that integrates genetic algorithm, minimal paths and Recursive Sum of Disjoint Products. A practical example in which multi-sized LCD monitors are delivered from China to Germany is considered to illustrate the solution procedure.
    International Journal of Systems Science 01/2012; 44(5):1-17. DOI:10.1080/00207721.2011.649368 · 2.10 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: The purpose of revenue management for remanufactured products is to maximise the expected revenue for remanufactured products. Most researchers in revenue management focus on analysing the sensitivity of the expected revenue to price, availability and disposal cost. In this note, we apply the Karush–Kuhn–Tucker conditions with maximum price constraints, and demonstrate that the optimal prices for the non-linear problem fall within the feasible region when constraints are imposed. A numerical example is given to illustrate the proposed study.
    International Journal of Systems Science 01/2012; 44(11):1-6. DOI:10.1080/00207721.2012.685199 · 2.10 Impact Factor
Show more

Similar Publications