A New Multi-Criteria Solving Procedure for Multi-Depot FSM-VRP with Time Window

2017 ◽  
Vol 4 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Lahcene Guezouli ◽  
Samir Abdelhamid
Keyword(s):  
Genetic Algorithm ◽  
Combinatorial Optimization ◽  
Vehicle Routing Problem ◽  
Processing Time ◽  
Optimization Problems ◽  
Time Window ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Acceptable Quality ◽  
Capacitated Vehicle

One of the most important combinatorial optimization problems is the transport problem, which has been associated with many variants such as the HVRP and dynamic problem. The authors propose in this study a decision support system which aims to optimize the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types (with distinct capacities and costs) and multiple available depots, that the authors call the Multi-Depot HVRPTW by respecting a set of criteria including: schedules requests from clients, the heterogeneous capacity of vehicles..., and the authors solve this problem by proposing a new scheme based on a genetic algorithm heuristics that they will specify later. Computational experiments with the benchmark test instances confirm that their approach produces acceptable quality solutions compared with previous results in similar problems in terms of generated solutions and processing time. Experimental results prove that the method of genetic algorithm heuristics is effective in solving the MDHVRPTW problem and hence has a great potential.

Efficient Golden-Ball Algorithm Based Clustering to solve the Multi-Depot VRP With Time Windows

2018 ◽  
Vol 9 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Lahcene Guezouli ◽  
Mohamed Bensakhria ◽  
Samir Abdelhamid
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Clustering Algorithm ◽  
Optimization Problems ◽  
Time Window ◽  
Time Windows ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Acceptable Quality ◽  
Golden Ball

In this article, the authors propose a decision support system which aims to optimize the classical Capacitated Vehicle Routing Problem by considering the existence of multiple available depots and a time window which must not be violated, that they call the Multi-Depot Vehicle Routing Problem with Time Window (MDVRPTW), and with respecting a set of criteria including: schedules requests from clients, the capacity of vehicles. The authors solve this problem by proposing a recently published technique based on soccer concepts, called Golden Ball (GB), with different solution representation from the original one, this technique was designed to solve combinatorial optimization problems, and by embedding a clustering algorithm. Computational results have shown that the approach produces acceptable quality solutions compared to the best previous results in similar problem in terms of generated solutions and processing time. Experimental results prove that the proposed Golden Ball algorithm is efficient and effective to solve the MDVRPTW problem.

The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization

2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Traveling Salesman Problem ◽  
Vehicle Routing Problem ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
The Traveling Salesman Problem

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.

scholarly journals Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

2014 ◽  
Vol 2014 ◽  
pp. 1-17 ◽  
Author(s):  
E. Osaba ◽  
F. Diaz ◽  
R. Carballedo ◽  
E. Onieva ◽  
A. Perallos
Keyword(s):  
Genetic Algorithms ◽  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Traveling Salesman ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Golden Ball ◽  
The One

Nowadays, the development of new metaheuristics for solving optimization problems is a topic of interest in the scientific community. In the literature, a large number of techniques of this kind can be found. Anyway, there are many recently proposed techniques, such as the artificial bee colony and imperialist competitive algorithm. This paper is focused on one recently published technique, the one called Golden Ball (GB). The GB is a multiple-population metaheuristic based on soccer concepts. Although it was designed to solve combinatorial optimization problems, until now, it has only been tested with two simple routing problems: the traveling salesman problem and the capacitated vehicle routing problem. In this paper, the GB is applied to four different combinatorial optimization problems. Two of them are routing problems, which are more complex than the previously used ones: the asymmetric traveling salesman problem and the vehicle routing problem with backhauls. Additionally, one constraint satisfaction problem (the n-queen problem) and one combinatorial design problem (the one-dimensional bin packing problem) have also been used. The outcomes obtained by GB are compared with the ones got by two different genetic algorithms and two distributed genetic algorithms. Additionally, two statistical tests are conducted to compare these results.

scholarly journals Sensitive Ants in Solving the Generalized Vehicle Routing Problem

2011 ◽  
Vol 6 (4) ◽  
pp. 731 ◽  
Author(s):  
Camelia-M. Pintea ◽  
Camelia Chira ◽  
Dan Dumitrescu
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Potential Benefits ◽  
Ant Colony Systems ◽  
Pheromone Trail ◽  
Generalized Vehicle Routing Problem

The idea of sensitivity in ant colony systems has been exploited in hybrid ant-based models with promising results for many combinatorial optimization problems. Heterogeneity is induced in the ant population by endowing individual ants with a certain level of sensitivity to the pheromone trail. The variable pheromone sensitivity within the same population of ants can potentially intensify the search while in the same time inducing diversity for the exploration of the environment. The performance of sensitive ant models is investigated for solving the generalized vehicle routing problem. Numerical results and comparisons are discussed and analysed with a focus on emphasizing any particular aspects and potential benefits related to hybrid ant-based models.

scholarly journals A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem

2011 ◽  
Vol 21 (2) ◽  
pp. 187-198 ◽  
Author(s):  
Petrica Pop ◽  
Corina Pop-Sitar
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Steiner Tree Problem ◽  
Great Effort ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Generalized Traveling Salesman Problem ◽  
Generalized Vehicle Routing Problem

Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems; they are harder than the classical ones, and nowadays are intensively studied due to their interesting properties and applications in the real world. Because of the complexity of finding the optimal or near-optimal solution in case of the generalized combinatorial optimization problems, great effort has been made, by many researchers, to develop efficient ways of their transformation into classical corresponding variants. We present in this paper an efficient way of transforming the generalized vehicle routing problem into the vehicle routing problem, and a new integer programming formulation of the problem.

scholarly journals AN IMPROVED SIMULATED ANNEALING FOR THE CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)

Kursor ◽  
2019 ◽  
Vol 9 (3) ◽  
pp. 117 ◽  
Author(s):  
Farhanna Mari ◽  
Wayan Firdaus Mahmudy ◽  
Purnomo Budi Santoso
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Optimization Problems ◽  
Product Distribution ◽  
Industrial Sector ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

In the industrial sector, in order to increase the company's competitive profit and ratio, must be able to suppress as much expenditure as possible. Product distribution is one of the logistics processes in the industry which consumes the most costs. Products must be distributed to customers in different locations and also with varying requests. The problem belongs to Capacitated Vehicle Routing Problem (CVRP) that is considered as one of the complex combinatorial optimization problems included in the NP-Hard Problem category, which is a problem that requires difficult computation and a lot of time along with the increasing size of the problem data. So, in this study improvisation will be carried out in the form of modifying the simulated annealing method to solve the combinatorial problem so that the optimal distance in the case of distribution will be obtained. In addition, in this study a comparison will be made between basic simulated annealing and also improved simulated annealing. Based on the results of the research it is proven that Improved Simulated Annealing can provide a better solution.

scholarly journals Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty

2021 ◽  
Author(s):  
Artur Alves Pessoa ◽  
Michael Poss ◽  
Ruslan Sadykov ◽  
François Vanderbeck
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Demand Uncertainty ◽  
Optimization Problems ◽  
Valid Inequalities ◽  
Branch And Cut ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Robust Formulation ◽  
Capacitated Vehicle

Capacitated vehicle routing problems are widely studied combinatorial optimization problems, and branch-and-cut-and-price algorithms can solve instances harder than ever before. These models, however, neglect that demands volumes are often not known with precision when planning the vehicle routes, thus incentivizing decision makers to significantly overestimate the volumes for avoiding coping with infeasible routes. A robust formulation that models demand uncertainty through a knapsack polytope is considered. A new branch-and-cut-and-price algorithm for the problem is provided, which combines efficient algorithms for the problem with no uncertainty with profound results in robust combinatorial optimization and includes novel heuristics and new valid inequalities. The numerical results illustrate that the resulting approach is two orders of magnitude faster that the best algorithm from the literature, solving twice as many instances to optimality.

scholarly journals Implementasi Capacitated Vehicle Routing Problem with Time Windows dengan Pendekatan Algoritma Sweep untuk Distribusi Pengangkutan Sampah

2021 ◽  
Vol 19 (1) ◽  
pp. 1-6
Author(s):  
Dedi Sa'dudin Taptajani
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Nearest Neighbour ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Vehicle Routing Problem (VRP) merupakan suatu permasalahan yang berkaitan dengan bagaimana menentukan rute yang dianggap optimal dan melibatkan lebih dari satu alat angkut demi memperhatikan beberapa kendala dalam melayani sejumlah tempat layanan sesuai dengan permintaan. Salah satu varian dari VRP adalah capacitated vehicle routing problem with time window (CVRPTW) varian ini menambahkan kendala kapasitas alat angkut sebagai salah satu pertimbangan didalam mengangkut ke masing masing tujuan dan kemudian memberikan jendela waktu didalam proses pengangkutannya. Tujuan dari penulisan ini adalah menjelaskan pembentukan model dari CVRPTW untuk permasalahan rute pengangkutan sampah dari tiap rumah Sampai Ke Tempat Pembuangan Akhir, dengan pertimbangan waktu yang tersedia dan kapasitas angkut alat angkut yang tersedia, Sedangkan Penyelesaiannya yaitu dengan menggunakan pendekatan algoritma sweep. Algoritma Ini merupakan algoritma yang terdiri dari dua tahap, pada tahapan pertama yaitu clustering dari masing masing rumah dan tahap selanjurtnya yaitu membentuk rute pengiriman untuk masing-masing cluster dengan metode Nearest Neighbour, kemudian dilanjutkan dengan menentukan kapasitas alat angkut terhadap waktu yang diperlukan untuk menentukan kapan sampah ini akan di angkut ke tempat pembuangan akhir. Studi ini sangat penting dilakukan dalam rangka menerapkan dasar untuk memahami kemungkinan meningkatkan tingkat layanan pada proses pengangkutan sampah di tingkat desa.

Sign in / Sign up

Export Citation Format

Share Document