Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

Rego, César

doi:10.1016/s0167-8191(00)00102-2

Cited by 78 publications

(38 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Alternatively, a node can exchange its position with some other node in the same route or in another route. More sophisticated operators extend these types of modifications by combining them to create ejection chains (Glover, 1996;Rego, 2001;Rego and Roucairol, 1996) or consider sequences of many nodes (Osman, 1993;Taillard et al, 1997). Infeasible solutions are typically penalized, to look less attractive when the neighborhood of the current solution is evaluated.…”

Section: Application Examplementioning

confidence: 99%

Metaheuristics in Combinatorial Optimization

2005

View full text Add to dashboard Cite

show abstract

Section: Application Examplementioning

confidence: 99%

Metaheuristics in Combinatorial Optimization

2005

View full text Add to dashboard Cite

show abstract

“…We added the tour length constraint to the algorithm as it was not taken into account in Larsen and Odoni (2007). After building the tours, the node ejection chains algorithm presented by Rego (2001) is used to improve the tours. This algorithm consists of two multi-node exchange and insert processes (Rego, 2001).…”

Section: Procedures 2: Routingmentioning

confidence: 99%

A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

Hamidi¹,

Farahmand²,

Sajjadi³

et al. 2013

10.5267/j.ijiec

View full text Add to dashboard Cite

The purpose of this study is to solve a complex multi-product four-layer capacitated locationrouting problem (LRP) in which two specific constraints are taken into account: 1) plants have limited production capacity, and 2) central depots have limited capacity for storing and transshipping products. The LRP represents a multi-product four-layer distribution network that consists of plants, central depots, regional depots, and customers. A heuristic algorithm is developed to solve the four-layer LRP. The heuristic uses GRASP (Greedy Randomized Adaptive Search Procedure) and two probabilistic tabu search strategies of intensification and diversification to tackle the problem. Results show that the heuristic solves the problem effectively.

show abstract

“…Embedding these simple neighborhoods in an ejection chain framework can notably reduce this effort (Glover 1991). Rego (2001) develops an ejection chain neighborhood for the VRP that implements a multi-node insertion move and a multi-node exchange move to yield an important form of combinatorial leverage. Specifically, the number of moves represented by a level k neighborhood is multiplicatively greater than the number of moves in a level k-1 neighborhood, but the best move from the neighborhoods at each successive level can be determined by repeating only the effort required to determine a best first level move.…”

Section: Node-based Ejection Chains For the Vrpmentioning

confidence: 99%

Ejection chain and filter-and-fan methods in combinatorial optimization

Rego

Glover

2009

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

-The design of effective neighborhood structures is fundamental to the performance of local search and metaheuristic algorithms for combinatorial optimization. Significant efforts have been made in the creation of larger and more powerful neighborhoods that are able to explore the solution space more extensively and effectively while keeping computation complexity within acceptable levels. The most important advances in this domain derive from dynamic and adaptive neighborhood constructions originating in ejection chain methods and a special form of a candidate list design that constitutes the core of the filter-and-fan method. The objective of this paper is to lay out the general framework of the ejection chain and filter-and-fan methods and present applications to a number of important combinatorial optimization problems. The features of the methods that make them effective in these applications is expected to provide insights into solving challenging problems in other settings.

show abstract

Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms

Cited by 78 publications

References 28 publications

Metaheuristics in Combinatorial Optimization

Metaheuristics in Combinatorial Optimization

A heuristic algorithm for a multi-product four-layer capacitated location-routing problem

Ejection chain and filter-and-fan methods in combinatorial optimization

Contact Info

Product

Resources

About