The Electric Traveling Salesman Problem with Time Windows

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. The authors address a problem, called Electric Traveling Salesman Problem with Time Windows. They 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.

• Record URL:
  https://doi.org/10.1016/j.tre.2016.01.010
• Record URL:
  http://www.sciencedirect.com/science/article/pii/S1366554516000181
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
• Supplemental Notes:
  • Abstract reprinted with permission of Elsevier.
• Authors:
  • Roberti, R
  • Wen, M
• Publication Date: 2016-5

Language

• English

Media Info

• Media Type: Web
• Features: Figures; References; Tables;
• Pagination: pp 32-52
• Serial:
  • Transportation Research Part E: Logistics and Transportation Review
  • Volume: 89
  • Publisher: Elsevier
  • ISSN: 1366-5545
  • Serial URL: http://www.sciencedirect.com/science/journal/13665545

Subject/Index Terms

• TRT Terms: Algorithms; Electric vehicles; Greenhouse gases; Heuristic methods; Logistics; Mixed integer programming; Traveling salesman problem
• Subject Areas: Environment; Freight Transportation; Highways; Planning and Forecasting;

Filing Info

• Accession Number: 01599424
• Record Type: Publication
• Files: TRIS
• Created Date: Apr 29 2016 10:49AM