𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A 3-OPT based simulated annealing algorithm for vehicle routing problems

✍ Scribed by Attahiru Sule Alfa; Sundresh S. Heragu; Mingyuan Chen

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
300 KB
Volume
21
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge assembly-based memetic algorithm fo
Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
✍ Yuichi Nagata; Olli BrΓ€ysy πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 200 KB

## Abstract Vehicle routing problems are at the heart of most decision support systems for real‐life distribution problems. In vehicle routing problem a set of routes must be determined at lowest total cost for a number of resources (i.e., fleet of vehicles) located at one or several points (e.g.,

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