Solving real-life vehicle routing problems efficiently using tabu search
Annals of Operations Research - Special issue on Tabu search
An overview of vehicle routing problems
The vehicle routing problem
Optimal facility location with random throughput costs
Computers and Operations Research - Location analysis
A Joint Location-Inventory Model
Transportation Science
Budget constrained location problem with opening and closing of facilities
Computers and Operations Research
The Best Shape for a Crossdock
Transportation Science
A compact model and tight bounds for a combined location-routing problem
Computers and Operations Research
Solving the truck and trailer routing problem based on a simulated annealing heuristic
Computers and Operations Research
Models for Evaluating and Planning City Logistics Systems
Transportation Science
Computers and Operations Research
Engineering Applications of Artificial Intelligence
Multi-start heuristics for the two-echelon vehicle routing problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Transportation Science
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Multiechelon distribution systems are quite common in supply-chain and logistics. They are used by public administrations in their transportation and traffic planning strategies, as well as by companies, to model own distribution systems. In the literature, most of the studies address issues relating to the movement of flows throughout the system from their origins to their final destinations. Another recent trend is to focus on the management of the vehicle fleets required to provide transportation among different echelons. The aim of this paper is twofold. First, it introduces the family of two-echelon vehicle routing problems (VRPs), a term that broadly covers such settings, where the delivery from one or more depots to customers is managed by routing and consolidating freight through intermediate depots. Second, it considers in detail the basic version of two-echelon VRPs, the two-echelon capacitated VRP, which is an extension of the classical VRP in which the delivery is compulsorily delivered through intermediate depots, named satellites. A mathematical model for two-echelon capacitated VRP, some valid inequalities, and two math-heuristics based on the model are presented. Computational results of up to 50 customers and four satellites show the effectiveness of the methods developed.