Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture

A vehicle scheduling problem (VSP) that arises from sugar beet transportation within minimum working time under the set of constraints reflecting a real‐life situation is considered. A mixed integer quadratically constrained programming (MIQCP) model of the considered VSP and reformulation to a mixe...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International transactions in operational research Jg. 27; H. 1; S. 26 - 56
Hauptverfasser:	Anokić, Ana, Stanimirović, Zorica, Davidović, Tatjana, Stakić, Đorđe
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Blackwell Publishing Ltd 01.01.2020
Schlagworte:	Constraints Heuristic methods Linear programming metaheuristics Mixed integer mixed integer quadratically constrained programming Operations research Production scheduling Scheduling transportation of agriculture raw materials variable neighborhood search vehicle scheduling problem
ISSN:	0969-6016, 1475-3995
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!