14,127 research outputs found
A Survey On Multi Trip Vehicle Routing Problem
The vehicle routing problem (VRP) and its variants are well known and greatly explored in the transportation literature. The vehicle routing problem can be considered as the scheduling of vehicles (trucks) to a set of customers under various side constraints. In most studies, a fundamental assumption is that a vehicle dispatched for service finishes its duty in that scheduling period after it returns back to the depot. Clearly, in many cases this assumption may not hold. Thus, in the last decade some studies appeared in the literature where this basic assumption is relaxed, and it is allowed for a vehicle to make multiple trips per period. We consider this new variant of the VRP an important one with direct practical impact. In this survey, we define the vehicle routing problem with multiple trips, define the current state-of-the-art, and report existing results from the current literature
Disrupted Capacitated Vehicle Routing Problem with Order Release Delay
With the popularity of the just-in-time system, more and more companies are operating with little or no inventories, which make them highly vulnerable to delays on supply. This paper discusses a situation when the supply of the commodity does not arrive at the depot on time, so that not enough of the commodity is available to be loaded on all vehicles at the start of the delivery period. New routing plans need to be developed in such a case to reduce the impact the delay of supply may have on the distribution company. The resulting vehicle routing problem is different from other types of vehicle routing problems as it involves waiting and multiple trips. Two approaches have been developed to solve the order release delay problem, both of which involve a Tabu Search algorithm. Computational results show the proposed approaches can largely reduce the disruption costs that are caused by the delayed supply and they are especially effective when the length of delay is long
Penerapan Algoritma Sequential Insertion Dalam Pendistribusian BBM di Kawasan TImur Indonesia (Studi Kasus Pada PT. Pertamina UPMS VIII Terminal Transit Wayame-Ambon)
Problems distribution where the transport vehicle departs from depot to get to some destination point by passing through multiple routes and come back to the same depot better known as the Vehicle Routing Problem ( VRP ) . VRP is an NP - hard problem Combinatorial means more size or variable problem, efforts to make computing will also increase exponentially. This is the background of this research by applying algorithms Sequential Insertion resolve the problems of VRP to determine the optimum (minimum of vehicles and duration ) in the distribution of fuel in the eastern region of Indonesia with the characteristics of VRP with heterogeneous fleet of vehicles , VRP with multiple trips , VRP with split deliveries, VRP with multiple products and multiple compartements
A Two-Stage Approach for Routing Multiple Unmanned Aerial Vehicles with Stochastic Fuel Consumption
The past decade has seen a substantial increase in the use of small unmanned
aerial vehicles (UAVs) in both civil and military applications. This article
addresses an important aspect of refueling in the context of routing multiple
small UAVs to complete a surveillance or data collection mission. Specifically,
this article formulates a multiple-UAV routing problem with the refueling
constraint of minimizing the overall fuel consumption for all of the vehicles
as a two-stage stochastic optimization problem with uncertainty associated with
the fuel consumption of each vehicle. The two-stage model allows for the
application of sample average approximation (SAA). Although the SAA solution
asymptotically converges to the optimal solution for the two-stage model, the
SAA run time can be prohibitive for medium- and large-scale test instances.
Hence, we develop a tabu-search-based heuristic that exploits the model
structure while considering the uncertainty in fuel consumption. Extensive
computational experiments corroborate the benefits of the two-stage model
compared to a deterministic model and the effectiveness of the heuristic for
obtaining high-quality solutions.Comment: 18 page
A savings based method for real-life vehicle routing problems
This paper describes a Savings Based algorithm for the Extended Vehicle Routing Problem. This algorithm is compared with a Sequential Insertion algorithm on real-life data. Besides the traditional quality measures such as total distance traveled and total workload, we compare the routing plans of both algorithms according to non-standard quality measures that help to evaluate the "visual attractiveness" of the plan. Computational results show that, in general, the Savings Based algorithm not only performs better with respect to these non-standard quality measures, but also with respect to the traditional measures.distribution;vehicle routing;road transport
Towards a Testbed for Dynamic Vehicle Routing Algorithms
Since modern transport services are becoming more flexible, demand-responsive, and energy/cost efficient, there is a growing demand for large-scale microscopic simulation platforms in order to test sophisticated routing algorithms. Such platforms have to simulate in detail, not only the dynamically changing demand and supply of the relevant service, but also traffic flow and other relevant transport services. This paper presents the DVRP extension to the open-source MATSim simulator. The extension is designed to be highly general and customizable to simulate a wide range of dynamic rich vehicle routing problems. The extension allows plugging in of various algorithms that are responsible for continuous re-optimisation of routes in response to changes in the system. The DVRP extension has been used in many research and commercial projects dealing with simulation of electric and autonomous taxis, demand-responsive transport, personal rapid transport, free-floating car sharing and parking search
A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers
We propose a ridesharing strategy with integrated transit in which a private
on-demand mobility service operator may drop off a passenger directly
door-to-door, commit to dropping them at a transit station or picking up from a
transit station, or to both pickup and drop off at two different stations with
different vehicles. We study the effectiveness of online solution algorithms
for this proposed strategy. Queueing-theoretic vehicle dispatch and idle
vehicle relocation algorithms are customized for the problem. Several
experiments are conducted first with a synthetic instance to design and test
the effectiveness of this integrated solution method, the influence of
different model parameters, and measure the benefit of such cooperation.
Results suggest that rideshare vehicle travel time can drop by 40-60%
consistently while passenger journey times can be reduced by 50-60% when demand
is high. A case study of Long Island commuters to New York City (NYC) suggests
having the proposed operating strategy can substantially cut user journey times
and operating costs by up to 54% and 60% each for a range of 10-30 taxis
initiated per zone. This result shows that there are settings where such
service is highly warranted
Area Speed Flow Relationships: Ring-Radial Aggregation Using SATURN
This paper is one of a series of ITS working papers and technical notes describing the methodology and results of the EPSRC funded project "The definition of capacity in urban road networks : The role of area speed flow relationships". The objectives of the project were to investigate the interaction between vehicle-hours and vehicle-km within a network as the demand for travel increases; to develop improved area speed flow relationships; to use the relationships to explain the process by which networks reach capacity; and to assess the significance for the evaluation of road pricing policies.
The approach used was to collect the vehicle-hours and the vehicle-km directly from a simulation model and thus create relationships between supply and demand in terms of veh-hours/hr and veh-km/hr demanded and also between times per trip and trips demanded.
During the project two models were used. The first was a micro-simulation model called NEMIS. This model was used on hypothetical networks ranging from single link to a six by six grid and finally a ring-radial network. The networks were used to study the effects of changes in OD pattern and the effects of varying capacity on the resulting speed flow measures.
The second model used was SATURN. This model was used to study the same ring-radial as before and a full SATURN model of Cambridge. The SATURN results were then taken one step further in that they were used to create an aggregate model of each network using SATURN in buffer only mode. The related papers discuss issues such as network aggregation. Note that the methodology and terminology was developed as the study progressed and that in particular the method varies between application of the two distinct models.
The reader is directed to the attached appendix A for a full list of publications arising from this project
- …