scholarly journals Two - Echelon Vehicle Routing Problem with Recharge Stations

2019 ◽  
Vol 20 (4) ◽  
pp. 305-317
Author(s):  
Anita Agárdi ◽  
László Kovács ◽  
Tamás Bányai
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicles ◽  
Vehicle Routing Problem ◽  
Manufacturing Systems ◽  
Route Planning ◽  
Planning Problem ◽  
Test Results ◽  
Routing Problem ◽  
Efficient Operation ◽  
Wide Range

Abstract The efficient operation of logistic processes requires a wide range of design tasks to ensure efficient, flexible and reliable operation of connected production and service processes. Autonomous electric vehicles support the flexible in-plant supply of cyber-physical manufacturing systems. Within the frame of this article, the extension of the Two-Echelon Vehicle Routing Problem with recharge stations is analyzed. The objective function of the optimization problem is the minimization of operation costs. The extension of 2E-VRP means that the second level vehicles (electric vehicles, must be recharged) come from one recharge station, then pick up the products from the satellite, visit the customers and return to the recharge station from where it started. We solved the route planning problem with the application of construction heuristics and improvement heuristics. The test results indicate that the combination of this approach provides a superior efficiency.

scholarly journals Capacitated vehicle routing problem model for carriers

2018 ◽  
Vol 12 ◽  
Author(s):  
Irma-Delia Rojas-Cuevas ◽  
Santiago-Omar Caballero-Morales ◽  
Jose-Luis Martinez-Flores ◽  
Jose-Rafael Mendoza-Vazquez
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Network Flow ◽  
Route Planning ◽  
Test Problems ◽  
Optimal Route ◽  
Routing Problem ◽  
Problem Model ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Background: The Capacitated Vehicle Routing Problem (CVRP) is one of the most important transportation problems in logistics and supply chain management. The standard CVRP considers a fleet of vehicles with homogeneous capacity that depart from a warehouse, collect products from (or deliver products to) a set of customer locations (points) and return to the same warehouse. However, the operation of carrier companies and third-party transportation providers may follow a different network flow for collection and delivery. This may lead to non-optimal route planning through the use of the standard CVRP.Objective: To propose a model for carrier companies to obtain optimal route planning.Method: A Capacitated Vehicle Routing Problem for Carriers (CVRPfC) model is used to consider the distribution scenario where a fleet of vehicles depart from a vehicle storage depot, collect products from a set of customer points and deliver them to a specific warehouse before returning to the vehicle storage depot. Validation of the model’s functionality was performed with adapted CVRP test problems from the Vehicle Routing Problem LIBrary. Following this, an assessment of the model’s economic impact was performed and validated with data from a real carrier (real instance) with the previously described distribution scenario.Results: The route planning obtained through the CVRPfC model accurately described the network flow of the real instance and significantly reduced its distribution costs.Conclusion: The CVRPfC model can thus improve the competitiveness of the carriers by providing better fares to their customers, reducing their distribution costs in the process.

scholarly journals A Method for Transportation Planning and Profit Sharing in Collaborative Multi-Carrier Vehicle Routing

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1788
Author(s):  
Yanjun Shi ◽  
Na Lin ◽  
Qiaomei Han ◽  
Tongliang Zhang ◽  
Weiming Shen
Keyword(s):  
Vehicle Routing ◽  
Shapley Value ◽  
Vehicle Routing Problem ◽  
Transportation Planning ◽  
Hybrid Genetic Algorithm ◽  
Profit Sharing ◽  
Planning Problem ◽  
Routing Problem ◽  
Heuristics Algorithm ◽  
Carrier Vehicle

This paper addresses a collaborative multi-carrier vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs. First, a hierarchical heuristics algorithm is proposed to solve the transportation planning problem. This algorithm makes order assignments based on two distance rules and solves the vehicle routing problem with a hybrid genetic algorithm. Second, the profit arising from the coalition is quantified, and an improved Shapley value method is proposed to distribute the profit fairly to individual players. Extensive experiment results showed the effectiveness of the proposed hierarchical heuristics algorithm and confirmed the stability and fairness of the improved Shapley value method.

Research on Single Distribution Center Logistics Transportation Scheduling Problem Based on Static Road Capacity Constraints

2013 ◽  
Vol 798-799 ◽  
pp. 954-962
Author(s):  
Yu Qiang Chen ◽  
Wei Jun Yang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Economic Value ◽  
Capacity Constraints ◽  
Distribution Center ◽  
Routing Problem ◽  
Road Capacity ◽  
Wide Range ◽  
Transportation Scheduling ◽  
Chaos Genetic Algorithm

Related Vehicle Routing Problem is another form of Vehicle Routing Problem. RVRP also belongs to NP-Hard with a wide range of application areas and major economic value. The research based on single distribution center RVRP with road capacity static constraint, to build a model of single distribution RVRP and propose a kind of chaos genetic algorithm to solve this problem, with experiments verify the feasibility and effectiveness of the algorithm.

Practical aspects of the split delivery vehicle routing problem (SDVRP)

2018 ◽  
Vol 120 ◽  
pp. 155-166
Author(s):  
Marek Karkula
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Route Planning ◽  
Product Distribution ◽  
Delivery Vehicle ◽  
Routing Problem ◽  
Split Delivery ◽  
Delivery Planning ◽  
Distribution Company ◽  
Planning Problems

Transport process arrangement and delivery route planning is one of the most important tasks of managers in distribution, trade and production enterprises. The problem of route planning concerns the rationalization of product distribution processes offered by company for the customer's network. In operational research, such a problem is included in the class of issues of Vehicle Routing Problem – VRP. The VRP delivery planning problems constitute a wide family of issues arising primarily from the conditions and constraints of the practice. The paper presents the practical application of one of the VRP variants – the problem of arranging routes for the Split Delivery Vehicle Routing Problem – SDVRP, and the results of analyses based on research carried out in a distribution company.

A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem

2014 ◽  
Vol 505-506 ◽  
pp. 1071-1075
Author(s):  
Yi Sun ◽  
Yue Chen ◽  
Chang Chun Pan ◽  
Gen Ke Yang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Algorithm ◽  
Time Windows ◽  
Time Dependent ◽  
Ant Colony System ◽  
Optimal Solutions ◽  
Test Results ◽  
Routing Problem ◽  
Traffic Conditions

This paper presents a real road network case based on the time dependent vehicle routing problem with time windows (TDVRPTW), which involves optimally routing a fleet of vehicles with fixed capacity when traffic conditions are time dependent and services at customers are only available in their own time tables. A hybrid algorithm based on the Genetic Algorithm (GA) and the Multi Ant Colony System (MACS) is introduced in order to find optimal solutions that minimize two hierarchical objectives: the number of tours and the total travel cost. The test results show that the integrated algorithm outperforms both of its traditional ones in terms of the convergence speed towards optimal solutions.

Intervention Planning in ITIL Context

2021 ◽  
Vol 12 (4) ◽  
pp. 85-109
Author(s):  
Mounir Ketata ◽  
Zied Loukil ◽  
Faiez Gargouri
Keyword(s):  
Combinatorial Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Service Level ◽  
Incident Management ◽  
Planning Problem ◽  
Service Level Agreements ◽  
Routing Problem ◽  
Priority Order ◽  
Intervention Planning

In incident management and especially in after-sales services, customer interventions must be planned according to a priority order set by service level agreements as well as the availability of both technicians and clients. Despite the availability of incident management software solutions, intervention planning is still performed manually in most solutions because numerous constraints must be considered such as the synchronization of technician skills and customer requests, their availability, and the customer priorities. The intervention planning problem is considered as a difficult combinatorial optimization issue. Various approaches have been proposed in the literature including the transformation of this problem into a vehicle routing problem (VRP) or into a CSP in the context of ITIL framework. Yet, the resolution of this problem with a classical CSP solver is time consuming and must be optimized by proposing filtering rules or specific heuristics. This paper proposes the improved CSP and COP models for intervention planning problem with implementing filtering rules and techniques.

Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity

2021 ◽  
Author(s):  
Alexander Jungwirth ◽  
Guy Desaulniers ◽  
Markus Frey ◽  
Rainer Kolisch
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Cutting Planes ◽  
Time Windows ◽  
Time Dependent ◽  
Planning Problem ◽  
Routing Problem ◽  
Number Of Patients ◽  
New Variant ◽  
Synchronization Constraints

We study a new variant of the vehicle routing problem, which arises in hospital-wide scheduling of physical therapists. Multiple service locations exist for patients, and resource synchronization for the location capacities is required as only a limited number of patients can be treated at one location at a time. Additionally, operations synchronization between treatments is required as precedence relations exist. We develop an innovative exact branch-price-and-cut algorithm including two approaches targeting the synchronization constraints (1) based on branching on time windows and (2) based on adding combinatorial Benders cuts. We optimally solve realistic hospital instances with up to 120 treatments and find that branching on time windows performs better than adding cutting planes. Summary of Contribution: We present an exact branch-price-and-cut (BPC) algorithm for the therapist scheduling and routing problem (ThSRP), a daily planning problem arising at almost every hospital. The difficulty of this problem stems from its inherent structure that features routing and scheduling while considering multiple possible service locations with time-dependent location capacities. We model the ThSRP as a vehicle routing problem with time windows and flexible delivery locations and synchronization constraints, which are properties relevant to other vehicle routing problem variants as well. In our computational study, we show that the proposed exact BPC algorithm is capable of solving realistic hospital instances and can, thus, be used by hospital planners to derive better schedules with less manual work. Moreover, we show that time window branching can be a valid alternative to cutting planes when addressing synchronization constraints in a BPC algorithm.

scholarly journals The Mobile Charging Vehicle Routing Problem with Time Windows and Recharging Services

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Shaohua Cui ◽  
Hui Zhao ◽  
Hui Chen ◽  
Cuiping Zhang
Keyword(s):  
Vehicle Routing ◽  
Electric Vehicles ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Sensitivity Analyses ◽  
Mixed Integer ◽  
Mixed Integer Linear Program ◽  
Routing Problem ◽  
Battery Electric Vehicles ◽  
Battery Capacity

For the environmental friendliness of the technology on battery electric vehicles, there is growing attention on it. However, the market share of battery electric vehicles remains low due to the range anxiety. As a remedy, the mobile charging services could offer charging service at any time or locations requested. For profitability of the services, the operator should route the charging vehicles in a more efficient manner. For this consideration, we formulate the mobile charging vehicle routing problem as a mixed integer linear program based on the classical vehicle routing problem with time windows. To demonstrate the model, test instances are designed and computational results are presented. In order to examine the change of the number of mobile charging vehicles and travel distance, sensitivity analyses, such as battery capacity and recharging rate, are performed. The results show that larger battery capacity, quicker charging rate, or higher service efficiency could decrease the number of mobile charging vehicles and total traveled distances, respectively.

Sign in / Sign up

Export Citation Format

Share Document