Mathematical models for green vehicle routing problems with pickup and delivery: A case of semiconductor supply chain

In this paper, we consider a special case of vehicle routing problem that addresses the routing problem in a semiconductor supply chain. This paper proposes two Mixed Integer Linear Programming (MILP) models for solving the Green Vehicle Routing Problems with Pickups and Deliveries in a Semiconducto...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2018-01, Vol.89, p.183-192
Hauptverfasser:	Madankumar, Sakthivel, Rajendran, Chandrasekharan
Format:	Artikel
Sprache:	eng
Schlagworte:	Alternative Fuel Vehicles Completion time Constraint modelling Delivery scheduling Fuels Green Vehicle Routing Problem with Pickup and Delivery Integer programming Linear programming Lower bounds Mathematical models Minimum cost Mixed integer Operations research Refueling Request-priorities and Request-types Route planning Routing Schedules Semiconductors Studies Supply chains Time constraints Vehicle Compatibility Vehicle routing Vehicles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!