نتایج جستجو برای: transportation vehicle routing problem
تعداد نتایج: 1057718 فیلتر نتایج به سال:
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths and the assignment of buses on these routes. The objective of this problem is to minimize the number of vehicles required and to maximize the number of demands transported. This paper considers a Memetic Algorithm fo...
The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. Taking a basic GA to solve the CVRP, we propose a new problem dependent recombi...
The need for integration in supply chain management leads us to consider the coordination of two logistic planning functions: transportation and inventory. The coordination of these activities can be an extremely important source of competitive advantage in supply chain management. The battle for cost reduction can involve finding the equilibrium between transportation and inventory management ...
The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles and the sequencing of stops for each vehicle to minimize transportation costs. This paper presents two different genetic algorithm models (panmitic and cellular models) for providing solutions for the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the ...
In this paper a new multi-chaotic variant of differential evolution is used to solve a model of vehicle routing problem with profits. The main goal was to achieve exceptional reliability (success rate) and low time demands in comparison with deterministic solvers. The method will be applied in the future on solving realworld transportation network problems.
If you believe this document infringes copyright then please contact the KAR admin team with the take-down information provided at http://kar.kent.ac.uk/contact.html Citation for published version Nagy, Gábor and Wassan, Niaz A. and Speranza, M. Grazia and Archetti, Claudia (2015) The Vehicle Routing Problem with Divisible Deliveries and Pickups. Transportation Science . pp. 271-294. ISSN 0041-...
The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Vehicle routing problem has many applications in the fields of transportation, distribution and logistics. In this study, the vehicle routing problem subject to precedence constraints has been modeled as the Travelling Salesman Problem (T...
The Vehicle Routing Problem with Simultaneous Deliveries and Pickups (VRPSDP) has attracted great interest in research due to its potential cost savings to transportation and logistics operators. There exist several extensions of VRPSDP, and among these extensions, Simultaneous Deliveries and Pickups with Split Loads Problem (SDPSLP) is particularly proposed for eliminating the vehicle capacity...
In this paper we define a new problem, the aim of which is to find a set of k dissimilar solutions for a vehicle routing problem (VRP) on a single instance. This problem has several practical applications in the cashin-transit sector and in the transportation of hazardous materials. A min–max mathematical formulation is proposed which requires a maximum similarity threshold between VRP solution...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید