Solving the Capacitated Open Vehicle Routing Problem Algorithm, Based on Probability Distribution Modelling of Saving Matrix

Lipowezky, Uri; Korenfeld, Boris; Ideses, Ianir A.

doi:10.1109/icsee.2018.8646014

Cited by 3 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Adaptive Large Neighbourhood Search (ALNS) has been applied to solve many complex vehicle routing problems since it was proposed by Lipowezky et al (2018), and has achieved good solving results, this algorithm has the feature of fast convergence and is easy to jump out of the local optimal solution in the process of its neighbourhood search, and the algorithm can adaptively select the optimal operator so that in different problem situations, quickly obtain a solution with a better total cost within a limited time. The basic principle of this algorithm is to extract a group of remove and insert operators from a variety of remove and insert operators with a certain probability to perform neighbourhood search on the initial solution, the quality of the generated new solution is compared with the quality of the current best solution and the quality of the current solution, and the probability of the operator being selected is adjusted according to the comparison degree, so that the next iteration can use better operators to solve the problem, and then continuously adaptive optimisation operator is selected in the process of probability, so that the algorithm can obtain the optimal solution at a faster speed, while using remove and insert operators to reconstruct the solution, it also avoids falling into the local optimal solution.…”

Section: Proposed Algorithmmentioning

confidence: 99%

Research on collaborative optimisation of urban agricultural product distribution centre location and routing based on improved adaptive large-scale neighbourhood search algorithm

Zhang¹,

Huang²

2022

IJWMC

View full text Add to dashboard Cite

The selection of the location of agricultural products refrigeration centres and the optimisation of the route distribution of refrigerated vehicles are the key issues to be considered in the decision-making of fresh food enterprises, which involves selecting one or more refrigerated storage centres from multiple centres to be selected as distribution centres, and planning the route distribution of refrigerated vehicles from distribution centres to multiple groups of customers. In vehicle routing and distribution optimisation and distribution centre location problems each had a mature research method, this paper establishes an optimisation model of limited fresh agricultural products distribution centre location considering fuel consumption, exhaust emission and multiple constraints, in order to minimise the total cost of distribution centre location. In this paper, an improved adaptive large-scale neighbourhood search is designed to solve this collaborative optimisation problem, and the model simulation test is compared with the traditional CW saving algorithm under different calculation examples. The results clearly show that the proposed model is closer to the reality of agricultural products distribution, and the proposed adaptive large-scale neighbourhood search algorithm is effective.

show abstract

Section: Proposed Algorithmmentioning

confidence: 99%

Research on collaborative optimisation of urban agricultural product distribution centre location and routing based on improved adaptive large-scale neighbourhood search algorithm

Zhang¹,

Huang²

2022

IJWMC

View full text Add to dashboard Cite

show abstract

“…Therefore, that the work is easier and more effective and vehicle route becomes more efficient. So that garbage transportation in the Sukarami Sub-District used the open vehicle routing problem (OCVRP) [7,14], where the route passed does not form a closed route but forms an open route. If the route is not closed, so the driver can start anywhere from point so this problem has uncertainty, where the results will obtained vary greatly.…”

mentioning

confidence: 99%

Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0

Puspita

Simanjuntak

Melati

et al. 2020

IJECE

View full text Add to dashboard Cite

Demand robust counterpart-open capacitated vehicle routing problem with time windows and deadline (DRC-OCVRPtw,d) model formed and explained in this paper, is the model used to find the minimum distance and the time needed for vehicles to transport garbage in Sukarami Sub-District, Palembang that consists of the time it takes for the vehicle to pass through the route. Time needed to transport garbage to the vehicle is called time windows. Combination of the thoses times is called deadline. The farther the distance passed by vehicle and the more garbage transported, the longer the deadline is needed. This DRC-OCVRPtw,d model is completed by LINGO 13.0 to obtain the optimal route and time deadline for Sukarami Sub-District. The model shows that the improved model of open vehicle routing problem involving the robustness, time windows and deadline can achieve the optimal routes that enable driver to save operational time in picking up the garbage compared to similar problem not involving no-time windows and deadline stated in previous research.

show abstract

Robust Counterpart Open-Capacitated Vehicle Routing Problem with Time Windows and Deadline (RCOCVRPTWD) Model in Optimization of Waste Transportation in Subdistrict Kalidoni, Palembang Using LINGO 13.0

Puspita

Melati

Simanjuntak

et al. 2021

J. Phys.: Conf. Ser.

View full text Add to dashboard Cite

Robust Counterpart-Open Capacitated Vehicle Routing Problem with time windows and deadline (RC-OCVRPTWD) model which was formed and explained in this paper, is a model used to design solid waste control routes to minimize the distance and time needed for vehicles to complete waste transportation in Kalidoni Sub-District, Palembang. The completion of this route is expected to be able to overcome the occurrence of solid waste accumulation in Kalidoni District, Palembang that involved two characteristics the time that takes for the vehicle to across the route and the time needed to transport waste to the vehicle, which is called time windows. The second combination of time above is deadline. Waste that are transported every day are divided into working areas where the distance of temporary disposal to other disposal in one working area and the volume of waste transported will affect the length of deadline needed. This RC-OCVRPTWD model uses the LINGO 13.0 application to obtain optimal routes and deadlines. The results show that the working route for Kalidoni Sub-District in working area 1 is completed within 28.6 km and a deadline of 2 hours 51 minutes. In working area 2, is with a distance of 23.6 km and a deadline of 1 hour 42 minutes, and in working area 3 is with a distance of 38 km and a deadline of 3 hours 16 minutes.

show abstract

Solving the Capacitated Open Vehicle Routing Problem Algorithm, Based on Probability Distribution Modelling of Saving Matrix

Cited by 3 publications

References 22 publications

Research on collaborative optimisation of urban agricultural product distribution centre location and routing based on improved adaptive large-scale neighbourhood search algorithm

Research on collaborative optimisation of urban agricultural product distribution centre location and routing based on improved adaptive large-scale neighbourhood search algorithm

Demand robust counterpart open capacitated vehicle routing problem time windows and deadline model of garbage transportation with LINGO 13.0

Robust Counterpart Open-Capacitated Vehicle Routing Problem with Time Windows and Deadline (RCOCVRPTWD) Model in Optimization of Waste Transportation in Subdistrict Kalidoni, Palembang Using LINGO 13.0

Contact Info

Product

Resources

About