Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem

Soto, Mara; Sevaux, Marc; Rossi, André; Reinholz, Andreas

doi:10.1016/j.cie.2017.03.022

Cited by 64 publications

(21 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some new restrictions were introduced in this research. Soto et al [ 20 ] developed a multiple variable neighborhood search, hybridized with a tabu search (MNS-TS), to deal with the MDOVRP. In this article, authors compared MNS-TS with MIP and found that the average quality of the solutions was different.…”

Section: Literature Reviewmentioning

confidence: 99%

Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading

Shen

Tao

Wang

2018

IJERPH

View full text Add to dashboard Cite

In order to cut the costs of third-party logistics companies and respond to the Chinese government’s low-carbon economy plans, this paper studies the more practical and complex open vehicle routing problem, which considers low-carbon trading policies. A low-carbon multi-depot open vehicle routing problem with time windows (MDOVRPTW) model is constructed with minimum total costs, which include the driver’s salary, penalty costs, fuel costs and carbon emissions trading costs. Then, a two-phase algorithm is proposed to handle the model. In the first phase, the initial local solution is obtained with particle swarm optimization (PSO); in the second phase, we can obtain a global optimal solution through a further tabu search (TS). Experiments proved that the proposed algorithm is more suitable for small-scale cases. Furthermore, a series of experiments with different values of carbon prices and carbon quotas are conducted. The results of the study indicate that, as carbon trading prices and carbon quotas change, total costs, carbon emission trading costs and carbon emissions are affected accordingly. Based on these academic results, this paper presents some effective proposals for the government’s carbon trading policy-making and also for logistics companies to have better route planning under carbon emission constraints.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading

Shen

Tao

Wang

2018

IJERPH

View full text Add to dashboard Cite

show abstract

“…In this sense, having efficient formulations permits advancing the knowledge of the problem as well as assessing more accurately the performance of approximate approaches. With regards to approximate approaches, Soto et al [13] proposed multiple neighborhood search, tabu search and ejection chains for the MDOVRP. Yao et al [15] proposed an ant colony optimization approach in the context of product seafood delivery.…”

Section: Introductionmentioning

confidence: 99%

Mathematical formulations and improvements for the multi-depot open vehicle routing problem

Lalla-Ruiz

Mes

2020

Optim Lett

View full text Add to dashboard Cite

The multi-depot open vehicle routing problem (MDOVRP) is a hard combinatorial optimization problem belonging to the vehicle routing problem family. It considers vehicles departing from different depots to deliver goods to customers without requiring to return to the depots once all customers have been served. The aim of this work is to provide a new two-index-based mathematical formulation for the MDOVRP as well as enhancements on alternative sub-tour elimination constraints. Through numerical experiments, using traditional benchmarks for the MDOVRP, we show that the proposed formulation outperforms existing ones. In addition, we provide insights with regards to problem instance defining parameters on the models performance.

show abstract

“…The classic traveling salesman problem was used for validating the proposed algorithm. Along this line, Soto et al [19] hybridized TSA with multiple neighborhood searches for addressing multi-depot open vehicle routing. The proposed hybrid system provided good results, which was attributed to the successful exploration of neighborhoods.…”

Section: Introductionmentioning

confidence: 99%

Design of Flotation Circuits Using Tabu-Search Algorithms: Multispecies, Equipment Design, and Profitability Parameters

2019

View full text Add to dashboard Cite

The design of a flotation circuit based on optimization techniques requires a superstructure for representing a set of alternatives, a mathematical model for modeling the alternatives, and an optimization technique for solving the problem. The optimization techniques are classified into exact and approximate methods. The first has been widely used. However, the probability of finding an optimal solution decreases when the problem size increases. Genetic algorithms have been the approximate method used for designing flotation circuits when the studied problems were small. The Tabu-search algorithm (TSA) is an approximate method used for solving combinatorial optimization problems. This algorithm is an adaptive procedure that has the ability to employ many other methods. The TSA uses short-term memory to prevent the algorithm from being trapped in cycles. The TSA has many practical advantages but has not been used for designing flotation circuits. We propose using the TSA for solving the flotation circuit design problem. The TSA implemented in this work applies diversification and intensification strategies: diversification is used for exploring new regions, and intensification for exploring regions close to a good solution. Four cases were analyzed to demonstrate the applicability of the algorithm: different objective function, different mathematical models, and a benchmarking between TSA and Baron solver. The results indicate that the developed algorithm presents the ability to converge to a solution optimal or near optimal for a complex combination of requirements and constraints, whereas other methods do not. TSA and the Baron solver provide similar designs, but TSA is faster. We conclude that the developed TSA could be useful in the design of full-scale concentration circuits.

show abstract

Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem

Cited by 64 publications

References 39 publications

Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading

Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading

Mathematical formulations and improvements for the multi-depot open vehicle routing problem

Design of Flotation Circuits Using Tabu-Search Algorithms: Multispecies, Equipment Design, and Profitability Parameters

Contact Info

Product

Resources

About