نتایج جستجو برای: transportation vehicle routing problem
تعداد نتایج: 1057718 فیلتر نتایج به سال:
Electrified transportation and power systems are mutually coupled networks. In this paper, a novel framework is developed for interdependent power and transportation networks. Our approach constitutes solving an iterative least cost vehicle routing process, which utilizes the communication of electrified vehicles (EVs) with competing charging stations to exchange data, such as electricity price...
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
Contemporary vehicle routing requires ubiquitous computing and massive data in order to deal with the three aspects of transportation such as operations, planning and safety. Out of the three aspects, safety is the most vital and this study refers safety as the reduction of CO2 emissions and hazardous risks. Hence, this paper presents a data driven multi-objective differential evolution (MODE) ...
Vehicular Ad Hoc Network (VANET) is appeared to be a new technology to integrate the susceptibility of vastly employed wireless networks to vehicles. The idea is to attain the ubiquitous connectivity for vehicles either through efficient vehicle-to-vehicle or vehicle-to-infrastructure communication that enables the Intelligent Transportation Systems (ITS). In order to design a suitable and effi...
a hybrid meta-heuristic approach for the capacitated location-routing problem with hard time windows
the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...
this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...
Vehicle routing problems (VRPs) are very popular mainly because of their interesting combinatorial properties and applications to various industries. Informally, the problem is to provide a service to a set of customers using a fleet of vehicles so as to minimize the ‘transportation costs’ without loosing ‘customer satisfaction’. Many variations of the problem have been formulated corresponding...
With the rapid development of modern logistics industry, multi-compartment vehicle routing problem (MCVRP) is one of the research directions of vehicle routing problem, mainly to solve the problem of the transportation of non-mixed products in one vehicle. These products must be stored in separate compartments, and should not exceed the capacity of the carriage. A hybrid fruit fly optimization ...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید