Gábor Nagy

Affiliations:
  • University of Kent, Centre for Logistics and Heuristic Optimisation, CLHO, Kent Business School, Canterbury, UK


According to our database1, Gábor Nagy authored at least 20 papers between 1999 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes.
Int. J. Math. Oper. Res., 2019

2018
The heterogeneous fleet vehicle routing problem with light loads and overtime: Formulation and population variable neighbourhood search with adaptive memory.
Expert Syst. Appl., 2018

An efficient heuristic algorithm for the alternative-fuel station location problem.
Eur. J. Oper. Res., 2018

2017
Speeding up the optimal method of Drezner for the p-centre problem in the plane.
Eur. J. Oper. Res., 2017

The Multiple Trip Vehicle Routing Problem with Backhauls: Formulation and a Two-Level Variable Neighbourhood Search.
Comput. Oper. Res., 2017

2016
Drezner's Exact Method for the Continuous p-Centre Problem Revisited.
Electron. Notes Discret. Math., 2016

An adaptive perturbation-based heuristic: An application to the continuous p-centre problem.
Comput. Oper. Res., 2016

2015
The Vehicle Routing Problem with Divisible Deliveries and Pickups.
Transp. Sci., 2015

Solving a novel multi-objective uncapacitated hub location problemby five meta-heuristics.
J. Intell. Fuzzy Syst., 2015

The continuous p-centre problem: An investigation into variable neighbourhood search with memory.
Eur. J. Oper. Res., 2015

2013
The vehicle routing problem with restricted mixing of deliveries and pickups.
J. Sched., 2013

Solving the Mixed Backhauling Vehicle Routing: Problem with Ants.
Int. J. Energy Optim. Eng., 2013

2011
A guided reactive GRASP for the capacitated multi-source Weber problem.
Comput. Oper. Res., 2011

2009
Region-rejection based heuristics for the capacitated multi-source Weber problem.
Comput. Oper. Res., 2009

Local improvement in planar facility location using vehicle routing.
Ann. Oper. Res., 2009

2008
A heuristic method for the vehicle routing problem with mixed deliveries and pickups.
J. Sched., 2008

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries.
J. Comb. Optim., 2008

2007
Location-routing: Issues, models and methods.
Eur. J. Oper. Res., 2007

2005
Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries.
Eur. J. Oper. Res., 2005

1999
A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling.
J. Oper. Res. Soc., 1999


  Loading...