In this paper, we consider the step fixed-charge transportation problem where is one of the
most important problems in transportation research area. To tackle such an NP-hard …

The time-dependent vehicle routing problem with time windows (TDVRPTW) is examined in
this study. A mathematical model for the TDVRPTW is formulated by considering the time …

In this research, an improved bio-inspired metaheuristic named firefly is utilized to solve the
Multi-Depot Vehicle Routing Problem with Time Windows (MDVRP-TW) and it is a …

The vehicle routing problem (VRP)[2][5] is a logistical and distribution problem. It consists to
schedule, at best, the path of a group of vehicles assuring the service of customers from a …

On-time and foolproof demand satisfaction has gained attention in today's transportation and
logistics industries due to their direct impact on business success. However, the uncertainty …

Solving the multi-objective vehicle routing problem with stochastic demand (MO-VRPSD) is
challenging due to its non-deterministic property and conflicting objectives. Most multi …

Fixed charge transportation problem (FCTP) is a primary and important problem which
attracts researchers in the last decade. Recently, solution approaches typically …

The Vehicle Routing Problem with Time Windows (VRPTW) has drawn considerable
attention in the last decades. The objective of VRPTW is to find the optimal set of routes for a …

One of the most often researched optimization issues is the vehicle routing problem. It is
categorized as an NP-hard problem with high time complexity. In this study, a novel hybrid …

A route-directed hybrid genetic approach to address the Vehicle Routing Problem with Time
Windows is presented. The proposed scheme relies on the concept of simultaneous …