The selective pickup and delivery problem: Formulation and a memetic algorithm

Ting, Chuan-Kang; Liao, Xin-Lan

doi:10.1016/j.ijpe.2012.06.009

Cited by 65 publications

(63 citation statements)

References 57 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Fleischmann et al (2001) is one of first papers to extend classic facility location models to consider whether to integrate the reverse and forward logistics networks. More recently, Pishvaee et al (2010) and Ting and Liao (2013) proposed memetic algorithm which uses dynamic search strategy for integrated forward/reverse logistics network design. However, the proposed models neglect the demand uncertainty and the supply of returned products in the multi-product integrated logistics network.…”

Section: Deterministic Models/methods For Reverse Logisticsmentioning

confidence: 99%

See 1 more Smart Citation

Partner selection for reverse logistics centres in green supply chains: a fuzzy artificial immune optimisation approach

Barnes

2016

Production Planning & Control

View full text Add to dashboard Cite

Abstract:The design of reverse logistics networks has now emerged as a major issue for manufacturers, not only in developed countries where legislation and societal pressures are strong, but also in developing countries where the adoption of reverse logistics practices may offer a competitive advantage. This paper presents a new model for partner selection for reverse logistic centres in green supply chains. The model offers three advantages. Firstly, it enables economic, environment, and social factors to be considered simultaneously. Secondly, by integrating fuzzy set theory and artificial immune optimization technology, it enables both quantitative and qualitative criteria to be considered simultaneously throughout the whole decision-making process. Thirdly, it extends the flat criteria structure for partner selection evaluation for reverse logistics centres to the more suitable hierarchy structure. The applicability of the model is demonstrated by means of an empirical application based on data from a Chinese electronic equipment and instruments manufacturing company.

show abstract

Section: Deterministic Models/methods For Reverse Logisticsmentioning

confidence: 99%

“…-37- Abdallah et al (2012), Das and Chowdhury (2012), Amin and Zhang (2013), Ramezani et al (2013), Ting and Liao (2013) Figure 1: Venn diagram of the classification of existing models/methods…”

Section: )mentioning

confidence: 99%

Partner selection for reverse logistics centres in green supply chains: a fuzzy artificial immune optimisation approach

Barnes

2016

Production Planning & Control

View full text Add to dashboard Cite

show abstract

“…In the literature this problem class has been rst referred to as VRP with simultaneous delivery and pickup points by Min (1989), the Traveling Salesman Problem (TSP) with Pickup and Delivery by Gendreau et al (1999), multivehicle case as VRP with simultaneous pickup and delivery by Angelelli and Mansini (2002), simultaneous VRP with Pickup and Delivery by Nagy and Salhi (2005) Table 2 summarizes recent articles related to PDP published since the past 5 years. All the problems dealing with a vehicle eet; TSP with Pickup and Delivery such as Li et al (2011), Ting andLiao (2013) or Gendreau et al (2015) are not included. The rst column shows the references.…”

Section: State Of the Artmentioning

confidence: 99%

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Iassinovskaia

Limbourg

Riane³

2017

International Journal of Production Economics

105

View full text Add to dashboard Cite

Reducing environmental impact, related regulations and potential for operational benets are the main reasons why companies share their returnable transport items (RTIs) among the dierent partners of a closed-loop supply chain. In this paper, we consider a producer, located at a depot, who has to distribute his products packed in RTIs to a set of customers. Customers dene a time window wherein the service can begin. The producer is also in charge of the collection of empty RTIs for reuse in the next production cycle. Each partner has a storage area composed of both empty and loaded RTI stock, as characterized by initial levels and maximum storage capacity. As deliveries and returns are performed by a homogeneous eet of vehicles that can carry simultaneously empty and loaded RTIs, this research addresses a pickup and delivery inventory-routing problem within time windows (PDIRPTW) over a planning horizon.A mixed-integer linear program is developed and tested on small-scale instances. To handle more realistic large-scale problems, a cluster rst-route second matheuristic is proposed.

show abstract

“…Second, the agencies is fascinated in decreasing the time required to deliver all newspapers, i.e., the time required to distribute all newspapers to the final readers. Ting and Liao (2013) suggested a unique problem formulation of particular pickup and delivery issues, which reduces the need for visiting all pickup nodes in the distribution network and examines a minimum-cost route for a vehicle with capacity constraint. The problem dealt in this study falls into the category of Delivery Problems (DP), in which the focus is not on the production of the newspaper nor the vehicle routing problem or route optimization.…”

Section: Synchronizing Production and Distribution Of Heterogeneous Nmentioning

confidence: 99%

Optimizing the Newspaper Distribution Scenarios using Genetic Algorithm: A Case Study of India

Kamble¹,

Raut²,

Gawankar³

2017

American Journal of Applied Sciences

View full text Add to dashboard Cite

This paper attempts to optimize the various newspaper distribution scenario as observed in India. It found from the literature that earlier research work carried out in optimizing the vehicle routing networks problem using time window and scope was limited to distribution from newspaper printing location to the vendor point of distribution. This paper focuses on the distribution of newspaper from vendor to the newspaper reader/customer. In this study case study method is used and the circulation activity is modelled with different field scenarios with a aim of minimizing the overall (total) delivery time of the Newspaper. The major aim of this paper was to identify the issues, while distributing the newspaper by the vendor at the hub to the end reader. The company under consideration had an objective of finishing the last newspaper delivery by 6:30 am. To optimize the same the paper identified the following scenario: Case 1. Delivery to Independent Houses Located in a Community Case 2. Delivery to an Apartment Cluster Case 3. Delivery considering the various modes of transportation The present paper optimized the same using genetic algorithm as the optimizing tool. The model with different scenarios presented in the paper will help the newspaper distribution planners to understand the various issues on the field and achieve to have a successful distribution strategy within the set objective of reaching the last copy of newspaper by 6:30 am to the reader. This will help not only the newspaper company under consideration but the entire newspaper industry. This paper contributes to body of knowledge of newspaper industry its major research implications are 1. It provide insights for a particular type of functioning environment, where speed and time play an critical role. 2. In certain type the time delays in the distribution network will impact the consumer's preference which will lead to improved market share and more satisfied customers.

show abstract

The selective pickup and delivery problem: Formulation and a memetic algorithm

Cited by 65 publications

References 57 publications

Partner selection for reverse logistics centres in green supply chains: a fuzzy artificial immune optimisation approach

Partner selection for reverse logistics centres in green supply chains: a fuzzy artificial immune optimisation approach

The inventory-routing problem of returnable transport items with time windows and simultaneous pickup and delivery in closed-loop supply chains

Optimizing the Newspaper Distribution Scenarios using Genetic Algorithm: A Case Study of India

Contact Info

Product

Resources

About