English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

In this research, a new variant of the vehicle routing problem with timewindows is addressed. The nodes associated with the customers are related toeach other through AND/OR precedence constraints. The objective is minimizingthe total traveling and service time. This generalization is necessary forproblems where the visiting node sequence is defined according to the AND/ORrelations, such as picker routing problems. We propose a Mixed Integer LinearProgramming model to solve small-scale instances extended from the well-knownSolomon benchmark. A meta-heuristic algorithm based on the hybridization ofIterated Local Search and Simulated Annealing approaches is developed, whichcan compute reasonable solutions in terms of CPU time and the accuracy ofsolutions. To improve the hybrid algorithm's performance, the Taguchi method isused to tune the algorithm parameters. A comprehensive computational analysisis conducted to analyze the performance of the proposed methods.

A Hybrid Algorithm for the Vehicle Routing Problem with AND/OR Precedence Constraints and Time Windows