نتایج جستجو برای: heuristic and hybrid algorithms occupational safety vehicle routing problem
تعداد نتایج: 17037607 فیلتر نتایج به سال:
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
increasing of the distribution efficiency is one of the most objectives of an integrated logistic system developed as a new management philosophy in the past few decades. the problem is examind in two parts: facilities location problem (flp) for long policies and vehicle routing problem (vrp) to meet the customer demand. these two components can be solved separately; however, this solution may ...
This paper addresses a rollon–rolloff waste collection vehicle routing problem which involves large containers that collect huge amounts of waste from construction sites and shopping malls. In this problem, vehicles could only move one container at a time between customers’ locations, a depot, a disposal center, and a recycling center site. Other than a disposal center, a recycling ...
wireless sensor networks (wsns) are one of the most interesting consequences of innovations in different areas of technology including wireless and mobile communications, networking, and sensor design. these networks are considered as a class of wireless networks which are constructed by a set of sensors. a large number of applications have been proposed for wsns. besides having numerous applic...
A vehicle routing problem is a significant problem that has attracted great attention from researchers in recent years. The main objectives of the vehicle routing problem are to minimize the traveled distance, total traveling time, number of vehicles and cost function of transportation. Reducing these variables leads to decreasing the total cost and increasing the driver's satisfaction level. O...
The Vehicle Routing Problem can be expressed as the problem of designing optimal collection or delivery routes from one or multiple depots to a number of terrestrially scattered customers or cities, subject to side constraints such as time, capacity, mileage etc. The VRP plays a key role in the fields of logistics and transportation. There exist a number of variants of VRPs. Mostly VRPs with fi...
The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...
The location routing problem (LRP) is a relatively new research direction within location analysis that takes into account vehicle routing aspect. The goal of LRP is to solve a facility location problem and a vehicle routing problem simultaneously. We propose a simulated annealing (SA) based heuristic for solving the LRP. The proposed heuristic is tested on some well-known benchmark instances a...
This research addresses an empirical multi-depot vehicle routing case for a fixed-route trucking carrier. In this case, the characteristics of vehicle routing problems, including multi-depots, dispatching quantity, routes arrangement and time-window constraints, are considered in order to reduce the delivering cost. A hybrid heuristic algorithm is developed in order to solve this practical prob...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید