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

Article · March 2010with21 Reads
DOI: 10.1080/00207720903326944 · Source: DBLP
Abstract
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.
    • 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.
    Full-text · Article · Dec 2014
    • Georgiadis and Athanasiou [8] developed a long-term demand-driven capacity planning policies in a closed-loop supply chain with uncertainty in actual demand and sales patterns. Anbuudayasankar et al. [1] developed three unified heuristics based on an extended branch and a bound heuristic, a genetic algorithm, and simulated annealing to solve the reverse logistics routing problem for sustainable supply chains. Kim et al. [12] proposed joint pricing and ordering policies for price-dependent demand in a supply chain with one retailer and one manufacturer.
    [Show abstract] [Hide abstract] ABSTRACT: The study deals with optimal pricing model for recycling products, which are returned, recovered, and shipped into a secondary market for resale. The selling probability of recy-cling products is sensitive to their price and availability. This assumption is rational because price and availability often influence customer demand. The study also assumes that the three quality levels of collected returns exist, which affect the price they are sold for. This paper determines optimal selling prices for re-manufacturers. The exact closed-form solution is then derived and total profit is maximized to create the remanufacturing model. A numerical example and sensitivity analysis are conducted to demonstrate the model. The study provides managerial insights on the benefits of revenue management for product reuse. For example, if manager can develop an incentive return-subsidy policy to encourage consumer to offer better or more returns, the profits will increase more.
    Full-text · Article · Mar 2014
  • [Show abstract] [Hide abstract] ABSTRACT: This paper discusses the design and implementation of a decision-support software system based on web services, capable of modelling the supply chain and querying the supply-chain partners to provide information, regarding the availability of parts, required for the production of a highly customisable product. Furthermore, it describes the details of a software system for the evaluation of time and financial feasibility of acquiring the necessary parts in order for the customised product to be built. The feasibility of implementing this approach is demonstrated in a typical automotive case study. The system is capable of simulating the customer's orders impact on the supply-chain operation, while it utilises the Web services technology for facilitating the supply-chain control logic.
    Article · Jan 2012
  • [Show abstract] [Hide abstract] ABSTRACT: A multistate network is a stochastic network composed of multistate arcs in which each arc has several possible capacities and may fail due to failure, maintenance, etc. The quality of a multistate network depends on how to meet the customer's requirements and how to provide the service in time. The system reliability, the probability that a given amount of data can be transmitted through a pair of minimal paths (MPs) simultaneously under the time constraint, is a proper index to evaluate the quality of a multistate network. An efficient solution procedure is first proposed to calculate it. In order to further enhance the system reliability, the network administrator decides the routing policy in advance to indicate the first and the second priority pairs of MPs. The second priority pair of MPs takes charge of the transmission duty if the first fails. The system reliability under the routing policy can be subsequently evaluated.
    Article · Jan 2012
  • [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.
    Article · Jan 2012
  • [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.
    Article · Jan 2012
Show more
Article
July 2007 · International Journal of Advanced Manufacturing Technology · Impact Factor: 1.46
    The reverse logistics problem of the simultaneous distribution of commodities and the collection of reusable empty packages with a single depot and a single vehicle with limited capacity is addressed in this paper. Commodities to be distributed are loaded at the depot and the empty packages are transported back to the depot. This is called the traveling salesman problem with simultaneous... [Show full abstract]
    Article
    January 2008
      The vehicle routing problem with simultaneous delivery and pick-up (VRPSDP) is the problem of optimally assimilating goods collection and distribution, when no priority constraints are imposed on the order in which the vehicle must perform the operations. This paper considers an additional constraint of maximum route length in VRPSDP. We develop a mixed-integer linear programming model for... [Show full abstract]
      Article
      January 2009 · International Journal of Value Chain Management
        Workload balancing between drivers in transshipment of goods is a critical humanitarian issue in enterprise logistics management. This problem is modelled as a multiple Travelling Salesman Problem with Workload Balancing (mTWB). The problem is addressed under the condition that the load for all the drivers must be balanced on a trip. We propose a clustering-based heuristic to solve the mTWB... [Show full abstract]
        Article
        September 2008 · Computers & Operations Research · Impact Factor: 1.86
          The single vehicle routing problem with deliveries and selective pickups (SVRPDSP) is defined on a graph in which pickup and delivery demands are associated with customer vertices. The difference between this problem and the single vehicle routing problem with pickups and deliveries (SVRPPD) lies in the fact that it is no longer necessary to satisfy all pickup demands. In the SVRPDSP a pickup... [Show full abstract]
          Discover more