An Integer Programming Model For Solving Heterogeneous Vehicle Routing Problem With Hard Time Window considering Service Choice

Generally a Vehicle Routing Problem with time windows (VRPTW) can be defined as a problem to determine the optimal set of routes used by a fleet of vehicles to serve a given set of customers with service time restrictions; the objective is to minimize the total travel cost (related to the travel tim...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IOP conference series. Materials Science and Engineering 2018-01, Vol.300 (1), p.12023
Hauptverfasser:	Susilawati, Enny, Mawengkang, Herman, Efendi, Syahril
Format:	Artikel
Sprache:	eng
Schlagworte:	Customer services Customers feasible neighbourhood search Heterogenic fleet Integer programming Operating costs Route planning time restricted Travel time Vehicle routing Vehicle routing problem Vehicles Windows (intervals)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!