Category: <span>Papers</span>

Multiroute fresh produce green routing models with driver fatigue using Type-2 fuzzy logic-based DFWA

In developing countries, 40 percent of fresh fruits and vegetables are generally transported through nonrefrigerated vehicles and perishes before use, and wholesalers lose potential profits due to item rot. Here, a wholesaler’s conveyance with fresh goods starts from a depot …

Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows

In recent years, reducing emissions has been important for mitigating global warming and the effects of traffic congestion. As a variant of the green vehicle routing problem (GVRP), the time-dependent GVRP with time windows (TDGVRPTW) accounts for both time-dependent travel …

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 …

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