The savings algorithm for the vehicle routing problem |
| |
| Affiliation: | 1. Southampton Business School, Centre for Operational Research, Management Science and Information Systems (CORMSIS), University of Southampton, SO17 1BJ Southampton, United Kingdom;2. Faculdade de Ciencias da Universidade de Lisboa, DEIO, Centro de Investigao Operacional, Bloco C/2 Campo Grande, Cidade Universitaria, Lisboa 1749-016, Portugal;3. DMEIO, Universidad de La Laguna, 38200 La Laguna, Tenerife, Spain;1. School of Information Science and Engineering, Xiamen University, Xiamen, China;2. Department of Computer and Information Science, University of Macau, Macau, China;3. Department of Maritime and Mechanical Engineering, Liverpool John Moores University, Liverpool, England United Kingdomn |
| |
| Abstract: | Survey is given concerning the savings method for the vehicle routing problem. Results for several methods and data sets are compared. Furthermore, modifications of the savings method are presented which show less CPU time and reduced storage requirements. Therefore, the savings method can be implemented on microcomputers. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
