In this paper, we tackle a new variant of the Vehicle Routing Problem (VRP) which combines two known variants namely the Profitable VRP and the VRP with Mult iple Trips. The resulting problem may be called the Profitable Vehicle Routing Problem with Multiple Trips. The main purpose is to cover and solve a more complex realistic situation of the distribution transportation. The profitability con...

To solve the low-carbon vehicle routing problem (VRP) with sustainable development background, VRP considering impact of speed on carbon emissions is studied. A optimization model aims to minimize total cost distribution, penalty and emission cost. In model, driving time are calculated basis varying matching real road network. Moreover, improved genetic algorithm applied optimize in this paper....

This paper proposes an abstraction of emerging vehicle routing problems, the Vehicle Routing Problem with Black Box Feasibility. In this problem the routes of a basic VRP need to satisfy an unknown set of constraints. A black box function to test the feasibility of a route is provided. This function is considered of non-linear complexity (in the length of the route). Practical examples of such ...

increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different ...

In this paper we define a new problem, the aim of which is to find a set of k dissimilar solutions for a vehicle routing problem (VRP) on a single instance. This problem has several practical applications in the cashin-transit sector and in the transportation of hazardous materials. A min–max mathematical formulation is proposed which requires a maximum similarity threshold between VRP solution...

Artificial Intelligent (AI) techniques make a great influence on real-world distribution operations due to the complexity and the difficulty of finding an optimal solution within the limited time frame. To bridge the gap between standard problems in distribution and the real world problems, in this research, the standard VRP problem is extended to Multi Depot Vehicle Routing Problem with Time W...

This paper investigates the periodic delivery planning of vending machine problem (PDPVMP). The problem is a periodic vehicle routing problem (PVRP), which is also an extension of the typical vehicle routing problem (VRP). The considered PDPVMP contains multiple vending machines with periodic demands. For each vending machine, its replenishment frequency is either once per two days or twice per...

In this paper, we present an intelligent solution system for a vehicle routing problem (VRP) with rigid time window in urban distribution. The solution has three stages. The first stage uses Clustering Analysis in Data Mining to classify all customers by a number of attributes, such as distance, demand level, the density of customer, and city layout. The second stage introduces how to generate ...