Category: <span>Papers</span>

Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows

Motivated by rising concerns regarding global warming and traffic congestion effects, we study the time-dependent green vehicle routing problem with time windows (TDGVRPTW), aiming to minimize carbon emissions. The TDGVRPTW is a variant of the time-dependent vehicle routing problem (TDVRP) …

A time-dependent green location-routing problem with variable speed of vehicles

Recently Green Location-Routing Problem (GLRP) has been considered by many researchers. The GLRP includes location for depots and routing the vehicles simultaneously by considering environmental aspects. In this work an extension of GLRP in the presence of traffic congestion and …

Dynamic discretization discovery for solving the Continuous Time Inventory Routing Problem with Out-and-Back Routes

In time dependent models, the objective is to find the optimal times (continuous) at which activities occur and resources are utilized. These models arise whenever a schedule of activities needs to be constructed. A common approach consists of discretizing the …

Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem

This paper is motivated by a non-emergency ambulance transportation service provider that picks up and drops off patients while considering both the time window for medical appointments and the maximum ride-time constraint for each patient. Varying travel times based on …

A Chaotic Genetic Algorithm with Variable Neighborhood Search for Solving Time-Dependent Green VRPTW with Fuzzy Demand

Aiming at the time-dependent green vehicle routing problem with fuzzy demand, this paper comprehensively considers the dispatch costs, time window penalty costs, fuel costs, and the effects of vehicle travel speed, road gradient, and vehicle load on fuel consumption, a …

x
This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close