Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method

Ruiz, Efrain; García-Calvillo, Irma D.; Nucamendi-Guillén, Samuel

doi:10.1007/s12351-020-00580-8

Cited by 10 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hosseinabadi et al [33] proposed a new meta-heuristic algorithm for OVRP. Ruiz et al [34] proposed two mixed-integer formulations for the OVRP with split deliveries. They also used a cutting-plane method to improve the optimization performance.…”

Section: Introductionmentioning

confidence: 99%

Modeling open vehicle routing problem with real life costs and solving via hybrid civilized genetic algorithm

TONBUL

2024

Sigma J Eng Nat Sci - Sigma Müh Fen Bil Derg

View full text Add to dashboard Cite

Many companies prefer to use third party logistics firms to deliver their goods and as such planning the return of the vehicles to the depot is not required. This is called open vehicle routing problem (OVRP). In literature, the OVRP is handled with minimum distance as objective function like vehicle routing problem. But in the real world, the objective function achieves minimum many costs like standard routing cost, stopping by cost and the deviation cost. The standard routes are previously defined under free market conditions by third party logistic firms. The deviation from the standard route is required to arrive cities which are not on the standard route. The stop by cost occurs on the delivery points. In this paper mentioned three costs are considered in the objective function while many papers consider only distance related costs in the literature. This paper proposes a new mathematical model for the OVRP. In the constraints, the last points of the routes are researched in detail. The standard route costs are determined by considering the last point of the route. Because of the NP-hard structure of the OVRP, the proposed mathematical model is solved with a hybrid metaheuristic called Civilized Genetic Algorithm (CGA). CGA is developed by hybridizing a modified genetic algorithm and a local search algorithm. The application of this study is implemented for the delivery routing of a combi boiler producer in Turkey. The third party logistic firms may use this proposed model and the solution approach for the real life applications.

show abstract

Section: Introductionmentioning

confidence: 99%

Modeling open vehicle routing problem with real life costs and solving via hybrid civilized genetic algorithm

TONBUL

2024

Sigma J Eng Nat Sci - Sigma Müh Fen Bil Derg

View full text Add to dashboard Cite

show abstract

“…Related research results in recent years are as follows: Yin and Zhang [28] constructed three hybrid bat algorithms to solve multiobjective vehicle path problems with hard time windows; Wu et al [29] improved the ant colony algorithm based on brainstorming to improve the solution of vehicle path problems with soft time windows; the literature [30][31][32] conducted in-depth studies on open vehicle path problems under diferent conditions. Brandao [33] and Ruiz et al [34] considered the case of multiple warehouses and demand detachability, respectively; on this basis, the iterative local search algorithm for jet chains proposed by Brandao [35] and the variable neighborhood search algorithm designed by Chen et al [36] both improved the quality of OVRPTW solutions.…”

Section: Introductionmentioning

confidence: 99%

Research on the Distribution of Emergency Supplies during the COVID-19 Epidemic

2023

View full text Add to dashboard Cite

The COVID-19 virus spreads quickly and is highly contagious, and the timeliness of emergency supplies is extremely demanding, so adequate and efficient emergency supplies have become a necessary prerequisite for strict prevention and control during the outbreak. However, the available research results are still relatively few, and using the brain storm optimization algorithm to solve the emergency supplies distribution problem is still blank. In order to optimize the emergency supplies distribution system in the context of COVID-19, this paper studies the open vehicle routing problem by considering the load weight constraints, demand constraints, and time window constraints. With the shortest total distribution distance as the objective function, a mathematical model of mixed integer linear programming is established, and the crossover operation of the genetic algorithm, the destruction operator and the repair operator of the large neighborhood search algorithm are introduced in the brain storm optimization algorithm to enhance the diversity of the solution while making the solution toward the optimal direction. Through the verification of two sets of examples, we found that compared with the other 13 solution algorithms, the solution capability and solution efficiency of the brain storm optimization algorithm are better than the comparison algorithms, which can significantly reduce the length of the distribution route and lower the distribution cost, and has excellent convergence and stability. Meanwhile, it can effectively improve the distribution efficiency of emergency supplies, which is of great significance to help the emergency reception and regular prevention and control during the outbreak of the COVID-19 epidemic. In addition, it has the necessary guidance for the improvement of personnel efficiency in the supply chain and logistics industry.

show abstract

Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches

Heidari

Imani

Khalilzadeh

et al. 2022

Environ Dev Sustain

View full text Add to dashboard Cite

Nowadays organizations outsource transportation of goods or services to reduce cost which leads to a particular type of problem called open location-routing. Also, each logistic organization possesses a limited number of specific vehicles that may not be enough in certain circumstances. This issue indicates the importance of simultaneously considering both open and closed routs. On the other hand, the growing concerns about the detrimental environmental impacts of human activities reveal the necessity of paying attention to environmental issues in logistics. In this study, a bi-objective mathematical programming model is proposed for two-echelon close and open location-routing problem (2E-COLRP) including two echelons of factories, depots and customers to minimize costs and CO 2 emissions. The proposed model finds the optimal routs, optimal number of vehicles and facilities as well as the locations of facilities. The augmented epsilon constraint method is used as an exact method to solve the small-sized problems. Due to complexity of model, two metaheuristic algorithms named MOGWO and NSGA-II are utilized to tackle the problems. The efficiency of two aforementioned algorithms is evaluated in terms of several indices considering 22 problem instances with various sizes. The results show that MOGWO performs better than NSGA-II.

show abstract

Open vehicle routing problem with split deliveries: mathematical formulations and a cutting-plane method

Cited by 10 publications

References 13 publications

Modeling open vehicle routing problem with real life costs and solving via hybrid civilized genetic algorithm

Modeling open vehicle routing problem with real life costs and solving via hybrid civilized genetic algorithm

Research on the Distribution of Emergency Supplies during the COVID-19 Epidemic

Green two-echelon closed and open location-routing problem: application of NSGA-II and MOGWO metaheuristic approaches

Contact Info

Product

Resources

About