scholarly journals Dynamic Multiple Depots Vehicle Routing in the Physical Internet context

2021 ◽  
Vol 54 (1) ◽  
pp. 92-97
Author(s):  
Anirut Kantasa-ard ◽  
Tarik Chargui ◽  
Abdelghani Bekrar ◽  
Abdessamad Ait El Cadi ◽  
Yves Sallez
Keyword(s):  
Vehicle Routing ◽  
Multiple Depots ◽  
Physical Internet

scholarly journals A Hybrid Ant Colony Optimization for Dynamic Multidepot Vehicle Routing Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Haitao Xu ◽  
Pan Pu ◽  
Feng Duan
Keyword(s):  
Ant Colony Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Ant Colony ◽  
Optimization Approach ◽  
Dynamic Vehicle Routing ◽  
Routing Problem ◽  
Multiple Depots ◽  
Mutation Operation ◽  
Clustering Approach

In the real world, the vehicle routing problem (VRP) is dynamic and variable, so dynamic vehicle routing problem (DVRP) has obtained more and more attentions among researchers. Meanwhile, due to actual constraints of service hours and service distances, logistics companies usually build multiple depots to serve a great number of dispersed customers. Thus, the research of dynamic multidepot vehicle routing problem (DMDVRP) is significant and essential. However, it has not attracted much attention. In this paper, firstly, a clustering approach based on the nearest distance is proposed to allocate all customers to the depots. Then a hybrid ant colony optimization (HACO) with mutation operation and local interchange is introduced to optimize vehicle routes. In addition, in order to deal with dynamic problem of DMDVRP quickly, a real-time addition and optimization approach is designed to handle the new customer requests. Finally, the t-test is applied to evaluate the proposed algorithm; meanwhile the relations between degrees of dynamism (dod) and HACO are discussed minutely. Experimental results show that the HACO algorithm is feasible and efficient to solve DMDVRP.

An Effective Genetic Algorithm for the Vehicle Routing Problem with Multiple Depots

2011 ◽  
Vol 204-210 ◽  
pp. 283-287 ◽  
Author(s):  
Yun Yao Li ◽  
Chang Shi Liu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computing Time ◽  
Travel Distance ◽  
Computational Results ◽  
High Quality ◽  
Routing Problem ◽  
Multiple Depots ◽  
Reasonable Computing

The vehicle routing problem with multiple depots was considered in this paper, and a genetic algorithm for the proposed problem was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics recently published in the literature, the computational results show that the proposed approaches produce high quality results within a reasonable computing time.

scholarly journals Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

2021 ◽  
Vol 69 (2) ◽  
pp. 380-409
Author(s):  
Michiel A. J. uit het Broek ◽  
Albert H. Schrotenboer ◽  
Bolor Jargalsaikhan ◽  
Kees Jan Roodbergen ◽  
Leandro C. Coelho
Keyword(s):  
Vehicle Routing ◽  
Valid Inequalities ◽  
Directed Graphs ◽  
Branch And Cut ◽  
Vehicle Routing Problems ◽  
Problem Size ◽  
Routing Problems ◽  
Multiple Depots ◽  
Number Of Customers ◽  
New Inequalities

In “Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm,” Uit het Broek, Schrotenboer, Jargalsaikhan, Roodbergen, and Coelho present a generic branch-and-cut framework to solve routing problems with multiple depots on directed graphs. They present new valid inequalities that eliminate subtours, enforce tours to be linked to the same depot, and enforce bounds on the number of customers in a vehicle tour. This is embedded in a branch-and-cut scheme that also contains generalized and adapted versions of valid inequalities that are well known for related routing problems. The authors show that the new inequalities tighten root node relaxations considerably. In combination with a simple but effective upper-bound procedure, only requiring a MIP solver and a smart reduction of the problem size, the authors show that the overall framework solves instances of considerably larger size to optimality than have been reported in the literature.

The Distribution and Pickup of Goods

2019 ◽  
pp. 46-85
Author(s):  
Hamdi Radhoui ◽  
Atour Taghipour ◽  
Beatrice Canel-Depitre
Keyword(s):  
Supply Chain ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Scheduling Problems ◽  
New Classification ◽  
Routing Problem ◽  
Comprehensive Review ◽  
Multiple Depots ◽  
Transport Management ◽  
Distribution Problems

The literature of vehicle scheduling problems is rich with different approaches, which try to schedule the distribution of products to a network of clients. In this case, the vehicle routing problem with deliveries and pickups of goods is an extension of vehicle routing problem in which goods are transported from a depot (or multiple depots) to customers, as well from customers to the depots. There is tremendous work in the literature of this problem. Freight transport management deals with all distribution problems along the supply chain. This chapter presents a comprehensive review and survey of this literature. The literature is classified into four fundamental classes according to the way of the customers' visit and methods used for solving. Then different variants are generated according to the elements of the proposed framework. During this chapter, based on a proposed framework, the authors analyze the literature of the vehicle routing problem with deliveries and pickups, and as a result, the researchers propose a new classification where they give a short modeling of it.

Sign in / Sign up

Export Citation Format

Share Document