A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem

Daşdemir, Erdi; Testik, Murat Caner; Öztürk, Diclehan Tezcaner; Şakar, Ceren Tuncer; Güleryüz, Güldal; Testik, Özlem Müge

doi:10.1016/j.omega.2021.102587

Cited by 25 publications

(4 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, no prior studies have examined these real life costs in the literature. For instance; Dasdemir et al [29] considered the minimization of the total travelled distance, Dutta et al [30] studied minimizing the operating costs and minimizing the carbon emission due to fuel consumption by the service vehicles, Hashemi et al [28] considered the minimization of the total transportation costs, Niu et al [36] studied on OVRP to minimize the total cost of fuel emissions cost and the driver wages, etc. Therefore, this study presents a new and precise model for companies that meet real life costs such as standard routing cost, stop by cost, and deviation cost.…”

Section: Discussionmentioning

confidence: 99%

“…Hashemi and et al [28] studied the another variation of open and VRP a combination of the multi-trip with time windows. Dasdemir et al [29] studied a real life OVRP with overbooking, multiple objectives and unknown initial pickup points. Dutta et al [30] proposed a model for OVRP which considers two conflicting realistic objectives: minimizing the operating costs and minimizing the carbon emission due to fuel consumption by the service vehicles.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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: Discussionmentioning

confidence: 99%

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

“…Therefore, the optimal solution can only be obtained when the number of customers is small, and the transportation network is simple. In order to improve the efficiency and quality of the solution, as well as obtain an approximate or satisfactory solution of the problem at a reasonable computational cost, exact algorithms are generally combined with other methods when solving the problem [154][155][156][157].…”

Section: Exact Algorithmsmentioning

confidence: 99%

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

Tang

2023

Sustainability

View full text Add to dashboard Cite

The vehicle routing problem (VRP), as a classic combinatorial optimization problem, has always been a hot research topic in operations research. In order to gain a deeper understanding of the VRP problem, this work uses the knowledge graph to comprehensively analyze and summarize the literature related to VRP from 1959 to 2022 in the Web of Science (WoS) database. Firstly, according to the basic statistical information of the literature, the annual publications, the authors, their institutions and countries, the keyword co-occurrence, and the literature co-citation network are analyzed to comprehensively summarize and generalize the research on VRP and predict its future development trend. The results show that, in the past 60 years, there have been abundant changes in the research on VRP. The United States and China have made the most important contributions in the field of VRP. According to the WoS literature retrieval results and classification methods, the VRP models and their solutions are comprehensively classified, and the model solving algorithms are divided into exact algorithms, heuristic algorithms, metaheuristic algorithms, hyper-heuristic algorithms, machine learning, etc. The results show that the development of information computing technology plays an important role in research on the VRP problem, and dynamic VRP, hyper-heuristic algorithms, deep reinforcement learning, etc. are the future development directions of the VRP model and its optimization. The results of this research can provide help and guidance for beginners and scholars outside the industry to comprehensively understand the development and research hotspots of VRP.

show abstract

“…Babagolzadeh et al 34 handled Australian regional airports with subsidy schemes and developed a mixed integer linear programming model to solve the OVRP. Dasdemir et al 35 also addressed a real‐life OVRP and proposed a multi‐objective mathematical model.…”

Section: Literature Reviewmentioning

confidence: 99%

A variable neighborhood search for Open Vehicle Routing Problem

Ozcetin

Öztürk

2022

Concurrency and Computation

View full text Add to dashboard Cite

In this study, the Open Vehicle Routing Problem, which the companies widely employ in practice using third‐party logistics services, is discussed. This problem is in the class of high‐dimensional and complex optimization problems. A three‐phase Variable Neighborhood Search Algorithm was proposed to solve large‐scale problems efficiently. In this proposed method, eight different neighborhoods are used, four within the route and four between the routes. In addition to this, wise shaking strategies are designed to escape local optimal solutions. The method's performance was tested on literature test instances and comparatively reported its competitiveness.

show abstract

A multi-objective open vehicle routing problem with overbooking: Exact and heuristic solution approaches for an employee transportation problem

Cited by 25 publications

References 37 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

A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research

A variable neighborhood search for Open Vehicle Routing Problem

Contact Info

Product

Resources

About