Variable neighborhood search for optimizing the transportation of agricultural raw materials
From MaRDI portal
Publication:1687665
DOI10.1016/J.ENDM.2017.03.018zbMath1384.90011OpenAlexW2606209650MaRDI QIDQ1687665
Tatjana Davidović, Zorica Stanimirović, Đorđe Stakić, Ana Anokić
Publication date: 4 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.03.018
variable neighborhood searchvehicle scheduling problemmixed integer quadratically constrained programmingLingo solver
Mixed integer programming (90C11) Quadratic programming (90C20) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Skewed general variable neighborhood search for the location routing scheduling problem
- Sugar cane transportation in Cuba, a case study
- Variable neighborhood search
- Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints
- Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
This page was built for publication: Variable neighborhood search for optimizing the transportation of agricultural raw materials