Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows

Authors

  • Marcin Woch AGH University of Science and Technology
  • Piotr Łebkowski AGH University of Science and Technology

DOI:

https://doi.org/10.7494/dmms.2009.3.2.87

Keywords:

simulated annealing, vehicle routing problem with time windows, bi-criterion optimization

Abstract

This article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.

Downloads

Published

2009-12-21

How to Cite

Woch, M., & Łebkowski, P. (2009). Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows. Decision Making in Manufacturing and Services, 3(2), 87–100. https://doi.org/10.7494/dmms.2009.3.2.87

Issue

Vol. 3 (2009): No. 1-2

Section

Articles

License

Remeber to prepeare, sign and scan copyright statement

Licencja Creative Commons
The content of the journal is freely available according to the Creative Commons License Attribution 4.0 International (CC BY 4.0)

Received 2013-08-22
Accepted 2013-08-22
Published 2009-12-21