A Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm

author

Abstract:

Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of demand nodes. Then, the proposed model is validated using a numerical example and sensitivity analyses that are implemented by CPLEX solver/GAMS software. To solve the problem efficiently, a Genetic Algorithm (GA) is designed and implemented. The obtained results demonstrate that the proposed GA can yield high-quality solutions compared to exact solutions.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A novel heuristic algorithm for capacitated vehicle routing problem

The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...

full text

A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem

Recently proved successful for variants of the vehicle routing problem (VRP) involving time windows, genetic algorithms have not yet shown to compete or challenge current best search techniques in solving the classical capacitated VRP. In this paper, a hybrid genetic algorithm to address the capacitated vehicle routing problem is proposed. The basic scheme consists in concurrently evolving two ...

full text

A Genetic Algorithm for the Capacitated Vehicle Routing Problem

as well as to one Genetic Algorithm proposed to solve this problem.

full text

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

full text

an efficient genetic algorithm for a vehicle routing problem considering the competency of working teams

this paper presents a new mathematical model for a combined manpower vehicle routing problem, in which working teams are considered as servers. having teams with different competency affects the service duration and cost that expands the flexibility of scheduling. a fleet of vehicles with different speed and cost of movement is used to transport these teams to visit the customers before the due...

full text

Two phase genetic algorithm for vehicle routing and scheduling problem with cross-docking and time windows considering customer satisfaction

Cross-docking is a new warehousing policy in logistics which is widely used all over the world and attracts many researchers attention to study about in last decade. In the literature, economic aspects has been often studied, while one of the most significant factors for being successful in the competitive global market is improving quality of customer servicing and focusing on customer satisfa...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 10  issue 1

pages  117- 127

publication date 2019-07

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023