Two-Echelon Location-Routing and Vehicle Routing Problems in City Logistics

2019 ◽  
pp. 55-87
Keyword(s):  
Vehicle Routing ◽  
The Other ◽  
City Logistics ◽  
Heuristic Methods ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Commodity Flow ◽  
Flow Modelling ◽  
Location Routing

This chapter presents the main notions of two-echelon vehicle routing (2E-VRP) in relation to city logistics. After introducing vehicle routing and the main single-echelon problems and variants, the two-echelon version is presented and two different models proposed: one based on commodity flow and the other on vehicle flow modelling). Several instances are solved with those models and the results are compared and discussed. That comparison illustrates the difficulty of using this type of models to obtain results to that problem, and motivates the need of developing suitable algorithms. For that reason, an overview of heuristic methods to solve two-echelon vehicle routing problems is made, as well as an introduction of other related problems which are similar and interesting, relating in all cases the presented methods and problems to city logistics needs and goals.

scholarly journals A review on the electric vehicle routing problems: Variants and algorithms

2021 ◽  
Author(s):  
Hu Qin ◽  
Xinxin Su ◽  
Teng Ren ◽  
Zhixing Luo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Location Routing Problem ◽  
Routing Problems ◽  
Routing Problem ◽  
Delivery Problem ◽  
Pickup And Delivery Problem ◽  
The Past ◽  
Location Routing ◽  
Comprehensive Survey

AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.

scholarly journals Vehicle routing problems for city logistics

2015 ◽  
Vol 6 (1) ◽  
pp. 51-79 ◽  
Author(s):  
Diego Cattaruzza ◽  
Nabil Absi ◽  
Dominique Feillet ◽  
Jesús González-Feliu
Keyword(s):  
Vehicle Routing ◽  
City Logistics ◽  
Vehicle Routing Problems ◽  
Routing Problems

VRoptBees

2018 ◽  
Vol 7 (1) ◽  
pp. 32-56
Author(s):  
Thiago A.S. Masutti ◽  
Leandro Nunes de Castro
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Optimization Problems ◽  
The Other ◽  
Vehicle Routing Problems ◽  
Routing Problems ◽  
Routing Problem ◽  
Combinatorial Optimization Problems ◽  
Biological Phenomena ◽  
The Traveling Salesman Problem

Combinatorial optimization problems are broadly studied in the literature. On the one hand, their challenging characteristics, such as the constraints and number of potential solutions, inspires their use to test new solution techniques. On the other hand, the practical application of these problems provides support of daily tasks of people and companies. Vehicle routing problems constitute a well-known class of combinatorial optimization problems, from which the Traveling Salesman Problem (TSP) is one of the most elementary ones. TSP corresponds to finding the shortest route that visits all cities within a path returning to the start city. Despite its simplicity, the difficulty in finding its exact solution and its direct application in practical problems in multiple areas make it one of the most studied problems in the literature. Algorithms inspired by biological phenomena are being successfully applied to solve optimization tasks, mainly combinatorial optimization problems. Those inspired by the collective behavior of insects produce good results for solving such problems. This article proposes the VRoptBees, a framework inspired by honeybee behavior to tackle vehicle routing problems. The framework provides a flexible and modular tool to easily build solutions to vehicle routing problems. Together with the framework, two examples of implementation are described, one to solve the TSP and the other to solve the Capacitated Vehicle Routing Problem (CVRP). Tests were conducted with benchmark instances from the literature, showing competitive results.

AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS

2005 ◽  
Vol 22 (01) ◽  
pp. 85-104 ◽  
Author(s):  
L. ZENG ◽  
H. L. ONG ◽  
K. M. NG
Keyword(s):  
Simulated Annealing ◽  
Local Search ◽  
Vehicle Routing ◽  
Search Method ◽  
Benchmark Problems ◽  
Heuristic Methods ◽  
Vehicle Routing Problems ◽  
Local Search Method ◽  
Routing Problems ◽  
Improvement Algorithm

In this paper, we propose an assignment-based local search method for solving vehicle routing problems. This method is a multi-route improvement algorithm that can operate on several routes at a time. To evaluate the performance of the proposed method, extensive computational experiments on the proposed method applied to a set of benchmark problems are carried out. The results show that the proposed method, when coupled with metaheuristics such as simulated annealing, is comparable with other efficient heuristic methods proposed in the literature.

Sign in / Sign up

Export Citation Format

Share Document