Modeling and Solving the Capacitated Vehicle Routing Problem on Trees

Chandran, Bala G.; Raghavan, S.

doi:10.1007/978-0-387-77778-8_11

Cited by 29 publications

(21 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A tree network arising in the area of Amarillo, Texas, was considered the second test network. The test networks were generated by a procedure similar to the one described by Labbé et al (1), Mbaraga et al (16), and Chandran and Raghavan (4). Every node in the tree had between one and five children.…”

Section: Test Instancesmentioning

confidence: 99%

Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds

Kumar

Unnikrishnan

Waller

2012

Transportation Research Record: Journal of the Transportation R

View full text Add to dashboard Cite

The vehicle routing problem (VRP) is a classical problem in logistics that aims to design minimum-cost delivery routes from a centralized depot. A special case of the VRP arises in situations in which the network has a tree structure (TVRP). Such tree networks arise when the cost of road construction and maintenance is much more than the routing cost or when the transportation network consists of a main highway (e.g., Interstate system) and the customer locations are located off the highway. A heuristic for a constrained case of TVRP in which the vehicle fleet is capacitated and heterogeneous is proposed. The heuristic first determines the customers that will be served by each vehicle by use of bin-packing and Lagrangian-based generalized assignment algorithms. The individual vehicle routes are then determined by use of a depth-first search method. A procedure for further refinement of the heuristic solution quality is also described. The heuristic algorithm was implemented on two real-world networks and on randomly generated networks that varied in size from 20 to 120 nodes. The heuristic solution was found to be between 2% and 10% for almost all of the 200 instances tested and took a fraction of the time taken to find the optimal solution.

show abstract

Section: Test Instancesmentioning

confidence: 99%

Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds

Kumar

Unnikrishnan

Waller

2012

Transportation Research Record: Journal of the Transportation R

View full text Add to dashboard Cite

show abstract

“…CVRP problem instances that can be consistently solved by the most effective exact algorithms proposed so far can only accommodate up to 50 customers, while larger instances, which contain hundreds of customers, can only be solved in particular cases and can only be tackled with heuristic methods (Toth and Vigo 2002). Despite the lack of a conclusive approach, enormous improvements in the research community's ability to solve these problems are improved due to better algorithms and computational abilities (Chandran and Raghavan 2008).…”

Section: Approaches To Solving Cvrpmentioning

confidence: 99%

“…It embodies a necessary basis of logistics planning (Chandran and Raghavan 2008) and evidently plays a critical part in wide-ranging practical applications. A solution to this particular routing problem will greatly benefit businesses and industries that are involved in transportation and distribution.…”

Section: Introductionmentioning

confidence: 99%

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

et al. 2017

View full text Add to dashboard Cite

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and doublebridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well on the problem instances, save for a select few on which the algorithm achieved the close to near-optimal result and one on which the algorithm achieved the optimal result. Increasing the number of iterations for each run of the algorithm on the two large-scale problem instances led to obtaining solutions closer to the optimal solution compared to the ones obtained with fewer number iterations. This gives an idea that the larger the problem instance becomes, the slower the algorithm converges to the optimal solution. Several other factors may also have contributed to the overall performance of the algorithm. Regardless of its performance, the algorithm was able to obtain routes that satisfied the constraints of the capacitated vehicle routing problem. The potential of the cuckoo search algorithm in solving combinatorial problems is demonstrated in this study in which the performance of the algorithm on routing problems was explored.

show abstract

“…In addition, capacitated vehicle routing problems form core of logistics planning, as Chandran and Raghavan (2008) present.…”

Section: Introductionmentioning

confidence: 99%

Design and analysis of the location of an online resale business distribution centre in Japan

Suzuki

Kawai

Wakabayashi

2016

Production & Manufacturing Research

View full text Add to dashboard Cite

The location of distribution centres for online retailers has become an important issue for many companies. The operation of the distribution centre for e-commerce seems to be different from the traditional concept of distribution centres. This study considers how the location of distribution centres are designed and operated for online retailing using a computer simulation with actual data. This paper analyses current issues in order to propose an effective location for e-commerce distribution centres. An effective location for a multidistribution system over a wide geographical area is required. This paper clearly points out the importance of locating e-commerce distribution centres over a wide geographical area by performing a computer simulation using actual data on the assumption that online resale business customers live in a metropolitan area. The study created a business model in which a buffer warehouse, which primarily handled commodities with high-frequency shipments, was located near a large consumption area and was used in addition to a large-scale distribution centre. The validity of the created business model was verified by performing a simulation based on actual data. The result revealed that these recommended improvement measures for the location of e-commerce distribution centres can function effectively.

show abstract

Modeling and Solving the Capacitated Vehicle Routing Problem on Trees

Cited by 29 publications

References 9 publications

Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds

Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds

Cuckoo search via Lévy flights for the capacitated vehicle routing problem

Design and analysis of the location of an online resale business distribution centre in Japan

Contact Info

Product

Resources

About