scispace - formally typeset
Proceedings ArticleDOI

Vehicle Navigation Protocol in Real-Time Fleet Management

Reads0
Chats0
TLDR
The use of parallel computing strategies for solving real-time vehicle routing problems is highlighted, related to linear optimisation and falls under the domain of logistics and transport.
Abstract
In Real-Time Fleet Management, vehicle routes are built dynamically according to travel durations, location of the vehicles and also customer requests which are revealed gradually To account for such situations, algorithms which are fast and can accommodate the uncertainty are needed We here highlights the use of parallel computing strategies for solving real-time vehicle routing problems The vehicle routing problem is related to linear optimisation and falls under the domain of logistics and transport Vehicle routing problems comprise of determining optimal vehicle routes according to various constraints such as the total demand should not exceed the total capacity, service durations are met The objectives of solving the Vehicle Routing Protocol varies depending upon the dynamically of the system In general, systems, which are weakly dynamic, focus on optimising or minimising the routing costs The systems, which are strongly dynamic, focus more on minimising the expected response time

read more

References
More filters
Journal ArticleDOI

Scheduling of Vehicles from a Central Depot to a Number of Delivery Points

TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Journal ArticleDOI

A simple and effective evolutionary algorithm for the vehicle routing problem

TL;DR: A GA without trip delimiters, hybridized with a local search procedure is proposed, which outperforms most published TS heuristics on the 14 classical Christofides instances and becomes the best solution method for the 20 large-scale instances generated by Golden et al.
Journal ArticleDOI

A Green Vehicle Routing Problem

TL;DR: In this paper, a green vehicle routing problem (G-VRP) is formulated and solution techniques are developed to aid organizations with alternative fuel-powered vehicle fleets in overcoming difficulties that exist as a result of limited vehicle driving range in conjunction with limited refueling infrastructure.
Journal ArticleDOI

Vehicle routing problem with time windows and a limited number of vehicles

TL;DR: This paper proposes a tabu search approach characterized by a holding list and a mechanism to force dense packing within a route that allows time windows to be relaxed by introducing the notion of penalty for lateness.
Journal ArticleDOI

City Vehicle Routing Problem (City VRP): A Review

TL;DR: The state of the art of City VRP is identified, the core challenging issues are highlighted, and some potential research area in this field that have remained underexplored are suggested.
Related Papers (5)