one of the most important extensions of the capacitated vehicle routing problem (cvrp) is the vehicle routing problem with simultaneous pickup and delivery (vrpspd) where customers require simultaneous delivery and pick-up service. in this paper, we propose an effective ant colony optimization (eaco) which includes insert, swap and 2-opt moves for solving vrpspd that is different with common an...

delivering perishable products to customers as soon as possible and with the minimum cost has been always a challenge for producers and has been emphasized over recent years due to the global market becoming more competitive. in this paper a multi-objective mix integer non-linear programming model is proposed to maximize both profits of a distributer and the total freshness of the several produ...

In this paper, we introduce two algorithms to address the two-echelon capacitated location-routing problem (2E-CLRP). We introduce a branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities. We also propose an adaptive large-neighbourhood search (ALNS) meta-heuristic with the objective of findin...

Multi-echelon distribution systems and more precisely, optimization of LTL routes related to them is one of the most popular subjects in the last 5 years of vehicle routing research. Although a plethora of models, methods and visions is found, it is still difficult to compare them because they use different terminologies and some authors insist on the fact there are a multitude of close but dif...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

Abstract We present a multi-ob’jective two-echelon vehicle routing problem with synchronization and ‘grey zone’ customers arising in the context of urban freight deliveries. Inner-city center deliveries are performed by small vehicles due to access restrictions, while outside this area carried out conventional for economic reasons. Goods transferred from first second echelon synchronized meetin...

With the increase in pollutants, need to use electric vehicles (EVs) various urban logistics activities is an increasingly important issue. Currently, there are issues with efficiency of transport companies recognizing effects uncertain factors daily operations. Thus, this research proposes a novel fuzzy two-echelon vehicle routing problem involving heterogeneous fleet EVs and internal combusti...