An adaptive VNS algorithm for vehicle routing problems with intermediate stops

Schneider, Michael; Stenger, A.; Hof, Julian

doi:10.1007/s00291-014-0376-5

Cited by 107 publications

(54 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…While some of the previously described removal operators rely on removing customers without considering the properties of the routes they belong to, we additionally use operators which aim at removing customers from routes with certain characteristics. To this end, we use various route selection policies which are combined with the corresponding removal operators (see for a similar approach).…”

Section: Adaptive Large Neighborhood Search With Path Relinkingmentioning

confidence: 99%

“…To this end, we use various route selection policies which are combined with the corresponding removal operators (see [33] for a similar approach). Besides a purely random selection, we implement the following policies that determine routes according to a roulette wheel selection mechanism based on specific criteria: Cost selects a route with a probability proportional to the cost of the route including penalty costs.…”

Section: Route Selection and Evaluation Of Removal And Insertionmentioning

confidence: 99%

See 1 more Smart Citation

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

Hof

Schneider

2019

Networks

Self Cite

View full text Add to dashboard Cite

We study a class of vehicle‐routing problems with simultaneous pickup and delivery (VRPSPD). In VRPSPDs, each customer may require a certain quantity of goods delivered from the depot and a quantity of goods to be picked up and returned to the depot. Besides the standard VRPSPD, we address (1) the VRPSPD with time limit (VRPSPDTL), which imposes a time limit on the routes of the transportation vehicles, (2) the VRPSPD with time windows (VRPSPDTW), which takes customer time windows into account, (3) the VRP with divisible deliveries and pickups (VRPDDP), which allows for fulfilling the delivery and pickup requests of each customer in two separate visits, (4) the previously unstudied VRP with restricted mixing of divisible deliveries and pickups (VRPRMDDP), which accounts for the difficulty of rearranging the vehicle load by additionally requiring that a certain percentage of the vehicle capacity must remain unoccupied when both types of demand are simultaneously loaded, and (5) the previously unstudied VRPDDP with time windows (VRPDDPTW). We develop a hybrid heuristic solution method which combines an adaptive large neighborhood search algorithm with a path relinking approach, called ALNS‐PR, and we demonstrate the competitiveness of our algorithm on benchmark instances proposed in the literature. Especially on VRPSPDTL, VRPSPDTW, and VRPDDP instances, our ALNS‐PR proves to be superior to the majority of comparison algorithms and is able to obtain numerous new best solutions.

show abstract

Section: Adaptive Large Neighborhood Search With Path Relinkingmentioning

confidence: 99%

Section: Route Selection and Evaluation Of Removal And Insertionmentioning

confidence: 99%

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

Hof

Schneider

2019

Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors develop a hybrid variable neighborhood search-tabu search heuristic and computationally demonstrate its effectiveness. Schneider et al [20] generalize the notion of refueling stops to intermediate stops where vehicles can visit to refuel or reload. The authors solve the emerging problem via an adaptive variable neighborhood search algorithm.…”

Section: Green Vehicle Routingmentioning

confidence: 99%

“…In addition, constraints (17) and (18) assure that the vehicle at the current customer leaves the customer node, and υ other vehicles leave the depot to start their respective tours. Finally, constraint (20) sets υ to the minimum number of vehicles that can suffice to the anticipated traveling within the workday.…”

Section: Assignment Problem and Nearest Neighborsmentioning

confidence: 99%

An iterated beam search algorithm for the green vehicle routing problem

Yavuz

2017

Networks

View full text Add to dashboard Cite

Green, or, alternative-fuel vehicles provide opportunities to improve fleet operators' financial and environmental bottom lines. They also present challenges due to limited driving ranges, limited refueling infrastructure, and lengthy refueling times. This paper addresses a green vehicle routing problem of homogeneous service fleets with stated challenges, and develops an Iterated Beam Search algorithm for its solution. The developed algorithm can employ different lower and upper bounding strategies, and can work as an exact or a heuristics algorithm. A dominance strategy is also developed to improve efficiency of the algorithm. Computational experiments on various-size test instances show that the algorithm's performance is comparable to existing approaches.

show abstract

“…The vehicle routing problem with intermediate stops (VRPIS) was introduced by Schneider et al (2015) where intermediate facilities are visited depending on the fuel and/or the load level of a delivery vehicle. The authors developed an adaptive variable neighborhood search (AVNS) to deal with this problem.…”

Section: Introductionmentioning

confidence: 99%

Variable neighborhood search algorithm for the green vehicle routing problem

Affi¹,

Derbel²,

Jarboui³

2018

10.5267/j.ijiec

View full text Add to dashboard Cite

This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature.

show abstract

An adaptive VNS algorithm for vehicle routing problems with intermediate stops

Cited by 107 publications

References 34 publications

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

An adaptive large neighborhood search with path relinking for a class of vehicle‐routing problems with simultaneous pickup and delivery

An iterated beam search algorithm for the green vehicle routing problem

Variable neighborhood search algorithm for the green vehicle routing problem

Contact Info

Product

Resources

About