Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

Rieck, Julia; Zimmermann, Jürgen

doi:10.1007/bf03342743

Cited by 20 publications

(15 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach is also suggested by Hosny and Mumford [8] who stated that the initial solution for multivehicle VRP-SPD with time windows could be generated by utilizing routing to create individual vehicle routes. Solutions of routing algorithm will be solved via branch-and-cut method from Rieck and Zimmermann [24]. A total of minimum travel distance and the route taken for every vehicle will be obtained.…”

Section: Methodsmentioning

confidence: 99%

“…It also shows the way parameters affect the algorithm and its performance. The algorithm is implemented in 25 set data as shown in Rick and Zimmermann [24]. The analysis is carried out not only for every step in the algorithm design process, but also for the result.…”

Section: Methodsmentioning

confidence: 99%

“…The solution of the routing problem is the route for every vehicle, which later used as input for the packing algorithm. A mathematical model of VRP-SPD and the branch-and-cut method designed by Rieck and Zimmermann [24] with CPLEX Studio IDE 12.8.0 are used to unravel the routing problem. Figure 4 shows the flowchart of the routing algorithm.…”

Section: Development Of Algorithmmentioning

confidence: 99%

“…Routing algorithm implementation is done by using a dataset from Rieck and Zimmermann [24]. There are five data sets, i.e., R121, R141, R161, R181, and R1101.…”

Section: Implementation Of Routing Algorithmmentioning

confidence: 99%

See 3 more Smart Citations

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

Budi

Ariningsih

Iswari

2019

jti

View full text Add to dashboard Cite

Forward and reverse logistics are two types of distribution methods that shall be synergized in practices. Two problems in synergizing the two distributions type are (1) how to route vehicles and (2) how to pack the goods inside the vehicle. A truck with only one door for loading and unloading process could create numerous problems of item packing activities. An item picked up from a customer could occasionally block other goods which need to be delivered; hence, the courier shall unload other items before the loading process. This condition will increase the probability of item damage, longer on-loading/off-loading (lo/lo) time, and higher lo/lo cost because of the rapid item movement. Therefore, this article aims to propose an algorithm to solve the problem by creating an algorithm hybrid of routing and packing to find the solution for routing and packing problem, sequentially, with a metaheuristic approach. The proposed method calculates the cost from routing procedure and sum of item movement in every loading and unloading process. Based on the trial on 25 cases, this algorithm generates 59.64% of the containers have zero goods repacking. Several potential future research avenues are also proposed in this article.

show abstract

Section: Methodsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Development Of Algorithmmentioning

confidence: 99%

“…Routing algorithm implementation is done by using a dataset from Rieck and Zimmermann [24]. There are five data sets, i.e., R121, R141, R161, R181, and R1101.…”

Section: Implementation Of Routing Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

Budi

Ariningsih

Iswari

2019

jti

View full text Add to dashboard Cite

show abstract

“…In [17] the authors propose a cutting-plane-based technique which allows them to find optimal solutions for medium size instances. This kind of techniques becomes very expensive in terms of computational time as the problem size increases though.…”

Section: Literature Reviewmentioning

confidence: 99%

Ant Colony System for a Problem in Reverse Logistic

Johnson¹,

Vega²,

Cabrera³

et al. 2015

SIC

View full text Add to dashboard Cite

Distribution, redistribution, recycling and repacking have become an important issue in logistic planning during the last decades. While keeping operational cost as low as possible still the main goal for logistic planners, other aspects such as recycling are getting more attention from industry. In this article the well known Ant Colony System (ACS), a bioinspired algorithm, is implemented to solve a problem arising in Reverse Logistic namely Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP). To solve this problem we need to find the optimal set of paths that meet, at the same time, customer delivery and pickup demands. In order to solve this problem, our ACS implementation makes use of a strategy that mimics the effect of the pheromone in the natural Ants behaviour. To do that, each vehicle is viewed as an individual agent (ant) and consequently its behaviour is driven by pheromone strategy, i.e. it tends to choose the route for which the pheromone level is higher. Results show that our ACS implementation provides good quality solutions within an acceptable time. Furthermore, obtained solutions are quite competitive when compared to other stochastic techniques previously studied in literature.Keywords: vehicle routing problem with simultaneous delivery and pickup, ant colony system, reverse logistic.

show abstract

New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries

Agarwal

Venkateshan

2021

Networks

View full text Add to dashboard Cite

The symmetric vehicle routing problem with simultaneous pickup and deliveries is considered. The current state‐of‐the‐art method to solve this problem employs the idea of a no‐good cut. This article achieves an order of magnitude improvement in the computational time needed to solve difficult problem instances by generalizing the no‐good cuts and developing a way to generate improved no‐good cuts much earlier in a branch‐and‐bound tree. Results are reported on benchmark instances in literature and new difficult instances generated by the authors. Some polyhedral results are presented about the strength of the generalized no‐good cuts for a special case of the problem.

show abstract

Exact Solutions to the Symmetric and Asymmetric Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

Abstract: In reverse logistics networks, products (e.g., bottles or containers)

Cited by 20 publications

References 38 publications

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

Proposing an Algorithm to Solve the Forward and Reverse Logistics Distribution Problem with One Door Container

Ant Colony System for a Problem in Reverse Logistic

New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries

Contact Info

Product

Resources

About