Vehicle routing problem (VRP) is a highly investigated discrete optimization problem. The first paper was published in 1959, and later, many vehicle routing problem variants appeared to simulate real logistical systems. Since vehicle routing problem...
This paper presents a hybrid grasshopper optimization algorithm using a novel decoder and local search to solve instances of the open vehicle routing problem with capacity and distance constraints. The algorithm’s decoder first defines the number of...
This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists of altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicle...
The vehicle-routing problem (VRP) is a popular area of research. This popularity springs from its wide application in many real-world problems, such as logistics, network routing, E-commerce, and various other fields. The VRP is simple to formulate,...
The dynamic vehicle routing problem (DVRP) is a variant of the Vehicle Routing Problem (VRP) in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a mo...
The main purpose of the work was examining various methods of decomposition of a network optimization problem of simultaneous routing and bandwidth allocation based on Lagrangian relaxation. The problem studied is an NP-hard mixed-integer nonlinear o...
The novel coronavirus pandemic is a major global public health emergency, and has presented new challenges and requirements for the timely response and operational stability of emergency logistics that were required to address the major public health...
The capacitated vehicle routing problem (CVRP) is a representative NP-hard combinatorial optimization problem with broad applications in logistics and transportation. This paper proposes a hybrid metaheuristic, termed SPSOM-CVRP, which integrates an...
Optimizing the siting and servicing of urban facilities is a core operations research problem that must reconcile heterogeneous demand, spatial constraints, and network-realistic travel. We present GD-ARISE, a GIS-integrated and data analytics pipeli...
The path planning problem is an important issue in maritime search and rescue. This paper models the path planning problem as a dynamic vehicle routing problem. It first designs a dynamic generator that transforms the existing benchmark sets for the...
This study uses bibliometric analysis to examine the scientific evolution of particle swarm optimization (PSO) for the vehicle routing problem (VRP) over the past 20 years. Analyses were conducted to discover and characterize emerging trends in the r...
Presented in this research paper is an attempt to apply a cat swarm optimization (CSO)-based algorithm to the urban transit routing problem (UTRP). Using the proposed algorithm, we can attain feasible and efficient (near) optimal route sets for publi...
Transportation planning has been established as a key topic in the literature and practices of social production, especially in urban contexts. To consider traffic environment factors, more and more researchers are taking time-varying factors into ac...
This paper focuses on the dynamic workforce scheduling and routing problem for the maintenance work of harvesters in a sugarcane harvesting operation. Technician teams categorized as mechanical, hydraulic, and electrical teams are assumed to have dif...
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding met...
The Cell Formation Problem plays a fundamental role in cellular manufacturing due to its impact on efficiency, flexibility, and reliability. Its complexity increases under real-world conditions involving alternative process routes and machine reliabi...
In the realm of supply chain logistics, the Multi-Depot Multi-Supplier Vehicle Routing Problem (MDMSVRP) poses a significant challenge in optimizing the transportation process to minimize costs and enhance operational efficiency. This problem involve...
Generally, transportation costs account for approximately half of the total operation expenses of a logistics firm. Therefore, any effort to optimize the planning of vehicle routing would be substantially beneficial to the company. This study focuses...
Many real-life applications of the vehicle routing problem (VRP) occur in scenarios subject to uncertainty or dynamic conditions. Thus, for instance, traveling times or customers’ demands might be better modeled as random variables than as dete...
With the rapid development of the sharing economy, the distribution in third-party logistics (3PL) can be modeled as a variant of the open vehicle routing problem (OVRP). However, very few papers have studied 3PL with loading constraints. In this wor...
With the increasing demand for hazardous materials (hazmat) from enterprises, port chemical industrial parks face growing risks in hazardous material transportation. By using internal road network information of parks, this study investigates the haz...
Background: The logistics network design with cross-docking operations enables shipping service providers to integrate the physical flow of products between vendors and dealers in logistics management. The collective goal is to synchronize the goods...
Over recent years, location-routing problems have become popular, since they tackle multiple major decisions in supply chains. With the focus now on sustainable supply chains, the problem has become sought-after, with the emphasis on complying with g...
The classical capacitated vehicle routing problem (CVRP) is a very popular combinatorial optimization problem in the field of logistics and supply chain management. Although CVRP has drawn interests of many researchers, no standard way has been estab...
This paper proposes a collaborative optimization method that combines the multi-objective grey wolf optimizer (MOGWO) and the dual-thread ant colony optimization (DTACO) algorithm to solve the vehicle routing problem with time windows (VRPTW). The ai...
In the context of urban distribution, given the complexity of express delivery and the variability of distribution conditions, vehicle routing problems with time-dependent characteristics have received increasing attention. This study incorporates a...
Customers’ habits, as far as shipping requests are concerned, have changed in the last decade, due to the fast spread of e-commerce and business to consumer (B2C) systems, thus generating more and more vehicles on the road, traffic congestion a...
This paper studies a vehicle routing problem with simultaneous pickup and delivery (VRPSPD), which has an important application in logistics and other areas. The problem is that the depot provides both forward supply service and reverse recovery serv...
This paper proposes a Q-learning-driven butterfly optimization algorithm (QLBOA) by integrating the Q-learning mechanism of reinforcement learning into the butterfly optimization algorithm (BOA). In order to improve the overall optimization ability o...
The satisfaction of requirements and preferences of shippers is critical to enable the practicability of solutions that are derived from intermodal transportation routing problems. This study aims to propose a decision process to help shippers partic...
Compared to fossil fuel-based internal combustion vehicles, electric vehicles with lower local pollution and noise are becoming more and more popular in urban logistic distribution. When electric vehicles are involved, high-quality delivery depends o...
The Cell Formation Problem (CFP) involves the clustering of machines to enhance productivity and capitalize on various benefits. This study addresses a variant of the problem where alternative routes and machine reliability are included, which we cal...
In humanitarian aid scenarios, the model of cumulative capacitated vehicle routing problem can be used in vehicle scheduling, aiming at delivering materials to recipients as quickly as possible, thus minimizing their wait time. Traditional approaches...
The bamboo forest growth optimization (BFGO) algorithm combines the characteristics of the bamboo forest growth process with the optimization course of the algorithm. The algorithm performs well in dealing with optimization problems, but its exploita...
This study presents a bi-objective optimization model for the Green Vehicle-Routing Problem in cold chain logistics, with a focus on symmetric distance matrices, aiming to minimize total costs, including carbon emissions, while maximizing customer sa...
This systematic literature review (SLR) synthesizes current research on integrating machine learning (ML) into robust optimization (RO) frameworks for solving Green Vehicle Routing Problems (Green-VRP) under uncertainty. The key contributions include...
The vehicle routing problem with time windows (VRPTW) remains a formidable challenge, due to the intricate constraints of vehicle capacity and time windows. As a result, an algorithm tailored for this problem must demonstrate robust search capabiliti...
In the context of sustainable logistics planning, carbon emission costs have become a critical factor influencing distribution decisions. Meanwhile, the time-dependent characteristics of urban road networks and simultaneous pickup–delivery oper...
This study explored the optimization of groupage intercity delivery using a two-stage genetic algorithm (GA) framework, developed with the BaumEvA Python library. The primary objective was to minimize the transportation costs by strategically positio...
The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem, which requires the identification of such route plans on a given graph to a number of vehicles that generates the least total cost. The Dynamic CARP (DCARP) is a vari...
This paper proposes an electric vehicle routing problem, considers the states of charging stations and suggests solution strategies. The charging of electric vehicles is a main issue in the field of electric vehicle routing. There are many studies th...
In many states in the United States, school bus fleets are assigned to serve students sequentially at three levels—high school, middle school, and elementary school; however, in past studies, each of these stages in the problem was considered s...
Vehicle routing improvement has become a vital topic in modern transport digitalization projects. Presently, there are no fully adapted techniques to offer optimal solutions for finding the best routes that include all visiting locations, considering...
This study specifies an agricultural field (Latitude = 56°30′0.8″ N, Longitude = 9°35′27.88″ E) and provides the absolute optimal route for covering that field. The calculated absolute optimal solution for this field c...
Since the actual factors in the instant distribution service scenario are not considered enough in the existing distribution route optimization, a route optimization model of the instant distribution system based on customer time satisfaction is prop...
The vehicle routing problem (VRP) is a common problem in logistics and transportation with high application value. In the past, many methods have been proposed to solve the vehicle routing problem and achieved good results, but with the development o...
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which passes through all cities and returns to the starting point, given the distance between cities. The Vehicle Routing Problem (VRP) is the issue of defining...
This study tackles the complex challenge of dynamic multi-objective vehicle routing optimization in large-scale equipment manufacturing, where routing operations significantly impact both economic performance and environmental sustainability. We deve...
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implem...
Nowadays, the depopulation of Europe’s rural areas and the ageing of the population in these areas has led to the disappearance of basic services such as supermarkets, fishmongers, household goods, etc. In response to this problem, there are Eu...
of 37