scispace - formally typeset
G

Gábor Nagy

Researcher at University of Kent

Publications -  50
Citations -  3169

Gábor Nagy is an academic researcher from University of Kent. The author has contributed to research in topics: Vehicle routing problem & Metaheuristic. The author has an hindex of 22, co-authored 48 publications receiving 2804 citations. Previous affiliations of Gábor Nagy include Corvinus University of Budapest & University of Greenwich.

Papers
More filters
Journal ArticleDOI

Location-routing: Issues, models and methods

TL;DR: This paper proposes a classification scheme and looks at a number of problem variants in location-routing: a relatively new branch of locational analysis that takes into account vehicle routing aspects.
Journal ArticleDOI

Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries

TL;DR: This method finds a solution to the corresponding VRP problem and modifies this solution to make it feasible for the VRPPD, and is capable of solving multi-depot problems, which has not been done before.
Journal ArticleDOI

A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problems with Backhauling

TL;DR: This work investigates an extension to the classical insertion-based heuristic for the vehicle routing problem with backhauling (VRPB) based on the idea of inserting more than one backhaul at a time, with encouraging results.
Journal ArticleDOI

The effect of strategic orientations on business performance in SMEs

TL;DR: In this paper, the role of strategic orientations in explaining business growth is examined, namely learning orientation, entrepreneurial orientation, market orientation, and brand orientation simultaneously affect business performance measured with brand performance, market performance and business growth.
Journal ArticleDOI

A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries

TL;DR: A reactive tabu search metaheuristic is designed that can check feasibility of proposed moves quickly and reacts to repetitions to guide the search in the vehicle routing problem with pickups and deliveries.