A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

López-Sánchez, Ana Dolores; Hernández-Díaz, Alfredo G.; Vigo, Daniele; Caballero, Rafael; Molina, Julián

doi:10.1016/j.ejor.2014.04.008

Cited by 46 publications

(33 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…(), Reiter and Gutjahr (), and López‐Sánchez et al. (), among others. Route balancing could also be introduced by minimizing the difference between the length of the longest and shortest routes, see Jozefowiez et al.…”

Section: Introductionmentioning

confidence: 94%

See 1 more Smart Citation

A multiobjective GRASP–VND algorithm to solve the waste collection problem

López-Sánchez

Hernández-Díaz

Gortázar

et al. 2017

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, the waste collection problem (WCP) of a city in the south of Spain is addressed as a multiobjective routing problem that considers three objectives. From the company's perspective, the minimization of the travel cost is desired as well as that of the total number of vehicles. Additionally, from the employee's point of view, a set of balanced routes is also sought. Four variants of a multiobjective hybrid algorithm are proposed. Specifically, a GRASP (greedy randomized adaptive search procedure) with a VND (variable neighborhood descent) is combined. The best GRASP–VND algorithm found is applied in order to solve the real‐world WCP of a city in the south of Spain.

show abstract

Section: Introductionmentioning

confidence: 94%

“…To the best of our knowledge, López‐Sánchez et al. () were the first authors to design specific neighborhoods for this objective. …”

Section: A Multiobjective Hybrid Algorithm: Grasp–vndmentioning

confidence: 99%

A multiobjective GRASP–VND algorithm to solve the waste collection problem

López-Sánchez

Hernández-Díaz

Gortázar

et al. 2017

Int Trans Operational Res

View full text Add to dashboard Cite

show abstract

“…Also in the application considered by López‐Sánchez et al. (), the duration of the longest route was used as the measure of quality of a solution. They named this variant as balanced open vehicle routing problem since minimizing the maximum route duration can also be viewed as a measure of route balancing.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we consider the same type of problem as that considered by López‐Sánchez et al. (), and from now on we will name it the MinMax‐COVRP .…”

Section: Introductionmentioning

confidence: 99%

A matheuristic for the MinMax capacitated open vehicle routing problem

Lysgaard

López-Sánchez

Hernández-Díaz

2018

Int Trans Operational Res

View full text Add to dashboard Cite

In this paper, the MinMax‐COVRP (where COVRP is capacitated open vehicle routing problem) is considered as a variation of the COVRP where the objective is to minimize the duration of the longest route. For the purpose of producing high‐quality solutions, elements from the fields of mathematical programming and metaheuristics are combined, resulting in a matheuristic for solving the MinMax‐COVRP. The matheuristic benefits from the diversification produced by a metaheuristic and the intensification from mixed‐integer linear programming (MILP). The initial solution provided by a multistart heuristic is used to seed and accelerate the MILP in which a local branching framework and the separation of k‐path inequalities are suitably combined. Computational experience shows promising results not only improving the initial solution provided by the multistart algorithm, but also ensuring optimality for most of the small‐ and medium‐sized instances.

show abstract

“…In the literature, vehicle routing problems can be structured differently according to various constraints, such as capacitated VRP [120][121][122][123][124][125][126], the VRP with heterogeneous fleet of vehicles [127], open VRP [128][129][130][131], VRP with time windows [132][133][134][135][136][137][138], VPR with both pick-up and delivery [139][140][141][142][143][144], location routing problem [145][146][147], period VRP [148][149][150][151], multidepot VRP [152][153][154][155][156], VRP with backhaul [157][158][159], inventory routing problem [160][161][162][163], dynamic VRP [164], or the mixture [165][166]…”

Section: Vrpmentioning

confidence: 99%

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Fei

Shen

2017

Scientific Programming

View full text Add to dashboard Cite

Over the past decades, optimization in operations management has grown ever more popular not only in the academic literature but also in practice. However, the problems have varied a lot, and few literature reviews have provided an overview of the models and algorithms that are applied to the optimization in operations management. In this paper, we first classify crucial optimization areas of operations management from the process point of view and then analyze the current status and trends of the studies in those areas. The purpose of this study is to give an overview of optimization modelling and resolution approaches, which are applied to operations management.

show abstract

A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem

Cited by 46 publications

References 19 publications

A multiobjective GRASP–VND algorithm to solve the waste collection problem

A multiobjective GRASP–VND algorithm to solve the waste collection problem

A matheuristic for the MinMax capacitated open vehicle routing problem

A Survey of Recent Research on Optimization Models and Algorithms for Operations Management from the Process View

Contact Info

Product

Resources

About