scholarly journals An Efficient Algorithm for Crowd Logistics Optimization

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 509
Author(s):  
Raúl Martín-Santamaría  ◽  
Ana D. López-Sánchez  ◽  
María Luisa Delgado-Jalón  ◽  
J. Manuel Colmenar 
Keyword(s):  
Distribution System ◽  
Efficient Algorithm ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Quality Performance ◽  
Routing Problem ◽  
Distribution Process ◽  
Crowd Logistics ◽  
Corporate Information Systems ◽  
A Company

Crowd logistics is a recent trend that proposes the participation of ordinary people in the distribution process of products and goods. This idea is becoming increasingly important to both delivery and retail companies, because it allows them to reduce their delivery costs and, hence, to increase the sustainability of the company. One way to obtain these reductions is to hire external drivers who use their own vehicles to make deliveries to destinations which are close to their daily trips from work to home, for instance. This situation is modelled as the Vehicle Routing Problem with Occasional Drivers (VRPOD), which seeks to minimize the total cost incurred to perform the deliveries using vehicles belonging to the company and occasionally hiring regular citizens to make just one delivery. However, the integration of this features into the distribution system of a company requires a fast and efficient algorithm. In this paper, we propose three different implementations based on the Iterated Local Search algorithm that are able to outperform the state-of-art of this problem with regard to the quality performance. Besides, our proposal is a light-weight algorithm which can produce results in small computation times, allowing its integration into corporate information systems.

scholarly journals An iterated local search algorithm for the vehicle routing problem with convex time penalty functions

2008 ◽  
Vol 156 (11) ◽  
pp. 2050-2069 ◽  
Author(s):  
Toshihide Ibaraki ◽  
Shinji Imahori ◽  
Koji Nonobe ◽  
Kensuke Sobue ◽  
Takeaki Uno ◽  
...  
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Penalty Functions ◽  
Local Search Algorithm ◽  
Routing Problem

scholarly journals The Electric Vehicle Routing Problem with Capacitated Charging Stations

2021 ◽  
Author(s):  
Aurélien Froger ◽  
Ola Jabali ◽  
Jorge E. Mendoza ◽  
Gilbert Laporte
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicle ◽  
Search Algorithm ◽  
Iterated Local Search ◽  
Branch And Cut ◽  
Continuous Time Model ◽  
Time Model ◽  
Routing Problem ◽  
Multiple Charging ◽  
Charging Stations

Electric vehicle routing problems (E-VRPs) deal with routing a fleet of electric vehicles (EVs) to serve a set of customers while minimizing an operational criterion, for example, cost or time. The feasibility of the routes is constrained by the autonomy of the EVs, which may be recharged along the route. Much of the E-VRP research neglects the capacity of charging stations (CSs) and thus implicitly assumes that an unlimited number of EVs can be simultaneously charged at a CS. In this paper, we model and solve E-VRPs considering these capacity restrictions. In particular, we study an E-VRP with nonlinear charging functions, multiple charging technologies, en route charging, and variable charging quantities while explicitly accounting for the number of chargers available at privately managed CSs. We refer to this problem as the E-VRP with nonlinear charging functions and capacitated stations (E-VRP-NL-C). We introduce a continuous-time model formulation for the problem. We then introduce an algorithmic framework that iterates between two main components: (1) the route generator, which uses an iterated local search algorithm to build a pool of high-quality routes, and (2) the solution assembler, which applies a branch-and-cut algorithm to combine a subset of routes from the pool into a solution satisfying the capacity constraints. We compare four assembly strategies on a set of instances. We show that our algorithm effectively deals with the E-VRP-NL-C. Furthermore, considering the uncapacitated version of the E-VRP-NL-C, our solution method identifies new best-known solutions for 80 of 120 instances.

scholarly journals Designing optimal route for the distribution chain of a rural LPG delivery system

2021 ◽  
pp. 221-234 ◽  
Author(s):  
Purusotham Singamsetty ◽  
Jayanth Kumar Thenepalle
Keyword(s):  
Distribution System ◽  
Present Model ◽  
Search Algorithm ◽  
Pickup And Delivery ◽  
Liquefied Petroleum Gas ◽  
Routing Problem ◽  
Fixed Subset ◽  
Simultaneous Pickup And Delivery ◽  
Distribution Chain ◽  
Single Commodity

A practical distribution system that arises in the context of delivering liquefied petroleum gas (LPG) through cylinders is considered in this study. To meet all the challenging constraints, the model is explicitly considered as a simultaneous pickup and delivery single commodity truncated vehicle routing problem with the homogeneous fleet of vehicles. The aim of this problem is to find the optimal routes for the set of vehicles locating at the distributing agency (DA), which offers simultaneous pickup and delivery operations over single commodity (i.e. LPG cylinders) to a fixed subset (need not serve all delivery centers) of delivery centers at rural level. The model is designed using zero-one integer linear programming. For proper treatment of the present model, an exact Lexi-search algorithm (LSA) has been developed. A comparative study is performed between the LSA and existing results for the relaxed version of the present model. Further, the efficiency of the LSA is tested through numerical experiments over small and medium CVRP benchmark test instances. The extensive computational results have shown that the LSA is productive and revealed that the real solutions have more consistent than the integral solutions in the presence of truncation constraint.

Sign in / Sign up

Export Citation Format

Share Document