Conceptual modeling of evolvable local searches in memetic algorithms using linear genetic programming: a case study on capacitated vehicle routing problem

2015 ◽  
Vol 20 (9) ◽  
pp. 3745-3769 ◽  
Author(s):  
Liang Feng ◽  
Yew-Soon Ong ◽  
Caishun Chen ◽  
Xianshun Chen
Keyword(s):  
Genetic Programming ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Conceptual Modeling ◽  
Memetic Algorithms ◽  
Linear Genetic Programming ◽  
Routing Problem ◽  
Local Searches ◽  
Capacitated Vehicle

scholarly journals Methodology to Solve the Combination of the Generalized Assignment Problem and the Vehicle Routing Problem: A Case Study in Drug and Medical Instrument Sales and Service

2018 ◽  
Vol 9 (1) ◽  
pp. 3 ◽  
Author(s):  
Malichan Thongkham ◽  
Sasitorn Kaewman
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Search Techniques ◽  
De Algorithm ◽  
Local Searches ◽  
Generalized Assignment ◽  
Linear Probability

This article presents algorithms for solving a special case of the vehicle routing problem (VRP). We define our proposed problem of a special VRP case as a combination of two hard problems: the generalized assignment and the vehicle routing problem. The different evolution (DE) algorithm is used to solve the problem. The recombination process of the original DE is modified by adding two more sets of vectors—best vector and random vector—and using two other sets—target vector and trial vector. The linear probability formula is proposed to potentially use one out of the four sets of vectors. This is called the modified DE (MDE) algorithm. Two local searches are integrated into the MDE algorithm: exchange and insert. These procedures create a DE and MDE that use (1) no local search techniques, (2) two local search techniques, (3) only the exchange procedure, and (4) only the insert procedure. This generates four DE algorithms and four MDE algorithms. The proposed methods are tested with 15 tested instances and one case study. The current procedure is compared with all proposed heuristics. The computational result shows that, in the case study, the best DE algorithm (DE-4) has a 1.6% better solution than that of the current practice, whereas the MDE algorithm is 8.2% better. The MDE algorithm that uses the same local search as the DE algorithms generates a maximum 5.814% better solution than that of the DE algorithms.

scholarly journals Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem

2020 ◽  
Author(s):  
Fernando Francisco Sandoya Sánchez ◽  
Carmen Andrea Letamendi Lazo ◽  
Fanny Yamel Sanabria Quiñónez
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Impact Analysis ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Economic Impact Analysis ◽  
Transportation Sector ◽  
Capacitated Vehicle

This chapter presents the best-known heuristics and metaheuristics that are applied to solve the capacitated vehicle routing problem (CVRP), which is the generalization of the TSP, in which the nodes are visited by more than one route. To find out which algorithm obtains better results, there are 30 test instances used, which are grouped into 3 sets of problems according to the position of the nodes. The study begins with an economic impact analysis of the transportation sector in companies, which represents up to 20% of the final cost of the product. This case study focuses on the CVRP for its acronym capacitated vehicle routing problem, analyzing the best-known heuristics such as Clarke & Wright and sweep, and the algorithms GRASP and simulated annealing metaheuristics based.

scholarly journals A model for collection of Waste Electrical and Electronical Equipment in Metropolitan Area of Bucaramanga

2020 ◽  
pp. 110-117
Author(s):  
Javier Arias-Osorio ◽  
Ruben Darío Ríos-Mercado ◽  
Ingrid Dayanna Tamayo-Morantes
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Programming Model ◽  
Mixed Integer ◽  
Solution Technique ◽  
Second Phase ◽  
Routing Problem ◽  
Different Types ◽  
Capacitated Vehicle

In this paper, a model for the collection of waste electrical and electronic equipment is designed based on a problem of location and vehicle routing. Two main phases are carried out: The localization phase, in which the WEEE collection points are defined from a series of potential points, involving the novelty about the assignment of different types of devices to each of those points. And, the routing phase in which the collection routes are designed to minimize the associated costs. A case study is analyzed for the collection of WEEE in communes 6, 7 and 8 of Bucaramanga. For the localization phase, a mixed integer linear programming model is developed, which is solved with the GAMS software. The capacitated vehicle routing problem CVRP is addressed with the objective of minimizing the costs associated with the distance traveled by the vehicle for each of the assigned collection points, and a GRASP metaheuristic with local search operators is proposed as a solution technique to solve this second phase. The algorithm was programmed in MATLAB Software and validated with instances of the literature, showing good results for the defined case study.

Sign in / Sign up

Export Citation Format

Share Document