相关论文: Large neighborhoods with implicit customer selecti…

Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods are impractical. In particular, local search-based metaheuristics have been successfully applied…

Vehicle Routing Problem is a well-known problem in logistics and transportation, and the variety of such problems is explained by the fact that it occurs in many real-life situations. It is an NP-hard combinatorial optimization problem and…

Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for problems with individual services, their counterparts for…

The goal of this paper is to investigate a decision support system for vehicle routing, where the routing engine learns from the subjective decisions that human planners have made in the past, rather than optimizing a distance-based…

The growing aging population has significantly increased demand for efficient home health care (HHC) services. This study introduces a Vehicle Routing and Appointment Scheduling Problem (VRASP) to simultaneously optimize caregiver routes…

The capacitated vehicle routing problem (CVRP) involves distributing (identical) items from a depot to a set of demand locations, using a single capacitated vehicle. We study a generalization of this problem to the setting of multiple…

Ride-sharing is an essential aspect of modern urban mobility. In this paper, we consider a classical problem in ride-sharing - the Multi-Vehicle Dial-a-Ride Problem (Multi-Vehicle DaRP). Given a fleet of vehicles with a fixed capacity…

The Virtual Network Embedding Problem (VNEP) captures the essence of many resource allocation problems of today's infrastructure providers, which offer their physical computation and networking resources to customers. Customers request…

The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one or more time windows where it must be visited, and the agents…

We study the load balanced capacitated vehicle routing problem (LBCVRP): the problem is to design a collection of tours for a fixed fleet of vehicles with capacity Q to distribute a supply from a single depot between a number of predefined…

In this research, we propose an iterative learning hybrid optimization solver developed to strengthen the performance of metaheuristic algorithms in solving the Capacitated Vehicle Routing Problem (CVRP). The iterative hybrid mechanism…

When vehicle routing decisions are intertwined with higher-level decisions, the resulting optimization problems pose significant challenges for computation. Examples are the multi-depot vehicle routing problem (MDVRP), where customers are…

This paper introduces an extension to the Orienteering Problem (OP), called Clustered Orienteering Problem with Subgroups (COPS). In this variant, nodes are arranged into subgroups, and the subgroups are organized into clusters. A reward is…

The Team Orienteering Problem (TOP) is an NP-hard routing problem in which a fleet of identical vehicles aims at collecting rewards (prizes) available at given locations, while satisfying restrictions on the travel times. In TOP, each…

We consider the neighborhood tree induced by alternating the use of different neighborhood structures within a local search descent. We investigate the issue of designing a search strategy operating at the neighborhood tree level by…

The rapid growth of pharmaceutical refrigerated logistics poses sustainability challenges, including elevated costs, energy consumption, and resource inefficiency. Collaborating multiple depots can enhance logistics efficiency when…

The vehicle routing problem with drones (VRP-D) is to determine the optimal routes of trucks and drones such that the total operational cost is minimized in a scenario where the trucks work in tandem with the drones to deliver parcels to…

Unmanned ground vehicles (UGVs) are being used extensively in civilian and military applications for applications such as underground mining, nuclear plant operations, planetary exploration, intelligence, surveillance and reconnaissance…

In this research, a new variant of the vehicle routing problem with time windows is addressed. The nodes associated with the customers are related to each other through AND/OR precedence constraints. The objective is minimizing the total…

Logistics and transport are core of many industrial and business processes. One of the most promising segments in the field is optimisation of vehicle routes. Scientific effort is focused primarily on algorithms developed in simplified…