Most of the studies on vehicle routing problem with time windows (VRPTW) aim to minimize total travel distance or travel time. This paper presents the VRPTW with a new objective function of minimizing the total fuel consumption. A mathematical model is proposed to formulate this problem. Then, a novel tabu search algorithm with a random variable neighborhood descent procedure (RVND) is given, w...

In this paper, we formulate the vehicle routing problem with time windows and temporal dependencies. The problem is an extension of the well studied vehicle routing problem with time windows. In addition to the usual constraints, a scheduled time of one visit may restrain the scheduling options of other visits. Special cases of temporal dependencies are synchronization and precedence constraint...

This paper documents our investigation into various heuristic methods to solve the vehicle routing problem with time windows (VRPTW) to near optimal solutions. The objective of the VRPTW is to serve a number of customers within prede®ned time windows at minimum cost (in terms of distance travelled), without violating the capacity and total trip time constraints for each vehicle. Combinatorial o...

The vehicle routing problem with time windows (VRPTW) is the problem of minimizing the total travel distance of a number of vehicles, under capacity and time window constraints, where every customer must be visited exactly once by a vehicle. We consider two generalizations of the VRPTW and propose local search algorithms. The first one treats traveling times as variables and introduce cost func...

In this paper we propose a heuristic algorithm to solve the Vehicle Routing Problem with Time Windows. Its framework is a smart combination of three simple procedures: the classical k-opt exchanges improve the solution, an ad hoc procedure reduces the number of vehicles and a second objective function drives the search out of local optima. No parameter tuning is required and no random choice is...

The paper considers multi agent approach and respective multi-agent system for resource allocation and scheduling within shipping logistics problem. A well known benchmark that is Vehicle Routing Problem with Time Windows is considered as a case study. The paper proposes an approach to the shipping logistics problem solving that includes auction-based resource allocation and scheduling, distrib...

Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others, are integrated and stored into the spatial temporal database systems. Various location-based services by using mobile phone are also becoming popular. In this paper, we focus on one of GIS-based scheduling applications concerning the availability of GPS technologie...

Deriving the optimal cash deployment strategy for a network of ATMs involves the analysis of logistics costs, inventory policies as well as of the routing of replenishment vehicles. The optimal cash deployment strategy focuses on the reduction of cash-related expenses provided that ATMs do not run out of cash. In the paper, this rich vehicle routing problem is solved using genetic algorithm. Th...