scholarly journals Optimizing Vehicle Routing for Simultaneous Pick-up and Delivery considering the Reusable Transporting Containers: Case of Convenient Stores

2020 ◽  
Author(s):  
Intaek Gong ◽  
Kyungho Lee ◽  
Jaewon Kim ◽  
Yunhong Min ◽  
Kwang Sup Shin
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Traffic Congestion ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Mathematical Problem ◽  
Transportation Cost ◽  
Business Environment ◽  
Routing Problem ◽  
The Mathematical Model

A lot of previous research have proposed various frameworks and algorithms to optimize routes to reduce the total transportation cost, which accounts for over 70% of overall logistics cost. However, it is very hard to find the cases applied the mathematical models or algorithms to the practical business environment cases, especially daily operating logistics services like convenient stores. Most of previous research have considered the developing an optimal algorithm which can solve the mathematical problem within the practical time while satisfying all constraints such as the capacity of delivery and pick-up, and time windows. For the daily pick-up and delivery service like supporting several convenient stores, it is required to consider the unit transporting container as well as the demand, capacity of trucks, traveling distance and traffic congestion. Especially, the reusable transporting container, trays, should be regarded as the important asset of logistics center. However, if the mathematical model focuses on only satisfying constraints related delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this research, it has been proposed to build the mathematical model for optimizing pick-up and delivery plans by extending the general vehicle routing problem of simultaneous delivery and pickup with time windows while considering left-over cost. With the numerical experiments, it has been proved that the proposed model may reduce the total delivery cost. It may be possible to apply the proposed approach to the various logistics business which uses the reusable transporting container like shipping containers, refrigerating containers, trays, and pallets.

scholarly journals Optimizing Vehicle Routing for Simultaneous Delivery and Pick-Up Considering Reusable Transporting Containers: Case of Convenience Stores

2020 ◽  
Vol 10 (12) ◽  
pp. 4162 ◽  
Author(s):  
Intaek Gong ◽  
Kyungho Lee ◽  
Jaewon Kim ◽  
Yunhong Min ◽  
KwangSup Shin
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Optimal Algorithm ◽  
Time Windows ◽  
Mathematical Problem ◽  
Transportation Cost ◽  
Business Environment ◽  
Routing Problem ◽  
Convenience Stores ◽  
Simultaneous Delivery

Previous studies have proposed various frameworks and algorithms to optimize routes to reduce total transportation cost, which accounts for over 29.4% of overall logistics costs. However, it is very hard to find cases in which mathematical models or algorithms are applied to practical business environment cases which require reusable packaging, especially daily operating logistics services like convenience store support systems. Most previous studies have considered developing an optimal algorithm which can solve the mathematical problem within a practical amount of time while satisfying all constraints, such as the capacity of delivery and pick-up, and hard or soft time windows. For daily delivery and pick-up services, like those supporting several convenience stores, it is required to consider the unit transporting the container, as well as the demand, capacity of trucks, travel distance, and traffic congestion. In particular, reusable transport containers and trays should be regarded as important assets of logistics centers. However, if the mathematical model focuses on only satisfying constraints related to delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this study, we propose a mathematical model for optimizing delivery and pick-up plans by extending the general vehicle routing problem of simultaneous delivery and pick-up with time windows, while considering left-over cost. With numerical experiments it has been proved that the proposed model may reduce the total delivery cost. Also, it seems possible to apply the proposed approach to the various logistics businesses which require reusable transport containers like shipping containers, refrigerating containers, trays, and pallets.

Optimize the Transit Vehicle Routing for the Emergency Evacuation

2011 ◽  
Vol 201-203 ◽  
pp. 1075-1081 ◽  
Author(s):  
De Ai Chen ◽  
Wang Tu Xu ◽  
Wei Zhang
Keyword(s):  
Vehicle Routing ◽  
Time Windows ◽  
Emergency Situation ◽  
Emergency Evacuation ◽  
Intelligent Algorithm ◽  
Routing Problem ◽  
Evacuation Strategy ◽  
Transit Route ◽  
Evacuation Plan ◽  
The Mathematical Model

This paper concentrates on modeling the vehicle routing to develop an evacuation plan for transit-dependent residents during emergency situation. Planning of transit route in the evacuation is formulated as a vehicle routing problem with time windows (VRPTW). An intelligent algorithm, in which genetic algorithm is embedded with simulated annealing is developed to solve the optimization model. A real evacuation network on which 19 pick-up points and 4 shelters are distributed is used to study the proposed evacuation strategy. The relevant results show the feasibility of the mathematical model as well as the efficiency of the solving algorithm.

scholarly journals Pollution routing problem with time window and split delivery

2019 ◽  
Author(s):  
Sameh M. Saad ◽  
Ramin Bahadori
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Carbon Dioxide Emissions ◽  
Co2 Emission ◽  
Simulated Annealing Algorithm ◽  
Time Window ◽  
Time Windows ◽  
Routing Problem ◽  
Split Delivery ◽  
Pollution Routing Problem

In most classic vehicle routing problems, the main goal is to minimise the total travel time or distance while, the green vehicle routing problem, in addition to the stated objectives, also focuses on minimising fuel costs and greenhouse gas emissions, including carbon dioxide emissions. In this research, a new approach in Pollution Routing Problem (PRP) is proposed to minimise the CO2 emission by investigating vehicle weight fill level in length of each route. The PRP with a homogeneous fleet of vehicles, time windows, considering the possibility of split delivery and constraint of minimum shipment weight that must be on the vehicle in each route is investigated simultaneously. The mathematical model is developed and implemented using a simulated annealing algorithm which is programmed in MATLAB software. The generated results from all experiments demonstrated that the application of the proposed mathematical model led to the reduction in CO2 emission.

scholarly journals Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

2020 ◽  
Vol 26 (4) ◽  
pp. 174-184
Author(s):  
Thi Diem Chau Le ◽  
Duy Duc Nguyen ◽  
Judit Oláh ◽  
Miklós Pakurár
Keyword(s):  
Mathematical Model ◽  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Distribution Networks ◽  
Mixed Integer ◽  
Vehicle Group ◽  
Real Problem ◽  
Routing Problem

AbstractThis study describes a pickup and delivery vehicle routing problem, considering time windows in reality. The problem of tractor truck routes is formulated by a mixed integer programming model. Besides this, three algorithms - a guided local search, a tabu search, and simulated annealing - are proposed as solutions. The aims of our study are to optimize the number of internal tractor trucks used, and create optimal routes in order to minimize total logistics costs, including the fixed and variable costs of an internal vehicle group and the renting cost of external vehicles. Besides, our study also evaluates both the quality of solutions and the time to find optimal solutions to select the best suitable algorithm for the real problem mentioned above. A novel mathematical model is formulated by OR tools for Python. Compared to the current solution, our results reduced total costs by 18%, increased the proportion of orders completed by internal vehicles (84%), and the proportion of orders delivered on time (100%). Our study provides a mathematical model with time constraints and large job volumes for a complex distribution network in reality. The proposed mathematical model provides effective solutions for making decisions at logistics companies. Furthermore, our study emphasizes that simulated annealing is a more suitable algorithm than the two others for this vehicle routing problem.

scholarly journals DIESEL SUPPLY PLANNING FOR OFFSHORE PLATFORMS BY A MATHEMATICAL MODEL BASED ON THE VEHICLE ROUTING PROBLEM WITH REPLENISHMENT

2016 ◽  
Author(s):  
Rodrigo De Alvarenga Rosa ◽  
Henrique Fiorot Astoures ◽  
André Silva Rosa
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Oil And Gas ◽  
Offshore Platforms ◽  
Oil Exploration ◽  
Routing Problem ◽  
Model Based ◽  
Supply Planning ◽  
The Mathematical Model

Oil exploration in Brazil is mainly held by offshore platforms which require the supply of several products, including diesel to maintain its engines. One strategy to supply diesel to the platforms is to keep a vessel filled with diesel nearby the exploration basin. An empty boat leaves the port and goes directly to this vessel, then it is loaded with diesel. After that, it makes a trip to supply the platforms and when the boat is empty, it returns to the vessel to be reloaded with more diesel going to another trip. Based on this description, this paper proposes a mathematical model based on the Vehicle Routing Problem with Intermediate Replenishment Facilities (VRPIRF) to solve the problem. The purpose of the model is to plan the routes for the boats to meet the diesel requests of the platform. Given the fact that in the literature, papers about the VRPIRF are scarce and papers about the VRPIRF applied to offshore platforms were not found in the published papers, this paper is important to contribute with the evolution of this class of problem, bringing also a solution for a real application that is very important for the oil and gas business. The mathematical model was tested using the CPLEX 12.6. In order to assess the mathematical model, tests were done with data from the major Brazilian oil and gas company and several strategies were tested.DOI: http://dx.doi.org/10.4995/CIT2016.2016.2217

A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing

2011 ◽  
Vol 30 (2) ◽  
pp. 83-92 ◽  
Author(s):  
R. Tavakkoli-Moghaddam ◽  
M. Gazanfari ◽  
M. Alinaghian ◽  
A. Salamatbakhsh ◽  
N. Norouzi
Keyword(s):  
Mathematical Model ◽  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem

scholarly journals Vehicle Routing Problem for Multiple Product Types, Compartments, and Trips with Soft Time Windows

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
P. Kabcome ◽  
T. Mouktonglang
Keyword(s):  
Mathematical Model ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Maximum Distance ◽  
Single Type ◽  
Routing Problem ◽  
Soft Time Windows ◽  
Multiple Product ◽  
Multiple Categories

This paper presents a mathematical model to solve the vehicle routing problem with soft time windows (VRPSTW) and distribution of products with multiple categories. In addition, we include multiple compartments and trips. Each compartment is dedicated to a single type of product. Each vehicle is allowed to have more than one trip, as long as it corresponds to the maximum distance allowed in a workday. Numerical results show the effectiveness of our model.

scholarly journals A Two-Echelon Electric Vehicle Routing Problem with Time Windows and Battery Swapping Stations

2021 ◽  
Vol 11 (22) ◽  
pp. 10779
Author(s):  
Dan Wang ◽  
Hong Zhou
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
High Efficiency ◽  
Programming Model ◽  
Time Windows ◽  
Transportation Cost ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Fixed Cost ◽  
Routing Problem

Driven by the new laws and regulations concerning the emission of greenhouse gases, it is becoming more and more popular for enterprises to adopt cleaner energy. This research proposes a novel two-echelon vehicle routing problem consisting of mixed vehicles considering battery swapping stations, which includes one depot, multiple satellites with unilateral time windows, and customers with given demands. The fossil fuel-based internal combustion vehicles are employed in the first echelon, while the electric vehicles are used in the second echelon. A mixed integer programming model for this proposed problem is established in which the total cost, including transportation cost, handling cost, fixed cost of two kinds of vehicles, and recharging cost, is minimized. Moreover, based on the variable neighborhood search, a metaheuristic procedure is developed to solve the problem. To validate its effectiveness, extensive numerical experiments are conducted over the randomly generated instances of different sizes. The computational results show that the proposed metaheuristic can produce a good logistics scheme with high efficiency.

Sign in / Sign up

Export Citation Format

Share Document