This study focuses on solving the vehicle routing problem (VRP) of E-logistics service providers. In our problem, each must visit some pick up nodes first, for instance, warehouses to orders then makes deliveries customers in list. Each pickup node has its own list more than one requiring delivery. The objective is minimize total travelling cost while real-world application constraints, such as...

In this work, the capacitated location-routing problem with simultaneous pickup and delivery (CLRP-SPD) is considered. This problem is a more realistic case of the capacitated location-routing problem (CLRP) and belongs to the reverse logistics of the supply chain. The problem has many real-life applications of which some have been addressed in the literature such as management of liquid petrol...

Two types of decisions that directly affect the performance of a distribution system is the vehicle routing and inventory assignment. These problems have been studied separately for many years. The inventory routing problem (IRP) is integration of above mentioned distribution problems. In the other words, IRP assumes each customer maintains a local inventory of a product and consumes a certain ...

This project seeks to explore the application of two developing algorithmic paradigms from the field of computational intelligence towards optimized vehicle routing within geographic information systems (GIS). Ant Colony Optimization (ACO) is a type of multi-agent, swarm-based algorithm designed to mimic the emergent problem-solving behavior of real ants within a colony. Genetic Algorithms (GA)...

Since the Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser, it became one of the most studied problems in Combinatorial Optimization. Different solution approaches were proposed over the past decades to solve the VRP and its variants. In this thesis, we discuss about two VRP variants, resulting from the integration of VRPs with distribution problems. The first problem takes pl...

This paper presents an approximate algorithm based on distributed learning automata for solving capacitated vehicle routing problem. The vehicle routing problem (VRP) is an NPhard problem and capacitated vehicle routing problem variant (CVRP) is considered here. This problem is one of the NP-hard problems and for this reason many approximate algorithms have been designed for solving it. Distrib...

Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...

Multi-Attribute Vehicle Routing Problems (MAVRP) are variants of (VRP) in which, besides the original constraint on vehicle capacity present Capacitated Problem (CVRP), other attributes that model diverse real-life system characteristics present. Among most common studied literature and route duration constraints. The influence these restrictions overall structure problem performance local sear...

The Vehicle Routing Problem (VRP) is one of the most studied topics in Operations Research. Among numerous variants VRP, this research addresses VRP with relaxed priority rules (VRP-RPR) which customers are assigned to several groups and highest priorities typically need be served before lower ones. Additional used control trade-off between cost efficiency. We propose a Mixed Integer Linear Pro...