Search results for "Vehicle"
showing 10 items of 634 documents
The collaborative consistent vehicle routing problem with workload balance
2021
Abstract The rising competition in the logistics sector forces companies to be more economically efficient. One of the major sources of inefficiency is the incomplete usage of available resources, such as vehicles’ capacities. Mechanism that allow to better exploit such resources by enabling carrier collaborations are on the rise. Our study examines a centrally organized multi-period collaborative vehicle routing problem, where carriers can exchange customers who have to be serviced on a regular basis. Collaborations, where carriers serve frequent customers, are supposed to face the problem of (i) time consistency in terms of visiting time, and of (ii) service consistency. The latter ensure…
Branch-and-Cut-and-Price for the Vehicle Routing Problem with Time Windows and Convex Node Costs
2019
Two critical yet frequently conflicting objectives for logistics and transportation service companies are improving customer satisfaction and reducing transportation cost. In particular, given a network of customer requests with preferred service times, it is very challenging to find vehicle routes and service schedules simultaneously that respect all operating constraints and minimize the total transportation and customers’ inconvenience costs. In this paper, we introduce the vehicle routing problem with time windows and convex node costs (VRPTW-CNC), in which we model each customer’s inconvenience cost as a convex function of the service start time at that customer. The VRPTW-CNC combine…
Vehicle scheduling for rental-with-driver services
2021
Abstract In this paper, we introduce a new vehicle scheduling problem (VSP) with driver consistency faced by rental-with-driver companies. A weekly time-horizon is considered and a set of potential customers, each one associated with a list of required tasks, is assumed. The company can choose to accept or reject a customer, but if accepted, all required tasks must be performed by the same driver. A profit is associated with each customer. The goal is to maximize the company’s total profit, by respecting a list of daily and the weekly drivers’ workload limitations imposed by drivers’ contracts. We propose a mathematical formulation of the problem and design an exact solution method based on…
EV-planning: Electric vehicle itinerary planning
2014
International audience; In the latest few years, lot of efforts have been done to pave the way to sustainable mobility, in order to solve pollution problems and fuel shortage. The use of electric vehicles (EV) is considered as one of the best ecologic and economic solution. However, autonomy barriers and limitations slow the progress and the deployment of this technology. In this paper, we propose an advanced electric vehicles' fleet management architecture. This architecture considers the most important factors that can affect the traveling mode of electric vehicles, in order to offer different services to fleet management companies for an efficient monitoring and management of their fleet…
Producing Routing Systems Flexibly Using a VRP Metamodel and a Software Product Line
2012
Routing problems occur in a wide variety of situations. Due to the heterogeneity of cases we do not yet know how to manage the complexity of addressing all the relevant aspects in logistic planning and solving the variety of different problem types in a cost-efficient way. In the last decade, we have witnessed an emergence of systematic approach into managing variation within a set of related software systems. This paper presents an application of these advances from software engineering into vehicle routing: we suggest the construction of a higher-level (meta-) model of routing problems and the application of a software product line approach. The proposed approach results in a flexible pro…
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison
2014
Vehicle route optimization is an important application of combinatorial optimization. Therefore, a variety of methods has been proposed to solve different challenging vehicle routing problems. An important step in adopting these methods to solve real-life problems is to find appropriate parameters for the routing algorithms. In this chapter, we show how this task can be automated using parameter tuning by presenting a set of comparative experiments on seven state-of-the-art tuning methods. We analyze the suitability of these methods in configuring routing algorithms, and give the first critical comparison of automated parameter tuners in vehicle routing. Our experimental results show that t…
A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem
2008
In this chapter we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The quality of the obtained results is comparable to the best results known up to date on a set of instances previously published in the literature.
A New Metaheuristic for the Vehicle Routing Problem with Split Demands
2007
In this paper we present a metaheuristic procedure constructed for the special case of the Vehicle Routing Problem in which the demands of the clients can be split, i.e., any client can be serviced by more than one vehicle. The proposed algorithm, based on the scatter search methodology, produces a feasible solution using the minimum number of vehicles. The results obtained compare with the best results known up to date on a set of instances previously published in the literature.
Efficient Local Search Limitation Strategies for Vehicle Routing Problems
2008
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem 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. The examined strategies are applied to three standard neighborhoods and implemented in a recently suggested powerful memetic algorithm. Experimental results on 26 well-known benchmark problems indicate significant speedups of almost 80% without worsening the solution quality. On the contrary, in 12 cases new best solutions were obtained.
Data-based modeling of vehicle collision by LPV-ARMAX model approach
2013
Vehicle crash are considered to be events with high complexity from the mathematical points of view. The high experiment cost and huge time-consumption make the establishment of a mathematical model of vehicle crash which can simplify the analysis process in great demand. In this work, we present the application of LPV-ARMAX model to simulate the car-to-pole collision with different initial impact velocities. The parameters of the LPV-ARMAX are assumed to be functions of the initial impact velocities. Instead of establishing a set of LTI models for vehicle crashes with various impact velocities, the LPV-ARMAX model is comparatively simple and applicable to predict the responses of new colli…