The vehicle routing problem: State of the art classification and review

K Braekers, K Ramaekers… - Computers & industrial …, 2016 - Elsevier
Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever
more popular in the academic literature. Yet, the problem characteristics and assumptions …

Distributed job scheduling based on Swarm Intelligence: A survey

E Pacini, C Mateos, CG Garino - Computers & Electrical Engineering, 2014 - Elsevier
Scientists and engineers need computational power to satisfy the increasing resource
intensive nature of their simulations. For example, running Parameter Sweep Experiments …

A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows

R Baños, J Ortega, C Gil, AL Márquez… - Computers & industrial …, 2013 - Elsevier
The Capacitated Vehicle Routing Problem with Time Windows is an important combinatorial
optimization problem consisting in the determination of the set of routes of minimum distance …

A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery

M Avci, S Topaloglu - Expert Systems with Applications, 2016 - Elsevier
Abstract The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is
a variant of the classical Vehicle Routing Problem (VRP) where the vehicles serve a set of …

A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery

T Öztaş, A Tuş - Expert Systems with Applications, 2022 - Elsevier
The vehicle routing problem is an optimization problem that deals with transporting between
the depot and the customers in its most general form. On the other hand, vehicle routing …

A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows

R Baños, J Ortega, C Gil, A Fernández… - Expert Systems with …, 2013 - Elsevier
The Capacitated Vehicle Routing Problem with Time Windows (VRPTW) consists in
determining the routes of a given number of vehicles with identical capacity stationed at a …

Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks

FY Vincent, P Jewpanya, AANP Redi… - Computers & operations …, 2021 - Elsevier
This paper introduces the heterogeneous fleet vehicle routing problem with multiple cross-
docks, a variant of the vehicle routing problem with cross-docking, which considers the use …

An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries

M Avci, S Topaloglu - Computers & Industrial Engineering, 2015 - Elsevier
Abstract The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is
an extension to the classical Vehicle Routing Problem (VRP), where customers may both …

Grammatical evolution hyper-heuristic for combinatorial optimization problems

NR Sabar, M Ayob, G Kendall… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Designing generic problem solvers that perform well across a diverse set of problems is a
challenging task. In this work, we propose a hyper-heuristic framework to automatically …

An adaptive large neighborhood search heuristic for solving a robust gate assignment problem

C Yu, D Zhang, HYK Lau - Expert Systems with Applications, 2017 - Elsevier
With the rapid growth of air traffic demand, airport capacity becomes a major bottleneck
within the air traffic control systems. Minor disturbances may have a large impact on the …