Toward a more flexible VRP with pickup and delivery allowing consolidations
نویسندگان
چکیده
One important requirement of modern supply chain management is the frequent exchange containers via multiple cross-docks which requires spatial and time synchronisations between different types vehicle. Moreover, as collaborations in logistics several companies become popular, more flexible extended models must be solved to consider needs companies. This high importance a new concept, Physical Internet, expected considerably improve way are handled current management. To optimise aforementioned requirements, rich vehicle routing problem with pickup delivery including numerous attributes modelled solved. A mathematical formulation proposed implemented CPLEX solve problem. Given complexity problem, solving large instances exact methods very time-consuming. Therefore, multi-threaded meta-heuristic based on Simulated Annealing developed. set operators coupled restart strategy memory developed help performance. Computational results generated data-set showed that superior solver terms solvability computational time. The was also compared best-known by state-of-the-art classical benchmark problems windows (with up 200 customers). experimental method able match many these scale
منابع مشابه
A Novel Hybrid Method on VRP with Pickup and Delivery
Abstract: In order to solve the vehicle routing problem with pickup and delivery (VRPPD), this paper proposed an improved quantum genetic algorithm based on different constraint conditions. Firstly, a mathematical model was established aiming at minimizing the dispatching time and the total cost. Secondly, the paper proposes the improved quantum genetic algorithm and non dominated sorting strat...
متن کاملLarge Neighborhood Search for rich VRP with multiple pickup and delivery locations
In this paper we consider a rich vehicle routing problem where transportation requests are characterised by multiple pickup and delivery locations. The problem is a combined load acceptance and generalised vehicle routing problem incorporating a diversity of practical complexities. Among those are time window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs ...
متن کاملA Continuous Genetic Algorithm for Pickup and Delivery Problem in a VRP environment
Picking and delivery problems and its combinations are considered as NP-hard problems according to the computational complexity. For those problems, exact algorithms cannot propose appropriate solutions needing scenarios such as large industrial manufacturing enterprises or commercials, asset custody and logistics operators. These companies need to manage their inventories and movements across ...
متن کاملA particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation
In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C-emerging Technologies
سال: 2021
ISSN: ['1879-2359', '0968-090X']
DOI: https://doi.org/10.1016/j.trc.2021.103077