This paper proposes an approach which is based on a multi objective genetic algorithm to resolve the vehicles routing problem with time windows (VRPTW). The context of this problem is to plan a set of routes to serve heterogeneous demands respecting several constraints (only one depot, vehicles limited capacity, windows of time). We used an approach based on a multi-objective optimization to re...

This article describes a tabu search heuristic for the dial-a-ride problem with the following characteristics. Users specify transportation requests between origins and destinations. They may provide a time window on their desired departure or arrival time. Transportation is supplied by a fleet of vehicles based at a common depot. The aim is to design a set of least cost vehicle routes capable ...

Transportation has an important role in the logistics of a company, both services and products. Increased orders 2020 for wooden speaker products at CV. XYZ (Wonoayu-Sidoarjo) makes this company try to minimize transportation costs their operational level. This study focuses on determining relationship between changes type fleet vehicle depot location product delivery time return terms adding t...

The development of computerized systems in the financial industry facilitated the growth of the stock exchange market for institutional and private investors. Paperless settlement systems for stocks and bonds were first introduced in the Nordic region. The successful introduction of the new infrastructure for the securities markets was the result of solid cooperation between market participants...

The generalized vehicle routing problem with time windows (GVRPTW) is defined on a directed graph G=(V,A) where the vertex set V partitioned into clusters. One cluster contains only depot, located homogeneous fleet of vehicles, each limited capacity. other clusters represent customers. A demand associated cluster. Inside cluster, vertices possible locations customer. window vertex, during which...

Abstract This paper introduces the multi-depot open location routing problem (MD-OLRP) with a heterogeneous fixed fleet. The is inspired by collection of company which collects raw materials from different suppliers coordinating several carriers. Each carrier has Moreover, there cost for contracting each vehicle and variable associated distance traveled. empty haul return to vehicles depot not ...

This paper studies the distribution of emergency relief for electric vehicles (EVs), which considers energy saving, multi-depot, and vehicle routing problems with time windows, named saving-oriented multi-depot problem windows (ESMDVRPTW). Our aim is to find routes EVs such that all shelter demands are fulfilled during their total cost traveled by fleet minimized. To this end, we formulate ESMD...

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

In this paper, we propose a solution for optimizing the routes of Mobile Medical Units (MMUs) in domain vehicle routing and scheduling. The generic objective is to optimize distance traveled by MMUs as well associated cost. These are located at central depot. idea provide improved healthcare rural people India. obtained two stages: preparing mathematical model with most suitable parameters, the...

Due to the recent worries about environment, transportation companies are incentivized use Alternative Fuel Vehicles (AFVs) instead of conventional ones. However, due limited AFV driving range and since Stations (AFSs) usually not widespread on territory, routes AFVs have be properly planned in order prevent them from remaining without sufficient fuel reach depot or closest station. The Green V...