๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Improvement heuristics for the Vehicle Routing Problem based on simulated annealing

โœ Scribed by Alex Van Breedam

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
802 KB
Volume
86
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Using simulated annealing to minimize fu
Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem
โœ Yiyo Kuo ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 750 KB

## a b s t r a c t The vehicle routing problem (VRP) has been addressed in many research papers. Only a few of them take time-dependent travel speeds into consideration. Moreover, most research related to the VRP aims to minimize total travel time or travel distance. In recent years, reducing carb

Decomposition and hybrid simulated annea
Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
โœ Christos Koulamas ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB ๐Ÿ‘ 2 views

A polynomial decomposition heuristic is developed for the parallel-machine tardiness problem (P//T V ) by extending the decomposition principle embedded in the single-machine tardiness problem (1//T V ) to a parallel-machine setting. The subproblems generated by the decomposition are solved by an ef