An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Penna, Puca Huachi Vaz; Subramanian, Anand; Ochi, Luiz Satoru

doi:10.1007/s10732-011-9186-y

Cited by 208 publications

(118 citation statements)

References 38 publications

Supporting

Mentioning

112

Contrasting

Unclassified

Order By: Relevance

“…Several studies [35][36][37][38][39][40] have examined the heterogeneous VRP (HVRP). In the applications of HVRP, they tried to minimize total cost by dispatching each vehicle type, defined by its capacity, a fixed cost, a distance unit, and availability.…”

Section: Fleet Optimization Modelsmentioning

confidence: 99%

Migrating towards Using Electric Vehicles in Campus-Proposed Methods for Fleet Optimization

Yoon

Cherry

2018

Sustainability

View full text Add to dashboard Cite

Managing a fleet efficiently to address demand within cost constraints is a challenge. Mismatched fleet size and demand can create suboptimal budget allocations and inconvenience users. To address this problem, many studies have been conducted around heterogeneous fleet optimization. That research has not included an examination of different vehicle types with travel distance constraints. This study focuses on optimizing the University of Tennessee (UT) motor pool which has a heterogeneous fleet that includes electric vehicles (EVs) with a travel distance and recharge time constraint. After assessing UT motor pool trip patterns as a case study, a queuing model was used to estimate the maximum number of each vehicle type needed to minimize the expected customer wait time to near zero. The break-even point is used for the optimization model to constrain the minimum number of years that electric vehicles should be operated under the no-subsidy assumption. The results show that the fleet has surplus vehicles. In addition to reducing the number of vehicles, total fleet costs could be minimized by using electric vehicles for all trips less than 100 miles. The models are flexible and can be applied and help fleet managers make decisions about fleet size and EV adoption.

show abstract

Section: Fleet Optimization Modelsmentioning

confidence: 99%

Migrating towards Using Electric Vehicles in Campus-Proposed Methods for Fleet Optimization

Yoon

Cherry

2018

Sustainability

View full text Add to dashboard Cite

show abstract

“…The HVRPs can be divided according to vehicle availability (limited or unlimited) and vehicle costs (fixed or variable) [10]. When the fleet is limited, the number of vehicles and their capacity are known beforehand, and solution routes must consider this availability.…”

Section: Heterogeneous Vrpsmentioning

confidence: 99%

“…The second algorithm uses distance calculation strategies in order to diversify the search in the solution space. More recently, Baldaccci et al [22], Penna et al [10], Martinez and Amaya [23] and Pillac et al [24] compile different studies on the HVRP variants mentioned above. Vidal et al [25] introduce a new local search operator based on the combination of standard VRP moves and swaps between trips, applied to Multi-Attribute VRP, and find many best known solutions.…”

Section: Heterogeneous Vrpsmentioning

confidence: 99%

An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints

Coelho

Grasas

Ramalhinho

et al. 2016

European Journal of Operational Research

View full text Add to dashboard Cite

Distribution planning is crucial for most companies since goods are rarely produced and consumed at the same place. Distribution costs, in addition, can be an important component of the final cost of the goods. In this paper, we study a VRP variant inspired on a real case of a large distribution company. In particular, we consider a VRP with a heterogeneous fleet of vehicles that are allowed to perform multiple trips. The problem also includes docking constraints in which some vehicles are unable to serve some particular customers. Given the combinatorial nature and the size of the problem, which discard the use of efficient exact methods for its resolution, a novel heuristic algorithm is proposed. The proposed algorithm, called GILS-VND, combines Iterated Local Search (ILS), Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) procedures. Our method obtains better solutions than other approaches found in the related literature, and improves the solutions used by the company leading to * Corresponding author * * Principal corresponding author

show abstract

“…The essential idea of ILS is that when the local search is trapped at a local optimum, the ILS perturbs the previously visited local optimum instead of generating a new initial solution, and then restarts the local search from this modified solution (Lourenço et al 2003). Although the ILS has a very simple framework, it has been successfully applied to a wide variety of optimization problems including the graph coloring problem (Chiarandini and Stüt-zle 2002), the job shop scheduling problem (Lourenço 1995) and the vehicle routing problem (Hashimoto et al 2008;Chen et al 2010;Walker et al 2012;Penna et al 2013;Michallet et al 2014). However, no study has been reported on the application of the ILS to the WSRP, which is the aim of this paper.…”

Section: Introductionmentioning

confidence: 99%

Iterated local search for workforce scheduling and routing problems

2017

View full text Add to dashboard Cite

The integration of scheduling workers to perform tasks with the traditional vehicle routing problem gives rise to the workforce scheduling and routing problems (WSRP). In the WSRP, a number of service technicians with different skills, and tasks at different locations with pre-defined time windows and skill requirements are given. It is required to find an assignment and ordering of technicians to tasks, where each task is performed within its time window by a technician with the required skill, for which the total cost of the routing is minimized. This paper describes an iterated local search (ILS) algorithm for the WSRP. The performance of the proposed algorithm is evaluated on benchmark instances against an off-the-shelf optimizer and an existing adaptive large neighbourhood search algorithm. The proposed ILS algorithm is also applied to solve the skill vehicle routing problem, which can be viewed as a special case of the WSRP. The computational results indicate that the proposed algorithm can produce high-quality solutions in short computation times.

show abstract

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem

Cited by 208 publications

References 38 publications

Migrating towards Using Electric Vehicles in Campus-Proposed Methods for Fleet Optimization

Migrating towards Using Electric Vehicles in Campus-Proposed Methods for Fleet Optimization

An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints

Iterated local search for workforce scheduling and routing problems

Contact Info

Product

Resources

About