scholarly journals Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach

2017 ◽  
Vol 273 (1-2) ◽  
pp. 257-277 ◽  
Author(s):  
Pawel Sitek ◽  
Jarosław Wikarek
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Alternative Delivery ◽  
Capacitated Vehicle

Optimization of capacitated vehicle routing problem with alternative delivery, pick-up and time windows: A modified hybrid approach

2021 ◽  
Vol 423 ◽  
pp. 670-678 ◽  
Author(s):  
Paweł Sitek ◽  
Jarosław Wikarek ◽  
Katarzyna Rutczyńska-Wdowiak ◽  
Grzegorz Bocewicz ◽  
Zbigniew Banaszak
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Hybrid Approach ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Alternative Delivery ◽  
Capacitated Vehicle

scholarly journals Hybrid Heuristic Algorithm for solving Capacitated Vehicle Routing problem

2014 ◽  
Vol 12 (9) ◽  
pp. 3844-3851 ◽  
Author(s):  
Moh. M. AbdElAziz ◽  
Haitham A. El-Ghareeb ◽  
M. S. M. Ksasy
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Nearest Neighbor ◽  
Hybrid Approach ◽  
Minimum Cost ◽  
Second Phase ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Vehicle Capacity ◽  
Capacitated Vehicle

The Capacitated Vehicle Routing Problem is the most common and basic variant of the vehicle routing problem, where it represents an important problem in the fields of transportation, distribution and logistics. It involves finding a set of optimal routes that achieve the minimum cost and serve scattered customer locations under several constraints such as the distance between customers’ locations, available vehicles, vehicle capacity and customer demands. The Cluster first – Route second is the proposed approach used to solve capacitated vehicle routing problem which applied in a real case study used in that research, it consists of two main phases. In the first phase, the objective is to group the closest geographical customer locations together into clusters based on their locations, vehicle capacity and demands by using Sweep algorithm. In the second phase, the objective is to generate the minimum cost route for each cluster by using the Nearest Neighbor algorithm. The hybrid approach is evaluated by Augerat’s Euclidean benchmark datasets.

scholarly journals An Improved Clarke and Wright Algorithm to Solve the Capacitated Vehicle Routing Problem

2013 ◽  
Vol 3 (2) ◽  
pp. 413-415 ◽  
Author(s):  
L. Caccetta ◽  
M. Alameen ◽  
M. Abdul-Niby
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Routing Problem ◽  
Cpu Time ◽  
Capacitated Vehicle Routing Problem ◽  
Domain Reduction ◽  
Problem Instances ◽  
Capacitated Vehicle

This paper proposes an effective hybrid approach that combines domain reduction with the Clarke and Wright algorithm to solve the capacitated vehicle routing problem. The hybrid approach is applied to solve 10 benchmark capacitated vehicle routing problem instances. The dimension of the instances was between 21 to 200 customers. The results show that domain reduction can improve the classical Clarke and Wright algorithm by about 18%. The hybrid approach improves the large instances significantly in comparison with the smaller size instances. This paper will not show the time taken to solve each instance, as the Clarke and Wright algorithm and the hybrid approach took almost the same CPU time.

scholarly journals A Hybrid Approach to the Optimization of Multiechelon Systems

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Paweł Sitek ◽  
Jarosław Wikarek
Keyword(s):  
Mathematical Programming ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Approach ◽  
Decision Models ◽  
Data Sets ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Decision Variables ◽  
Capacitated Vehicle

In freight transportation there are two main distribution strategies: direct shipping and multiechelon distribution. In the direct shipping, vehicles, starting from a depot, bring their freight directly to the destination, while in the multiechelon systems, freight is delivered from the depot to the customers through an intermediate points. Multiechelon systems are particularly useful for logistic issues in a competitive environment. The paper presents a concept and application of a hybrid approach to modeling and optimization of the Multi-Echelon Capacitated Vehicle Routing Problem. Two ways of mathematical programming (MP) and constraint logic programming (CLP) are integrated in one environment. The strengths of MP and CLP in which constraints are treated in a different way and different methods are implemented and combined to use the strengths of both. The proposed approach is particularly important for the discrete decision models with an objective function and many discrete decision variables added up in multiple constraints. An implementation of hybrid approach in theECLiPSesystem using Eplex library is presented. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) and its variants are shown as an illustrative example of the hybrid approach. The presented hybrid approach will be compared with classical mathematical programming on the same benchmark data sets.

Sign in / Sign up

Export Citation Format

Share Document