The purpose of this research is to present a new mathematical modeling for a vehicle routing problem considering concurrently the criteria such as distance, weight, traffic considerations, time window limitation, and heterogeneous vehicles in the reverse logistics network for collection of expired products. In addition, we aim to present an efficient solution approach according to differential ...

The CapTA model is developed to capture the capacity phenomena in passenger traffic assignment to a transit network. These pertain to the interaction of passenger traffic and vehicle traffic: vehicle seat capacity drives the internal comfort, vehicle total capacity determines internal comfort and also platform waiting, passenger flows at vehicle egress and access interplay with dwell time, dwel...

The Vehicle Routing Problem (VRP) is an important management problem in the field of physical distribution and logistics. Good vehicle routing can not only increase the profit of logistics but also make logistics management more scientific. The Capacitated Vehicle Routing Problem (CVRP) constrained by the capacity of a vehicle is the extension of VRP. Our research applies a two-phase algorithm ...

In this paper we consider a vehicle routing problem where a fleet of homogeneous vehicles must serve a set of customers, the demand of which can take any integer number possibly greater than the vehicle capacity. Each time a vehicle visits a customer it collects an integer quantity. The objective is to minimize the total distance travelled by the vehicles to serve all the customers. This proble...

We consider the Split Delivery Vehicle Routing Problem (SDVRP) where a fleet of homogeneous vehicles has to serve a set of customers. Each customer can be visited more than once, contrary to what is usually assumed in the classical Vehicle Routing Problem (VRP) and the demand of each customer can be greater than the capacity of the vehicles. No constraint on the number of available vehicles is ...

This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...

This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem. This problem is characterized by a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic, and a simulat...

This article proposes a quantitative approach in considering the effect of inter-vehicle communication with respect to safety and congestion improvement. For enhancing safety by reducing delay time for safe braking for individual vehicles, long distance inter-vehicle communication (LDIVC) is proposed. An equation is developed for calculating delay time from a micro view. For alleviating congest...