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...

Celý popis

Podrobná bibliografie

Vydáno v:	International transactions in operational research Ročník 27; číslo 1; s. 26 - 56
Hlavní autoři:	Anokić, Ana, Stanimirović, Zorica, Davidović, Tatjana, Stakić, Đorđe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Blackwell Publishing Ltd 01.01.2020
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!