The Electric Traveling Salesman Problem with Time Windows |
| |
Institution: | 1. Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30013, Taiwan;2. Department of Civil and Environmental Engineering, and Department of Industrial Engineering and Operations Research, University of California-Berkeley, Berkeley, CA 94720, USA |
| |
Abstract: | To minimize greenhouse gas emissions, the logistic field has seen an increasing usage of electric vehicles. The resulting distribution planning problems present new computational challenges.We address a problem, called Electric Traveling Salesman Problem with Time Windows. We propose a mixed integer linear formulation that can solve 20-customer instances in short computing times and a Three-Phase Heuristic algorithm based on General Variable Neighborhood Search and Dynamic Programming.Computational results show that the heuristic algorithm can find the optimal solution in most small-size instances within a tenth of a second and achieves goods solutions in instances with up to 200 customers. |
| |
Keywords: | Electric vehicles Green logistics Traveling Salesman General Variable Neighborhood Search Dynamic Programming Time windows |
本文献已被 ScienceDirect 等数据库收录! |
|