a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...

in recent years, reducing emissions has become an important issue. besides reducing the economic costs, reducing the fuel consumption decreases emissions, pollutant impact and increases society health as well. green vehicle routing problem are a major key to reduce hazardous effects of transportation such as air pollution, greenhouse gas (ghg) emissions, noise and the like. generally, the amoun...

We investigate the implementation of edge-exchange improvement methods for the vehicle routing problem with time windows with minimization of route duration as the objective. The presence of time windows as well as the chosen objective cause verification of the feasibility and profitability of a single edge-exchange to require an amount of computing time that is linear in the number of vertices...

To realize the vision of intelligent transportation systems with fully automated vehicles, there is a need for highlevel planning for single vehicles as well as fleets of vehicles. This paper addresses the problem of optimally assigning and scheduling a set of spatially distributed tasks to a fleet of vehicles working together to achieve a high-level goal, in domains where tasks may be related ...

Planning Waste Management involves the two major resources collection-vehicles and crews. The overall goal of our on-going project with two waste management companies is an integrative approach for planning the routes and the crews of the vehicles. Here we focus on the route generation as modeled in the first two phases of our three-phase optimization approach. We introduce relevant practical r...

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...

Flexible Manufacturing System (FMS),equipped with several CNC machines and Auto Guided Vehicle (AGV) based material handling systems has been designed and implemented to have the flexibility and efficiency in production process. After the implementation of FMS, various problems came such as the scheduling of the resources, such as frequent variation in the parts, tools, AGV routings, becomes a ...

Branch-and-price algorithms based on Dantzig-Wolfe decomposition have shown great success in solving mixed integer linear optimization problems (MILPs) with specific identifiable structure, such as vehicle routing and crew scheduling problems. For unstructured MILPs, the most frequently used methodology is branch-and-cut, which depends on generation of “generic” classes of valid inequalities to...

A heuristic algorithm is described for vehicle routing and scheduling problems to minimise the total travel time, where the time required for a vehicle to travel along any road in the network varies according to the time of travel. The variation is caused by congestion that is typically greatest during morning and evening rush hours. The algorithm is used to schedule a fleet of delivery vehicle...