C
Christos D. Tarantilis
Researcher at Athens University of Economics and Business
Publications - 84
Citations - 4630
Christos D. Tarantilis is an academic researcher from Athens University of Economics and Business. The author has contributed to research in topics: Vehicle routing problem & Metaheuristic. The author has an hindex of 38, co-authored 80 publications receiving 4221 citations. Previous affiliations of Christos D. Tarantilis include National Technical University of Athens.
Papers
More filters
Journal ArticleDOI
A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
TL;DR: A new metaheuristic, termed the backtracking adaptive threshold accepting algorithm, for solving the heterogeneous fixed fleet vehicle routing problem (HFFVRP), which has attracted much less attention in the operational research literature than the classical VRP.
Journal ArticleDOI
A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints
TL;DR: A metaheuristic algorithm is proposed which incorporates the rationale of Tabu Search and Guided Local Search and employs a memory structure to record the loading feasibility information of the Capacitated Vehicle Routing Problem with two-dimensional loading constraints.
Book Chapter
Dynamic Vehicle Routing Problems.
TL;DR: While information evolves and decisions must be continuously made in a changing environment, the goal is to react to the new events as well as to anticipate future events, particularly if exploitable stochastic.
Journal ArticleDOI
Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
TL;DR: Computational experiments on benchmark data sets demonstrate that the proposed hybrid metaheuristic reaches high-quality solutions in short computational times, and requires very few user-defined parameters, rendering it applicable to real-life flow shop scheduling problems.
Journal ArticleDOI
A Hybrid Metaheuristic Algorithm for the Integrated Vehicle Routing and Three-Dimensional Container-Loading Problem
TL;DR: This paper examines a recently addressed practical variant of the capacitated vehicle routing problem (VRP) called 3L-CVRP, which considers customer demand to be formed by 3-D rectangular items and proposes a hybrid metaheuristic methodology that combines the strategies of tabu search and guided local search.