Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations

The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route constraints. Every vehicle is equipped with a rechargeable battery that d...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2022-09, Vol.145, p.105870, Article 105870
Hauptverfasser:	Lam, Edward, Desaulniers, Guy, Stuckey, Peter J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Batteries Benders decomposition Charging Conflict-driven clause learning Dantzig-Wolfe decomposition Drainage Electric vehicles Integer programming Linear functions Logic-based Benders decomposition Operations research Rechargeable batteries Recharging Route planning Scheduling Synchronization Vehicle routing Vehicle routing problem Windows (intervals)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!