Designing a multi-depot multi-period vehicle routing problem with time window: hybridization of tabu search and variable neighbourhood search algorithm

Paul, Arjun; Kumar, Ravi Shankar; Rout, Chayanika; Goswami, Adrijit

doi:10.1007/s12046-021-01693-2

Cited by 5 publications

(2 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This algorithm first classifies the vertices based on their geometric relations and then solves a traveling salesman problem (TSP) for each separate class. Researchers have also developed other heuristic methods such as finite branch-and-bound, petal method, and heuristic improvement for solving VRPs [13,16,19,23].…”

Section: Literature Reviewmentioning

confidence: 99%

A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm

Ahmed

Singhal

Prakaash³

et al. 2022

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

The current study examines an essential type of vehicle routing problem (VRP). This type is one where customers are served by limited-capacity vehicles from multiple depots and is known as Multi-Depot Capacitated Vehicle Routing Problem (MDCVRP). The novelty of this study is that in the present case, cars, after Leaving the Depot, can go back to any other depot. Those issues seem to occur in most real-world issues where information, messages, or news are sent electronically from somewhere. The purpose of the problem is to minimize the costs associated with routing. Regarding the literature on such issues, it has been proven in previous studies and research that these problems are among the hard-NP problems, and to solve them using the metaheuristic method, the exact methods justify it. After changing the basic model, this study developed a Tabu Search (TS) algorithm. The study results demonstrate that if the equipment can return to any depot, the cost is significantly reduced in contrast to the case where equipment is forced to return to their depot.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Mathematical Model for the Vehicles Routing Problem with Multiple Depots, Considering the Possibility of Return Using the Tabu Search Algorithm

Ahmed

Singhal

Prakaash³

et al. 2022

Foundations of Computing and Decision Sciences

View full text Add to dashboard Cite

show abstract

“…Heuristic algorithms are more promising for practical application because the majority of accurate approaches are useful for small-scale situations. In Paul et al (2021), a three-phase Tabu Search (TS) heuristic is proposed for the split delivery vehicle routing problem with unlimited fleet. Furthermore, heuristics algorithms in this field is limited, let alone the algorithms developed to solve split delivery problem with certain scale of customer number.…”

Section: Introductionmentioning

confidence: 99%